4.1.5 · D3Memory Technologies

Worked examples — Row - column addressing and sense amplifiers

3,098 words14 min readBack to topic

This page is the drill ground for the parent topic. We enumerate every kind of case the topic can throw at you — big signals, tiny signals, stored 0 vs stored 1, degenerate capacitors, non-square arrays, a real-world timing question — then work each one from scratch. Guess before you read the steps; that is where the learning happens.

Prerequisites you may want open: DRAM cell structure (1T1C), Address decoders and multiplexers, CAS latency and memory timing.


The scenario matrix

Two independent machines live in this topic:

  1. The addressing machine (decoders): turns an address into a chosen wordline + bitline. Its "inputs" are array shapes.
  2. The sensing machine (charge sharing + latch): turns tiny charge into a clean bit. Its "inputs" are the capacitor sizes and the stored voltage.

Every exam question is one cell of this table:

# Machine Case class What makes it tricky Example
A Addressing Square array, multiplexed pins baseline Ex 1
B Addressing Non-square array dominates Ex 2
C Addressing Degenerate: single row () column-only, limiting case Ex 3
D Sensing Stored 1, normal positive Ex 4
E Sensing Stored 0, normal negative , symmetry Ex 4
F Sensing Limiting: (huge bitline) signal collapses Ex 5
G Sensing Degenerate: (equal caps) signal saturates Ex 6
H Sensing Sign edge: cell exactly at zero signal — unreadable Ex 7
I Real-world Refresh + retention word problem leakage vs sense floor Ex 8
J Exam twist Given , solve backward for invert the formula Ex 9

The two formulas we reuse everywhere, from the parent note:

The figure below plots the first formula for a fixed-size chip so you can see why square arrays win — refer back to it during Ex 1 and Ex 2.

Figure — Row - column addressing and sense amplifiers

Read the curve like this: the horizontal axis is how many address bits we spend on rows (the rest go to columns); the teal curve is the multiplexed pin count . The plum dot at the bottom is the square array — the single lowest point — and the orange dashed line marks that optimum of 14 pins. Everything to the left or right (lopsided arrays) sits higher: more pins for the same chip.


Addressing examples (cells A, B, C)


Sensing examples (cells D, E, F, G, H)

For all sensing examples we use a fixed chip unless stated: V, so the precharge mid-rail is V.

The figure below plots the second formula: sense signal against the stored cell voltage. Keep it in view for Ex 4 and Ex 7 — the straight line is the sensing physics.

Figure — Row - column addressing and sense amplifiers

Read it like this: the horizontal axis is what the cell holds, ; the vertical axis is the resulting signal in millivolts. The line crosses zero exactly at the mid-rail V (the black square). The orange dot at V is a stored 1 giving mV; the plum dot at V is a stored 0 giving mV — equal and opposite, which is the whole reason for mid-rail precharge.


Real-world & exam-twist examples (cells I, J)


Recall Quick self-test (click to reveal)

Non-square -bit array with needs how many multiplexed pins? ::: . Why precharge to and not ? ::: It makes stored 0 and stored 1 give equal and opposite , so one differential amp reads both symmetrically. A cell at exactly gives what signal? ::: — unreadable; refresh must act before the cell drifts this far. Doubling does what to ? ::: Roughly halves it (dilutes the cell charge into a bigger bitline).