Professional Documents
Culture Documents
CONTENTS
Sl. Page
Experiment
No. No.
1. Course Objectives & Syllabus 2
2. Introduction 4
3. Front Panel of Digital IC Trainer Kit 6
Simplification and Realization of given Boolean Expression Using Logic
1. 9
Gates / Universal Gates
2. Half / Full Subtractor Half / Full Adder 16
3. Realization of 4-Bit Parallel Adder / Subtractor using IC 7483 22
Realization of 3 bit Binary to Grey code conversion and vice versa using
4. 28
basic/Universal gates.
5. Realization of 4:1 Multiplexer and 1:4 De-multiplexer 32
6. Arithmetic Circuit realization (Half/Full, Adder / Subtractor) using Mux 37
Construction and verification of JK Master-Slave, T type & D type Flip-
7. 46
Flops using logic gates
Construction and realization of 3 bit ripple up/down counter using IC 7476
8. 51
and other logic gates
Design and verification of mod-n, 3bit synchronous counter using 7476 JK,
9. 55
T & D flip flops
Realize the following shift registers usingIC7474/7495(i) SISO (ii) SIPO
10. 59
(iii)) PISO(iv) )PIPO
11. Challenge Experiments 63
12. Frequently Asked Viva Questions 64
13. Digital IC’s PIN Details 66
B20EN0302 L T P C
Digital Electronics Lab
Duration :14 Wks 0 0 2 2
Prerequisites:
Course Objectives:
Course Outcomes:
Syllabus
Digital Electronics Lab - B20EN0302
Introduction
In 1854 George Boole introduced a systematic treatment of logic and developed an algebraic
system now known as Boolean algebra. In 1938, C.E. Shannon introduced a two valued
Boolean algebra called switching algebra, which demonstrated that, the properties of bi-stable
electrical switching circuits could be represented through this algebra. With passage of time
Boolean algebra has emerged as a powerful tool and forms the foundation of many theories
of computer science and engineering.
Boolean algebra like any other mathematical system may be defined with a set of elements, a
set of operators and number of axioms or postulates. A set of element is a collection of
objects having a common property.
A logic gate is an elementary building block of a digital circuit. Most logic gates have two
inputs and one output. At any given moment, every terminal is in one of the two binary
conditions low (0) or high (1), represented by different voltage levels. The logic state of a
terminal can, and generally does, change often, as the circuit processes data. In most logic
gates, the low state is approximately zero volts (0 V), while the high state is approximately
five volts positive (+5 V).
There are three basic logic gates: AND, OR, & NOT, and two Universal logic gates NAND
and NOR other logic gates are emerged from basic gates such as X-OR and X-NOR.
Comparing Boolean algebra with arithmetic and ordinary algebra we note the following
differences:
Boolean algebra does not have additive or multiplicative inverses; hence there are no
subtraction or division operations.
Boolean algebra defines an operator called complement which is not available in
normal algebra.
Normal algebra deals with real number, which constitute an infinite set of elements
where as Boolean algebra deals with a set of only two elements 0 and 1 (defined as
two valued Boolean algebra).
The distributive law of '+' over '.' i.e., x + (y. z) = (x + y). (x + z) is valid for Boolean
algebra but not for normal algebra.
Using combinations of logic gates, complex operations can be performed. In theory, there is
no limit to the number of gates that can be arrayed together in a single device. But in practice,
there is a limit to the number of gates that can be packed into a given physical space. Arrays
of logic gates are found in digital integrated circuits (lC’s).
As IC technology advances, the required physical volume for each individual logic gate
decreases and digital devices of the same or smaller size become capable of performing ever-
more complicated operations at ever-increasing speeds.
They are called universal gates because all of the other gates may be constructed using only
those two gates. That is important because it's a lot cheaper in practice to make lots of similar
things than a bunch of different things (different gates).
All other gates/functions can be implemented by NOR or NAND gates. So they are called
universal gates. In fact, in chips, entire logic maybe built using only NAND or NOR gates.
Implementing with NAND is easier when considering power and area of the chip. They are
called universal gates as they can be used to design all other logic circuit. Elements like X-
OR, NOR etc. Also these gates can be realized through easy combination of diodes thus
making them easy to use base elements in any chip designing project.
NAND, NOR gates are called universal gates because they can be used to create all the
remaining logical gates. Like sending the same input to the inputs of the NAND or NOR will
make it a NOT gate. Because from them you can create any other one! You can make any
other gate using NAND and NOR. Any other gate i.e. AND, OR, XOR etc can be created
using these basic gates i.e. it needs only NAND and NOR gates to create logical circuits.
Note: Use Patch chords smoothly & test Patch Chord Continuity for every circuit before
connecting.
To Test, connect Patch chord end A to Input Zero (GND) & B to output LED Indicator. If
LED Glows Green (0) then the patch chord is good or else Replace the patch chord.
Experiment – 1
Simplification and Realization of given Boolean Expression Using Logic
Gates / Universal Gates
Aim: simplification and realization of given Boolean expression using Basic/Universal gates.
Components &Equipment’s required: 74LS-08, 32, 00 & 02, Digital IC Trainer Kit, 4mm.
Patch cards etc.
Truth Table
Input Output
A B
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0
Truth Table
Input Output
A B
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0
Truth Table
Input Output
A B Y
0 0 1
ii) Using NOR gates only: 0 1 0
1 0 0
1 1 1
Truth Table
Input Output
A B Y
ii) Using NOR gates only: 0 0 0
0 1 1
1 0 1
1 1 0
Truth Table
A B C D
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 0
g) Simplification and Realization of given Boolean Expression in SOP form using Logic
Gates/Universal Gates
Truth Table
A B C D Y
i) Using basic gates: 0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
ii) Using NAND gates: 0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
ii) Using NOR gates:
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
Note: Students has to Simplify, Realize any given Boolean expression in the examination.
Ex1: f(A,B,C,D) = m (0,2,5,7,8,10,13,15)
Experiment – 2
Half/Full Adder
Half/Full Subtractor
Aim:
a. Realization & verify the truth table of Half & Full Adder using Basic Gates/ Universal
Gates
b. Realization & verify the truth table of Half & Full Subtractor using Basic
Gates/Universal Gates
Half Adder:
A combinational circuit that performs the addition of two bits is called a half-adder. From the
verbal explanation of half-adder, we find that this circuit needs two binary inputs and two
binary outputs. The input variables designate the augend and addend bits, the o/p variables
are sum and carry. It is necessary to specify two output variables because the result may
consists’ of two binary digits. Here A, B are inputs, Sum & Carry are outputs.
Note how the same two inputs are directed to two different gates. The inputs to the XOR gate
are also the inputs to the AND gate.
Full Adder:
A combinational circuit that performs the addition of three bits (two significant bits and a
previous carry) is called a full-adder. It consists of three inputs and two outputs. Two of the
input variables are denoted by A and B, represent the two significant bits to be added. The
third input Cin represents the carry from the previous lower significant position. Two outputs
are necessary because the arithmetic sum of three binary digits ranges in the value from 0 to 3
and binary 2 or 3 needs two digits. Here the outputs are Sum and Cout.
The full-adder circuit adds three one-bit binary numbers (Cin, A, B) and outputs two one-bit
binary numbers, a sum (S) and a carry (Cout). The full-adder is usually a component in a
cascade of adders, which add 8, 16, 32, etc. binary numbers.
A full adder is made by combining two half-adders and an additional OR-gate. A full adder
has the carry in capability (denoted as Cin in the diagram) and so allows cascading which
results in the possibility of multi-bit addition. If you look closely, you'll see the full adder is
simply two half adders joined by an OR.
Components &equipments required: 74LS-00, 02, 04, 08, 32, 86. Digital IC Trainer Kit,
4mm. Patch cards etc.
Circuit Diagram:
Realization of Half Adder using XOR & AND Gate:
Truth Table
Input Output
A B S C
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Half Subtractor:
Cleary this circuit is performing binary subtraction of B from A (A -B, recalling that in
binary 0-1 = 1 borrow 1). Such a circuit is called a half-subtractor, the reason for this is that it
enables a borrow out of the current arithmetic operation but no borrow in from a previous
arithmetic operation. The circuit has two outputs labeled Difference and Borrow
Full Subtractor:
As in the case of the addition using logic gates, a full subtractor is made by combining two
half-subtractors and an additional OR-gate. A full subtractor has the borrow in capability
(denoted as Boin in the diagram below) and so allows cascading which results in the
possibility of multi-bit subtraction.
Full subtractor is a combinational circuit that performs a subtraction of two bits, taking into
account that a 1 may have been borrowed by a lower significant stage. The circuit has 3
inputs and 2 outputs. The three inputs A, B &Boin represents the minuend, subtrahend and
previous burrow respectively. Outputs Bout and Difference represents the Borrow and the
Difference output respectively.
Circuit Diagram:
Realization of Half Subtractor using XOR, NOT & AND Gate:
Truth Table
Input Output
A B D B
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
Experiment – 3
Realization of 4-Bit Parallel Adder / Subtractor
Aim: Realization of Parallel Adder/ Subtractor using IC 7483.
Parallel adder:
The 7483 IC is a 4-bit parallel adder chip. Note: the chip can also be listed as a 74LS83. The
LS signifies that the chip is a newer, lower-power, faster version. A binary parallel adder is a
digital function that produces the arithmetic sum of two binary numbers in parallel. It consists
of full adders connected in cascades with the output carry from one full adder connected to
input carry of the next full adder.
Components &equipments required: 7483, 7486 & 7404, Digital IC Trainer Kit, 4mm. Patch
cards etc.
PIN Diagram:
Circuit Diagram:
Note: A1, A2, A3, A4 & B1, B2, B3, B4 &Cin are the Inputs.
S1, S2, S3, S4 and Cout are the Outputs.
Here A1, B1 & S1 are the LSB Bits.
S is considered as selection Input to select for Addition or Subtraction.
For Addition S=0 & For Subtraction S=1.
Problems:
A := 1111 1111 1100 1100 0111
B := 0000 0000 0011 0011 1110
Cin : = 0 1 0 1 1
Sum =
(Do it yourself)
II Step:
Adding 1’s complement of Subtrahend to the minuend
A4 ,A3, A2, A1 = 1 0 0 1 Given Larger Number
B4, B3, B2, B1 = + 1 1 0 0
= 1 0101
Example 1: Subtract
A4 ,A3, A2, A1 = 1 0 0 1
B4, B3, B2, B1 = 0 0 1 1 Give this from Trainer Kit
II Step:
A4 ,A3, A2, A1 = 1 0 0 1 Given Larger Number
B4, B3, B2, B1 = + 1 1 0 1
1 0110
Carry generated
III Step:
Neglect the carry to get true Answer
Therefore Answer = 0 1 1 0 - Trainer Kit
II Step:
Adding 1’s complement of Subtrahend to the minuend
A4 ,A3, A2, A1 = 0 0 1 1 Given Larger Number
B4, B3, B2, B1 = +0 1 1 0
= 1 0 0 1 Trainer Kit Final Output
Example 1: Subtract
A4 ,A3, A2, A1 = 0 0 1 1 3
B4, B3, B2, B1 = 1 0 0 1 9 Give this from Trainer Kit
II Step:
A4, A3, A2, A1 = 0 0 1 1 Given Larger Number
B4, B3, B2, B1 = + 0 1 1 1
1 0 1 0 Trainr Kit Final Output
III Step: Here theoretically perform 2’s Compliment operation to get True Answer.
1 0 1 0 (Trainer Kit Output)
2’s Compliment
0 1 1 0 True Answer
Problems:
A := 0110 1100 0100 0111 1111
B := 0100 0111 0110 1100 1111
Diff =
(Do it yourself)
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
5. Given problems should be worked out & get the outputs.
Experiment – 4
3 Bit Binary to Gray Code Conversion & Vice Versa
Aim: Realization of 3bit Binary to Gray Code conversion and Vice-Versa using Basic /
Universal gates.
Binary Codes:
The usual way of expressing a decimal number in terms of a binary number is known as pure
binary coding. A number of other techniques can be used to represent a decimal number.
Gray Code:
Gray coding is an important code and is used for its speed, it is also relatively free from
errors. In pure binary coding or 8421 BCD then counting from 7 (0 1 1 1) to 8 (1000) requires
4 bits to be changed simultaneously. If this does not happen then various numbers could be
momentarily generated during the transition so creating spurious numbers which could be
read.
Gray coding avoids this since only one bit changes between subsequent numbers. To
construct the code there are two simple rules. First start with all 0s and then proceed by
changing the least significant bit (LSB) which will bring about a new state.
Components &equipments required: IC 7486, Digital IC Trainer Kit, 4mm. Patch cards etc.
INPUT OUTPUT
BCD
BINARY CODE GRAY CODE
Number
B2 B1 B0 G2 G1 G0
0 0 0 0 0 0 0
1 0 0 1 0 0 1
2 0 1 0 0 1 1
3 0 1 1 0 1 0
4 1 0 0 1 1 0
5 1 0 1 1 1 1
6 1 1 0 1 0 1
7 1 1 1 1 0 0
K - Maps:
G2 G1 G0 B2 B1 B0
0 0 0 0 0 0
0 0 1 0 0 1
0 1 1 0 1 0
0 1 0 0 1 1
1 1 0 1 0 0
1 1 1 1 0 1
1 0 1 1 1 0
1 0 0 1 1 1
K - Maps:
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
Experiment – 5
4:1 Multiplexer / 1:4 De-multiplexer
Using Basic/universal gates
Multiplexer:
Multiplexer has many data input lines and one output line.
Multiplexer (MUX) places the data of one of its input lines on the output line.
MUX has a set of “n” address lines to select one of 2n input line
SOP realization is possible using MUX.
In other words, the multiplexer works like the input selector. Only one input is selected at a
time, and the selected input is transmitted to the single output.
Demultiplexer:
A demultiplexer (DEMUX) is a device which essentially performs the opposite operation to
the MUX. That is, it functions as an electronic switch (or data distributor) to route an
incoming data signal to one of several outputs.
The demultiplexer is the inverse of the multiplexer, in that it takes a single data input and n
address inputs. It has 2n outputs. Output is inverted in IC 74139 1:4 Demultiplixer.
Components &equipments required: IC 74153, 74139, 7404, 7408, 7432, 7400 & 7420.
Digital IC Trainer Kit, 4mm. Patch cards etc.
Connection Diagram MUX:
Truth Table:
Address
Enable
Select Data Inputs Output
Inputs Comments
Inputs
S1 S0 I0 I1 I2 I3 Y
0 0
0 0 0 X X X I0 Selected
1 1
0 0
0 0 1 X X X I1 Selected
1 1
0 0
0 1 0 X X X I2 Selected
1 1
0 0
0 1 1 X X X I3 Selected
1 1
1 X X X X X X X MUX Disabled
Circuit Diagram:
Circuit Diagram:
Truth Table:
Address
Data Input Select Data Outputs
Inputs Comments
S1 S0 Y0 Y1 Y2 Y3
(Da) (Db)
0 0 0 0 0 1 1 1 Y0 Selected
0 1 1 0 1 1 Y1 Selected
1 0 1 1 0 1 Y2 Selected
1 1 1 1 1 0 Y3 Selected
Circuit Diagram:
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
5. X in the truth table indicates Don’t care condition since depending on the selection
line the data line will be selected.
Experiment – 6
Arithmetic Circuit realization
(Half/Full, Adder/Subtractor) using Mux.
Circuit Diagram:
OR
Truth Table:
Input Output
A B S C
S1 S0 Ia Ib
0 0 0 0 0
1 0 1 1 0
2 1 0 1 0
3 1 1 0 1
Circuit Diagram:
Circuit Diagram:
OR
Circuit Diagram:
Circuit Diagram:
OR
Truth Table:
Input Output
A B D B
S1 S0 Ia Ib
0 0 0 0 0
1 0 1 1 1
2 1 0 1 0
3 1 1 0 0
Circuit Diagram:
Circuit Diagram:
OR
Truth Table: Implementation Table:
Input Output
A B Bin D Bout
0 0 0 0 0 0
Bin Bin
1 0 0 1
1 1
2 0 1 0 1 1
Logic
3 0 1 1 0 1
1
4 1 0 0 1 0
Logic
5 1 0 1 0 0
0
6 1 1 0 0 0
Bin Bin
7 1 1 1
1 1
Circuit Diagram:
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. The Logic levels are applied at the Input for all combinations indicated in Truth Table
& the Output is observed on LED’s.
Experiment – 7
Master- Slave JK Flip-Flop
Aim: Construction and verification of JK Master-Slave, T type & D type Flip-Flops using
logic gates.
JK Flip-Flop: One way of overcoming the problem with oscillation that occurs with a JK
Flip-Flop when J= K = 1 is to use a so-called master-slave flip- flop which is illustrated in the
circuit diagram.
The master-slave flip-flop is essentially two back-to-back JKFFs, note however, that
feedback from this device is fed back both to the master FF and the slave FF.
Any input to the master-slave flip-flop at J and K is first seen by the master FF part of the
circuit while CLK is High (= 1). This behaviour effectively "locks" the input into the master
FF. An important feature here is that the complement of the CLK pulse is fed to the slave FF.
Therefore the outputs from the master FF are only "seen" by the slave FF when CLK is Low
(=0). Therefore on the High-to-Low CLK transition the outputs of the master are fed through
the slave FF. This means that at most one change of state can occur when J=K = 1 and so
oscillation between the states Q=O and Q= 1 during the same CLK pulse does not occur.
Components &equipments required: IC 7400, & 7410. Digital IC Trainer Kit, 4mm. Patch
cards etc.
Circuit Diagram:
Truth Table:
Inputs Outputs
CL Comments
J K Qn n
K
0 0 X X X 1 1 Indeterminate State
0 1 X X X 1 0 FF Preset(Set)
1 0 X X X 0 1 FF Cleared(Reset)
1 1 0 1 0 1 Reset
1 1 1 0 1 0 Set
Circuit Diagram:
Truth Table:
Inputs Outputs
Comments
T CLK Qn n
0 0 X X 1 1 Indeterminate State
0 1 X X 1 0 FF Preset(Set)
1 0 X X 0 1 FF Cleared(Reset)
1 1 0 X Q n-1 n-1 Previous
1 1 1 n-1 Q n-1 Toggle
Circuit Diagram:
Truth Table:
Inputs Outputs
Comments
D CLK Qn n
0 0 X X 1 1 Indeterminate State
0 1 X X 1 0 FF Preset(Set)
1 0 X X 0 1 FF Cleared(Reset)
1 1 0 0 1 Data transferred
1 1 1 1 0 Data transferred
Circuit Diagram:
Procedure:
1. The connections are made as shown in Circuit(by referring IC PIN diagram)
2. The input terminals (JK, T & D) are connected to the toggle switches & the output is
connected to the Output Connector (LED’s).
3. The power is applied between the VCC & Ground terminals.
4. Connect clock pin to the bounce less pulsar HIGH or LOW
5. The Logic levels are applied at the Inputs as indicated in Truth Table & the Output is
observed on LED’s.
6. X in the truth table indicates Don’t Care condition.
Experiment -8
3 Bit ripple up/down Counters
Aim: Construction and realization of 3 bit ripple up/down counter using IC 7476 and other
logic gates.
Counters: The synchronous design of any sequential circuit application for example counter
is a design in which all the flip-flops are connected to a common clock input that is, all the
flip-flops are clocked simultaneously. Therefore to get the next state of application actual
inputs of the flip-flop should be designed according to the requirement.
Hence excitation tables are used to design the actual inputs of the flip-flops to get the next
stage. The excitation table gives the combination of input for the required output condition
before and after the application of clock.
Components &equipments required: IC 7476, 7400, 7404, 7408 & 7410. Digital IC Trainer
Kit, 4mm. Patch cards etc.
Circuit Diagram:
Note:
J & K inputs of Flip-Flops are connected to logic 1 or Keep it open to operate under
toggle mode.
When Preset = 1, Clear = 0; Counter is cleared Q0 = Q1 = Q2 = 0
When Preset = 0, Clear = 1; Counter is preset Q0 = Q1 = Q2 = 1
Keep Preset = 1, Clear = 1 for count mode.
Truth Table:
No. of Flip-Flop
Clock Outputs
Pulses Q2 Q1 Q0
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
8 0 0 0
Circuit Diagram:
Truth Table:
No. of Flip-Flop
Clock Outputs
Pulses Q2 Q1 Q0
0 1 1 1
1 1 1 0
2 1 0 1
3 1 0 0
4 0 1 1
5 0 1 0
6 0 0 1
7 0 0 0
8 1 1 1
Circuit Diagram:
Truth Table:
No. of Flip-Flop
Clock Outputs
Pulses Q2 Q1 Q0
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 0 0 0
Circuit Diagram:
Note:
When Mode control is at logic 1 counter works as an Up-counter.
When Mode control is at logic 0 counter works as a Down-counter.
Design and verification of mod-n, 3bit synchronous counter using 7476 JK, T & D flip flops.
Experiment –9
Design of JK flip-flop 3 Bit Synchronous Counters
Components &equipments required: IC 7476, 7400, 7404, & 7408. Digital IC Trainer Kit,
4mm. Patch cards etc.
Excitation Tables:
Q (n) Q (n+1) J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
PS NS Flip-Flop Inputs
Q2 Q1 Q0 Q2 Q1 Q0 J2 K2 J1 K1 J0 K0
0 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
2 0 1 0 0 1 1 0 X X 0 1 X
3 0 1 1 1 0 0 1 X X 1 X 1
4 1 0 0 1 0 1 X 0 0 X 1 X
5 1 0 1 1 1 0 X 0 1 X X 1
6 1 1 0 1 1 1 X 0 X 0 1 X
7 1 1 1 0 0 0 X 1 X 1 X 1
Circuit Diagram:
Truth Table:
No. of Flip-Flop
Clock Outputs
Pulses Q2 Q1 Q0
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
8 0 0 0
K-Maps:
Circuit Diagram:
Note:
Carryout the design similarly
Assignment:
Design of T flip-flop 3 Bit Synchronous Counters
Design of D flip-flop 3 Bit Synchronous Counters
Procedure:
The connections are made as shown in Circuit(by referring IC PIN diagram)
The input terminals are connected to the toggle switches & the output is connected to
the Output Connector (LED’s).
The power is applied between the VCC & Ground terminals.
Connect clock pin to the bounce less pulsar LOW.
The clock input is applied as indicated in Truth Table & the Output is observed on
LED’s.
X in the truth table indicates irrelevant care condition.
Assignment:
Design and verification of random sequence counter, 3bit synchronous counter using
7476 JK, T & D flip flops.
Experiment – 10
SHIFT REGISTERS
Aim: Realization of shift register and Sequence Generator.
Shift Right Operation (SIPO, SISO, PIPO, PISO).
Shift Left Operation.
Shift Registers: The 7495 is a 4-Bit Shift Register with serial and parallel synchronous
operating modes. It has a Serial (DS) and four Parallel (D0-D3) Data inputs and four Parallel
Data outputs (Q0 –Q3). The serial or parallel mode of operation is controlled by a Mode
Control input and two Clock Inputs (CLK1) and (CLK2). The serial (right-shift) or parallel
data transfers occur synchronous with the HIGH to LOW transition of the selected clock
input.
When the Mode Control input is HIGH, CLK2 is enabled. A HIGH to LOW transition on
enabled CLK2 transfers parallel data from D0-D3 the inputs to the Q0 –Q3 outputs. When the
Mode Control input is LOW, CLK1 is enabled. A HIGH to LOW transition on enabled CLK1
transfers the data from Serial input (DS) shifts the data to Q3 to Q2 to Q1 to Q0 output
respectively (right-shift). A left -shift is accomplished by externally connecting Qo to D1, Q1
to D2, and Q2 to D3, and operating the 7495 in the parallel mode (Mode Control input =
HIGH).
Components &equipments required: IC 7495, Digital IC Trainer Kit, 4mm. Patch cards
etc.
Circuit Diagram:
Note:
Ds: Serial input data (to be right shifted)
Truth Table:
SIPO & SISO
Truth Table:
Truth Table:
Challenge experiments:
1. Design a digital circuit to turn on and turn off the bulb with respect to ambient light
availability.
2. Design a digital circuit to generate 10 clock pulses upon receiving the control signal.
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN
Sec / Batch : …………….. Date :………………….. Sec / Batch : …………….. Date :…………………..
Name USN Name USN