Design and Study of Full Adder Circuit

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Design and study of full adder circuit

Aim:
To design and construct full adder circuit and verify the truth table using
logic gate.
Apparatus Required:
S.N. Component Quantity
1. Power Supply(5V) 1
2. Bread Board 1
3. IC-7483 1
4. Diode (4Red,1G 5
5. Resistor 13
6. Cords 23

Theory:
Adder circuit is a combinational digital circuit that is used for adding two numbers. A
typical adder circuit produces a sum bit (denoted by S) and a carry bit (denoted by C) as the
output. Typically adders are realized for adding binary numbers but they can be also realized for
adding other formats like BCD (binary coded decimal, XS-3 etc. Besides addition, adder circuits
can be used for a lot of other applications in digital electronics like address decoding, table index
calculation etc. Adder circuits are of two types: Half Adder ad Full Adder.

The simplest digital circuit which performs the binary addition operation on two binary digits
is called Half Adder. The addition of three binary digits is performed by Full Adder.

Full Adder:
A Full Adder is the digital Circuit which implements addition operation on three binary
digits. Two of the three binary digits are significant digits A and B and one is the carry input
(C-In) bit carried from the previous-less significant stage. Thus the Full Adder operates on
these three binary digits to generate two binary digits at its output referred to as Sum (SUM)
and Carry-Out (C-out).

The augends (number to which another number (the addend) is added) bits of ‘A’ and the
addend bits of ‘B’ are designated by subscript numbers from right to left, with subscript 0
denoting the least significant bits. The carries are connected in chain through the full adder.
The input carry to the adder is C0 and it ripples through the full adder to the output carry C4.

Consider the arithmetic addition of two decimal digits in BCD, together with an input carry
from a previous stage. Since each input digit does not exceed 9, the output sum cannot be
greater than 19, the 1 in the sum being an input carry. The output of two decimal digits must
be represented in BCD and should appear in the form listed in the columns.

Pin Diagram of IC7483:

Logic Diagram:

Circuit Diagram:
Truth Table:
Input Output
A B Cin S Cout
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

Boolean Expression:
𝐒 = 𝐀⨁𝐁⨁𝐂𝐢𝐧

𝐂𝐨𝐮𝐭 = 𝐀𝐁 + 𝐁𝐂𝐢𝐧 + 𝐀𝐂𝐢𝐧

Applications:
Full Adders finds applications in a lot of circuits which are comparatively
complex and carry out complex operations. Some of the common applications of the Full
Adder are listed as follows:

• Used in the ALU (Arithmetic Logic Unit) of the microprocessor


• Used in Ripple Carry Adders where it is employed to add n-bits at a time
• Used to calculate the addresses of memory locations inside the processor
• Used in simple logic control designs

You might also like