1) Provide a NAND circuit implementation for this function: F(x,y,z) = xyz’ + x’y’z’ + xy’z’ + x’yz’ + xy’z + x’yz
2) A 3-bit parity check circuit will output a 1 for input having even number of 1’s. Provide the truth table, Karnaugh map for the minimized function, and circuit implementation using PLA.
SOLUTION-
1)
2)
If I apply K map on this there will be 3 groups
output F = Z' + X'Y+YX'
IF YOU HAVE ANY DOUBT PLEASE COMMENT DOWN BELOW I
WILL SOLVE IT FOR YOU:)
----------------PLEASE RATE THE ANSWER-----------THANK
YOU!!!!!!!!----------
Get Answers For Free
Most questions answered within 1 hours.