Description
1. Simplify the following function and implement them using 2-level only NAND
circuits, simulated with software, show true table produce from simulator.
(20 marks each)
a. F(ABCD)=AC’D’+A’C+ABC+AB’C+ A’C’D’
b. F(ABC)=(A’+C’+D’)(A’+C’)(C’+D’)
2. Built Half adder using only NOR gates and then construct a 4 bits adders
using your hafts adder (only NOR gates are allowed) (30 marks)
– Connect the overflow to a light bulb that lights up if the sum of the result
in an overflow.
– I should be able to run your simulation file with my test cases.
3. Implement, via simulator, a 4-bits Binary to Gray Code converter using only
NAND gates. Your circuit only care Gray Code values from 0-9. (30 marks)
– Follow the design procedure discussed in class and show your k-map(s)
– Make sure to test your circuit
i
0
i
1
i
2
i
3
O0
O1
O2
O3
Binary to ray Code
converter
