LDCO Lab Manual
LDCO Lab Manual
Lab Manual
Subject:
Subject In-charge:
Ms. Jayashree R Surpur
Group A : Combinational circuit design
IC’s Used:
Theory:
There is a wide variety of binary codes used in digital systems. Some of these codes are binary-
coded -decimal (BCD), Excess-3, Gray, octal, hexadecimal, etc. Often it is required to convert
from one code to another. For example, the input to a digital system may be in natural BCD and
output may be 7-segment LEDs. The digital system used may be capable of processing the data
in straight binary format. Therefore, the data has to be converted from one type of code to
another type for different purposes. The various code converters can be designed using gates.
1. BCD Code:
Binary Coded Decimal (BCD) is used to represent each of decimal digits (0 to 9) with a 4-bit
binary code. For example (23)10 is represented by 0010 0011 using BCD code rather
than(10111)2 This code is also known as 8-4-2-1 code as 8421 indicates the binary weights of
four bits(23, 22, 21, 20). It is easy to convert between BCD code numbers and the familiar
decimal numbers. It is the main advantage of this code. With four bits, sixteen numbers (0000 to
1111) can be represented, but in BCD code only 10 of these are used. The six code
combinations (1010 to 1111) are not used and are invalid.
Applications: Some early computers processed BCD numbers. Arithmetic operations can be
performed using this code. Input to a digital system may be in natural BCD and output may be
7-segment LEDs.
It is observed that more number of bits are required to code a decimal number using BCD code
than using the straight binary code. However, in spite of this disadvantage it is very convenient
and useful code for input and output operations in digital systems.
2. EXCESS-3 Code:
Excess-3, also called XS3, is a non-weighted code used to express decimal numbers. It can be
used for the representation of multi-digit decimal numbers as can BCD.The code for each
decimal number is obtained by adding decimal 3 and then converting it to a 4-bit binary
number. For e.g. decimal 2 is coded as 0010 + 0011 = 0101 in Excess-3 code.
This is self-complementing code which means 1’s complement of the coded number yields 9’s
complement of the number itself. Self-complementing property of this helps considerably in
performing subtraction operations in digital systems, so this code is used for certain arithmetic
operations.
The 4-bit Excess-3 coded digit can be converted into BCD code by subtracting decimal value 3
i.e. 0011 from 4 bit Excess-3 digit.
e.g. Convert 4-bit Excess-3 value 0101 to equivalent BCD code.
0101-0011= 0010- BCD for 2
B3 B2 B1 B0 E3 E2 E1 E0
0 0 0 0 0 0 1 1
0 0 0 1 0 1 0 0
0 0 1 0 0 1 0 1
0 0 1 1 0 1 1 0
0 1 0 0 0 1 1 1
0 1 0 1 1 0 0 0
0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1
1 0 0 1 1 1 0 0
1 0 1 0 x x x x
1 0 1 1 x x x x
1 1 0 0 x x x x
1 1 0 1 x x x x
1 1 1 0 x x x x
1 1 1 1 x x x x
Fig.2 K-Map For Reduced Boolean Expressions Of Each Output (Excess-3 Code)
XOR 2 7486 1
NOT 2 7404 1
AND 1 7408 1
OR 2 7432 1
Test the circuit for all possible combinations of input and output codes.
The truth tables have been verified using IC 7486, 7432, 7408, and 7404.
IC’s USED:
IC 7483 (4 bit Binary adder), IC 7404(Hex INV), 7432 (OR-gate), 7408 (AND-gate), 7486
(EX-OR gate)
THEORY:
BCD Adder:
BCD adder is a circuit that adds two BCD digits & produces a sum of digits also inBCD.
Rules for BCD addition:
1. Add two numbers using rules of Binary addition.
2. If the 4 bit sum is greater than 9 or if carry is generated then the sum is invalid. To
correct the sum add 0110 i.e. (6)10 to sum. If carry is generated from this addition add it
to the next higher order BCD digit.
3. If the 4 bit sum is less than 9 or equal to 9 then sum is in proper form.
1. 0011
+ 0100
0111
Answer is valid BCD number = (7)BCD & so 0110 is not added.
1. 0110
+ 0101
10 1 1
+0110
1 0001
(1 1)BCD
1. 1001
+ 1001
1 0010
2. 1 0010
+ 0110
1 1000
(1 8)
Valid BCD result = (18) BCD
1. To execute first step i.e. binary addition of two 4 bit numbers we will use IC 7483
( with Cin = 0 ), which is a 4 bit binary adder.
2. We need to design a digital circuit which will sense the sum & carry of IC 7483 & if
sum exceeds 9 or carry = 1, this digital circuit will produce high output otherwise its
output will be zero.
First we will design circuit to check sum & then we will logically OR output of this
circuit to carry output of IC 7483
For digital circuit which we are going to design we will have 4 inputs
( S3, S2, S1, S0) & only 1 output Y.
a) Y output of this circuit. Will be ORed with carry output of first adder IC
7483.
b) If BCD result is invalid i e. sum output of first 7483 we have to add
(6)10 i.e. (0110)2 that means we need one more binary adder IC 7483.
c) If BCD result is valid (i.e. final output of the circuit to check validity is 0) we
will make an arrangement that second adder IC 7483 adds (0)10 i.e. ( 0000 )2
to the sum of the first adder IC 7483. The output of the combinational circuit is
used as the final output carry & carry output of the second adder IC is ignored.
INPUT OUTPUT
S3 S2 S1 S0 Y
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 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
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 1
Y = S3S2 + S3S1
AND 2 7408 1
OR 2 7432 1
OBSERVATION :
BCD adder :
INPUT OUTPUT
A0 B3 B0 S3 S0
A3 S S
A2 A1 (LSB (MS B2 B1 (LSB Cout (MS (LSB
(MSB) 2 1
) B) ) B) )
0 0 1 0 0 1 1 0 0 1 0 0 0
0 1 1 1 0 1 1 0 1 0 0 1 1
1 0 0 1 1 0 0 0 1 0 1 1 1
One Digit BCD Adder is designed & tested for all possible combinations.
FAQ’s:
Disadvantage :
Only one function can be implemented using one MUX. Hence they can’t be
used in combinational logic circuits which contain many functions.
VERIFICATION OF IC 74153 :
IC 74153 is a dual layer 4:1 MUX. It has four input lines for (I0D-I3D) for second MUX &
active high output.‘Ya’, ‘Yb’ (1Y or 2Y). It has select lines S1S0 common to both MUX. The
Enable inputs are active low inputs, Ea & Eb (1G and 2G). The MUX is activated when they are
at logic 0.
S S E (I or D D D D Y
1 0 II) 0 1 2 3
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
A full adder is a combinational circuit that forms the arithmetic sum of three input bits. It
consists of three inputs and two outputs. Two of these variables denoted by A and B represent
the two significant bits to be added. The third input represents the carry from the previous lower
significant position.
Input Output
A B C Su Carr
m y
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
D0 D1 D2 D3
A 0 1 2 3
A 4 5 6 7
i/p to MUX A A A A
D0 D1 D2 D3
A 0 1 2 3
A 4 5 6 7
i/p to MUX 0 A A 1
Hardware Requirements :
GATE Quantity IC Quantity
Mux. 1 74153 1
NOT 1 7404 1
2. CASCADING OF IC 74153:
Cascading is done to expand two or more MUX IC’s to a digital multiplexer with larger no. of
inputs i.e. multiplexer stocks or tress is designed. The enable input is used for cascading. In case
of IC 74153 we have only two select lines. But for certain applications 3 select lines are
required then it can be obtained by cascading using enable. Now with 3 select lines we have
8 combinations. Out of this combination the MSB is 0. MSB is 1 for last four combination so
we can use these MSB to select any 1 MUX out of two by connecting it to E pin of first 4:1
MUX .
C (1G / 2G B A Y
) (S1) (S0)
0 0 0 D0
0 0 1 D1
0 1 0 D2
0 1 1 D3
1 0 0 D4
1 0 1 D5
1 1 0 D6
1 1 1 D7
Inputs Outpu
t
C B A Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
LOGIC DIAGRAM :
Mux. 1 74153 1
NOT 1 7404 1
OR 1 7432 1
Conclusion :In this way multiplexer and its applications are studied, implemented &
tested.
Demultiplexer:
Demultiplexer is a logic used to perform exactly reverse function performed by
multiplexer. It accepts a single input and distributes among several outputs. The selection of a
particular output line is controlled by a set of selection line. There are n input lines & 2m is the
number of selection line whose bit combinations determine which output to be selected.
Difference between Multiplexer, De-multiplexer & Decoder
Encoder &Decoder:
1. Encoders are used to encode given digital number into different numbering format
like decimal to BCD Encoder, Octal to Binary.
2. Decoders are used to decode a coded binary word like BCD to seven segment
decoder.
3. Thus encoder and decoder are application specific logic develop, we can not use
any type of input for any encoder and decoder.
4. Need to select input according to encoder and decoder being selected for a
particular application as mention in examples above.
ADVANTAGES:
1) The decoder provides best implementation whenever there are many outputs of the
combinational circuit and each o/p of the function (or its complement) is required to be
expressed with a small no. of minterms.
2) The decoder can function as demux. If the Enable i/p line is taken as Din (data i/p) .
DISADVANTAGES:
Since the decoder method requires an OR gate for each o/p function, so there is new hardware
used. And it is always advisable to use minimum hardware as we come across problems like
propagation delay of gates.
APPLICATIONS:
Decoder is worthily used for decoding binary information and memory interfacing. It is used for
the implementation of Boolean function.
A) Verification of IC 74138:
We use IC 74138 which accepts 3 binary weighted inputs (A0, A1, A2) and when enabled
provides mutually exclusive active low outputs (y0-y7). It features 3 Enable i/ps. Two active
low (G2A, G2B) and one active high (G1). Every output will be high unless G2A, G2B are low
and G1 is high. It has demultiplexing capability and multiple enable i/ps for easy expansion.
Input Output
Enable Data
G2A G2B G1 A2 A1 A0 Y0 Y1 Y2 Y3 Y4 Y5 Y6 Y7
0 0 0 X X X 1 1 1 1 1 1 1 1
0 1 1 X X X 1 1 1 1 1 1 1 1
1 0 1 X X X 1 1 1 1 1 1 1 1
1 1 1 X X X 1 1 1 1 1 1 1 1
0 0 1 0 0 0 0 1 1 1 1 1 1 1
0 0 1 0 0 1 1 0 1 1 1 1 1 1
0 0 1 0 1 0 1 1 0 1 1 1 1 1
0 0 1 0 1 1 1 1 1 0 1 1 1 1
0 0 1 1 0 0 1 1 1 1 0 1 1 1
0 0 1 1 0 1 1 1 1 1 1 0 1 1
0 0 1 1 1 0 1 1 1 1 1 1 0 1
0 0 1 1 1 1 1 1 1 1 1 1 1 0
B) Cascading of IC 74138:
The enable i/p G1 active high of IC 74138 is used for cascading. For cascading 2 IC’s ,the
enable i/p G1 of first IC is connected to G1 enable i/p of second IC through a NOT gate. This
enable i/p is used as MSB select i/p line A3. the other three select input lines of both IC’s
(A0,A1,A2) are also shorted to select input lines of second IC to get single i/p select lines
(A0,A1,A2).
The i/p line A3 is used to enable /disable the 2 IC 74138 decoders. When A3=0, first IC is
enabled and second is disabled. Thus the first decoder will generate minterms from 0000 to
0111 as o/p and the second decoder will generate nothing. When A3=1, the enable conditions
are reversed and thus second decoder IC will generate minterms 1000 to 1111.
INPUT OUTPUT
A2 A1 A0 DIFFERENC BORROW
E
A B C
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
Conclusion :In this way Decoder and its applications are studied, implemented & tested.
FAQ’s:
1. What is the difference between multiplexer & demultiplexer?
2. What is the difference between decoder & demultiplexer?
AIM: Design and implement 3 bit Up and 3 bit Down Asynchronous Counters using master
slave JK flip-flop IC 7476.
THEORY:
Counters : Counters are logical devices or registers capable of counting the no. of states or
no. of clock pulses arriving at its clock input where clock is a timing parameter arriving at
regular intervals of time, so counters can be also used to measure time & frequencies. They are
made up of flip flops. Where the pulse are counted to be made of it goes up step by step & the
o/p of the counter in the flip flop is decoded to read the count to its starting step after counting
n pulse incase of module counters.
Types of Counters:
1) Asynchronous counter.
2) Synchronous counter.
Asynchronous counter:
A digital counter is a set of flip flops. The flip flops are connected such that their combined
state at any time is binary equivalent to the total no. of pulses that have occurred up to that time.
Thus its name implies a counter is used to count pulse. A counter is used as frequency dividers.
To obtain a waveform with frequency that is a specific fraction of clock frequency.
Counter may be Asynchronous or synchronous. The Asynchronous counter is
also called a ripple counter. An Asynchronous counter uses T flip flop to perform a counting
function. The actual hardware used is usually J-K flip flop with J & K connected to logic1.
Even D flip flops may be used here.
Fig. 1 shows 3bit Asynchronous Up Counter. Here Flip-flop 2 acts as a MSB Flip-flop and
Flip-flop 0 acts as a LSB Flip-flop. Clock pulse is connected to the Clock of Flip-flop 0. Output
of Flip-flop 0(Q0) is connected to the clock of the next flip-flop (i.e Flip-flop 1) and so on. As
soon as the clock pulse changes output is going to change (at the negative edge of clock pulse)
as a Up count sequence. The 3 bit Up counter state table is as shown below.
State Table :
Counter Count
States
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
Hardware requirements :
Gate /
IC Quantity
Flip flop Quantity
MS JK 3 7476 2
Waveforms:
Fig. 2 shows 2 bit Asynchronous Down Counter. Here Flip-flop 2 act as a MSB Flip-flop and
Flip-flop 0 act as a LSB Flip-flop. Clock pulse is connected to the Clock of Flip-flop 0. Output
of Flip-flop 0 (Q0’) is connected to clock of next flip-flop (i.e Flip-flop 1) and so on. As soon as
clock pulse changes output is going to change (at the negative edge of clock pulse) as a down
count sequence. For 3 bit down counter sate table is as shown below.
In both the counters Inputs J and K are connected to Vcc, hence J-K Flip flop work in toggle
mode. Preset and Clear both are connected to logic 1.
State Table :
Counter Count
States
Q2 Q1 Q0
7 1 1 1
6 1 1 0
5 1 0 1
4 1 0 0
3 0 1 1
2 0 1 0
1 0 0 1
0 0 0 0
7 1 1 1
Hardware requirements :
Gate /
IC Quantity
Flip flop Quantity
MS JK 3 7476 2
Applications :
Conclusion:
Up and down Asynchronous counters are successfully implemented, the counters are studied &
outputs are checked. The state table is verified.
THEORY:
Synchronous Counter :
When counter is clocked such that each flip flop in the counter is
triggered at the same time, the counter is called as synchronous counter.
The gates propagation delay at reset time will not be present or we may say will not occur.
1) Up counter.
2) Down counter.
The up counter counts from 0 to7 i.e.(000 to 111).for this we are using MS JK
flip flop. In IC 74LS76, 2 MS J-K flip flops are present. The clock pulse is given at pin 1 & 6 of
the 1st IC & pin 1 of 2nd IC. Next state decoder logic is designed with the help of a state table.
Present state Next state Flip flop Flip flop flip flop
3 2 1
Q Q Q Q Q Q J2 K2 J1 K1 J0 K0
2 1 0 2 2 0
0 0 0 0 0 1 0 x 0 x 1 x
0 0 1 0 1 0 0 x 1 x x 1
0 1 0 0 1 1 0 x x 0 1 x
0 1 1 1 0 0 1 x x 1 x 1
1 0 0 1 0 1 x 0 0 x 1 x
1 0 1 1 1 0 x 0 1 x x 1
1 1 0 1 1 1 x 0 x 0 1 x
1 1 1 0 0 0 x 1 x 1 x 1
K-Map :
Q1Q0 0 01 11 10
0
Q2
0 0 0 1 0
1 X X X X
J2= Q1Q0
0 X X X X
1 0 0 1 0
K2= Q1Q0
Q1Q0 0 01 11 10
0
Q2
0 0 1 X X
1 0 1 X X
J1= Q0
Q1Q0 0 01 11 10
0
Q2
0 X X 1 0
1 X X 1 0
K1= Q0
Q1Q0 0 01 11 10
0
Q2
0 1 X X 1
1 1 X X 1
J0= 1
0 X 1 1 X
1 X 1 1 X
K0= 1
Logic Diagram:
This is used to count from 7-0 i.e.(111-000).for this also 2 IC’s of 74LS76 are required & hence
we use 3 MS JK flip flops. Here also the clock is given to 1st& 6th pin of 1st IC &1st pin of 2nd IC
enabling the clock to apply to all flip flops at a time. Next state decoder logic is designed with
the help of a state table.
State table for synchronous down counter :
Present state Next state Flip flop Flip flop Flip flop
3 2 1
Q Q Q Q Q Q J2 K2 J1 K1 J0 K0
2 1 0 2 1 0
1 1 1 1 1 0 X 0 X 0 X 1
1 1 0 1 0 1 X 0 X 1 1 X
1 0 1 1 0 0 X 0 0 X X 1
1 0 0 0 1 1 X 1 1 X 1 X
0 1 1 0 1 0 0 X X 0 X 1
0 1 0 0 0 1 0 X X 1 1 X
0 0 1 0 0 0 0 X 0 X X 1
0 0 0 1 1 1 1 X 1 X 1 X
K-Map :
Q1Q0 0 01 11 10
0
Q2
0 1 0 0 0
1 X X X X
J2= Q1’Q0’
0 X X X X
1 1 0 0 0
K2= Q1’Q0’
Q1Q0 0 01 11 10
0
Q2
0 1 0 X X
1 1 0 X X
J1= Q0’
Q1Q0 0 01 11 10
0
Q2
0 X X 0 1
1 X X 0 1
K1= Q0’
Q1Q0 0 01 11 10
0
Q2
0 1 X X 1
1 1 X X 1
J0= 1
0 X 1 1 X
1 X 1 1 X
K0= 1
Logic Diagram :
Conclusion:
Up and down Synchronous counters are successfully implemented, the counters are studied &
outputs are checked. The state table is verified.
But in the Twisted ring counter the complementary output (Q bar) of the
last flip flop is fed back as an input to the first flip flop. Twisted Ring counters
are referred as MOD ‘2N’ counters.
OBJECTIVE: To study the Modulo ‘N’ counters in detail and check their design and working.
IC 7490 is a TTL MSI (medium scale integration) decade counter. It contains 4 master
slave flip flops internally connected to provide MOD-2 i.e. divide by 2 and MOD-5 i.e. divide
by 5 counters. MOD-2 and Mod-5 counters can be used independently or in cascading.
It is a 4-bit ripple type decade counter. The device consists of 4-master slave flip flops
internally connected to provide a divide by two and divide by 5 sections. Each section has a
separate clock i/p to initiate state changes of the counter on the high to low clock transition.
Since the o/p from the divide by 2 section is not internally connected to the succeeding
stages. The device may be operated in various counting modes. In a BCD counter the CP1 input
must be externally connected to QA o/p. The CP0i/p receives the incoming count producing a
BCD count sequence. It is also provided with additional gating to provide a divide by 2 counter
and binary counter for which the count cycle length is divide by 5. The device may be operated
in various counting modes.
There are 2 reset inputs R0(1) and R0(2) both of which need to be connected to the ‘logic
1’ for clearing all flip flops. Two set inputs R9(1) and R9(2) when connected to logic 1 are used
for setting counter to 1001 (BCD 9).
0 0
1 1
Q Q Q Coun
D C B t
0 0 0 0
0 0 1 1
0 1 0 2
0 1 1 3
1 0 0 4
The QA o/p the first flip flop is connected to the input B which is the clock i/p of
internal MOD-5 ripple counter. Due to cascading of Mod-2 and Mod-5 counters, the overall
configuration of the decade counters count from 0000 to 1001. After 1001 mod-5 resets to 0000
and next count after 1001 is 0000.
When QA o/p is connected to B i/p, we have the Mod-2 counter followed by Mod-5
counter. The count sequence obtained is shown in the table. It may be noted that QA changes
from 0 to 1 the state of Mod-5 counter doesn’t change, whereas when QA changes from 1 to 0
the Mod-5 counter goes to the next state.
QD Q Q Q Coun
C B A t
0 0 0 0 0
0 0 0 1 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
Mod-7 counter counts through seven states from 0 to 6 counters and it should reset as
soon as the count becomes 7. The o/p of reset logic should be 1 corresponding to invalid states.
The reset logic o/p should be applied to pin 2 and 3.
Truth Table of Reset Logic:
Q Q Q Q Y
D C B A
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 0
0 1 1 0 0
1 0 0 0 1
1 0 0 1 1
QD Q Q Q Coun
C B A t
0 0 0 0 0
0 0 0 1 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
For Mod-99 two IC 7490’s will be required. Hence to implement a divide by 99 counter
we have to use two decade counters IC’s. A divide by 99 counter counts 99 states from 0 to 98
and the counter should reset as soon as the count becomes 99. So in order to reset the counter of
99 connect the Q o/p which are equal to 1 in the count of 99 to an ‘And’ gate & then connect
and o/p to the reset i/p of both IC’s.
Conclusion: Hence we have studied the design and implementation of the MOD-N counter and
studied IC 7490 Decade counter(MOD-10). Further implemented MOD-7 and MOD-99
counters using IC 7490.
FAQs:
2. How will you use the 7490 IC to design a symmetrical divide by 10 frequency counter?
Binary counter – An N stage counter that recycles after 2 Ncount. The count proceeds in a
specified binary sequence.
Counter, Presetable- A counter which can be set to a desired value before the start of the
counting/
UP/Down counter – A counter that can count in both up and down direction depending upon a
control input.