Scribd
Upload
111 views2 pages

Implementing Function f Using MUX/Decoder

The document discusses various digital logic design problems including designing circuits using gates, decoders, multiplexers, encoders, parity generators and PLA/PAL. It provides problems involving simplifying Boolean functions using K-maps and implementing functions using logic gates, decoders, multiplexers and PLA/PAL.

Uploaded by

nishu chaudhary
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
111 views2 pages

Implementing Function f Using MUX/Decoder

The document discusses various digital logic design problems including designing circuits using gates, decoders, multiplexers, encoders, parity generators and PLA/PAL. It provides problems involving simplifying Boolean functions using K-maps and implementing functions using logic gates, decoders, multiplexers and PLA/PAL.

Uploaded by

nishu chaudhary
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/ 2

1. Design a full adder using two half adder and an OR gate.

2. Design a BCD to excess-3 code converter


3. Design a binary to gray code converter.
4. Design a combinational circuit that converts 4 bit Gray code to a 4 bit binary number
5. Design 3:8 decoders using basic gate.
6. Implement the following multiple output combinational logic circuit using 4 line to 16
line decoder

7. Implement the function using a 8:1multiplexer


8. Realize using 8 to 1 line MUX.
9. Implement a full adder circuit with
Decoder
Multiplexer
10. Design a octal to binary encoder
11. Design a priority encoder
12. Use K-map simplification to obtain the function

13. Simplify (using k-map) the given Boolean unction in both SOP and POS using the don't
case condition d:
f(A,B,C,D)=π(0,1,3,7,8,12)
πd (5,10,13,14)
14. Define decoder. Draw logic diagram and truth table of 3 to 8-line decoder.
15. Define PLA. Design PLA circuit with given function.
F1(A,B,C)=Σ (3,5,6,7)
F2(A,B,C)=Σ (0,2,4,7).
Design PLA Program table also
16. Simplify the Boolean function F(w,x,y,z) = π(0,2,4,6,8,10,12,14) and don't care
conditions d(w,x,y,z) = π(1,3,9,11) using K-Map method for both SOP and POS form
17. Explain binary to octal converter with block diagram, truth table and logic diagram
18. Write difference between PLA and PAL. Design a PLA circuit with given functions.
F1 (A, B, C)=Σ (2, 3, 5)
F2 (A, B, C)=Σ (0, 4, 5, 7).
Design PLA program table also.
19. Implement the following functions using PLA

a. w (A, B, C, D) = Σ(2, 12, 13)


b. x (A, B, C, D) = Σ(7, 8, 9, 10, 11, 12, 13, 14, 15)
c. y (A, B, C, D) = Σ(0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15)
d. z (A, B, C, D) = Σ(1, 2, 8, 12, 13)

20. Design 4-bit even parity generator.


21. Design a combinational circuit that generates 9’s complement of a BCD number.
22. Simplify the function
F = Ʃ(1,3,6,7)
F = Ʃ(0,2,3,4,6)
F (A,B,C,D) = Ʃ(3,7,11,13,14,15)
F (x,y,z ) = Ʃ(0,1,2,4,5) + Ʃd (3,6,7)
23. Simplify the boolean function F (w,x,y,z ) = Ʃ(1,3,7,11,15) which has don’t care
conditions d (w,x,y,z ) = Ʃ(0,2,5)
24. Design a logic circuit with 3 inputs and one output. The output will be high when more
than one input is high. Derive a truth table and find the simplified function using K-map.
25. Using PROM realize the following expression
a.

b.

You might also like