TLC SSD
A TLC SSD uses NAND flash that encodes three bits per cell using eight threshold-voltage states.
Cell encoding. Three bits require eight states; vertical stacking is a separate design property. [4]
Programming example. Cai and colleagues describe planar TLC with binary, foggy and fine stages; SLC buffers retain values needed for the final stage. Their LSB/CSB/MSB mapping uses one/two/four read references respectively. These are implementation examples, not requirements imposed by three-bit encoding. The same 2018 survey discusses one-shot programming in then-current 3D NAND, not a rule for all later devices. [2]
Device evidence. Grupp and colleagues' 2012 latency curves are historical raw-chip fits used in an idealized SSD model, with limited TLC data. They do not specify current host latency. [3] For an SSD comparison, use capacity-specific endurance and workload conditions, including write amplification and over-provisioning. [5]
Relations
- related
- Triple-level cell (TLC), Consumer SSD, SLC SSD, MLC SSD, QLC SSD, 3D NAND, SLC cache, Program/erase cycle, NAND copyback, TBW, DWPD
Advantages
- TLC stores three times as many bits per cell as SLC at equal cell count. [4]
- In the surveyed planar design, SLC buffering reduces reread errors before final programming compared with partially programmed MLC wordlines. [2]
Limitations
- That program-error comparison is not a ranking of overall SSD reliability. [2]
- Internal copyback in the surveyed design bypasses controller ECC; this does not describe every data-migration path. [2]
Citations
- Cai, Ghose, Haratsch, Luo, Mutlu: Errors in Flash-Memory-Based Solid-State Drives: Analysis, Mitigation, and Recovery, arXiv:1711.11427, sections 2-3
- Grupp, Davis and Swanson - The Bleak Future of NAND Flash Memory, FAST 2012, Sections 2-3 and Table 2
- KIOXIA - Multi-level cell technology: bits and threshold-voltage states
- KIOXIA - How Does Endurance Work in SSDs?, March 2021, pages 2-4
Further reading
Sources & caveats
- Cai et al., version 2: sections 2.3-2.4, 3.2 and 6 distinguish the example mapping, planar programming and historical 3D behavior. [2]
- No universal cycle limit, host-latency rating or current-product ranking is inferred.