Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luca Crippa

dblp:180/3947 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0003-1492-9542ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 67% Integrated circuit design · 32% Memory systems · 1%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › flash and SSD
flash memory
0.322017
Array Architectures for 3-D NAND Flash Memories · Proc. IEEE 2017
The flash memory read path: building blocks and critical aspects · Proc. IEEE 2003
Integrated circuit design
3d integration
0.312017
Array Architectures for 3-D NAND Flash Memories · Proc. IEEE 2017
Storage systems › flash and SSD › flash memory › NAND flash
3D NAND flash
0.312017
Array Architectures for 3-D NAND Flash Memories · Proc. IEEE 2017
Integrated circuit design › analog and mixed-signal circuits
mixed-signal circuit design
0.012003
The flash memory read path: building blocks and critical aspects · Proc. IEEE 2003
Memory systems › non-volatile memory
multilevel cell storage
0.012003
The flash memory read path: building blocks and critical aspects · Proc. IEEE 2003

Methods — techniques the papers use, named apart from their topics

floating gate · 0.3charge trap · 0.3
YearPublicationVenuePosition
2017 Array Architectures for 3-D NAND Flash Memories
abstract
NAND Flash memories have changed and keep changing our lives. In the past two decades, NAND-based systems, in the form of Flash cards and USB keys, have replaced films and floppy disks. But disruption did not stop there. Today, NAND is really ubiquitous, as it plays the role of storage element inside smartphones and tablets; even further, it is now expanding its reach because solid-state drives (SSDs), i.e., drives built with several NAND devices, are replacing hard disk drives (HDDs) in more and more applications. To fuel this continuous evolution, NAND has to remain very aggressive in terms of cost per bit. When approaching 10-nm technologies, planar NAND is running out of steam: industry and academia have worked hard on finding a solution to this problem for more than a decade. Three-dimensional integration turned out to be the most promising alternative, and it is now eventually reaching the market. This paper is about 3-D NAND Flash memories and the related integration challenges. Charge trap and floating gate 3-D technologies will be discussed with the aid of several bird's-eye views. Advanced layout techniques will thoroughly be analyzed. Finally, future scaling trends will be presented.
Rino Micheloni, Seiichi Aritome, Luca Crippa
Proc. IEEE3
2003 The flash memory read path: building blocks and critical aspects
abstract
The ever-increasing demand for portable equipment is leading to the use of flash memory devices for nonvolatile storage. Fast access time and low power consumption are obviously key requirements. Moreover, multilevel storage techniques are mandatory to reduce the cost per megabit. As a consequence, the READ operation becomes more and more critical, and optimized solutions are needed for almost all circuits involved in the read path. This paper examines the whole read path from addresses to data output, and describes several schemes developed to achieve the required high performances.
Rino Micheloni, Luca Crippa, Miriam Sangalli, Giovanni Campardo
Proc. IEEE2