Design a Programmable Logic Array (PLA) for a combinational logic circuit that computes the square of 3-bit binary numbers. Determine the minimum number of product terms required and construct the corresponding PLA programming table for the implementation.
20 marks · directive: Design
The core of a good answer
For input A₂A₁A₀ (0 to 7) the 6-bit square B₅...B₀ gives B₀ = A₀, B₁ = 0, B₂ = A₁Ā₀, B₃ = Ā₂A₁A₀ + A₂Ā₁A₀, B₄ = A₂Ā₁ + A₂A₀, B₅ = A₂A₁; with B₀ also taken through the PLA the minimum is 7 product terms (6 if B₀ is wired directly to A₀ and B₁ to ground).
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
The question asks for the truth table, multi-output minimisation aimed at the fewest distinct product terms (since the AND array is shared), and the PLA programming table showing inputs (1, 0, -) and output connections.
Answer outline
Introduction
Inputs A₂A₁A₀ represent 0 to 7; the largest square is 49 = 110001, so six outputs B₅ to B₀ are needed. Squares: 0, 1, 4, 9, 16, 25, 36, 49.
Step 1: Truth table (A₂A₁A₀ : B₅B₄B₃B₂B₁B₀)
- 000 : 000000 (0); 001 : 000001 (1); 010 : 000100 (4); 011 : 001001 (9)
- 100 : 010000 (16); 101 : 011001 (25); 110 : 100100 (36); 111 : 110001 (49)
Step 2: Output functions
- B₀ = Σm(1,3,5,7) = A₀; B₁ = 0 for all inputs
- B₂ = Σm(2,6) = A₁Ā₀
- B₃ = Σm(3,5) = Ā₂A₁A₀ + A₂Ā₁A₀ (minterms not adjacent)
- B₄ = Σm(4,5,7) = A₂Ā₁ + A₂A₀
- B₅ = Σm(6,7) = A₂A₁
Step 3: Minimum number of product terms
- No term can be shared between outputs without adding extra terms: B₃ needs both its minterms, B₄ needs two terms, B₅ and B₂ one each.
- Distinct terms: A₀, A₁Ā₀, Ā₂A₁A₀, A₂Ā₁A₀, A₂Ā₁, A₂A₀, A₂A₁ = 7
- An exhaustive search over all implicants confirms 7 is the minimum (6 if B₀ bypasses the PLA).
Step 4: PLA programming table (product term: inputs A₂A₁A₀ ; outputs B₅B₄B₃B₂B₁B₀, 1 = connected)
- 1. A₀: - - 1 ; 000001
- 2. A₁Ā₀: - 1 0 ; 000100
- 3. Ā₂A₁A₀: 0 1 1 ; 001000
- 4. A₂Ā₁A₀: 1 0 1 ; 001000
- 5. A₂Ā₁: 1 0 - ; 010000
- 6. A₂A₀: 1 - 1 ; 010000
- 7. A₂A₁: 1 1 - ; 100000
- All outputs true (T); B₁ has no connections, so it is 0.
Step 5: PLA size
- 3 inputs × 7 product terms × 6 outputs: AND array 6 × 7 literal fuses (true and complement of each input), OR array 7 × 6 fuses.
- Check: input 101 activates terms 1, 4, 5 and 6, giving B₄ = B₃ = B₀ = 1, i.e. 011001 = 25.
Conclusion
The PLA needs 3 inputs, 6 outputs and at least 7 product terms (6 if B₀ = A₀ is wired directly), compared with 8 words for a ROM implementation; the programming table above fully specifies the fuse map.
Examples and data to cite
- An exhaustive search over all 27 possible product terms of three variables confirms that no cover of B₀, B₂, B₃, B₄ and B₅ uses fewer than 7 distinct product terms.
- A ROM needs a separate memory location for every input combination (8 here), whereas a PLA can often implement the same logic with fewer transistors because it generates only the product terms needed.
Facts to remember
- A PLA has both the AND and OR planes programmable; a PAL has programmable AND gates but fixed OR gates.
- A PLA with M outputs needs M OR gates, one for each output.
- Multi-output minimisation aims to minimise distinct product terms, not literals in each output separately.
- The least significant bit of n² equals the LSB of n, and the next bit is always 0.