A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Static RAM (SRAM) Cell Design and Arrays

College Depth 93 in the knowledge graph ☐ I know this ☆ Set as goal
353prerequisites beneath it
See this on the map →
Flip-Flops and LatchesMemory Organization and Addressing→
sram memory-cell memory-design

Core Idea

An SRAM cell is a cross-coupled NOR or NAND latch that stores one bit and requires continuous power. Unlike DRAM, SRAM is fast (single-cycle access) but power-hungry and area-inefficient. SRAM arrays use row and column decoders for addressing. Register files and caches are typically built from SRAM; main memory uses DRAM.

Explainer

You already understand flip-flops and latches — circuits that use feedback loops to hold a binary value indefinitely as long as power is supplied. An SRAM cell is essentially a miniaturized latch, stripped down to the smallest circuit that can reliably store one bit. The standard design uses six transistors (6T): four transistors form two cross-coupled inverters that hold the stored value, and two additional transistors act as access gates controlled by a word line. When the word line is activated, the access transistors connect the storage inverters to a pair of complementary bit lines, allowing the cell to be read or written.

Reading an SRAM cell works by precharging both bit lines to a high voltage, then asserting the word line. The cross-coupled inverters pull one bit line slightly lower than the other, depending on the stored value. A sense amplifier detects this small voltage difference and amplifies it into a clean digital output. The key advantage is speed: because the stored value is actively maintained by the inverter pair, there is no need to restore the cell after reading (unlike DRAM, which destructively reads its capacitor). An SRAM read completes in a single clock cycle, making it ideal for circuits that demand the fastest possible access.

Writing works by driving the bit lines to the desired values and asserting the word line. The external drivers are stronger than the internal inverters, so they overpower the stored state and force the cross-coupled pair into the new configuration. Once the word line is deasserted, the feedback loop locks in the new value. This is straightforward but requires the drivers to be carefully sized — if they are too weak, the write fails; if the cell is too weak, it becomes vulnerable to noise during reads. Balancing these competing constraints is a central challenge in SRAM design.

The tradeoff that defines SRAM's role in computer architecture is speed versus density. Six transistors per bit is expensive in silicon area compared to DRAM's one transistor and one capacitor per bit. This means you can fit far fewer SRAM bits on a chip, making it impractical for main memory (which needs gigabytes). But SRAM's single-cycle access time and lack of refresh requirements make it perfect for register files (tens to hundreds of entries that the processor reads every cycle) and cache memory (kilobytes to megabytes of fast storage that bridge the speed gap between the processor and main memory). Nearly every modern processor uses SRAM for its L1, L2, and often L3 caches — the memory hierarchy depends on SRAM's speed advantage at the top and DRAM's density advantage at the bottom.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Binary Counters: Design and Analysis → Binary Arithmetic → Fixed-Point Number Representation → Two's Complement Representation → Overflow and Underflow Detection → Binary Adders: Half-Adders and Full-Adders → Full Adder and Carry Propagation → Carry Lookahead Adder Design → Half Adder Circuit Design → Multiplication Circuit Design → Sequential Circuit Design → Registers and Register Files → Instruction Set Architecture (ISA) → Assembly Language Basics → Memory Organization and Addressing → Static RAM (SRAM) Cell Design and Arrays

Longest path: 94 steps · 353 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.