Lcd Lab Manual
Lcd Lab Manual
THRIKKAKARA, ERNAKULAM
Experiment
Experiment
No.
1 Study of basic Logic Gates and Universal Gates
2 Realization of functions using basic & universal gates (SoP & PoS forms)
Design and realization of half / full adder and half / full subtractor using basic
3
gates and universal gates
4 Study of IC 7483 and realization of BCD adder using 7483
5 Code Converters (Binary to Gray and Gray to Binary converters)
6 Multiplexers and De-multiplexers using gates and ICs (74150, 74154 etc.)
7 Realization of combinational circuits using Mux & Demux
Study of flip-flops : SR, D, T, JK and Master Slave JK using NAND gates and
8
Study of flip-flop ICs
9 Ring Counter and Johnson Counter
10 Asynchronous and Synchronous Counters
11 Study of Counter ICs : 7490, 7492, 7493, 74192
12 Random Sequence Generator
13 BCD-to-7 segment Decoder/Driver to drive LED display
14 TTL / CMOS Characteristics
The Breadboard
The breadboard consists of two terminal strips and two bus strips (often
broken in the centre). Each bus strip has two rows of contacts. Each of the
two rows of contacts are a node. That is, each contact along a row on a bus
strip is connected together (inside the breadboard). Bus strips are used
primarily for power supply connections, but are also used for any node
requiring a large number of connections. Each terminal strip has 60 rows
and 5 columns of contacts on each side of the centre gap. Each row of 5
contacts is a node.
You will build your circuits on the terminal strips by inserting the leads of
circuit components into the contact receptacles and making connections
with 22-26 gauge wire. There are wire cutter/strippers and a spool of wire
in the lab. It is a good practice to wire +5V and 0V power supply
connections to separate bus strips.
Throughout these experiments we will use TTL chips to build circuits. The
steps for wiring a circuit should be completed in the order described below:
1. Turn the power (Trainer Kit) off before you build anything!
2. Make sure the power is off before you build anything!
3. Connect the +5V and ground (GND) leads of the power supply to
the power and ground bus strips on your breadboard.
4. Plug the chips you will be using into the breadboard. Point all the
chips in the same direction with pin 1 at the upper-left corner.
(Pin 1 is often identified by a dot or a notch next to it on the chip
package)
5. Connect +5V and GND pins of each chip to the power and
ground bus strips on the breadboard.
6. Select a connection on your schematic and place a piece of hook-
up wire between corresponding pins of the chips on your
breadboard. It is better to make the short connections before the
longer ones. Mark each connection on your schematic as you go,
so as not to try to make the same connection again at a later stage.
7. Get one of your group members to check the connections, before
you turn the power on.
8. If an error is made and is not spotted before you turn the power
on. Turn the power off immediately before you begin to rewire
the circuit.
9. At the end of the laboratory session, collect you hook-up wires,
chips and all equipment and return them to the demonstrator.
10.Tidy the area that you were working in and leave it in the same
condition as it was before you started.
Common Causes of Problems
1. Not connecting the ground and/or power pins for all chips.
2. Not turning on the power supply before checking the operation of
the circuit.
3. Leaving out wires.
4. Plugging wires into the wrong holes.
5. Driving a single gate input with the outputs of two or more gates
6. Modifying the circuit with the power on.
Sometimes the chip manufacturer may denote the first pin by a small
indented circle above the first pin of the chip. Place your chips in the same
direction, to save confusion at a later stage. Remember that you must
connect power to the chips to get them to work.
7400(NAND)
7402(NOR)
7404(NOT)
7408(AND)
7432(OR)
7486(EX-OR)
7410(3-i/p NAND)
7420(4-i/p NAND)
EXPERIMENT NO: 1
AIM:
To study and verify the truth table of logic gates.
To simplify the given expression and to realize it using Basic
gates and Universal gates.
COMPONENTS REQUIRED:
• Logic gates (IC) trainer kit.
• Connecting patch chords.
• IC 7400, IC 7408, IC 7432, IC 7406, IC 7402, IC 7404, IC 7486
Patch Cords & IC Trainer Kit.
THEORY:
The basic logic gates are the building blocks of more complex logic circuits.
These logic gates perform the basic Boolean functions, such as AND, OR, NAND,
NOR, Inversion, Exclusive-OR, Exclusive-NOR. Fig. below shows the circuit symbol,
Boolean function, and truth. It is seen from the Fig that each gate has one or two binary
inputs, A and B, and one binary output, C. The small circle on the output of the circuit
symbols designates the logic complement. The AND, OR, NAND, and NOR gates can
be extended to have more than two inputs. A gate can be extended to have multiple
inputs if the binary operation it represents is commutative and associative.
These basic logic gates are implemented as small-scale integrated circuits (SSICs) or as
part of more complex medium scale (MSI) or very large-scale (VLSI) integrated
circuits. Digital IC gates are classified not only by their logic operation, but also the
specific logic-circuit family to which they belong. Each logic family has its own basic
electronic circuit upon which more complex digital circuits and functions are
developed. The following logic families are the most frequently used.
TTL and ECL are based upon bipolar transistors. TTL has a well established popularity
among logic families. ECL is used only in systems requiring high-speed operation.
MOS and CMOS, are based on field effect transistors. They are widely used in large
scale integrated circuits because of their high component density and relatively low
power consumption. CMOS logic consumes far less power than MOS logic. There are
various commercial integrated circuit chips available. TTL ICs are usually distinguished
by numerical designation as the 5400 and 7400 series.
PROCEDURE:
Canonical Forms (Normal Forms): Any Boolean function can be written in disjunctive
normal form (sum of min-terms) or conjunctive normal form (product of max-terms).
Karnaugh Maps
TRUTH TABLE
INPUTS OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0
K Map Realization
1 1 1 1
Inputs Output
A B C D Y
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1
PROCEDURE:
1. Check the components for their proper working. Insert the appropriate IC to the
IC base.
2. Make connections as shown in the circuit diagram.
3. Provide the input data via the input switches and observe the output on
output LEDs Verify the Truth Table
RESULT:
Simplified and verified the Boolean function using basic gates and universal gates
VIVA QUESTIONS:
1. What are the different methods to obtain minimal expression?
2. What is a Min term and Max term
3. State the difference between SOP and POS.
4. What is meant by canonical representation?
5. What is K-map? Why is it used?
6. What are universal gates
EXPERIMENT NO: 2
AIM:
To realize
i) Half Adder and Full Adder
ii) Half Subtractor and Full Subtractor by using Basic gates and NAND gates
COMPONENTS REQUIRED:
IC 7400, IC 7408, IC 7486, IC 7432, Patch Cords & IC Trainer Kit.
THEORY:
Half-Adder: A combinational logic circuit that performs the addition of two data bits,
A and B, is called a half-adder. Addition will result in two output bits; one of which is
the sum bit, S, and the other is the carry bit,C. The Boolean functions describing the
half-adder are:
S =A ⊕ B C=AB
Full-Adder: The half-adder does not take the carry bit from its previous stage into
account. This carry bit from its previous stage is called carry-in bit. A combinational
logic circuit that adds two data bits, A and B, and a carry-in bit, Cin , is called a full-
adder. The Boolean functions describing the full-adder are:
S = (x ⊕ y) ⊕ Cin C = xy + Cin (x ⊕ y)
S =A ⊕B C = 𝐴̅ B
Full Subtractor: Subtracting two single-bit binary values, B, Cin from a single-bit
value Aproduces a difference bit D and a borrow out Br bit. This is called full
subtraction. The Boolean functions describing the full-subtracter are:
D = (x ⊕ y) ⊕ Cin Br= 𝐴̅ B + 𝐴̅ (Cin) + B(Cin)
I. TO REALIZE HALF ADDER BOOLEAN EXPRESSIONS:
TRUTH TABLE S=A ⊕ B
C=A B
INPUTS OUTPUTS
A B S C
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
ii) NAND Gates
i) Basic Gates
TRUTH TABLE
INPUTS OUTPUTS D= A ⊕ B ⊕ C
_ _
A B Cin D Br Br= A B + B Cin + A Cin
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
i) BASIC GATES
ii) To Realize the Full subtractor using NAND Gates only
PROCEDURE:
RESULT:
The truth table of the above circuits is verified.
VIVA QUESTIONS:
1) What is a half adder?
2) What is a full adder?
3) What are the applications of adders?
4) What is a half subtractor?
5) What is a full subtractor?
6) What are the applications of subtractors?
7) Obtain the minimal expression for above circuits.
8) Realize a full adder using two half adders
9) Realize a full subtractors using two half subtractors
EXPERIMENT NO: 3
AIM:
To design and set up the following circuit using IC 7483.
i) A 4-bit binary parallel adder.
ii) A 4-bit binary parallel subtractor.
LEARNING OBJECTIVE:
To learn about IC 7483 and its internal structure. To realize a subtractor using adder IC
7483.
COMPONENTS REQUIRED:
IC 7483, IC 7486, Patch Cords & IC Trainer Kit.
THEORY:
The Full adder can add single-digit binary numbers and carries. The largest sum that can
be obtained using a full adder is 112. Parallel adders can add multiple-digit numbers. If
full adders are placed in parallel, we can add two- or four-digit numbers or any other size
desired. Figure below uses STANDARD SYMBOLS to show a parallel adder capable of
adding two, two-digit binary numbers The addend would be on A inputs, and the augend
on the B inputs. For this explanation we will assume there is no input to C 0 (carry from a
previous circuit)
To add 102 (addend) and 012 (augend), the addend inputs will be 1 on A2 and 0 on A1.
The augend inputs will be 0 on B2 and 1 on B1. Working from right to left, as we do in
normal addition, let’s calculate the outputs of each full adder. With A1 at 0 and B1 at 1,
the output of adder1 will be a sum (S1) of 1 with no carry (C1). Since A2 is 1 and B2 is 0,
we have a sum (S2) of 1 with no carry (C2) from adder1. To determine the sum, read the
outputs (C2, S2, and S1) from left to right. In this case, C2 = 0, S2 = 1, and S1 = 1. The
sum, then, of 102 and 012 is 0112. To add four bits we require four full adders arranged in
parallel. IC 7483 is a 4- bit parallel adder whose pin diagram is shown.
MSB LSB
Cin
INPUTS A3 A2 A1 A0
B B B B
3 2 1 0
OUTPUT Cout S3 S2 S1 S0
ADDER CIRCUIT:
PROCEDURE:
• 8 is realized at A3 A2 A1 A0 = 1000
• 3 is realized at B3B2B1B0 through X-OR gates = 0011
• Output of X-OR gate is 1’s complement of 3 = 1100
• 2’s Complement can be obtained by adding
Cin =1
Therefore
Cin = 1
A3 A2 A1 A0 = 1 0 0 0
B3 B2 B1 B0 = 1 1 0 0
S3 S2 S1 S0 = 0 1 0 1
Cout = 1 (Ignored)
PROCEDURE:
RESULTS:
Verified the working of IC 7483 as adder and subtractor.
EXPERIMENT NO: 4
2/3 BITBINARYCOMPARATORS
AIM:
To realize One & Two Bit Comparator and to study 7485 magnitude comparator.
LEARNING OBJECTIVE:
• To learn about various applications of comparator
• To learn and understand the working of IC 7485 magnitude
comparator
• To learn to realize 8-bit comparator using 4-bit comparator
THEORY:
Magnitude Comparator is a logical circuit, which compares two signals A and B
and generates three logical outputs, whether A > B, A = B, or A < B. IC 7485 is a
high speed 4-bit Magnitude comparator , which compares two 4-bit words . The A
= B Input must be held high for proper compare operation.
COMPONENTS REQUIRED:
IC 7400, IC 7410, IC 7420, IC 7432, IC 7486, IC 7402, IC 7408, IC 7404, IC
7485, Patch Cords & IC Trainer Kit.
1) 1- BIT COMPARATOR
TRUTH TABLE
_
A>B = A B
_
A<B = A B INPUTS OUTPUTS
_ _
A=B = A B +AB A B A>B A=B A<B
0 0 0 1 0
0 1 0 0 1
1 0 1 0 0
1 1 0 1 0
2) 2- BIT COMPARATOR
_ _ _ _
(A>B)= A1 B1+A0B1B0+B0A1A0
(A=B) = (A0 ⊕ B0) (A1 ⊕ B1)
− _ _ _
(A<B) = B1 A1 +B0A1A0+A0B1B0
TRUTH TABLE
INPUTS OUTPUTS
A1 A0 B1 B0 A>B A=B A<B
0 0 0 0 0 1 0
0 0 0 1 0 0 1
0 0 1 0 0 0 1
0 0 1 1 0 0 1
0 1 0 0 1 0 0
0 1 0 1 0 1 0
0 1 1 0 0 0 1
0 1 1 1 0 0 1
1 0 0 0 1 0 0
1 0 0 1 1 0 0
1 0 1 0 0 1 0
1 0 1 1 0 0 1
1 1 0 0 1 0 0
1 1 0 1 1 0 0
1 1 1 0 1 0 0
1 1 1 1 0 1 0
3) TO COMPARE THE GIVEN DATA USING 7485 CHIP.
A B Result
A3 A2 A1 A0 B3 B2 B1 B0
0 0 0 1 0 0 0 0 A>B
0 0 0 1 0 0 0 1 A=B
0 0 0 0 0 0 0 1 A<B
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
RESULT:
One bit, two bit and four bit comparators are verified using basic gates and
magnitude comparator IC7485
VIVA QUESTIONS:
1) What is a comparator?
2) What are the applications of comparator?
3) Derive the Boolean expressions of one bit comparator and two bit comparators.
4) How do you realize a higher magnitude comparator using lower bit comparator
5) Design a 2 bit comparator using a single Logic gates?
6) Design an 8 bit comparator using a two numbers of IC 7485?
EXPERIMENT NO: 5
LEARNING OBJECTIVE:
• To learn the importance of non-
weighted code
• To learn to generate gray code
COMPONENTS REQUIRED:
IC 7400, IC 7486, and IC 7408, Patch Cords & IC Trainer Kit
Binary Gray
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
BOOLEAN EXPRESSIONS:
G3=B3
G2=B3 ⊕ B2
G1=B1 ⊕ B2
G0=B1 ⊕ B0
+
I) GRAY TO BINARY CONVERSION
0 0 1 1
0 0 1 1
0 0 1 1
0 0 1 1 B3 = G3
0 1 0 1
0 1 0 1
B2=G3 ⊕ G2
0 1 0 1
0 1 0 1
0 1 0 1
0 1 0 1
B1=G3 ⊕ G2 ⊕ G1
1 0 1 0
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
B0=G3⊕G2⊕G1⊕G0
1 0 1 0
GRAY TO BINARY CONVERSION
Gray Binary
G3 G2 G1 G0 B3 B2 B1 B0
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
BOOLEAN EXPRESSIONS:
1 0 1 1 1 1 0 1 B3=G3
1 0 0 1 1 1 1 0 B2=G3 ⊕ G2
B1=G3 ⊕ G2 ⊕ G1
1 0 0 0 1 1 1 1 B0=G3 ⊕ G2 ⊕ G1 ⊕ G0
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
RESULT:
Binary to gray code conversion and vice versa is realized using EX-OR gates and
NAND gates.
VIVA QUESTIONS:
1) What are code converters?
2) What is the necessity of code conversions?
3) What is gray code?
4) Realize the Boolean expressions for
a) Binary to gray code conversion
b) Gray to binary code conversion
EXPERIMENT NO: 6
LEARNING OBJECTIVE:
To learn about various Flip-Flops
To learn and understand the working of Master slave FF
To learn about applications of FFs
Conversions of one type of Flip flop to another
COMPONENTS REQUIRED:
IC 7408, IC 7404, IC 7402, IC 7400, Patch Cords & IC Trainer Kit.
THEORY:
Logic circuits that incorporate memory cells are called sequential logic circuits; their
output depends not only upon the present value of the input but also upon the previous
values. Sequential logic circuits often require a timing generator (a clock) for their
operation.
The latch (flip-flop) is a basic bi-stable memory element widely used in sequential
logic circuits. Usually there are two outputs, Q and its complementary value.
SR LATCH:
An S-R latch consists of two cross-coupled NOR gates. An S-R flip-flop can also be
design using cross-coupled NAND gates as shown. The truth tables of the circuits are
shown below.
A clocked S-R flip-flop has an additional clock input so that the S and R inputs
are active only when the clock is high. When the clock goes low, the state of flip-flop is
latched and cannot change until the clock goes high again. Therefore, the clocked S-R
flip-flop is also called “enabled” S-R flip-flop.
A D latch combines the S and R inputs of an S-R latch into one input by adding
an inverter. When the clock is high, the output follows the D input, and when the clock
goes low, the state is latched. A S-R flip-flop can be converted to T-flip flop by
connecting S input to Qb and R to Q.
1) S-R LATCH:
TRUTH TABLE
S R Q+ Q b+
0 0 Q Qb
0 1 0 1
1 0 1 0
1 1 0* 0*
S R Q+ Q b+
0 0 1* 1*
0 1 1 0
1 0 0 1
1 1 Q Qb
2) SR FLIP FLOP:
CIRCUIT DIAGRAM:
S R Q+ Q b+
0 0 Q Qb
0 1 0 1
1 0 1 0
1 1 0* 0*
LOGIC DIAGRAMSYMBOL
T Qn + 1
0 Qn
1 Qn
LOGIC DIAGRAMSYMBOL
D FLIP FLOP USING IC 7476 TRUTH TABLE
CLOCK D Q+ Q+
0 X Q Q
1 0 0 1
1 1 1 0
1 1 0 1 0 Set
1 1 1 Q’ Q Toggle
SD RD Clock J K Q Q’ Comment
0 0 Not Allowed
0 1 X X X 1 0 Set
1 0 X X X 0 1 Reset
1 1 1 0 0 NC NC Memory
1 1 1 0 1 0 1 Reset
1 1 1 1 0 1 0 Set
1 1 1 1 1 Q’ Q Toggle
6. JK MASTER SLAVE FLIP FLOP
TRUTH TABLE
PRE = CLR = 1
No
1 0 0 Q Q’
Change
1 0 1 0 1 Reset
1 1 0 1 0 Set
1 1 1 Race Around
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
VIVA QUESTIONS:
1. What is the difference between Flip-Flop & latch?
2. Give examples for synchronous & asynchronous inputs?
3. What are the applications of different Flip-Flops?
4. What is the advantage of Edge triggering over level triggering?
5. What is the relation between propagation delay & clock frequency of flip-flop?
6. What is race around in flip-flop & how to overcome it?
7. Convert the J K Flip-Flop into D flip-flop and T flip-flop?
8.List the functions of asynchronous inputs?
EXPERIMENT NO: 7
LEARNING OBJECTIVE:
To learn about Asynchronous Counter and its application
To learn the design of asynchronous up counter and down counter
COMPONENTS REQUIRED:
IC 7476, Patch Cords & IC Trainer Kit
THEORY:
A counter in which each flip-flop is triggered by the output goes to previous flip-flop.
As all the flip-flops do not change state simultaneously spike occur at the output. To
avoid this, strobe pulse is required. Because of the propagation delay the operating
speed of asynchronous counter is low. Asynchronous counter are easy and simple to
construct.
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
Circuit Diagram:
MOD-8 UP COUNTER
CIRCUIT DIAGRAM:
TRUTH TABLE
CLK QC QB QA
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
MOD_6 UP COUNTER
CIRCUIT DIAGRAM
TRUTH TABLE
CLK QC QB QA
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:
TRUTH TABLE
CLK QC QB QA
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
MOD-6 DOWN COUNTER
CIRCUIT DIAGRAM:
TRUTH TABLE
CLK QC QB QA
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 1 1 1
VIVA QUESTIONS:
1. What is an asynchronous counter?
2. How is it different from a synchronous counter?
3. Realize asynchronous counter using T flip-flop
EXPERIMENT NO: 8
Apparatus Required: -
Procedure: -
2. Clock pulses are applied one by one at the clock I/P and the O/P is
CIRCUIT DIAGRAM
RESULT: The working of 3-bit up/down asynchronous counter is verified
EXPERIMENT NO: 9
LEARNING OBJECTIVE:
To learn about pre-settable Counter and its application
COMPONENTS REQUIRED:
IC 74193, Patch Cords & IC Trainer Kit
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
CLK QD QC Q B QA QD QC QB QA
CLK
0 1 1 1 1
0 0 0 0 0
1 1 1 1 0
1 0 0 0 1
2 0 0 1 0 2 1 1 0 1
3 1 1 0 0
3 0 0 1 1
4 1 0 1 1
4 0 1 0 0
5 1 0 1 0
5 0 1 0 1
6 1 0 0 1
6 0 1 1 0
7 1 0 0 0
7 0 1 1 1
8 0 1 1 1
8 1 0 0 0
9 1 0 0 1 9 0 1 1 0
10 0 1 0 1
10 1 0 1 0
11 1 0 1 1 11 0 1 0 0
12 1 1 0 0 12 0 0 1 1
13 0 0 1 0
13 1 1 0 1
14 0 0 0 1
14 1 1 1 0
15 0 0 0 0
15 1 1 1 1
16 0 0 0 0 16 1 1 1 1
CIRCUIT DIAGRAM
TRUTH TABLE
CLK QD QC QB QA
1 0 0 1 0
2 0 0 1 1
3 0 1 0 0
4 0 1 0 1
5 0 1 1 0
6 0 1 1 1
7 1 0 0 0
8 1 0 0 1
9 1 0 1 0
10 1 0 1 1
11 1 1 0 0
12 0 0 1 0
CIRCUIT DIAGRAM
TRUTH TABLE
CLK QD QC Q B QA
1 1 0 1 1
2 1 0 1 0
3 1 0 0 1
4 1 0 0 0
5 0 1 1 1
6 0 1 1 0
7 0 1 0 1
8 0 1 0 0
9 0 0 1 1
10 0 0 1 0
11 0 0 0 1
12 1 0 1 1
VIVA QUESTIONS:
AIM:
To design and test 3-bit binary synchronous counter using flip-flop IC 7476 for the
given sequence.
LEARNING OBJECTIVE:
To learn about synchronous Counter and its application
To learn the design of synchronous counter counter
COMPONENTS REQUIRED:
IC 7476, Patch Cords & IC Trainer Kit
THEORY:
A counter in which each flip-flop is triggered by the output goes to previous flip-
flop. As all the flip-flops do not change states simultaneously in asynchronous counter,
spike occur at the output. To avoid this, strobe pulse is required. Because of the
propagation delay the operating speed of asynchronous counter is low. This problem
can be solved by triggering all the flip-flops in synchronous with the clock signal and
such counters are called synchronous counters.
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
MOD 5 COUNTER:
Q Q+ J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
DESIGN:
1 X X 1 X 1 X X
0 X X X X X X X
JA = QC KA = 1
0 1 X X X X 1 0
0 X X X X X X X
JB = QA KB = QA
0 0 1 0 X X X X
X X X X 1 X X X
JC = QB QA Kc = 1
CIRCUIT DIAGRAM
MOD 8 COUNTER:
TRUTH TABLE:
QC QB QA
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
0 0 0
JK FF excitation table:
Q Q+ J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
DESIGN:
1 X X 1
1 X X 1
JA = 1
X 1 1 X
X 1 1 X
KA = 1
JB=QA
JC = QBQA
KB=QA
KC = QBQA
Present count
QC QB QA
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Next count
QC QB QA
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
0 0 0
CIRCUIT DIAGRAM
RESULT:
The working of synchronous Mod-N counters is verified.
VIVA QUESTIONS:
1. What are synchronous counters?
2. What are the advantages of synchronous counters?
3. What is an excitation table?
4. Write the excitation table for D, T FF
5. Design mod-5 synchronous counter using T FF
EXPERIMENT NO: 11
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
Serial
Shift
i/p QA QB QC QD
Pulses
data
- - X X X X
0 t1 0 X X X
1 t2 1 0 X X
0 t3 0 1 0 X
1 t4 1 0 1 0
X t5 X 1 0 1
X t6 X X 1 0
X t7 X X X 1
X t8 X X X X
2) SERIAL IN PARALLEL OUT (SIPO)
Serial Shift
QA QB QC QD
i/p data Pulses
- - X X X X
0 t1 0 X X X
1 t2 1 0 X X
0 t3 0 1 0 X
1 t4 1 0 1 0
Clock
Shift
Input Pulses QA QB QC QD
Terminal
- - X X X X
CLK2 t1 1 0 1 0
Clock
Shift
Input QA QB QC QD
Pulses
Terminal
- - X X X X
CLK2 t1 1 0 1 0
CLK2 t2 X 1 0 1
0 t3 X X 1 0
1 t4 X X X 1
X t5 X X X X
14 13 12 11 10 9 8
IC 7495
1 2 3 4 5 6 7
LEARNING OBJECTIVE:
To learn about Ring Counter and its application
To learn about Johnson Counter and its application
COMPONENTS REQUIRED:
IC 7495, IC 7404, Patch Cords & IC Trainer Kit.
THEORY:
Ring counter is a basic register with direct feedback such that the contents of
the register simply circulate around the register when the clock is running. Here the
last output that is QD in a shift register is connected back to the serial input.
A basic ring counter can be slightly modified to produce another type of shift
register counter called Johnson counter. Here complement of last output is connected
back to the not gate input and not gate output is connected back to serial input. A four
bit Johnson counter gives 8 state output.
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Apply clock to pin number 9 and observe the output
CIRCUIT DIAGRAM:
Clock
QA QB QC QD
pulses
0 1 0 0 0
1 0 1 0 0
2 0 0 1 0
3 0 0 0 1
4 1 0 0 0
5 0 1 0 0
6 0 0 1 0
7 0 0 0 1
8 1 0 0 0
2) JOHNSON COUNTER TRUTH TABLE
Clock Q Q Q Q
A B C D
pulses
0 0 0 0 0
1 1 0 0 0
2 1 1 0 0
3 1 1 1 0
4 1 1 1 1
5 0 1 1 1
6 0 0 1 1
7 0 0 0 1
8 0 0 0 0
RESULT: The truth table & working of Ring and Johnson counters is verified.
EXPERIMENT NO: 13
LEARNING OBJECTIVE:
To learn about decade Counter
To use it as a divide by N counter [N<=10 ,say N=7,N=5]
COMPONENTS REQUIRED:
IC 7490, Patch Cords & IC Trainer Kit
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
DECADE COUNTER:
TRUTH TABLE:
QD QC QB QA
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
0 0 0 0
TRUTH TABLE:
QD QC QB QA
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 0 0 0
DIVIDE BY 5 COUNTER:
TRUTH TABLE:
QD QC QB QA
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 0 0 0
The 7492 / 74LS92 counter IC is a 4-Bit ripple counter (4 cascaded counting elements). The
individual counting circuits inside are partitioned into two blocks, one is a divide by two counter
and the other capable of divide by 6, which when combined together effectively implements a
divide by 12, perfect for the hour tracking register for a digital clock.
The 7493 can be wired for various modes of operations, including the full four bit mode (0-15 in
decimal) and also shorter counts such as 0-7 or 0-3 etc... This configurability allows the device
to be suited in a wide variety of different areas such as frequency dividers and special control
applications. Multiple 7493s can be configured together to provide greater counting lengths and
more division possibilities
VIVA QUESTIONS:
What is a decade counter?
What do you mean by a ripple counter?
Explain the design of Modulo-N counter (N ≤ 9) using IC 7490
EXPERIMENT NO: 14
LEARNING OBJECTIVE:
To learn about various applications of multiplexer and de-multiplexer To learn
and understand the working of IC 74153 and IC 74139
To learn to realize any function using Multiplexer
THEORY:
Multiplexers are very useful components in digital systems. They transfer a large number of
information units over a smaller number of channels, (usually one channel) 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 (usually one unit) 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
enable
COMPONENTS REQUIRED:
IC 7400, IC 7410, IC 7420, IC 7404, IC 74153, IC 74139, Patch Cords & IC Trainer Kit.
i) 4:1 MULTIPLEXER
4:1 Inputs
MUX
Y
E’
Select inputs
Output Y= E’S1’S0’I0 + E’S1’S0I1 + E’S1S0’I2 + E’S1S0I3
E D S1 S0 Y3 Y2 Y1 Y0
1 0 X X X X X X
0 1 0 0 0 0 0 1
0 1 0 1 0 0 1 0
0 1 1 0 0 1 0 0
0 1 1 1 1 0 0 0
REALIZATION USING NAND GATES TRUTH TABLE
S1 S0 E I0 I1 I2 I3 Y
X X 1 X X X X 0
0 0 0 0 X X X 0
0 0 0 1 X X X 1
0 1 0 X 0 X X 0
0 1 0 X 1 X X 1
1 0 0 X X 0 X 0
1 0 0 X X 1 X 1
1 1 0 X X X 0 0
1 1 0 X X X 1 1
Inputs Outputs
Ea S1 S0 Y3 Y2 Y1 Y0
1 X X 1 1 1 1
0 0 0 1 1 1 0
0 0 1 1 1 0 1
0 1 0 1 0 1 1
0 1 1 0 1 1 1
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
COMPONENTS REQUIRED:
IC 7400, IC 7410, IC 7420, IC 7404, IC 74153, IC 74139, Patch Cords & IC Trainer Kit.
THEORY:
Combinational circuit is a circuit in which we combine the different gates in the circuit, for
example encoder, decoder, multiplexer and demultiplexer. Some of the characteristics of
combinational circuits are following −
• The output of combinational circuit at any instant of time, depends only on the
levels present at input terminals.
• The combinational circuit does not use any memory. The previous state of input
does not have any effect on the present state of the circuit.
• A combinational circuit can have an n number of inputs and m number of outputs
DESIGN:
SUM CARRY
I0 I1 I3 I3
0 1 2 3
4 5 6 7
A A’ A’ A
TRUTH TABLE
Inputs Outputs
A B C S C
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
I0 I1 I3 I3
0 1 2 3
4 5 6 7
0 A A 1
HALF SUBTRACTOR USING MUX:
DESIGN:
DIFFERENCE BORROW
I0 I1 I0 I1
0 1 0 1
2 3 2 3
A A’ 0 A’
Inputs Outputs
A B D Br
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0
DESIGN:
DIFFERENCE BORROW
I0 I1 I2 I3 I0 I1 I2 I3
0 1 2 3 0 1 2 3
4 5 6 7 4 5 6 7
A A’ A’ A 0 A’ A’ 1
TRUTH TABLE
Inputs Outputs
A B C D Br
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
RESULT: Adder and subtractor circuits are realized using multiplexer IC 74153.
VIVA QUESTIONS:
1) What is a multiplexer?
2) What is a de-multiplexer?
3) What are the applications of multiplexer and de-multiplexer?
4) Derive the Boolean expression for multiplexer and de-multiplexer.
5) How do you realize a given function using multiplexer.
6) What is the difference between multiplexer & demultiplexer?
7) In 2n to 1 multiplexer how many selection lines are there?
8) How to get higher order multiplexers?
9) Implement an 8:1 mux using 4:1 mux.
EXPERIMENT NO: 16
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• By Keeping mode=1. Load the input A,B,C,D as in Truth Table 1st Row and give a
clock pulse
• For count mode make mode = 0.
• Verify the Truth Table and observe the outputs.
1 1 1 0 1
DESIGN 1:
1 1 1
Sequence = 100010011010111
Sequence length S = 15 1 1
1
QA QB QC QD Y
1 1 1 1 0
0 1 1 1 0 Y = QC (+) QD
0 0 1 1 0
0 0 0 1 1
1 0 0 0 0 X 1 0 1
0 1 0 0 0
0 0 1 0 1
0 1 0 1
1 0 0 1 1
1 1 0 0 0
0 1 0 1
0 1 1 0 1
1 0 1 1 0
0 1 0 1 1 0 1 0 1
1 0 1 0 1
1 1 0 1 1
QC QD
2
3
Y QA QB
1
CLK
VCC
14 13 12 11 10 9 8
IC 7495
1 2 3 4 5 6 7
DESIGN 2:
Sequence = 1001011
Sequence length S = 7 Y = Q B + QC
QB QC QA QB QC QD Y
3 2 1 1 1 1 0 X X 1 X
1
Y
CLK 0 1 1 1 0
0 0 1 1 1
VCC QA QD
0 X 0 X
1 0 0 1 0
14 13 12 11 10 9 8 0 1 0 0 1 X 1 X 0
IC 7495 1 0 1 0 1
1 1 0 1 1
1 1 0 X 1 X 1
1 2 3 4 5 6 7 1 1
1
Serial A B C D Mode Gnd
Input INPUTS Control
DESIGN 3:
Sequence = 1101011
Sequence length S = 7
QA QB QC QD 1
2 12 Y
13
VCC CLK
14 13 12 11 10 9 8
IC 7495
1 2 3 4 5 6 7
Y = QA + QC + QD
X X X X
X 1 1 X
X 1 0 1
X X 0 1
QA QB QC QD Y
1 1 1 1 1
1 1 1 1 0
0 1 1 1 1
1 0 1 1 0
0 1 0 1 1
1 0 1 0 1
1 1 0 1 1
1 1 0
1 1
1
VIVA QUESTIONS:
LEARNING OBJECTIVE:
To learn about various applications of decoder
To learn and understand the working of IC 7447
To learn about types of seven-segment display
COMPONENTS REQUIRED:
IC7447, 7-Segment display (common anode), Patch chords, resistor (1K ) & IC
Trainer Kit
THEORY:
The Light Emitting Diode (LED) finds its place in many applications in these modern
electronic fields. One of them is the Seven Segment Display. Seven-segment displays
contains the arrangement of the LEDs in “Eight” (8) passion, and a Dot (.) with a
common electrode, lead (Anode or Cathode). The purpose of arranging it in that
passion is that we can make any number out of that by switching ON and OFF the
particular LED's. Here is the block diagram of the Seven Segment LED arrangement.
The Light Emitting Diode (LED), finds its place in many applications in this modern
electronic fields. One of them is the Seven Segment Display. Seven-segment displays
contains the arrangement of the LEDs in “Eight” (8) passion, and a Dot (.) with a
common electrode, lead (Anode or Cathode). The purpose of arranging it in that
passion is that we can make any number out of that by switching ON and OFF the
particular LED's. Here is the block diagram of the Seven Segment LED arrangement.
LED’s are basically of two types-
Common Cathode (CC) -All the 8 anode legs uses only one cathode, which is
common. Common Anode (CA)-The common leg for all the cathode is of Anode
type.
A decoder is a combinational circuit that connects the binary information from ‘n’
input lines to a maximum of 2n unique output lines. The IC7447 is a BCD to 7-segment
pattern converter. The IC7447 takes the Binary Coded Decimal (BCD) as the input and
outputs the relevant 7 segment code.
CIRCUIT DIAGRAM:
TRUTH TABLE:
Decimal
BCD Inputs Output Logic Levels from IC 7447 to 7-segments number
display
D C B A a b c d e f g
0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 1 1 0 0 1 1 1 1 1
0 0 1 0 0 0 1 0 0 1 0 2
0 0 1 1 0 0 0 0 1 1 0 3
0 1 0 0 1 0 0 1 1 0 0 4
0 1 0 1 0 1 0 0 1 0 0 5
0 1 1 0 1 1 0 0 0 0 0 6
0 1 1 1 0 0 0 1 1 1 1 7
1 0 0 0 0 0 0 0 0 0 0 8
1 0 0 1 0 0 0 1 1 0 0 9
PROCEDURE:
• Check all the components for their working.
• Insert the appropriate IC into the IC base.
• Make connections as shown in the circuit diagram.
• Verify the Truth Table and observe the outputs.
VIVA QUESTIONS:
1. What are the different types of LEDs?
2. Draw the internal circuit diagram of an LED.
3. What are the applications of LEDs?