- 2082 Baisakh · 6 marks
PLA for F1 = Σm(3,5,6,7), F2 = Σm(0,2,4,7)
Short answer
Minimize: F1 = AB + AC + BC; F2 = A'C' + B'C' + ABC. Program six product terms in PLA: AB, AC, BC, A'C', B'C', ABC. F1 ORs the first three terms; F2 ORs the last three terms.
Implement the circuit with a PLA of the following Boolean function: F1 = Σm(3,5,6,7) and F2 = Σm(0,2,4,7).
A PLA (Programmable Logic Array) has a programmable AND array that forms product terms and a programmable OR array that sums them into outputs. To use it efficiently, each function is minimized and product terms are shared where possible.
Simplification
:
| A \ BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 |
:
| A \ BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 0 |
Groups: (0, 2) gives ; (0, 4) gives ; 7 alone gives .
PLA programming table
Six product terms are needed (none is common to both functions). In the input columns 1 = true variable, 0 = complemented, – = not connected; in the output columns 1 = term connected to that OR gate.
| Term | Product | A | B | C | ||
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | – | 1 | – | |
| 2 | 1 | – | 1 | 1 | – | |
| 3 | – | 1 | 1 | 1 | – | |
| 4 | 0 | – | 0 | – | 1 | |
| 5 | – | 0 | 0 | – | 1 | |
| 6 | 1 | 1 | 1 | – | 1 |
Size: 3 inputs × 6 product terms × 2 outputs.
PLA diagram
A A' B B' C C' (input buffers)
| | | | | |
x--+--x--+--+--+--[AND]-- P1 = AB
x--+--+--+--x--+--[AND]-- P2 = AC
+--+--x--+--x--+--[AND]-- P3 = BC
+--x--+--+--+--x--[AND]-- P4 = A'C'
+--+--+--x--+--x--[AND]-- P5 = B'C'
x--+--x--+--x--+--[AND]-- P6 = ABC
OR array
P1, P2, P3 ----------[OR]--> F1
P4, P5, P6 ----------[OR]--> F2
(x = programmed connection)
Check: (6): , so ; , so . Both match the given minterm lists for all 8 inputs.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- PROM vs PLA; functions using PAL · Digital Logic, chapter 4
- PLA and full subtractor using PLA · Digital Logic, chapter 4
- 32:1 MUX tree from 4:1; implement Σ(0,1,3,8,9,13) · Digital Logic, chapter 4
- 32:1 MUX tree; implement Σm(0,1,3,8,9,13,15) · Digital Logic, chapter 4
- RAM vs ROM; functions using PROM · Digital Logic, chapter 4
- ROM and implementing two functions · Digital Logic, chapter 4
- Find F1 and F2 for equilibrium · Applied Mechanics, chapter 2
- Design ROM for X,Y,Z to F1,F2 table · Embedded System, chapter 4
- Design ROM for A,B,C to F1-F4 table · Embedded System, chapter 4 · asked 2×
- Design ROM for X,Y,Z to F1-F4 table · Embedded System, chapter 4 · asked 2×