Digital Ic s Manual12
-
Upload
s-sarath-chandra -
Category
Documents
-
view
236 -
download
1
Transcript of Digital Ic s Manual12
-
7/30/2019 Digital Ic s Manual12
1/33
LIST OF DIGITAL EXPERIMENTS:
1. Study of Basic Digital ICs.
Verification of truth table for (AND, OR, NOT, NAND, NOR, EXOR)
2. Implementation of Adder/ Subtractor circuits.
3. Code converters, Binary to Gray and Gray to Binary code using suitable ICs.
4. Study of Flip-Flops (RS-FF, JK-FF, D-FF, T-FF)
5. Multiplexer/ De-multiplexer: Study of 4:1; 8:1 multiplexer and Study of 1:4; 1:8
demultiplexer
-
7/30/2019 Digital Ic s Manual12
2/33
Ex. No.1 STUDY OF BASIC DIGITAL ICS
AIM:
To verify the truth table of basic digital ICs (NAND, NOR, NOT, AND, OR, EX-OR gates)
APPARATUS REQUIRED:
S.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. NAND gate IC 7400 1
3. NOR gate IC 7402 1
4. NOT gate IC 7404 1
5. AND gate IC 7408 1
6. OR gate IC 7432 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required
PROCEDURE:
1. Connections are given as per the circuit diagrams.
2. For all the ICs 7th pin is grounded and 14th pin is given +5 V supply.
3. To verify the truth table of basic digital Ics
THEORY:
a. AND gate:
An AND gate is the physical realization of logical multiplication operation. It is an electronic circuit
which generates an output signal of 1 only if all the input signals are 1.
AND Gate Logic Symbol:
-
7/30/2019 Digital Ic s Manual12
3/33
PIN DIAGRAM OF IC 7408:
CIRCUIT DIAGRAM:
TRUTH TABLE (AND Gate):
S.NoINPUT OUTPUT
A B Y = A. B
1. 0 0 0
2. 0 1 0
3. 1 0 0
4. 1 1 1
b. OR gate:
An OR gate is the physical realization of the logical addition operation. It is an electronic circuit which
generates an output signal of 1 if any of the input signal is 1.
OR Gate Logic Symbol:
PIN DIAGRAM OF IC 7432:
-
7/30/2019 Digital Ic s Manual12
4/33
CIRCUIT DIAGRAM:
TRUTH TABLE (OR Gate):
S.NoINPUT OUTPUT
A B Y = A + B
1. 0 0 0
2. 0 1 1
3. 1 0 1
4. 1 1 1
c. NOT Gate:
A NOT gate is the physical realization of the complementation operation. It is an electronic circuit which
generates an output signal which is the reverse of the input signal. A NOT gate is also known as an
inverter because it inverts the input.
NOT Gate LOGIC SYMBOL:
PIN DIAGRAM OF IC 7404:
-
7/30/2019 Digital Ic s Manual12
5/33
CIRCUIT DIAGRAM:
TRUTH TABLE (NOT Gate):
S.No
INPUT OUTPUT
A Y = A
1. 0 1
2. 1 0
d. NAND gate:
A NAND gate is a complemented AND gate. The output of the NAND gate will be 0 if all the input
signals are 1 and will be 1 if any one of the input signal is 0.
NAND Gate LOGIC SYMBOL:
PIN DIAGRAM OF IC 7400:
-
7/30/2019 Digital Ic s Manual12
6/33
CIRCUIT DIARAM:
TRUTH TABLE (NAND Gate):
S.NoINPUT OUTPUT
A B Y = (A. B)
1. 0 0 1
2. 0 1 1
3. 1 0 1
4. 1 1 0
e. NOR gate:
A NOR gate is a complemented OR gate. The output of the OR gate will be 1 if all the inputs are 0
and will be 0 if any one of the input signal is 1.
NOR Gate Logic Symbol:
PIN DIAGRAM OF IC 7402
-
7/30/2019 Digital Ic s Manual12
7/33
CIRCUIT DIAGRAM:
TRUTH TABLE (NOR Gate):
S.No
INPUT OUTPUT
A B Y = (A + B)
1. 0 0 1
2. 0 1 0
3. 1 0 0
4. 1 1 0
f. EX-OR gate:
An Ex-OR gate performs the following Boolean function,
A B = ( A . B ) + ( A . B )
It is similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal 0 when the two input signals are equal either 0 or 1.
EX-OR Gate Logic Symbol
PIN DIAGRAM OF IC 7486:
-
7/30/2019 Digital Ic s Manual12
8/33
CIRCUIT DIAGRAM:
TRUTH TABLE (EX-OR Gate):
S.NoINPUT OUTPUT
A B Y = A B
1. 0 0 0
2. 0 1 1
3. 1 0 1
4. 1 1 0
Result:
Thus verify the truth table of basic digital Ics of AND, OR, NOT, NAND, NOR, EX-OR gates.
Ex. No. 2 IMPLEMENTATION OF ADDER & SUBTRACTOR
AIM:
To design and verify the truth tables of Adders and Subtractors.
[Design can be changed by changing the Boolean expression]
APPARATUS REQUIRED:
-
7/30/2019 Digital Ic s Manual12
9/33
S.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required
PROCEDURE:
1. Connections are given as per the circuit diagram
2. For all the ICs 7th pin is grounded and 14th pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the given Boolean expression.
Adders & Subtractor circuits.
THEORY:
ADDITION :The most basic arithmetic operation is the addition of two binary digits. There are four possible
elementary operations, namely,
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 102
The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower significant bit
is called the sum.
HALF ADDER:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.
FULL ADDER:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented with
two half adders and one OR gate.
SUBTRACTOR:
The arithmetic operation, subtraction of two binary digits has four possible elementary operations, namely,
-
7/30/2019 Digital Ic s Manual12
10/33
0 - 0 = 0
0 - 1 = 1 with 1 borrow
1 - 0 = 1
1 - 1 = 0
In all operations, each subtrahend bit is subtracted from the minuend bit. In case of the second operation the
minuend bit is smaller than the subtrahend bit, hence 1 is borrowed.
HALF SUBTRACTOR:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input variables
designate the minuend and the subtrahend bit, whereas the output variables produce the difference and borrow
bits.
FULL SUBTRACTOR:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The three
input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be implemented
with two halfsubtractor and one OR gate.
HALF ADDER:.
TRUTH TABLE (HALF ADDER):
S.NoINPUT OUTPUT
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 0 1
DESIGN:
From the truth table the expression for sum and carry bits of the output can be obtained as,
Sum, S = A B
Carry, C = A. B
CIRCUIT DIAGRAM (HALF ADDER):
-
7/30/2019 Digital Ic s Manual12
11/33
FULL ADDER
TRUTH TABLE (FULL ADDER):
S.NoINPUT OUTPUT
A B C SUM CARRY
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1
DESIGN:
From the truth table the expression for sum and carry bits of the output can be obtained as,
SUM = ABC + ABC + ABC + ABC
CARRY = ABC + ABC + ABC +ABC
Using Karnaugh maps the reduced expression for the output bits can be obtained as,
SUM
-
7/30/2019 Digital Ic s Manual12
12/33
SUM = ABC + ABC + ABC + ABC = A B C
CARRY
CARRY = AB + AC + BC
CIRCUIT DIAGRAM (FULL ADDER):
HALF SUBTRACTOR
TRUTH TABLE (HALF SUBTRACTOR):
S.NoINPUT OUTPUT
A B DIFF BORR
1. 0 0 0 0
2. 0 1 1 1
-
7/30/2019 Digital Ic s Manual12
13/33
3. 1 0 1 0
4. 1 1 0 0
DESIGN:
From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B
Borrow, BORR = A . B
CIRCUIT DIAGRAM (HALF SUBTRACTOR):
FULL SUBTRACTOR
TRUTH TABLE (FULL SUBTRACTOR):
S.NoINPUT OUTPUT
A B C DIFF BORR
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
-
7/30/2019 Digital Ic s Manual12
14/33
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1
DESIGN:
From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF= ABC + ABC + ABC + ABC
Borrow, BORR = ABC + ABC + ABC +ABC
Using Karnaugh maps the reduced expression for the output bits can be obtained as;
DIFFERENCE
DIFF = ABC + ABC + ABC + ABC = A B C
BORROW
BORROW = AB + AC + BC
CIRCUIT DIAGRAM (FULL SUBTRACTOR):
-
7/30/2019 Digital Ic s Manual12
15/33
RESULT:
The design of the boolean function , half Adder, Full Adder, half subtractor and full subtractor circuits
was done and their truth tables were verified.
Questions:
1. What is meant by half and full adder?
2. What is meant by half and full subtractor?
3. What is meant by Karnaugh map?
4. What are the ICs required for constructing adder and subtractor circuit?
5. How many half adders are there in a full adder?
6. What are the outputs produced at the end of full subtraction?
7. What is mean by SOP and POS?
8. List out the various types of k-maps.
9. What is the maximum possible grouping in a four variable k-map?
10. What are the various laws of Boolean algebra?
-
7/30/2019 Digital Ic s Manual12
16/33
Ex.No.3 BINARY TO GRAY and GRAY TO BINARY CODE CONVERTERS
AIM: To design and verify the truth table of a four bit binary to gray and gray to binary code Converters.
APPARATUS REQUIRED:
S.No Name of the Apparatus Range Quantity
-
7/30/2019 Digital Ic s Manual12
17/33
1. EX-OR gate IC 7486 2
2. Connecting wires As required
PROCEDURE:
1. Connections are given as per the circuit diagrams.
2. For all the ICs 7th pin is grounded and 14th pin is given +5 V supply.
3. Apply the inputs and verify the truth table for both binary to gray code and gray code to binary code.
THEORY:
BINARY TO GRAY CONVERSION: TRUTH TABLE:
DESIGN:
From the truth table the expression for the binary to gray code the output can be obtained as,
G3=B3
232BBG =
G1=B1 B2
G0=B1 B0
Using Karnaugh maps the reduced expression for the output bits can be obtained as,
-
7/30/2019 Digital Ic s Manual12
18/33
CIRCUIT DIAGRAM OF BINARY TO GRAY CODE Using EXOR Gates:
GRAY TO BINARY CONVERSION:
-
7/30/2019 Digital Ic s Manual12
19/33
DESIGN:
From the truth table the expression for the binary to gray code the output can be obtained as,
B3=G3
232GGB =
B1=G3 G2 G1
B0=G3 G2 G1 G0
Using Karnaugh maps the reduced expression for the output bits can be obtained as,
-
7/30/2019 Digital Ic s Manual12
20/33
CIRCUIT DIAGRAM FOR GRAY TO BINARY CONVERSION Using EXOR Gates:
Result:
The design of the binary to gray code and gray code to binary coded circuits was done and their truth
tables were verified.
QUESTIONS:
1) What are code converters?
2) What is the necessity of code conversion?
3) What is a gray code?
4) Realize the Boolean expressions for
a) Binary to gray code?
b) Gray to binary code?
-
7/30/2019 Digital Ic s Manual12
21/33
Ex.NO:4 STUDY OF FLIP FLOPS
AIM: To verify the characteristic table of RS, D, JK, and T Flip flops.
APPARATUS REQUIRED:
S.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit - 1
2. NOR gate IC 7402 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. NAND gate IC 7400 1
6. Connecting wires - As required
PROCEDURE:
1. Connections are given as per the circuit diagrams.
2. For all the ICs 7th pin is grounded and 14th pin is given +5 V supply.
3. Apply the inputs and observe the status of all the flip flops.
THEORY:
A Flip Flop is a sequential device that samples its input signals and changes its output states only at times
determined by clocking signal. Flip Flops may vary in the number of inputs they possess and the manner in which
the inputs affect the binary states.
RS FLIP FLOP:
-
7/30/2019 Digital Ic s Manual12
22/33
The clocked RS flip flop consists of NAND gates and the output changes its state with respect to the input on
application of clock pulse. When the clock pulse is high the S and R inputs reach the second level NAND gates in
their complementary form. The Flip Flop is reset when the R input high and S input is low. The Flip Flop is set
when the S input is high and R input is low. When both the inputs are high the output is in an indeterminate
state.
LOGIC SYMBOL:
CIRCUIT DIAGRAM:
CHARACTERISTIC TABLE:
CLOCK
PULSE
INPUT STATUS
S R
+ve CP 0 0 NO CHANGE (0 or 1)
+ve CP 0 1 RESET (0)
+ve CP 1 0 SET (1)
+ve CP 1 1 UNDEFINED
D FLIP FLOP:
-
7/30/2019 Digital Ic s Manual12
23/33
To eliminate the undesirable condition of indeterminate state in the SR Flip flop when both inputs are high at the
same time, in the D Flip flop the inputs are never made equal at the same time. This is obtained by making the
two inputs complement of each other.
D-Flip Flop Logic Symbol:
CIRCUIT DIAGRAM:
CHARACTERISTIC TABLE:
CLOCK
PULSE
INPUT
D
STATUS
+ve CP 0 0
+ve CP 1 1
JK FLIP FLOP:
The indeterminate state in the SR Flip-Flop is defined in the JK Flip Flop. JK inputs behave like S and R inputs
to set and reset the Flip Flop. The output Q is ANDed with K input and the clock pulse, similarly the output Q is
ANDed with J input and the Clock pulse. When the clock pulse is zero both the AND gates are disabled and the Q
and Q output retain their previous values. When the clock pulse is high, the J and K inputs reach the NOR gates.
When both the inputs are high the output toggles continuously. This is called Race around condition and this
must be avoided.
LOGIC SYMBOL:
-
7/30/2019 Digital Ic s Manual12
24/33
PIN DIAGRAM OF IC 7411:
CIRCUIT DIAGRAM:
CHARACTERISTIC TABLE:
CLOCK
PULSE
INPUT STATUS
J K
-
7/30/2019 Digital Ic s Manual12
25/33
+ve CP 0 0 NO CHANGE (0 or 1)
+ve CP 0 1 SET (1)
+ve CP 1 0 RESET (0)
+ve CP 1 1 TOGGLE (0) and (1)
T FLIP FLOP:
This is a modification of JK Flip Flop, obtained by connecting both inputs J and K inputs together. T Flip Flop is
also called Toggle Flip Flop.
LOGIC SYMBOL:
CIRCUIT DIAGRAM:
CHARACTERISTIC TABLE:
CLOCK
PULSE
INPUT
T
PRESENT
STATE (Q)
NEXT
STATE(Q+1)
STATUS
1 0 0 0
2 0 1 0 TOGGLE
3 1 0 1
4 1 1 0
RESULT:
The Characteristic tables of RS, D, JK, T flip flops were verified.
-
7/30/2019 Digital Ic s Manual12
26/33
QUESTIONS:
1. What are the basic logic gates?
2. What is mean by universal logic gates?
3. How many bits a flip flop can store?
4. What is mean by RS flip flop?
5. What is the different between RS and JK flip flop?
6. What will be the output of D-Flip flop if the input is zero?
7. NAND gate is a combination of _____________________
8. What is the use of flip-flops?
9. How many OR gate and NOT gate needed for constructing a NOR gate?
10. What is the different between a truth table and a characteristics table?
11. Why are the gates used in manufacturing ICs?
12. Why the digital circuit always represents 1s and 0s?
-
7/30/2019 Digital Ic s Manual12
27/33
Expt. No. 5 MULTIPLEXER & DEMULTIPLEXER
AIM:
To design and verify the truth table of a 4X1 Multiplexer & 1X4 Demultiplexer.
APPARATUS REQUIRED:
S.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required
THEORY:
Multiplexer is a digital switch which allows digital information from several sources to be routed onto a
single output line. The basic multiplexer has several data input lines and a single output line.
The selection of a particular input line is controlled by a set of selection lines. Normally, there are 2n
input lines and n selector lines whose bit combinations determine which input is selected. Therefore, multiplexer
is many into one and it provides the digital equivalent of an analog selector switch.
A Demultiplexer is a circuit that receives information on a single line and transmits this information on
one of 2n possible output lines. The selection of specific output line is controlled by the values of n selection lines.
4 X 1 MULTIPLEXER
LOGIC SYMBOL:
-
7/30/2019 Digital Ic s Manual12
28/33
TRUTH TABLE (4 X 1 MULTIPLEXER):
S.NoSELECTION INPUT OUTPUT
S1 S2 Y
1. 0 0 I0
2. 0 1 I1
3. 1 0 I2
4. 1 1 I3
PIN DIAGRAM OF IC 7411:
-
7/30/2019 Digital Ic s Manual12
29/33
CIRCUIT DIAGRAM:
7408
7432
7408
7432
7408
7432
-
7/30/2019 Digital Ic s Manual12
30/33
7408
1X4 DEMULTIPLEXER
LOGIC SYMBOL:
TRUTH TABLE (1X4 DEMULTIPLEXER):
S.No
INPUT OUTPUT
S1 S2 Din Y0 Y1 Y2 Y3
1. 0 0 0 0 0 0 0
2. 0 0 1 1 0 0 0
-
7/30/2019 Digital Ic s Manual12
31/33
3. 0 1 0 0 0 0 0
4. 0 1 1 0 1 0 0
5. 1 0 0 0 0 0 0
6. 1 0 1 0 0 1 0
7. 1 1 0 0 0 0 0
8. 1 1 1 0 0 0 1
CIRCUIT DIAGRAM:
-
7/30/2019 Digital Ic s Manual12
32/33
PROCEDURE:
1. Connections are given as per the circuit diagrams.
2. For all the ICs 7th pin is grounded and 14th pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the multiplexer &Demultiplexer.
RESULT:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables were verified.
-
7/30/2019 Digital Ic s Manual12
33/33
QUESTIONS:
1. Why multiplexer is also called as data selector?
2. How many select lines are needed for 4:1 multiplexer?
3. What is mean by de-multiplexer?
4. How many outputs will be produced for 4 inputs in a de-multiplexer?
5. Why de-multiplexer is also called as decoder?
6. What are the applications of mux and demux?
7. What is mean by active high signal and active low signal?
8. What is the different between an encoder and a multiplexer?
9. When the output will be high in a de-multiplexer?
10. What are the various combinations of multiplexer and de-multiplexer?