Scribd
Upload
7 views19 pages

Half & Full Adders

The document explains arithmetic circuits, focusing on half and full adders, which are essential for binary addition. Half adders have two inputs and produce a sum and carry output, while full adders have three inputs and can account for carry input. Additionally, it describes how multiple full adders can be combined to create a parallel adder circuit for adding multi-bit binary numbers.

Uploaded by

umerahmed20019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
7 views19 pages

Half & Full Adders

The document explains arithmetic circuits, focusing on half and full adders, which are essential for binary addition. Half adders have two inputs and produce a sum and carry output, while full adders have three inputs and can account for carry input. Additionally, it describes how multiple full adders can be combined to create a parallel adder circuit for adding multi-bit binary numbers.

Uploaded by

umerahmed20019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

ARITHMETIC CIRCUITS

HALF & FULL ADDERS


Adders
• An Adder is a type of digital circuit that
performs the operation of addition of numbers.

• Its main objective is addition of binary numbers,


but they can be used in various other
applications.

2
Types of Adders
• There are two types of Adders;
• One is Half Adder, and
• Other is Full Adder.
• They are the ‘Building Blocks’ of Arithmetic
Circuits.

3
Half Adder

• Half Adder has two inputs and two outputs. It can


add only two bits.

• Inputs are named as A and B, and the outputs are


named as Sum (S) and Carry (C).

• The Sum is obtained by X-ORing the inputs A and B.


• Carry is obtained by ANDing the inputs A and B

4
Half Adder Symbol

5
Half Adder Table

Inputs Outputs
A B Carry Sum
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0
Half Adder Circuit Design

• From the function table of HA, it is very


obvious that H.A’s Sum function can be
performed by simply a two i/p XOR Gate and
Carry function by a two i/p AND Gate, as
shown below.

7
Half Adder Circuit

8
Full Adder
• Full adder has three inputs and two outputs.
Three inputs are A and B, and C (the third
input is actually carry input CIN).

• The Sum output is named as SOUT and


the Carry output is named as COUT.

9
Full Adder Symbol

10
Full Adder Designing
• Full adder circuit can be implemented with the
help of two Half Adder circuits.
• The first half adder circuit is used to add A and
B to produce a partial sum.
• The second half adder logic is used to add CIN
to the partial sum produced by the first half
adder circuit.
• Finally, the S output is obtained.
Full Adder Designing

12
Full Adder Circuit

13
Full Adder Table
• Table Inputs Outputs
A B Carry in Carry out 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

14
F.A Circuit Designing
• F.A Circuit Designing can be done by the
method of H.A designing and by SOP, POS,
K Map Method

15
Parallel Adder Circuit
• 4 full adders can be cascaded to form a 4 bit
Parallel Adder Circuit, which can be used to
add two 4 bit numbers.
• More FAs can be used to make a bigger
Parallel Adder of more than 4 bits.
• The addition of the four bit numbers is shown
below.
• 4 + 3 = 7 = = = 0100 + 0011 = 0111
• 8 + 8 = 16 === 1000 + 1000 = 10000
16
Binary Addition
• The addition of the four bit numbers is shown
below.
• 4 + 3 = 7 = 0100 8 + 8 = 16 = 1000
• +0011 +1000
_____ _____
• 0111 (No Carry) 10000 (Carry)

17
Parallel Adder

18
Parallel Adder

19

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy