HALF ADDER

The half Adder operation needs two binary

inputs : augend and addend bits ;and two binary
outputs : sum and carry. The truth table shown
below gives the relation between inputs and
output variable for half-adder operation
 Half Adder

A B S C
0 0 0 0
1 0 1 0
0 1 1 0
1 1 0 1
 FOR S

A A
B 3 2

1 0
 For S

Y= AB +AB
 For C

Y= A B
 Full Adder

The full-adder is a combinational circuit that

forms arithmetic sum of three input bits. It
consist of three inputs and two outputs
 Full Adder
A B Cin S C
0 0 0 0 0

1 0 0 1 0

0 1 0 1 0

1 1 0 0 1

0 0 1 1 0

1 0 1 0 1

0 1 1 0 1

1 1 1 1 1
 For S

A A
B 3 7 6 2

1 5 4 0

C C C
 For S

Y= ABCin+ABCin+ABCin+ABCin
 A A
B 3 7 6 2

B 1 5 4 0

C C C
 For C

Y= AB + BCin+ ACin
 Half subtract or

A B D B
0 0 0 0
1 0 1 0
0 1 1 1
1 1 0 0
 For D

A A
B 3 2

1 0