Tut 3
Tut 3
ELCT201
Spring 2024
Tutorial_3
Implementing circuits using only
NAND & NOR
gates
1
Motivation
2
Demorgan’s Law
A A
B ≡ B
A
B ≡ A
B
3
Combinational Circuit
• Combinational Circuit
– Analysis Procedures
– Design Procedures
Combinational
n - inputs
Circuit m - outputs
4
Design Procedures
6
Problem 1
•
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
7
Problem 2
•
0 1 3 2
4 5 7 6
8
Problem 3
In a simple copy machine, a stop signal, S, is to be generated to stop the machine
operation and energize an indicator light whenever either of the following conditions
exists:
There is no paper in the paper feeder tray; OR the two micro-switches in the paper path
are activated, indicating a jam in the paper path.
The presence of paper in the feeder tray is indicated by a HIGH at logic signal P. Each
of the micro-switches produces a logic signal (Q and R) that goes HIGH whenever
paper is passing over the switch to activate it. Design the logic circuit to produce a
HIGH at output signal S for the stated conditions, and implement it using NAND gates.
P Q R S
0 0 0
0 0 1
0 1 0
0 1 1
0 1 3 2 1 0 0
1 0 1
4 5 7 6
1 1 0
1 1 1
9
Problem 6
• Design a 4–bit combinational circuit that generates the twos complement of the input binary
number. You are also required to show that the circuit can be implemented using XOR and
OR logic gates.
0 0 0 0
0 1 3 2 0 0 0 1
0 0 1 0
4 5 7 6
0 0 1 1
12 13 15 14 0 1 0 0
0 1 0 1
8 9 11 10 0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1 10
Problem 8
A lift door control is to operate in the following manner. When the lift stops at a floor
the door will open and a signal is generated that remains on until all the passengers are
on or off the lift. An additional signal is also generated to ensure that the doors do not
close on a passenger in the doorway. Doors will close if a call button has been pressed
on another floor or if a lift passenger has pressed a button for another floor. Design the
lift control combinational circuit using minimum
number of NAND gates. 0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 3 2
0 1 0 1
4 5 7 6 0 1 1 0
0 1 1 1
12 13 15 14 1 0 0 0
1 0 0 1
8 9 11 10
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1 11