EC-273 Lab

Team :
Punith Bajaj 19095122 punith.bajaj.cd.ece19@itbhu.ac.in

Yash Garg 19095123 yash.garg.cd.ece19@itbhu.ac.in

R Tharun Gowda 19095124 rtharun.gowda.cd.ece19@itbhu.ac.in

Experiment 1 : Verification and interpretation of truth

table for AND, OR, NOT, NAND, NOR, XOR, XNOR gates
Aim

To verify and interpret the logic and truth table for AND, OR, NOT, NAND, NOR,
XOR, XNOR gates using RTL Resistor Transistor Logic), DTL Diode Transistor
Logic) and TTL Transistor Transistor Logic) logics in simulator 1 and verify the
truth table for AND, OR, NOT, NAND, NOR, XOR, XNOR gates in simulator 2.

Theory

Logic gates are the basic building blocks of any digital system. Logic
gates are electronic circuits having one or more than one input and only
one output. The relationship between the input and the output is based
on a certain logic. Based on this, logic gates are named as
1 AND gate
2 OR gate
3 NOT gate
4 NAND gate
5 NOR gate
6 XOR gate
7 XNOR gate

1) AND Gate

EC273 Lab 1
 Theory
The AND gate is an electronic circuit that gives a high output 1 only if all its
inputs are high. A dot (.) is used to show the AND operation i.e. A.B or can be
written as AB

Procedure

Simulate the AND gate in the breadboard simulator by using AND Integrate
Circuit - 4081 and note the output of the AND gate for different levels of inputs
Observations

A = 1, B = 1

EC273 Lab 2
 We get Y = 1 (glowing LED is indication of high voltage level at the output)

A = 1 and B = 0 (degenerate to A0 and B1

We get Y0(the off LED is indication of low voltage level at the output)

A = 0 and B = 0

EC273 Lab 3
 We get Y0 (the off LED is indication of low voltage level at the output)

Conclusion

Hence we verified the truth table of AND gate.

2) OR Gate
Theory
The OR gate is an electronic circuit that gives a high output 1 if one or more of
its inputs are high. A plus (+) is used to show the OR operation.

EC273 Lab 4
 Procedure
Simulate the OR gate in the bread board simulator using OR Integrate Circuit -
4071 and note the output of the OR gate for different levels of inputs.

Observations

A = 1 and B = 1

EC273 Lab 5
 We get Y = 1 (the glowing LED indicates the high voltage level a the output)

A = 1 and B = 0 (degenerate to A0 and B1

We get Y = 1 (the glowing LED indicates the high voltage level at the output)

A = 0 and B = 0

EC273 Lab 6
 We get Y = 0 (the off LED indicates the low voltage level at the output)
Conclusion

Hence we verified the truth table of OR gate

3) NOT Gate
Theory
The NOT gate is an electronic circuit that produces an inverted version
of the input at its output. It is also known as an inverter. If the
input variable is A, the inverted output is known as NOT A. This is
also shown as A' or A with a bar over the top, as shown at the outputs.

EC273 Lab 7
 Procedure

Simulate the NOT gate in the bread board simulator using NOT Integrate Circuit -
4069 and note the output of the NOT gate for different levels of inputs.
Observations

A=1

EC273 Lab 8
 We get Y = 0 (the off LED indicates the low voltage level at the output)

A=0

We get Y = 1 (the glowing LED indicates the high voltage level at the output)

Conclusion
Hence we verified the truth table of NOT gate.

4) NAND Gate
Theory

This is a NOTAND gate which is equal to an AND gate followed by a NOT gate.
The outputs of all NAND gates are high if any of the inputs are low. The symbol is

EC273 Lab 9
 an AND gate with a small circle on the output. The small circle represents
inversion.

Procedure
Simulate the NOT gate in the bread board simulator using NOT Integrate Circuit -
4011 and note the output of the NOT gate for different levels of inputs.

Observations

A = 1 and B = 1

EC273 Lab 10
 We get Y = 0 (the off LED indicates low voltage level at the output)

A = 1 and B = 0 (degenerate to A = 0 and B = 1

We get Y = 1 (the glowing LED indicates high voltage level at the output)

A = 0 and B = 0

EC273 Lab 11
 We get Y = 1 (glowing LED indicates the high voltage level at the output)
Conclusion
Hence we verified the truth table of NAND gate

5) NOR gate
Theory

This is a NOTOR gate which is equal to an OR gate followed by a NOT gate. The
outputs of all NOR gates are low if any of the inputs are high. The symbol is an
OR gate with a small circle on the output. The small circle represents inversion

EC273 Lab 12
 Procedure
Simulate the NOR gate in the bread board simulator using NOR Integrate Circuit -
4001 and note the output of the NOR gate for different levels of inputs.
Observations

A = 0 and B = 0

EC273 Lab 13
 We get Y = 1 (glowing LED indicates the high voltage level at the output)

A = 1 and B = 0 (degenerate to A = 0 and B = 1

We get Y = 0 (the off LED indicates low voltage level at the output)

A = 1 and B = 1

EC273 Lab 14
 We get Y = 0 (the off LED indicates low voltage level at the output)

Conclusion
Hence we verified the truth table of NOR gate

6) XOR gate
Theory
The 'Exclusive-OR' gate is a circuit which will give a high output if either, but not
both of its two inputs are high. An encircled plus sign (⊕) is used to show the
XOR operation.

EC273 Lab 15
 Procedure
Simulate the XOR gate in the bread board simulator using XOR Integrate Circuit -
4070 and note the output of the XOR gate for different levels of inputs.
Observations

A = 1 and B = 1

EC273 Lab 16
 We get Y = 0 (the off LED indicates the low voltage level at the output)

A = 1 and B = 0 (degenerate to A = 0 and B = 1

We get Y = 1 (the glowing LED indicates the high voltage at the output)

A = 0 and B = 0

EC273 Lab 17
 We get Y = (the off LED indicates the low voltage level at the output)
Conclusion
Hence we verified the truth table of NOT gate

7) XNOR gate
Theory

The 'Exclusive-NOR' gate circuit does the opposite to the XOR gate. It will give a
low output if either, but not both of its two inputs are high. The symbol is an XOR
gate with a small circle on the output. The small circle represents inversion.

EC273 Lab 18
 Procedure
Simulate the XNOR gate in the bread board simulator using XOR Integrate Circuit
- 4011 and NOT Integrated circuit - 4069 and note the output of the XNOR gate
for different levels of inputs.

Observations

A = 0 and B = 0

EC273 Lab 19
 We get Y = 1 (the glowing LED indicates high voltage level at the output)

A = 1 and B = 0 (degenerate to A = 0 and B = 1

We get Y = 0 (the off LED indicates low voltage level at the output)
A = 1 and B = 1

EC273 Lab 20
 We get Y = 1 (the glowing LED indicates high voltage level at the output)

Conclusion
Hence we verified the truth table of NOT gate

Experiment 2 : Construction of half/ full adder using

XOR and NAND gates and verification of its operation

Aim

To verify the truth table of half adder and full adder by using XOR and NAND
gates respectively and analyse the working of half adder and full adder circuit
with the help of LEDs in simulator and verify the truth table only of half adder and
full adder in simulator .

Theory

Adders are digital circuits that carry out addition of numbers. Adders are a key
component of arithmetic logic unit. Adders can be constructed for most of the
numerical representations like Binary Coded Decimal BCD, Excess – 3, Gray
code, Binary etc. out of these, binary addition is the most frequently performed
task by most common adders. Apart from addition, adders are also used in
certain digital applications like table index calculation, address decoding etc

1) Half Adder

EC273 Lab 21
 Theory
Half adder is a combinational circuit that performs simple addition of two binary
numbers. If we assume A and B as the two bits whose addition is to be
performed,the block diagram and a truth table for half adder with A, B as inputs
and Sum, Carry as outputs can be tabulated as follows.

Half Adder Logic Diagram

Block diagram and truth table of half adder

If A and B are binary inputs to the half adder, then the logic function to calculate
sum S is XOR of A and B and logic function to calculate carry C is AND of A and
B. Combining these two, the logical circuit to implement the combinational circuit
of half adder is shown below.
Procedure
Construct the half adder using XOR Integrated circuit - 4081 and NAND
Integrated circuit - 4011 as shown below.
Observations

A = 0 and B = 0

EC273 Lab 22
 We get S = 0 LED off) and C = 0 LED off)

A = 1 and B = 0 (degenerate of A = 0 and B = 1

We get S = 1 LED on) and C = 0 LED off)

A = 1 and B = 1

EC273 Lab 23
 We get S = 1 LED on) and C = 1LED on)
Conclusion
Hence we verified the truth table of Full adder.

2) Full Adder
Theory
Full adder is a digital circuit used to calculate the sum of three binary bits. Full
adders are complex and difficult to implement when compared to half adders.
Two of the three bits are same as before which are A, the augend bit and B, the
addend bit. The additional third bit is carry bit from the previous stage and is
called 'Carry' – in generally represented by CIN. It calculates the sum of three bits
along with the carry. The output carry is called Carry – out and is represented by
Carry OUT.The block diagram of a full adder with A, B and CIN as inputs and S,
Carry OUT as outputs is shown below.

EC273 Lab 24
 Full adder block diagram and truth table

Full adder logic

Procedure
Construct the full adder using XOR Integrated circuit - 4081 and NAND
Integrated circuit - 4011 as shown below.
Observations

A = 0 , B = 0 and Cin = 0

EC273 Lab 25
 We get S = 0 LED off) and C = 0 LED off)

A = 0 , B = 0 and Cin = 1

We get S = 1 LED on) and C = 0 LED off)

A = 0 , B = 1 and Cin = 0

EC273 Lab 26
 We get S = 1 LED on) and C = 0 LED off)

A = 0 , B = 1 and Cin = 1

We get S = 0 LED off) and C = 1 LED on)

A = 1, B = 0 and Cin = 0

EC273 Lab 27
 We get S = 1 LED on) and C = 0 LED off)

A = 1 , B = 0 and Cin = 1

We get S = 0 LED off) and C = 1 LED on)

A = 1 , B = 1 and Cin = 0

EC273 Lab 28
 We get S = 0 LED off) and C = 1 LED on)

A = 1 , B = 1 and Cin = 1

We get S = 1 LED on) and C = 1 LED on)

Conclusion
Hence we verified the truth table of Full adder.

EC273 Lab 29