lab report 2
lab report 2
EEE241
LAB REPORT
Pre-Lab:
Background theory:
Digital circuits are more frequently constructed with universal gates. NAND and NOR gate
are called universal gates. Any Boolean logic function can be implemented using NAND only
or NOR only gates. NAND and NOR gates are easier to fabricate with electronic components
than basic gates. Because of the prominence of universal gates in the design of digital
circuits, rules and procedures have been developed for conversion from Boolean function
given in terms of AND, OR, and NOT into its equivalent NAND and NOR logic diagram.
Read and understand the universal gates. List the truth tables of AND, OR, NOT, NAND,
NOR and XOR gates. Identify the NAND and NOR ICs and their specification for CMOS
and TTL families.
In lab:
This lab has two parts. In the first part, simulation and implementation of any logic
expression by using only NAND gates are done. In the second part, the same procedure is
done by using NOR gates only.
Procedure
Simulate NOT, AND, OR , XOR and XNOR gates in Proteus software, by using
only NAND gates. Verify their truth tables.
Insert the IC on the trainer’s breadboard.
Use any one or more of the NAND gates of the IC for this experiment.
One or more Logic Switches of the trainer (S1 to S9) can be used for input to the
NAND gate.
For output indication, connect the output pin of the circuit to any one of the LEDs of
the trainer (L0 to L15).
In-Lab Tasks-Part-1
In-Lab Task 1.1: Verification of NOT function:
A F=A’
𝑨 𝑭
A
(AB)’ F=AB
B
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
A A’
F=A+B
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
A (A(AB)’)’
F=A’B+AB’
(AB)’
(B(AB)’)
Figure 2.4: XOR gate using NAND gates
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
F=AB+A’B’
(AB)’
B
(B(AB)’)’
Figure 2.5: XNOR gate
using NAND gates Table
2.5: Observation Table for
XNOR gate
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
𝐹(𝐴, 𝐵) =
Inputs Outputs
𝑨 �
𝑭𝑪 𝑭𝑶
Calculated Observed
�
0 0
0 1
1 0
1 1
Part 2 - Implementing any logic expression by using only NOR gates
If we can show that the logical operations AND, OR, and NOT can be
implemented with NOR gates, then it can be safely assumed that any
Boolean function can be implemented with NOR gates.
Procedure
INPUT OUTPUT
𝑨 𝑭
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
Post-Lab:
Task 01: Simulate NAND, XOR and XNOR gates in Proteus software, by
using only NOR gates. Verify their truth tables.
Critical Analysis/Conclusion
Lab Assessment
Pre-Lab /1
In-Lab /5
Data
/4
Analysis
Post-Lab
Data
Presentation
/4
/4
/10
Writing
/4
Style
𝑨 𝑩 𝑭
0 0
0 1
1 0
1 1
XOR:
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1
XNOR:
INPUTS OUTPUT
𝑨 � 𝑭
�
0 0
0 1
1 0
1 1