4.1.3 · D4Memory Technologies

Exercises — DRAM 1T1C cell structure

2,361 words11 min readBack to topic

Everything here rests on three tools you already met in the parent note:

A quick reminder of the units, because half of all DRAM errors are unit slips:


Level 1 — Recognition

Goal: name the parts and read a value straight off a formula, no algebra.

Exercise 1.1

State which physical line connects to (a) the transistor gate, and (b) the transistor source/drain that carries the bit in and out.

Recall Solution 1.1

(a) The wordline (WL) connects to the gate — raising it "opens the tap". (b) The bitline (BL) connects to the source/drain — it carries charge in during a write and out during a read. See Bitline and Wordline Architecture for how these run across the array.

Exercise 1.2

A cell holds logic 1. Roughly what voltage is on the storage node, and roughly what voltage is on it for logic 0 (in the precharge scheme)?

Recall Solution 1.2

Logic 1 → storage node near (charged bucket). Logic 0 → storage node near V (empty bucket). The bitline is precharged to ; that half-level is a reference, not the stored value.

Exercise 1.3

Without computing, look at . If the cell stores a "1" (so ), will be positive or negative? What about a "0"?

Recall Solution 1.3

The prefactor is always positive (both caps positive). So the sign of is the sign of .

  • "1": positive (bitline swings up).
  • "0": negative (bitline swings down).

Level 2 — Application

Goal: plug numbers into the tools and get a value with correct units.

Exercise 2.1

, , , cell holds a 1 (). Find in millivolts.

Recall Solution 2.1

What: apply Tool 3. Why: the transistor connects to , so signal swing is the only thing the sense amp sees. The femtofarads cancel in the ratio — only their ratio matters, so we never convert to farads here.

Exercise 2.2

Same caps and as 2.1, but the cell holds a 0 (). Find .

Recall Solution 2.2

Equal magnitude, opposite sign to Exercise 2.1 — that symmetry is exactly why we precharge to .

Exercise 2.3

, . How much charge sits on a cell holding a 1? Give it in femtocoulombs.

Recall Solution 2.3

Why Tool 1 and not Tool 3? We want stored charge, not a bitline swing — that is the defining relation .


Level 3 — Analysis

Goal: reason about how the numbers behave, not just compute one.

Exercise 3.1

Keep , , cell = 1. Compute for . What trend do you see, and why does it matter for chip design? (See figure below.)

Figure — DRAM 1T1C cell structure
Recall Solution 3.1

Using :

  • :
  • :
  • : Trend: bigger smaller swing (the curve in the figure falls). Why it matters: a long bitline touches many cells and grows ; if the swing drops below the sense-amp margin the read fails. Designers segment the array to keep small — see Sense Amplifiers.

Exercise 3.2

Define the charge-transfer ratio . Show that when we can approximate , and check the error for , .

Recall Solution 3.2

What: when dominates, , so . Check: exact ; approximation . Relative error . The approximation over-estimates because we dropped the in the denominator, which was of the total.

Exercise 3.3

For the "1"-read the bitline ends at . Using , , , find and the new voltage left on the storage node after sharing (before the sense amp rewrites). Why does this prove the read is destructive?

Recall Solution 3.3

After sharing, both plates sit at the same voltage (they are connected): The storage node, which started at V, is now at V. It got diluted toward — the original "1" is largely gone. That is exactly why the sense amp must rewrite the bit (see DRAM Refresh).


Level 4 — Synthesis

Goal: combine charge, swing, leakage and refresh into one argument.

Exercise 4.1

A cell holds a "1": , , so . Leakage bleeds charge at a constant rate of (approximate the decay as linear over the refresh window). The sense amp still reads "1" correctly as long as the node stays above . What is the longest safe refresh interval?

Recall Solution 4.1

Step 1 — voltage floor to charge floor. . Step 2 — charge we may lose. . Step 3 — time to lose it. . So refresh must happen at least every 75 ms — comfortably explaining the standard ~64 ms guardband.

Exercise 4.2

Now model the same leakage as a true RC decay with (3 TΩ) and . Find the time for a "1" to fall from V to the same V floor. Compare to the linear estimate.

Recall Solution 4.2

Why exponential? A capacitor discharging through a resistor obeys , whose solution is the exponential — the true physics of leakage. Time constant . Set . So . The exponential model is much stricter than the linear one (75 ms) because decay is fastest at the start when is highest — the linear rate assumed the slow late-stage rate throughout.

Exercise 4.3

The chip has cells and must refresh each every 64 ms. If refresh is spread evenly across the 64 ms window in rows of cells per refresh operation, how many refresh operations per second must the controller run?

Recall Solution 4.3

Step 1 — rows to refresh. rows (round up; you cannot do a fractional row). Step 2 — refresh cycles per second. All rows must be covered every 64 ms s, i.e. full sweeps per second. That is ~15 million refreshes every second — a real, continuous cost, which is why DRAM is called dynamic (see DRAM Refresh).


Level 5 — Mastery

Goal: edge cases, degenerate inputs, and why SRAM dodges all of this.

Exercise 5.1 (degenerate input)

What is the signal swing if a cell holds a "0" at exactly ? Interpret physically why this is the worst possible cell state.

Recall Solution 5.1

Zero swing. The cell already matches the precharge, so connecting it moves the bitline nowhere — the sense amp gets no signal and cannot decide 1 vs 0. This is why leakage that drags a "1" down toward is fatal: as the node approaches , the swing collapses to nothing.

Exercise 5.2 (limiting behaviour)

Take . Find the limit of as (a) and (b) . Interpret both.

Recall Solution 5.2

(a) As : , so . An infinitely large bitline is unmovable by one tiny cell — the read is impossible. (This is the extreme of Exercise 3.1's trend.) (b) As : , so . With no bitline capacitance the cell dumps its full voltage difference onto the line — the read would be perfect, but a real bitline touching many cells can never have zero capacitance.

Exercise 5.3 (case coverage: every stored value)

Fill the table for , , : for , give and the sense-amp decision. Where is the decision boundary?

Recall Solution 5.3

. :

  • : → reads 1
  • : → reads 1
  • : undecidable (boundary)
  • : → reads 0
  • : → reads 0 The decision boundary is : above it swings positive (1), below it swings negative (0). Precharging exactly there splits the two cases symmetrically.

Exercise 5.4 (synthesis vs SRAM)

In one paragraph, explain why an SRAM 6T cell does not need refresh or a destructive-read rewrite, tying it back to charge sharing.

Recall Solution 5.4

An SRAM cell stores its bit in a cross-coupled latch (two inverters holding each other) continuously driven by power — it is not a floating charge bucket, so there is no charge to leak away and nothing to top up: no refresh. When read, the latch actively drives the bitline rather than passively sharing charge, so the stored state is not diluted: non-destructive, no rewrite. The price is 6 transistors per bit instead of 1T1C, hence far lower density — the exact trade-off the parent note names.


Connections

  • DRAM 1T1C cell structure — parent note these exercises drill.
  • Charge Sharing · Capacitor Q=CV — the two tools every problem uses.
  • Sense Amplifiers — why a 45 mV swing is enough (and why 0 mV is fatal).
  • DRAM Refresh — the timing budget of L4.
  • SRAM 6T cell — the contrast in L5.
  • Bitline and Wordline Architecture — where WL/BL physically run.