DS2020 Lab4
DS2020 Lab4
Laboratory Manual
Digital Systems
Experiment 4
1. INTRODUCTION
1.1 Goals:
Learn to build and use binary arithmetic circuits.
Understand the design procedure of Asynchronous Counter.
Design and implement basic Arithmetic circuits and Asynchronous Counters.
1.3 References:
Digital Systems: Principles and Applications (11th Edition) – Ronald J. Tocci, Neal S.
Widmer, Gregory L. Moss, 2010.
Lecture Slides/Videos – Assoc. Prof. Dr. Tran Ngoc Thinh.
1.4 Pre-laboratory:
Read this experiment carefully to become familiar with the procedural steps in this
experiment.
2
Digital Systems – Lab 4
2. EXPERIMENTAL PROCEDURE:
One major disadvantage of the Half Adder circuit when used as a binary adder, is that there is
no provision for a “Carry-in” from the previous circuit when adding together multiple data
bits. To overcome this problem, we use a Full Adder type binary adder circuit.
2.1.2 The Full Adder
Full adder is a combinational arithmetic circuit that performs an addition operation on three
1-bit binary numbers and generates a sum bit (S) and a carry bit (C) as the output. (The main
difference between the Full Adder and the Half Adder is that a full adder has a Carry-in
3
Digital Systems – Lab 4
input). The truth table, schematic representation and logic circuit of a full adder are shown in
the figure below.
In many ways, the full adder can be thought of as two half adders connected together, with
the first half adder passing its carry to the second half adder as shown in Figure 3.
4
Digital Systems – Lab 4
Figure 4 shows a 4-bit Ripple Carry Adder. Suppose we want to “add” together two 4-bit
numbers, the two outputs of the first full adder will provide the first place digit sum (S) of the
addition plus a carry-out bit that acts as the carry-in digit of the next binary adder.
IC 7483
4-bit full adder circuits are available as standard IC packages in the form of the TTL 4-bit
binary adder 74LS83 which can add together two 4-bit binary numbers and generate a SUM
and a CARRY output as shown.
5
Digital Systems – Lab 4
2.2 Counter
Counters are very widely used in almost all computers and other digital electronic systems.
A counter is a sequential logic circuit that goes through a prescribed sequence of states upon
the application of input pulses. For example,
The circuit that moves through the states 0, 1, 2, 3, 4, 5, 6 (then gets back to 0) is called a counter
The circuit that constantly moves through the following same order of state transfers 1, 0, 2, 5, 7
then gets back to 1 is also a counter (it is often accepted that a counter restarts when it reaches the
final number).
A Binary Counter is a hardware circuit that is made out of a series of flip-flops. It goes through
2N (N is the number of flip-flops in the series) states.
Modulus Counters (MOD counters), are defined based on the number of states that the
counter will sequence through before getting back to its original value. For example,
A 2-bit counter that counts from 002 to 112 in binary, that is 0 to 3 in decimal, has a modulus
value of 4 ( 00 → 1 → 10 → 11, and return back to 00 ) so would therefore be called a modulo-4,
or mod-4, counter.
6
Digital Systems – Lab 4
2. Determine the number of Flip-flops needed to support the number of states in the
counting sequence.
An asynchronous counter with n flip-flops can count 2𝑛 − 1 possible states.
2𝑛 − 1 ≥ 𝑡ℎ𝑒 # 𝑜𝑓 𝑠𝑡𝑎𝑡𝑒𝑠
E.g. to design a MOD-6 counter of which the total number of state is 6 (0002 1012 and getting
back to 0002), we have to design a circuit with at least 3 FFs
We can decode this output state of 1102 (6) to give us a signal to clear (CLR) the counter back to
zero with the help of AND gates and NOT gates.
7
Digital Systems – Lab 4
- Connect the output of reset circuit to the CLR or PRE signal of FFs
2.3 Exercise
2.3.1 Design and simulate a Full Adder built from Half Adders in Logisim.
2.3.2 Design, simulate and implement a 4-bit Ripple Carry Adder using IC 7483
2.3.3 Design, simulate and implement a MOD-10 Asynchronous UP Counter using J-K Flip-
flops (IC 7473).