Introduction to Digital VLSI

Lecture 12
Dr. Shaeen Kalathil
Single-Bit Addition
A B A B

Half Adder S= Cout Full AdderS = Cout C

Cout = Cout = S
S
A B Cout S A B C Cout S
0 0 0 0 0
0 1 0 0 1
1 0 0 1 0
1 1 0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Single-Bit Addition
A B A B

Half Adder S = A B Cout Full AdderS = A  B  C Cout C

Cout = A B Cout = MAJ ( A, B, C ) S

S
A B Cout S A B C Cout S
0 0 0 0 0 0 0 0 0
0 1 0 1 0 0 1 0 1
1 0 0 1 0 1 0 0 1
1 1 1 0 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
 Addition of Binary Numbers
Full Adder. The full adder is the fundamental building block
of most arithmetic circuits:
ai bi

Cout Full Cin

Adder
si
The sum and carry outputs are described as:
si = ai bi ci + ai bi ci + ai bi ci + ai bi ci
ci +1 = ai bi ci + ai bi ci + ai bi ci + ai bi ci = ai bi + ai ci + bi ci
Full-Adder Implementation

Full Adder operations is defined by equations:

si = ai bi ci + ai bi ci + ai bi ci + ai bi ci = ai  bi  ci = pi  ci
ci +1 = ai bi ci + ai bi ci + ai bi = g i + pi ci ai bi

Carry-Propagate: pi = ai  bi
and Carry-Generate gi

g i = a i • bi
cout
cin
One-bit adder could be
implemented as shown

si
 Ripple-Carry Adder
• Chain 1-bit adders together
• Carry ripples through entire chain
• Disadvantage: slow

A31 B31 A30 B30 A1 B1 A0 B0

Cout Cin
+ C31 + C30 C2 + C1 +
S31 S30 S1 S0

20
Carry lookahead adder
 Carry-Lookahead Adder
• Some definitions:
– Generate (Gi) and propagate (Pi) signals for each column:
• A column will generate a carry out if Ai AND Bi are both 1.
Gi = Ai Bi
• A column will propagate a carry in to the carry out if Ai OR Bi is 1.

Pi = Ai + Bi
• The carry out of a column (Ci) is:
Ci+1 = Ai Bi + (Ai + Bi )Ci = Gi + Pi Ci

22
4-Bit CLA
Logic Diagram
Advantages –

•The propagation delay is reduced.

•It provides the fastest addition logic.

Disadvantages –

•The Carry Look-ahead adder circuit gets complicated as the number of variables
increase.
•The circuit is costlier as it involves more hardware.
Carry Select Adder
Carry Save Adder
Summary
Full adder: Study the truth table
Logic Equation to implement
Static CMOS implementation
Carry generate and carry propagate
Transmission gate implementation (All four circuit diagrams)
Ripple Carry Adder
Understand the concept and study the logic diagram in slide 19.
Carry look ahead adder
Understand the concept and implementation
Carry select adder
Understand the concept and implementation.
Carry save adder
Show with an example (binary inputs), how the carry save adder adds three inputs.
Understand the concept and implementation.