3.5ROM, PLA, PAL and comparators
The idea
A ROM stores a table of answers: the address picks a row. A PLA instead has a programmable AND plane and a programmable OR plane and stores only the product terms that are needed.
Think of it like this: A phone book (ROM: every number is listed) versus a short list of rules (PLA: only the useful patterns).
Why it exists
GATE asks for the size of a ROM or the number of connections of a PLA, and which plane is programmable.
How it works
- ROM size = 2^(address lines) × (word width) bits.
- A ROM is a full decoder (fixed AND plane) plus a programmable OR plane.
- A PLA has both planes programmable and shares product terms between outputs.
- A PAL has a programmable AND plane and a fixed OR plane.
Worked example: ROM for a 4-input, 3-output function
2⁴ = 16 words of 3 bits = 48 bits. A PLA with 6 product terms needs 2·4·6 = 48 AND-plane points and 6·3 = 18 OR-plane points.
Now play with it
- →Change the address lines to 6 and 8 and watch the ROM size explode.
- →Compare ROM and PLA for a few product terms.
A PLA wins when only a few product terms are needed; a ROM always builds all 2ᵃ minterms.
| Device | AND plane | OR plane |
|---|---|---|
| ROM | fixed (full decoder) | programmable |
| PLA | programmable | programmable |
| PAL | programmable | fixed |
Check yourself
A ROM implements an 8-bit output function of 6 address lines. Its size in bits is
Exam notes (the dense version)
A ROM with k address lines and m data bits stores 2ᵏ × m bits and is a fixed AND plane (full decoder) feeding a programmable OR plane. A PLA has a programmable AND plane (only the product terms needed) and a programmable OR plane, so it is smaller than a ROM for sparse functions. A PAL programs only the AND plane. A magnitude comparator for n bits uses per-bit equality Eᵢ = (Aᵢ ⊕ Bᵢ)′; A = B is the AND of all Eᵢ; A > B is the first bit from the MSB where Aᵢ = 1 and Bᵢ = 0 with all higher bits equal. A parity generator is a chain/tree of XOR gates (n − 1 gates for n bits).
Previous year questions: Combinational Circuits (10)
PYQs are grouped by topic, so this is the full set for Combinational Circuits; try the ones that match this subtopic. Open all 10 on the topic page.