Scribd
Upload
18 views

EE-261Digital Logic Design: Islamic University

This document discusses binary adders and subtractors. It describes half adders, full adders, half subtractors, and full subtractors. A half adder is a basic building block that performs addition on two 1-bit binary numbers and outputs a sum and carry bit. A full adder handles three input bits - two bits to be added and a carry in bit. Full adders are used to perform multi-bit additions. Half and full subtractors are similar but perform subtraction operations, outputting a difference bit and borrow out bit. Logic diagrams and truth tables are provided to illustrate the circuit designs and functions of each component.

Uploaded by

Arshad Kv
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
18 views

EE-261Digital Logic Design: Islamic University

This document discusses binary adders and subtractors. It describes half adders, full adders, half subtractors, and full subtractors. A half adder is a basic building block that performs addition on two 1-bit binary numbers and outputs a sum and carry bit. A full adder handles three input bits - two bits to be added and a carry in bit. Full adders are used to perform multi-bit additions. Half and full subtractors are similar but perform subtraction operations, outputting a difference bit and borrow out bit. Logic diagrams and truth tables are provided to illustrate the circuit designs and functions of each component.

Uploaded by

Arshad Kv
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/ 11

Islamic University

EE-261Digital Logic
Design
Binary adders and
subtractors

Functional Block: Half-Adder

A 2-input, 1-bit width binary adder that performs the


following computations:
X
0
0
1
1
+Y
+0
+1
+0
+1
CS
00
01
The sum is expressed as a
sum bit , S and a carry bit, C
The half adder can be specified as a
truth table for S and C

01

10

X Y

0
0
1
1

0
0
0
1

0
1
1
0

0
1
0
1

Logic Diagram-Half adder

Full adder

A full adder is combinational circuit that forms the arithmetic sum


of three input bits. It consists of three inputs and two outputs.

Two of the input variable represented by x and y. The third input Z


represent s the carry from previous lower significant position.

Full adder

Logic Diagram-Full adder

Half Subtractor
Subtracting a single-bit binary value Y from anther X (I.e. X -Y ) produces a
difference bit D and a borrow out bit B-out.
XY

1
o
o
o

o
o

1 0 0
D(X,Y) = (1,2)
D = XY + XY
D = XY
B= (1)
B = XY

Logic Diagram-Half Subtractor

Full Subtractor

The circuit has three inputs and two outputs. The three inputs X, Y,
Z denote the minuend, subtrahend, and previous borrow
respectively. The two outputs D and B represent the difference and
output borrow, respectively.

Easy way to write the truth table


B=1 if (X<Y+Z)
D=X-Y-Z (Dont bother about sign),If B=0
D=(2+X)-Y-Z, If B=1

Outputs

Inputs

X
0
0
0
0
1
1
1
1

Y
0
0
1
1
0
0
1
1

Z
0
1
0
1
0
1
0
1

D
0
1
1
0
1
0
0
1

B
0
1
1
1
0
0
0
1

D = XYZ + XYZ + XYZ + XYZ

B = XZ + XY + YZ

You might also like