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