4.1.10 · HinglishMemory Technologies

Multi-level cell (MLC - TLC - QLC) flash

1,762 words8 min readRead in English

4.1.10 · Hardware › Memory Technologies


Multi-level cell KYA hota hai?

Naam Bits/cell Levels Relative density
SLC (Single) 1 2
MLC (Multi, matlab 2) 2 4
TLC (Triple) 3 8
QLC (Quad) 4 16
PLC (Penta) 5 32

Bits pack karna exponentially zyada mushkil KYUN ho jaata hai?

Poora usable window ek fixed voltage span hoti hai (physics se limited: itna charge chhoti floating gate hold kar sakti hai aur periphery kitna high read voltage tolerate karta hai). Hume is mein distributions of fit karni hain, saath mein guard bands bhi taaki unhe alag pehchana ja sake.

Figure — Multi-level cell (MLC - TLC - QLC) flash

Multiple bits KO KAISE padhte hain? (Gray coding)

TLC Gray assignment ka example (3 bits over 8 levels): 000 → 001 → 011 → 010 → 110 → 111 → 101 → 100 Har neighbour exactly ek bit se differ karta hai.


Worked examples


Common mistakes


Ek flash cell data represent karne ke liye actually kaunsi physical quantity store karta hai?
Floating gate pe charge, jo transistor threshold voltage ko shift karta hai.
MLC (industry term ke roop mein) kitne bits store karta hai per cell?
2 bits (4 levels) — "koi bhi multi-bit cell" nahi.
Bits/cell aur levels mein kya relationship hai?
, yani .
Level spacing ke liye window ko se kyun divide karte hain?
level centres gaps banate hain unke beech (fencepost rule).
QLC levels SLC se kitne zyada crowded hain?
Lagbhag 15× ().
Level-to-bit assignment ke liye Gray coding kyun use karte hain?
Adjacent (sabse zyada confusable) levels sirf ek bit se differ karti hain, toh ek misread sirf ek bit flip karta hai — minimal, ECC-friendly damage.
SLC/MLC/TLC/QLC ko endurance ke hisaab se high se low order karo.
SLC > MLC > TLC > QLC (roughly P/E cycles).
QLC write slow kyun hoti hai, aur ise kya mitigate karta hai?
Tight target distributions ko kaafi ISPP verify pulses chahiye; ek SLC cache bursts absorb karta hai, baad mein QLC pe migrate karta hai.
Zyada bits pack karna reliability ko kya karta hai aur kyun?
Levels ke beech chhota voltage margin → overlapping smears → zyada raw bit errors → stronger ECC (LDPC) ki zaroorat.

Recall Feynman: 12 saal ke bachche ko explain karo

Socho ek bucket hai jo paani hold karta hai, aur tum data padhte ho paani ka level dekh ke. Agar tum sirf poochho "khaali hai ya bhara?" toh tum 1 fact store karte ho — woh SLC hai, aasaan aur reliable. Lekin tum bucket pe lines mark kar sakte ho (khaali, ¼, ½, ¾, bhara) aur exact amounts daalk ke zyada facts store kar sakte ho — woh TLC/QLC hai. Problem: lines bahut paas aa jaati hain, aur paani slosh karta hai aur dheere dheere leak hota hai. Ab yeh batana mushkil ho jaata hai ki "½ line" hai ya "½ se thoda upar." Toh tum zyada store kar sakte ho, lekin zyada reading mistakes karte ho aur bucket saari careful pouring ki wajah se jaldi ghis jaata hai. Yahi poora trade-off hai: zyada storage vs. zyada errors aur kam durability.

Connections

  • NAND Flash Architecture — pages, blocks, floating-gate transistor.
  • Threshold Voltage and ISPP Programming — levels precisely kaise likhe jaate hain.
  • Error Correction Codes (LDPC/BCH) — MLC/TLC/QLC ke raw errors clean up karta hai.
  • Wear Leveling and Flash Endurance — limited P/E cycles manage karna.
  • SLC Cache and SSD Write Amplification — QLC ke liye speed mitigation.
  • Gray Code — woh encoding jo bit-flip damage minimize karti hai.

Concept Map

shifts

slice into L levels

b = log2 L

more bits

holds L levels + L-1 guard bands

L = 2^b

dV = window / 2^b-1

smaller dV

misclassified reads

need

reliability and speed fall

Floating gate charge

Threshold voltage Vth

Multi-level cell

Bits per cell

Higher density per dollar

Fixed voltage window

Level spacing dV

Margin shrinks exponentially

Bell-curve smears overlap

Raw bit errors

Stronger ECC LDPC and retries

SLC over MLC over TLC over QLC tradeoff