Scribd
Upload
5 views8 pages

C0 1

The document discusses various aspects of digital logic design, including simplification of Boolean expressions, representation in canonical forms, and the architecture of programmable logic devices like CPLD, PAL, and PLA. It also covers the design of circuits such as multiplexers, encoders, and decoders, along with truth tables and output equations. Additionally, it highlights the role of macro cells in CPLD architecture and compares different types of programmable logic devices.

Uploaded by

tharak.ceo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views8 pages

C0 1

The document discusses various aspects of digital logic design, including simplification of Boolean expressions, representation in canonical forms, and the architecture of programmable logic devices like CPLD, PAL, and PLA. It also covers the design of circuits such as multiplexers, encoders, and decoders, along with truth tables and output equations. Additionally, it highlights the role of macro cells in CPLD architecture and compares different types of programmable logic devices.

Uploaded by

tharak.ceo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Simplify the expression F = A B D + A B' using Boolean identities.

F = A B D + A B'
= A (BD+B’)
= A (B’+B)(B’+D)
= A (B’+D)
Represent the given expression in canonical POS form Y = (A + B)(B + C)(A + C)
Y = (A + B)(B + C)(A + C)
= (A+B+CC’)(B+C+AA’)(A+C+BB’)
= (A+B+C)(A+B+C’)(A+B+C)(A’+B+C)(A+B+C)(A+B’+C)
= M0.M1.M0.M4.M0.M2
= ΠM(0, 1, 2, 4)
Draw the architecture of a Complex Programmable Logic Device (CPLD) and its key components.

Reduce A (A + B) to the least number of terms.


= A (A + B) = AA + AB = A + AB = A (1+B) = A
Represent the given expression in canonical SOP form Y = AC + AB + BC.
= AC(B+B’) + AB(C+C’) + BC(A+A’) [Since, C + C = 1]
= ABC + AB’C + ABC + ABC’ + ABC + A’BC
= m7 + m5 + m7 + m6 + m7 + m3
= ∑m (3, 5, 6, 7)
Discuss the role of macro cells in CPLD architecture.
• The main building block of the CPLD is a macro cell. Macro cells are defined as functional blocks
responsible for performing sequential or combinational logic.
• The macro cell consists of AND/OR array, Flip-flop, Multiplexer, XOR gate.
Apply De Morgan's theorems to simplify the expression: F = [(A+B)(C+D)]'
F = [(A+B)(C+D)]'
= (A+B)’ + (C+D)’
= A’.B’ + C’.D’
Develop a truth table that represents the Boolean equation. F = A’B’C + AB’C’ + ABC’ + ABC = ∑ m
(1,4,6,7).
A B C F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
Sketch a basic block diagram for a Programmable Array Logic (PAL) device.
Describe the full subtractor using a block diagram, list its truth table and output equations.

Design a circuit diagram for a 8-to-3 line encoder. Include input and output labels in your diagram.

a) Block Diagram b) Truth Table c) Circuit Diagram

Provide a thorough description of the architecture of a 1:4 de-multiplexer, including its input lines, control
lines, and output.
Compare and contrast PROM, PAL & PLA using schematic diagrams.

• The PROM (Programmable Read Only Memory) has a fixed AND array (constructed as a decoder) and
programmable connections for the output OR gates array. The PROM implements Boolean functions in
sum-of-min terms form.
• The PAL (Programmable Array Logic) device has a programmable AND array and fixed connections for
the OR array.
• The PLA (Programmable Logic Array) has programmable connections for both AND and OR arrays. So
it is the most flexible type of PLD.
Describe the full adder using a block diagram, list its truth table and output equations.
Block Diagram: Truth Table: Circuit Diagram:

Output Expressions: SUM = ∑m(1,2,4,7) = A’.B’.C+A’.B.C’+A.B’.C’+A.B.C


CARRY= ∑m(3,5,6,7) = A’.B.C+A.B’.C+A.B.C’+A.B.C
Design a circuit diagram for a 3-to-8 line decoder. Include input and output labels in your diagram.
Optimize the equation F (A, B, C) = AB’C + A’B’C + A’BC + A’B’C’ + AB’C’ using K-Maps and realize
the resultant expression using logic gates.

Design a 8:1 multiplexer using two 4:1 mux and one 2:1 mux.

Design the following Boolean functions using PROM.


i) A (X,Y,Z) = ∑m (2,5,6) ii) B (X,Y,Z) = ∑m (0,2,4,7)
Design the following Boolean functions using PAL. A (X,Y,Z) = Sum of Even Numbers (include Zero also)
and B (X,Y,Z) = Sum of Odd Numbers.

Optimize the given function using K-map F (W, X, Y, Z) = ∑m (1, 3, 4, 5, 6, 7, 11, 14, 15) and implement
using logic gates.
Design a Full Adder circuit utilizing an appropriate decoder and OR gates.

Illustrate the internal structure of Macro cell in CPLD using D Flip-flop and give the insights.

Design the circuit with a PLA having three inputs and two outputs.
i) F1 (A, B, C) = ∑m (3, 5, 6, 7) ii) F2 (A, B, C) = ∑(0, 2, 4, 7)
Optimize the four variable function F ⟮A,B,C,D⟯ = ∑m ⟮0,1,4,5,6,10,13⟯ + d ⟮2,3⟯ using K-Maps.

F = A’C’ + A’D’ + BC’D + B’CD’


Design the function F(A,B,C) = ∑ m (1,4,5,7) using 4X1 MUX considering A as Input line and B, C as
selection lines.

Design the following Boolean functions using PROM.


i) A (X,Y,Z) = ∑m (5,6,7) ii) B (X,Y,Z) = ∑m (3,5,6,7)
Design a Configurable Logic Block (CLB) for the given Boolean function Y(A,B)= ∑m (0,1,2).

You might also like