- 2078 Kartik · 2+2×2 marks
PROM vs PLA; functions using PAL
Short answer
PROM has a fixed AND array (full decoder) and programmable OR; PLA has both arrays programmable. For PAL, A(x,y,z)=Σ(2,4,5,7) simplifies to xy'+xz+x'yz', B=Σ(0,2,6) to x'z'+yz'. Program these product terms in the AND array; fixed ORs combine them.
Differentiate between PROM and PLA. Implement the following boolean functions using PAL. a) A(x,y,z) = Σ(2,4,5,7) b) B(x,y,z) = Σ(0,2,6)
PROM vs PLA
| Point | PROM | PLA |
|---|---|---|
| AND array | Fixed (full decoder, all minterms) | Programmable |
| OR array | Programmable | Programmable |
| Functions in form | Sum of minterms (no simplification) | Simplified SOP, shared terms |
| Size for many inputs | Grows as , wasteful | Only needed product terms |
| Typical use | Look-up tables, code converters | Multi-output logic with common terms |
Functions using PAL
In a PAL the AND array is programmable and the OR array is fixed, so each function is first simplified to SOP.
a)
yz=00 01 11 10
x=0 0 0 0 1
x=1 1 1 1 0
- give ; give ; alone gives .
b)
yz=00 01 11 10
x=0 1 0 0 1
x=1 0 0 0 1
- give ; give .
PAL programming table (each OR gate has 3 AND inputs; 1 = true, 0 = complement, – = not connected):
| Product term | x | y | z | Output |
|---|---|---|---|---|
| 1: | 1 | 0 | – | A |
| 2: | 1 | – | 1 | A |
| 3: | 0 | 1 | 0 | A |
| 4: | 0 | – | 0 | B |
| 5: | – | 1 | 0 | B |
| 6: (unused) | – | – | – | B |
x y z --[prog. AND]-- P1,P2,P3 --[fixed OR]--> A
\----- P4,P5,P6 --[fixed OR]--> B
The unused term 6 has all its fuses intact (both and connected) so it gives 0 and does not affect B.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Memory devices; PAL vs PLA · Digital Logic, chapter 4
- RAM vs ROM; functions using PROM · Digital Logic, chapter 4
- PLA for F1 = Σm(3,5,6,7), F2 = Σm(0,2,4,7) · Digital Logic, chapter 4
- PLA and full subtractor using PLA · Digital Logic, chapter 4
- Merits of functions; actual vs formal parameters · Computer Programming, chapter 6