3048
3048
Index
10. Understanding professional ethical legal security and social issues and
responsibilities further to function effectively in a multi disciplinary
environment.
SAFETY PROCEDURES
Problem Statement:
Do not do any action that may harm people or equipments in the lab.
At the end and beginning of laboratory, follow 5S procedures and leave the
work table clean and tidy.
8 Department of ECE, GPTC Perumbavoor
Electrical Safety:
Consult Electrical Engineering section available in the campus for electrical
safety queries.
The lab equipment is powered from electrical sockets installed on the tables.
Do not use equipment that is powered from a damaged socket.
Do not use equipment that is powered from flexible cable with damaged
insulation or if it’s plug is not assembled properly.
Do not open the main fuse box, unless it is an emergency and you need to
switch off main circuit breaker.
Emergency Switches:
The laboratory has circuit breakers, which is located in the main panel. Identify
the place.
In an emergency condition, switch off circuit breakers immediately.
Result
Familiarization of safety precautions performed.
Problem Statement:
1. Make sure you have a reliable ground point available near the table.
2. Do not wear clothing which generates static electric charges every time
you move.
3. Do not handle static generating objects while working on electronics.
4. Store all chips and other components in appropriate anti-static
containers.
5. Keep all ESD sensitive components and spares in anti-static envelopes
for storage.
6. Be sure to turn off the power and remove the power plug from all
equipment before working repairing or assembling.
Result
Familiarization of ESD protection procedures performed.
Problem Statement:
These electronic nippers are for cutting wires and component leads. They
have a cushioned handle which makes them much more comfortable to use.
Needle-nose pliers are both cutting and holding pliers used to bend, re-
position and snip wire. Because of their long shape they are useful for reaching
into small areas where cables or other materials have become stuck or
unreachable with fingers or other means.
11 Department of ECE, GPTC Perumbavoor
Wire stripper
Result
Study of handling components and their fixing performed.
OBJECTIVES:
Students will be familiar with the basic logic gate ICs commonly used in
digital electronics.
They will get an idea about both TTL and CMOS logic family.
They will understand the concept of Truth table verification.
They will understand the universal property of NAND and NOR gates.
PRINCIPLE:
Circuit that takes the logical decision and the process are called logic
gates. Each gate has one or more input and only one output. OR, AND and NOT
are basic gates. NAND, NOR are known as universal gates.
AND GATE:
NOT GATE:
The NOT gate is called an inverter. The output is high when the input
is low. The output is low when the input is high. Output Y= NOT(A) where A is
the input.
NAND GATE:
NOR GATE:
The NOR gate is a combination of OR-NOT. The output is high when both
inputs are low. The output is low when one or both inputs are high.
X-OR GATE:
The output is high when any one of the inputs is high. The output is low
when both the inputs are low and both the inputs are high.
AND GATE
15 Department of ECE, GPTC Perumbavoor
OR GATE:
NOT GATE:
SYMBOL: PIN DIAGRAM:
16 Department of ECE, GPTC Perumbavoor
X-OR GATE :
SYMBOL : PIN DIAGRAM :
NOR GATE:
PROCEDURE:
1. Check the all the required components.
2. Connect the circuit as per the circuit diagram.
3. Apply Vcc and Ground.
4. Logical inputs are given as per truth table using switches provided.
5. Observe the output on LEDs and verify the truth table.
RESULT:
i. Familiarized with basic TTL and CMOS logic gate ICs and verified their
truth tables.
ii. Constructed basic logic gates and X-OR using Universal gates.
INFERENCE:
1. By using NAND and NOR gates we can construct any logic circuits.
2. ……………………
21 Department of ECE, GPTC Perumbavoor
OBJECTIVES:
Students will study how to interconnect different gates in a circuit.
They can differentiate Half adder from Full adder.
PRINCIPLE:
HALF ADDER:
A half adder has two inputs for the two bits to be added and two
outputs one from the sum S and other from the carry C. The Sum is obtained
from the X-OR Gate and the Carry out from the AND gate.
FULL ADDER:
22 Department of ECE, GPTC Perumbavoor
Design
HALF ADDER
TRUTH TABLE:
A B CARRY SUM
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0
From above truth table, the expressions for carry and sum can be derived using
the sum product terms.
= A ⊕B
Carry= AB
LOGIC DIAGRAM:
Sum
Carry = A.B
FULL ADDER
TRUTH TABLE:
A B C CARRY SUM
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
DESIGN:
= (A ⊕B) ⊕ C
24 Department of ECE, GPTC Perumbavoor
PROCEDURE:
Inference :
1. A Full adder can handle additional carry input compared to a Half adder.
2. Students get a basic idea about the addition circuits used in calculators
and ALU.
26 Department of ECE, GPTC Perumbavoor
AIM:
To construct half subtractor and full subtractor circuits and verify the
truth table using logic gates.
OBJECTIVES:
Students will study how to interconnect different gates in a circuit.
They can differentiate Half subtractor from Full subtractor.
THEORY:
HALF SUBTRACTOR:
The half subtractor is constructed using X-OR, NOT and AND gate. The
half subtractor has two input and two outputs. The outputs are difference and
borrow. The difference can be applied using X-OR Gate, borrow output can be
implemented using an AND Gate and an inverter.
27 Department of ECE, GPTC Perumbavoor
FULL SUBTRACTOR:
The full subtractor is a combination of X-OR, AND, OR, NOT Gates. In a
full subtractor the logic circuit should have three inputs and two outputs. A full
subtractor has three inputs while half subtractor has only two. This additional
carry input facility makes them to subtract any two numbers. Two half
subtractors can be connected together to give a full subtractor.
A B BORROW DIFFERENCE
0 0 0 0
0 1 1 1
1 0 0 1
1 1 0 0
DIFFERENCE = = A ⊕B
BORROW =
FULL SUBTRACTOR
TRUTH TABLE:
A B C BORROW DIFFERENCE
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 1 0
1 0 0 0 1
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
DESIGN:
From the truth table, taking the sum of product terms, we get
Borrow =
=
29 Department of ECE, GPTC Perumbavoor
DESIGN:
Design for implementing Half subtractor aand Full subtractor using NAND gates
should also be done by students.
LOGIC DIAGRAM
(a)Half subtractor using NAND only.
PROCEDURE:
1. Check the required components
2. Connections are given as per circuit diagram.
3. Logical inputs are given as per truth table.
4. Observe the output and verify the truth table.
RESULT:
Designed and constructed half subtractor and full subtractor circuits and
verified their truth tables.
Inference :
1. A full subtractor is always required to handle three inputs.
2.----------------------------------------------------------------
31 Department of ECE, GPTC Perumbavoor
AIM:
To construct and verify the truth tables of
(i) Binary to gray code converter
(ii) Gray to binary code converter
OBJECTIVE:
Students will study how to construct a Binary to Gray and Gray to binary
code converters.
THEORY:
The availability of large variety of codes for the same discrete elements
of information results in the use of different codes by different systems. A
conversion circuit must be inserted between the two systems if each uses
different codes for same information. Thus, code converter is a circuit that
makes the two systems compatible even though each uses different binary
code.
Here we take 4 bits for Gray to binary and vice versa conversions. Thus
there are four inputs and four outputs. Gray code is a non-weighted code and
its hamming distance is always 1.
The input variables for a Binary to Gray converter are designated as B3,
B2, B1, and B0 and the output variables are designated as G3, G2, G1,and G0.
From the truth table, combinational circuit is designed through K-Map.
32 Department of ECE, GPTC Perumbavoor
Meanwhile the inputs for a Gray to Binary converter is G3, G2, G1,and
G0 and its output generates B3, B2, B1, and B0.
DESIGN
BINARY TO GRAY CODE CONVERTOR
TRUTH TABLE:
Binary inputs Gray outputs
B3 B2 B1 B0 G3 G2 G1 G0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
33 Department of ECE, GPTC Perumbavoor
G3 = B 3
K-Map for G2:
LOGIC DIAGRAM:-
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 1 0 0 1 0
0 0 1 0 0 0 1 1
0 1 1 0 0 1 0 0
0 1 1 1 0 1 0 1
0 1 0 1 0 1 1 0
0 1 0 0 0 1 1 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 1
1 1 1 1 1 0 1 0
1 1 1 0 1 0 1 1
1 0 1 0 1 1 0 0
1 0 1 1 1 1 0 1
1 0 0 1 1 1 1 0
1 0 0 0 1 1 1 1
35 Department of ECE, GPTC Perumbavoor
B3 = G3
K-Map for B2:
Gray To Binary
38 Department of ECE, GPTC Perumbavoor
PROCEDURE:
1. The circuit connections are made as shown in fig.
2. Pin (14) is connected to +Vcc and Pin (7) to ground.
3. In the case of binary to gray conversion, the inputs B0, B1, B2 and
B3 are given at respective pins and outputs G0, G1, G2, G3 are
taken for all the 16 combinations of the input.
4. In the case of gray to binary conversion, the inputs G0, G1, G2 and
G3 are given at respective pins and outputs B0, B1, B2, and B3 are
taken for all the 16 combinations of inputs.
5. The values of the outputs are tabulated.
RESULT:
Designed and implemented
a. Binary to gray code converter
b. Gray to binary code converter
Inference :
1.By using a single IC we can do both Gray to Binary and Binary to Gray
converter.
2. Students get an idea to construct circuit for any code converter.
3.________________________________________
39 Department of ECE, GPTC Perumbavoor
THEORY:
The term combinational comes from mathematics. In mathematics a
combination is an unordered set. The combinational circuit produces the same
output regardless of the order the inputs are changed. A combinational circuit
is one where the output at any time depends only on the present combination
of inputs at that point of time. The logic gate is the most basic building block of
combinational logic. The logical function performed by a combinational circuit
is fully defined by a set of Boolean expressions. The other category of logic
circuits, called sequential logic circuits, comprises both logic gates and memory
elements such as flip-flops. Owing to the presence of memory elements, the
40 Department of ECE, GPTC Perumbavoor
output in a sequential circuit depends upon not only the present but also the
past state of inputs.
For converting Boolean expressions to logic diagrams the order of precedence
of operations is given below:
1. First, perform all inversions of single terms in the given expression.
2. Perform all operations with parentheses.
3. Perform an AND operation before an OR operation unless parentheses
indicate otherwise.
4. If an expression has a bar over it, perform the operations inside the
expression first and then invert the result.
PROCEDURE:
1. Prepare the truth table and draw the logic circuit diagram.
2. Check the required components.
3. Make connections as shown in the circuit diagram.
4. Switch ON the trainer kit and provide the input data via the input switches.
5. Observe the output on output LEDs and verify it with truth table.
CIRCUIT DIAGRAM:
Note: Students are advised to construct circuit for different equations .
Example1. Implements the Boolean equation
Inputs _ _
X Y Z YZ X+YZ
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 0 0
1 0 0 0 1
1 0 1 1 1
1 1 0 0 1
1 1 1 0 1
41 Department of ECE, GPTC Perumbavoor
Q1.Draw the circuit diagram that implements the equation below using gates
having no more than three inputs.
x ABC ( A D )
Q2.
.
.
.
RESULT:
Implemented the combinational logic circuits, from the given Boolean
expressions.
INFERENCE:
1. Students get basic idea about drawing circuit of any Boolean equation.
2.-------------------------------------------------------
42 Department of ECE, GPTC Perumbavoor
OBJECTIVES:
To design and set up the following circuit using IC 7483.
A 4-bit binary parallel adder.
A 4-bit binary parallel subtractor.
.COMPONENTS AND EQUIPMENTS:
SL COMPONENT SPECIFICATION QTY
No.
1. 4 BIT ADDER IC IC 7483 1
2. NOT GATE IC 7404 1
3. X-OR GATE IC 7486 1
4. IC TRAINER KIT - 1
5. CONNECTING WIRES AS REQUIRED
THEORY:
A binary adder/subtractor is a digital circuit that produces the arithmetic sum
or difference of two binary numbers. A binary adder can be constructed with
full adders connected in cascade with the output carry from each adder
connected to the next full adder in the chain. Subtraction of two numbers (A-B)
can be performed by taking 2’s complement of B and adding it with A. Thus
binary adder can be used to perform subtraction of two binary numbers if few
changes are made. In case of binary adder, input carry is set to be 0 and all the
input bits are given as it is. Whereas for binary subtractor, in order to give 2’s
complement of B, consider input carry equal to 1 and the bits of B is
complemented ie 1’scomplement of B is taken and it is added with 1 to give its
2’s complement value. The block diagram of 4-bit binary adder/subtractor is as
shown in figure. The circuit performs addition when M = 0 & subtraction when
M = 1.
IC 7483 is an integrated circuit which performs addition of two 4-bit binary
numbers.
4 BIT BINARY SUBTRACTOR:
43 Department of ECE, GPTC Perumbavoor
PROCEDURE:
1. Test all the ICs manually/ using IC tester.
2. Connections are made as in the logic circuit diagram and give Vcc and the
ground.
3. Connect the appropriate pins to the input switches and output LEDs.
4. Give various combinations of the inputs and observe the output in adder
circuit.
5. Similarly verify the subtractor circuit with truth table.
6. Then setup the adder/subtractor circuit. Make M=0,and verify whether it
works as a nibble adder.
7. Give M=1 to function as a subtractor and verify the output of
adder/subtractor circuit by giving various combinations of inputs
CIRCUIT DIAGRAM:
FUNCTION TABLE
0 1 0 0 0 1 0 0 0 1 0 0 0 0
0 0 0 1 0 1 0 0 0 0 1 0 1 0
0 0 0 0 1 0 1 1 1 0 1 0 0 0
0 0 1 1 1 1 0 0 0 ? ? ? ? ?
0 1 1 0 0 0 1 1 1
0 1 1 1 1 1 1 1 1
1 1 1 0 0 0 0 1 1 1 1 0 0 1
1 1 0 1 0 0 1 0 1 1 0 1 0 1
1 1 0 0 0 0 1 0 1 ? ? ? ? ?
1 1 1 1 1 1 0 1 1
1 1 1 1 0 1 0 0 0
1 1 1 0 0 1 0 1 1
Note:
Subtraction performed in the above circuits is 2’s complement method. Hence
carry output is discarded.
When A < B ,and M=1,result will be in the 2’s complement form(ie. result is
negative).
RESULT:
Studied 4 bit binary adder/subtractor circuit using IC 7483.
INFERENCE:
1. Students get an idea about adder IC s and its working.
2. IC7483 can be used for addition of BCD numbers, Octal numbers.
46 Department of ECE, GPTC Perumbavoor
PRINCIPLE:
Multiplexers are very useful components in digital systems. They
transfer a large number of information units over a smaller number of
channels or lines, (usually one line) under the control of selection signals.
Multiplexer means many to one. A multiplexer is a circuit with many inputs but
only one output. By using control signals (select lines) we can select any input
to the output. Multiplexer is also called as data selector because the output bit
depends on the input data bit that is selected. The general multiplexer circuit
has 2n input signals, n control/select signals and 1 output signal.
De-multiplexers perform the opposite function of multiplexers. They
transfer a small number of information units over a larger number of channels
under the control of selection signals. The general de-multiplexer circuit has 1
input signal, n control/select signals and 2n output signals. De-multiplexer
circuit can also be realized using a decoder circuit with additional
47 Department of ECE, GPTC Perumbavoor
select/control inputs for the selection of output line into which the data is to
be transmitted
PROCEDURE:
1. Test all the ICs manually/ using IC tester.
2. Connections are made as in the logic circuit diagram and give Vcc and the
ground.
3. Connect the appropriate pins to the input switches and output LEDs.
4. Give various combinations of the inputs and observe the output and verify
the truth table.
5. Similarly verify the demux circuit with truth table.
CIRCUIT DIAGRAM:
BLOCK DIAGRAM FOR 4:1 MULTIPLEXER:
SOP of output
4:1 MUX USING NAND GATES
To implement using NAND gates, apply double inversion rule.
48 Department of ECE, GPTC Perumbavoor
Then ,
CIRCUIT DIAGRAMS: 4:1 MULTIPLEXER USING BASIC GATES:
DESIGN
1:4 DEMUX FUNCTION TABLE
RESULT:
Realized 4:1 Multiplexer and 1:4 Demultiplexer using basic gates and NAND
gates and verified the truth table.
51 Department of ECE, GPTC Perumbavoor
INFERENCE:
1. Many input data lines can be switched to a single line using multiplexer.
2. Data is directed to one of many output lines in a DEMUX circuit.
3. Selecting different IO devices for data transfer can be done using MUX.
4. These circuits are used for data routing.
52 Department of ECE, GPTC Perumbavoor
OBJECTIVE:
Students will study about multiplexer IC 74151.
PRINCIPLE:
In most of the electronic systems, the digital data is available on more than
one line. It is necessary to route this data over a single line. Under such
circumstances we require a circuit which selects one of the many inputs at a
time. Multiplexer improves the reliability of the digital system because it
reduces the number of external wired connections.
An 8:1 Multiplexer has eight data inputs D0 to D7, three select inputs S0 to
S2, an enable input and one output.Depending upon the digital code applied at
the select inputs one out of n data input is selected & transmitted to a single
o/p channel. Normally strobe (G) input is incorporated which is generally active
low which enables the multiplexer when it is LOW. Strobe i/p helps in
cascading.
IC 74151A is an 8: 1 multiplexer which provides two complementary
outputs Y & The o/p Y is same as the selected i/p & is its complement.
CIRCUIT DIAGRAM:
53 Department of ECE, GPTC Perumbavoor
[Note: Pin No.7 Enable pin is ACTIVE LOW input. So should be 0 to enable the
IC].
54 Department of ECE, GPTC Perumbavoor
PROCEDURE:
RESULT:
Studied about 8x1 MUX 74151 and verified its truth table.
Inference :
AIM:
Using NAND gates, construct and verify the truth tables of following Flip-
Flops:
(i) RS-Type (ii) D- Type (iii) T- Type. (iv)JK-Type
OBJECTIVE:
Students will study how to construct flip flops using NAND gates.
To convert RS to D flipflop and JK to T Flipflop.
PRINCIPLE:
used in memory circuits to store data bits. The term "Flip-flop" relates to the
actual operation of the device, as it can be "Flipped" into one logic state or
"Flopped" back into another. Flipflop is basically a Bistable Multivibrator.
characteristic equation it is quite evident that when T=0, the next sate is same
as the present state.
i) SR FLIP-FLOP
CLK S R Qn+1
Qn (No
0 X X
Change)
1 0 0 No Change
1 0 1 0
1 1 0 1
1 1 1 Invalid
ii) D FLIP-FLOP
58 Department of ECE, GPTC Perumbavoor
CLK D Qn+1
Qn
0 X
(No Change)
1 0 0
1 1 1
iii) T FLIP-FLOP
7410 Details:
PROCEDURE:
RESULT
Constructed SR, D, JK and T flip flops and verified the truth tables.
Inference :
3. ______________________
60 Department of ECE, GPTC Perumbavoor
AIM:
To construct asynchronous (ripple) mod-10 counter using flip-flops.
OBJECTIVE:
Students will study how to construct a MOD 10 ripple counter.
3. IC TRAINER KIT - 1
PRINCIPLE:
asynchronous first flip flop is clocked by external pulse and then each
successive flip flop is clocked by Q or output of previous stage ie the clock
of second stage is triggered by output of first stage. Because of inherent
propagation delay time all flip flops are not activated at same time which
results in asynchronous operation.
The modulus is the number of unique states through which the counter
will sequence. The maximum possible number of states of a counter is 2n
where ‘n’ is the number of flip-flops. Counters can be designed to have a
number of states in their sequence that is less than the maximum of 2 n . This
type of sequence is called a truncated sequence. One common modulus for
counters with truncated sequences is 10 (Modules10). A decade counter with a
count sequence of zero (0000) through 9 (1001) is a BCD decade counter
because its 10-state sequence produces the BCD code. To obtain a truncated
sequence, it is necessary to force the counter to recycle before going through
all of its possible states. A decade counter requires 4 flip-flops. If we take the
modulo-16 ripple counter and modified it with additional logic gates it can be
made to give a decade (divide-by-10) counter output for use in standard
decimal counting and arithmetic circuits. Such counters are generally referred
to as Decade Counters. A decade counter requires resetting to zero when the
output count reaches the decimal value of 10, ie. when DCBA = 1010 . One way
to make the counter recycle after the count of 9 (1001) is to decode the count
‘10’ (1010) with a NAND gate and connect the output of the NAND gate to the
clear (CLR) inputs of the flip-flops.
This type of asynchronous counter counts upwards on each leading edge
of the input clock signal starting from "0000" until it reaches an output "1010"
(decimal 10). Both outputs Q1 and Q3 are now equal to logic "1" and the
output from the NAND gate changes state from logic "1" to a logic "0" level
and whose output is also connected to the CLEAR (CLR) inputs of all the J-K
Flip-flops. This causes all of the Q outputs to be reset back to binary "0000" on
the count of 10. Once QB and QD are both equal to logic "0" the output of the
NAND gate returns back to a logic level "1" and the counter restarts again from
"0000". We now have a decade or Modulo-10 counter.
Similarly we can construct a MOD-N ripple counter by clearing the
selected flip flops when it counts N. Students are advised to construct a MOD-
12 or MOD-6 counter as an extended experiment.
62 Department of ECE, GPTC Perumbavoor
PIN DIAGRAM:
IC 7476:(Negative edge triggered Dual JK flpflop with active low PRESET and
CLEAR inputs)
TRUTH TABLE:
CLK Q3 Q2 Q1 Q0
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
10 0 0 0 0
63 Department of ECE, GPTC Perumbavoor
DESIGN:
Design procedure of Mod N asynchronous counter
Usually the count N may not be a power of 2.The general procedure for
designing a ripple counter is as follows.
Find the number of flip flop ‘n’ such that 2n > N
Connect the n flipflops as a ripple counter.
Find the binary representation of N
Put a NAND gate. Each input to the NAND gate is a flip flop output Q
which becomes 1 at the count N.
The output of the NAND gate s connected to the clear pin of all the flip
flops(because clear input is active LOW in IC 7476)
Example. Design a Mod 10 ripple counter
Binary of decimal 10 is ‘1010’ ie output Q3 and Q1 are ‘1’.
Hence they are connected to the inputs of a NAND gate and the output of
NAND is connected to clear input of all flip flops.
PROCEDURE:
RESULT:
A MOD 10 RIPPLE/ASYNCHRONOUS counter is constructed and verified
the truth table.
Inference :
SYNCHRONOUS COUNTERS
AIM:
To construct synchronous mod-8 counters using JK flipflops.
OBJECTIVES:
Students will get an idea about
• Understanding the operation and characteristics of synchronous counters
Analyze counter circuits
Determine the sequence of a counter
Determine the modulus of a counter sequences
Understand different applications of flip flops.
Realize the frequency division of signals.
COMPONENTS AND EQUIPMENTS:
Sl.No. COMPONENT SPECIFICATION QTY.
1. JK FLIP FLOP IC 7476 2
2. NAND GATE IC 7400 1
3. IC TRAINER KIT - 1
4. CONNECTING WIRES As required
THEORY:
A synchronous counter, in contrast to an asynchronous counter, is one whose
output bits change state simultaneously, in synchronous with the clock signal
with no ripple. The” clock" pulses are applied to all the flip-flops in counter
simultaneously. Depending on the way in which the counting progresses ,the
synchronous and asynchronous counters are classified into (i)up counters
(ii)down counters(iii) up/down counters
A synchronous binary counter counts from 0 to 2 n-1, where ‘n’ is the number
of bits/flip-flops in the counter. Each flip-flop is used to represent one bit.
66 Department of ECE, GPTC Perumbavoor
4. Transfer the J & K states from the transition table to Karnaugh maps. There
is a Karnaugh map for each input of each flip-flop.
5. Group the Karnaugh map cells to generate and derive the logic expression
for each flipflop input.
6. Implement the expressions with combinational logic, and combine with the
flip-flops to create the counter
FUNCTION TABLE
3 bit (mod -8) synchronous up counter using JK flipflop
CLOCK Q2 Q1 Q0
Initially 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(recycles) 0 0 0
CIRCUIT DIAGRAM:
3 bit (mod -8) synchronous up counter using JK flipflop
68 Department of ECE, GPTC Perumbavoor
FUNCTION TABLE
3 bit (mod -8) synchronous down counter using JK flipflop
CLOCK Q2 Q1 Q0
pulse
Initially 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(recycles) 1 1 1
RESULT:
1. Studied 3 bit synchronous up counter .
2. Studied 3 bit synchronous down counter.
INFERENCE:
After studying this section, students should be able to:
1. Understand the operation of synchronous counters. The count sequence is
controlled using logic gates.
2. Describe common control features used in synchronous counters such as
Preset and Clear.
69 Department of ECE, GPTC Perumbavoor
3. To count the number of times that a certain event takes place; the
occurrence of event to be counted is represented by the input signal to the
counter
4. To control a fixed sequence of actions in a digital system
5. To generate timing signals
6. To generate clocks of different frequencies
70 Department of ECE, GPTC Perumbavoor
PRINCIPLE:
7490, a 1:10 counter which can be split into 1:2 and 1:5
7492, a 1:12 counter which can be split into 1:2 and 1:6
7493, a 1:16 counter which can be split into 1:2 and 1:8
All three ICs are based on JK flipflops and feature asynchronous reset
inputs. The first counter stage uses separate input and output pins, and can be
used as a standalone 1:2 counter stage. The remaining three stages are
connected internally, so that the carry and feedback paths are not accessible
from the outside.
IC 7490 is a decade counter which drives input by 10 and provides BCD
outputs 0 to 9, this is also called as decimal counter. This counter comprises of
a divide-by 2 and divide-by 5 counters. To use as decade counter we have to
cascade divide-by 2 and divide-by 5. Outputs Q0 to Q3 are BCD outputs, inputs
A and B are clock inputs to the, divide-by 2 and divide-by 5 counters
respectively. R01 and R02 are the reset inputs, when these are activated
71 Department of ECE, GPTC Perumbavoor
counter output goes to 0000. If two 7490 are connected in a manner that
input of one becomes the output of other, the second IC will receive a pulse on
every tenth count and will reset at every hundredth count.
IC 7492 is an asynchronous divide by 12 counter. If the clock is applied at
input B, (pin 1) and outputs are taken from QD,QC and QB, it will function as a
MOD-6 counter.
If QA is connected to B input (Pin 12 to Pin 1), and clock is applied at A
input, it will function as a MOD-12 counter.
PIN DIAGRAM:
CIRCUIT DIAGRAM
Clock QD QC QB QA
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
73 Department of ECE, GPTC Perumbavoor
Clock QD QC QB QA
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
74 Department of ECE, GPTC Perumbavoor
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
10 1 0 1 0
11 1 0 1 1
PROCEDURE:
1. Check the ICs.
2. Insert the appropriate IC into the IC base.
3. Make connections as shown in the circuit diagram.
4. Verify the Truth Table and observe the output.
5. Vary the clock frequency to see the difference in the output.
6. Constructed different types of 4 bit shift registers and verified the truth
tables.
7. Constructed different types of 4 bit shift registers and verified the truth
tables.
RESULT:
Familiarized with counter ICs 7490 and 7492.
75 Department of ECE, GPTC Perumbavoor
AIM:
To construct following 4 bit shift registers.
(i) Serial in serial out
(ii) Serial in parallel out
(iii) Parallel in serial out
(iv) Parallel in parallel out
OBJECTIVE:
Students will study how to construct a different shift registers.
PRINCIPLE:
The Shift Register is another type of sequential logic circuit that can be
used for the storage or the transfer of data in the form of binary numbers. This
sequential device loads the data present on its inputs and then moves or
“shifts” it to its output once every clock cycle, hence the name “shift register”.
in a serial type daisy-chain arrangement so that the output from one data latch
becomes the input of the next latch and so on.
Data bits may be fed in or out of a shift register serially, that is one after
the other from either the left or the right direction, or all together at the same
time in a parallel configuration.
The number of individual data latches required to make up a single Shift
Register device is usually determined by the number of bits to be stored with
the most common being 8-bits (one byte) wide constructed from eight
individual data latches.
Shift Registers are used for data storage or for the movement of data
and are therefore commonly used inside calculators or computers to store
data such as two binary numbers before they are added together, or to
convert the data from either a serial to parallel or parallel to serial format. The
individual data latches that make up a single shift register are all driven by a
common clock ( Clk ) signal making them synchronous devices.
Shift register IC’s are generally provided with a clear or reset connection so
that they can be “SET” or “RESET” as required. Generally, shift registers
operate in one of four different modes with the basic movement of data
through a shift register being:
Serial-in to Serial-out (SISO) - the data is shifted serially “IN” and
“OUT” of the register, one bit at a time in either a left or right direction
under clock control.
Serial-in to Parallel-out (SIPO) - the register is loaded with serial data,
one bit at a time, with the stored data being available at the output in
parallel form.
Parallel-in to Serial-out (PISO) - the parallel data is loaded into the
register simultaneously and is shifted out of the register serially one bit at
a time under clock control.
Parallel-in to Parallel-out (PIPO) - the parallel data is loaded
simultaneously into the register, and transferred together to their
respective outputs by the same clock pulse.
77 Department of ECE, GPTC Perumbavoor
PIN DIAGRAM:
LOGIC DIAGRAM:
78 Department of ECE, GPTC Perumbavoor
On each clock pulse, the input bit will shift towards right. Thus it requires 4
clock pulse to reach the 4th flip flop’s output.
TRUTH TABLE:
OUTPUT
CLK DATA QA QB QC QD
1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1
We can see that, the working condition is the same as SISO, but the output is
taken from each flip flop’s output.
79 Department of ECE, GPTC Perumbavoor
PROCEDURE:
RESULT:
Constructed different types of 4 bit shift registers and verified the truth tables.
Inference :
1. Shift registers are the important modules for Data transfer in Digital
communication
2. These are used for storage and transfer of data inside a microprocessor,
microcontroller etc.
81 Department of ECE, GPTC Perumbavoor
OBJECTIVES:
To verify the different functions of IC7495 such as clearing the register,
serial input, parallel input, serial/parallel output etc.
.
COMPONENTS AND EQUIPMENTS:
SL COMPONENT IC QT
No NUMBE Y
. R
1. 4 BIT SHIFT REGISTER IC IC 7495 1
2 IC trainer kit 1
3 Connecting wires
THEORY:
The 7495 is a 4-Bit Shift Register with serial and parallel synchronous operating
modes. The serial shift right and parallel load are activated by separate clock
inputs which are selected by a mode control input.
It has a Serial and four Parallel (A–D) Data inputs and four Parallel Data
outputs (QA–QD). 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 the A–D inputs to the
QA–QD 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 to QA and shifts
the data in QA to QB, QB to QC, and QC to QD respectively (right-shift). A left-
shift is accomplished by externally connecting QD to C, QC to B, and QB to A,
and operating the 7495 in the parallel mode (Mode Control input = HIGH).
82 Department of ECE, GPTC Perumbavoor
For normal operation, Mode Control input should only change states
when both Clock inputs are LOW. However, changing Mode Control input from
LOW to HIGH while CLK2 is HIGH, or changing Mode Control input from HIGH
to LOW while CLK1 is HIGH and CLK2 is LOW will not cause any changes on the
register outputs.
PROCEDURE:
Serial In Parallel Out (SIPO):-
1. Connections are made as per circuit diagram.
2. Apply the data at serial i/p
3. Apply one clock pulse at clock 1 (Right Shift) observe this data at QA.
4. Apply the next data at serial i/p.
5. Apply one clock pulse at clock 2, observe that the data on QA will shift to
QB and the new data applied will appear at QA.
6. Repeat steps 2 and 3 till all the 4 bits data are entered one by one into the
shift register.
Serial In Serial Out(SISO):-
1. Connections are made as per circuit diagram.
2. Load the shift register with 4 bits of data one by one serially.
3. At the end of 4th clock pulse the first data ‘d0’ appears at QD.
4. Apply another clock pulse; the second data ‘d1’ appears at QD.
5. Apply another clock pulse; the third data appears at QD.
6. Application of next clock pulse will enable the 4th data ‘d3’ to appear at
QD. Thus the data applied serially at the input comes out serially at QD
Parallel In Serial Out (PISO):-
1. Connections are made as per circuit diagram.
2. Apply the desired 4 bit data at A, B, C and D.
3. Keeping the mode control M=1 apply one clock pulse. The data applied at
A, B, C and D will appear at QA, QB, QC and QD respectively.
4. Now mode control M=0. Apply clock pulses one by one and observe the
Data coming out serially at QD
Parallel In Parallel Out (PIPO):-
1. Connections are made as per circuit diagram.
2. Apply the 4 bit data at A, B, C and D.
3. Apply one clock pulse at Clock 2 (Note: Mode control M=1).
4. The 4 bit data at A, B, C and D appears at QA, QB, QC and QD
respectively.
83 Department of ECE, GPTC Perumbavoor
LOGIC DIAGRAM:
LOGIC SYMBOL
84 Department of ECE, GPTC Perumbavoor
Note:
To work as a PIPO, keep the mode control M=1 and apply one clock pulse. The
data applied at A, B, C and D will appear at QA, QB, QC and QD
respectively.(PIPO)
To get PISO ,change the mode control M=0. Apply clock pulses one by one and
observe the data coming out serially at
QD
85 Department of ECE, GPTC Perumbavoor
RESULT:
Shift registers using IC 7495 in all its modes i.e.SIPO/SISO, PISO/PIPO are
verified.
INFERENCE:
1. 4-bit Parallel-Access Shift Register IC s 4 bit parallel in /serial out7494,
74195
2. 4 bit bidirectional 74194, can also be studied.
86 Department of ECE, GPTC Perumbavoor
JOHNSON COUNTER
AIM:
To construct a Johnson Counter and verify the truth table.
OBJECTIVE:
To construct a Johnson counter.
PRINCIPLE:
A shift register counter is basically a shift register with the serial output
connected back to the serial input to produce special sequences. These devices
are often classified as counters because they exhibit a specified sequence of
states. Two of the most common types of shift register counters, the Johnson
counter and the ring counter.
JohnsonCounter
The Johnson digital counter or Twisted Ring Counter is a synchronous shift
register with feedback from the inverted output ( ) of the last flip-flop. of
the last flip flop is connected back to the input D of the first flip-flop. This
inversion of Q before it is fed back to input D causes the counter to “count” in
a special way. The main benefit of this type of counter is that it only needs half
the number of flip flops compared to that of standard ring counter to
represent many states. So an n-stage Johnson counter gives a sequence
87 Department of ECE, GPTC Perumbavoor
TRUTH TABLE:
CLK Q0 Q1 Q2 Q3
1 0 0 0 0
2 1 0 0 0
3 1 1 0 0
4 1 1 1 0
5 1 1 1 1
6 0 1 1 1
7 0 0 1 1
8 0 0 0 1
88 Department of ECE, GPTC Perumbavoor
PROCEDURE:
RESULT:
Constructed a Johnson counter and the truth table is verified.
Inference :
1. Many beautiful patterns can be generated using Johnson counter.
2.
89 Department of ECE, GPTC Perumbavoor
RING COUNTER
AIM:
To construct a Ring Counter and verify the truth table.
OBJECTIVE:
To construct a Ring counter.
PRINCIPLE:
A ring counter is formed by feeding the output of a shift register to its own
input. Here the last output ie. QD in a shift register is connected back to the
serial input. The data pattern enclosed within the shift register will re-circulate
with respect to the clock pulse. Ring counter is one of the shift register
applications. A ring counter has N states where ‘N’ is the number of flip-flops.
The synchronous Ring Counter is preset so that exactly one data bit in
the register is set to logic “1” with all the other bits reset to “0”. To achieve
this, a “CLEAR” signal is firstly applied to all the flip-flops together in order to
“RESET” their outputs to a logic “0” level and then a “PRESET” pulse is applied
to the input of the first flip-flop ( FFA ) before the clock pulses are applied. This
then places a single logic “1” value into the circuit of the ring counter.
So on each successive clock pulse, the counter circulates the same data
bit between the four flip-flops over and over again around the “ring” every
90 Department of ECE, GPTC Perumbavoor
fourth clock cycle. But in order to cycle the data correctly around the counter
we must first “load” the counter with a suitable data pattern as all logic “0’s”
or all logic “1’s” outputted at each clock cycle would make the ring counter
invalid.
PIN DIAGRAM
IC 7474(positive edge triggered dual D flipflop with active LOW, PRESET and
CLEAR inputs)
TRUTH TABLE:
Clock QA QB QC QD
0 0 0 0 0
1 1 0 0 0
2 0 1 0 0
3 0 0 1 0
4 0 0 0 1
5 1 0 0 0
6 0 1 0 0
7 0 0 1 0
LOGIC DIAGRAM
91 Department of ECE, GPTC Perumbavoor
PROCEDURE:
(i) 3. In the beginning, clear all flip flops using input by applying
‘0’ to all clear inputs. After that, keep it at logic state ‘1’. In order
to make QA high to begin, we should keep of flipflop A at “ 0
“ for a time period which is less than the clock duration. After that
keep = 1 for proper working
For this,keep the mode input M = 1, apply one clock pulse. (<16Hz).
4. Now the mode M is made 0 and clock pulses are applied one by one
and
the truth table is verified.
RESULT:
Inference :