Beruflich Dokumente
Kultur Dokumente
NAME : TAMILSELVAN.R DEPT. : M.E. VLSI DESIGN(1ST YEAR) SUBJECT : VLSI DESIGN TECHNIQUES DATE : 16.11.2013
CARRY-SAVE ADDERS
Carry-Skip Adder is also called as Carry-bypass Adder To speed up operation, propagation is skipped to position i without waiting for rippling
Carry-skip logic is added to each block to detect when carry-in the block can be passed directly to the next block
If each block is 4bits, Group carry propagate signal is P(i+3:i)=Pi+(3Pi+2Pi+Pi) Carry out of this group is Cout= Ci+4+P(i+3:i)Ci
Where, Ci is Carry in Performance of Carry-Skip Adder is calculated by number of bits in each group N bit adder using n.k bit groups tskip=tpg+2(n-1)+(k-1)tAO+ txor
At the bit level, the adder delay increases from least significant 0-th position upward, with (n-1)th requiring the most complex logic
Higher order groups adds word segments an-1an/2 and bn-1.bn/2 The carry out cn/2 produced by the sum of lower order word segments a(n/2)-1a0 and b(n/2)-1b0 Only two possibilities off carry bit cn/2=0 and cn/2=1 Use two 4 bit adder on upper words, one for each possibility, Mux is used to valid result
Example:
The carry bit C4 from the adder L is used as Mux select signal(Fig:12.35) If, C4=0, the result of U0 sent to output C4=1, the result of U1 sent to output Advantage:
Dis Advantage:
Cost is high High area consumption
Adder(FA)
Avoids delay in carry out bits Faster than the normal adders
Example:
This starts with 7 n-bit words(a, b, c,g) Use 5 Carry Save Adders to reduce it down to 2 words Carry propagate adder used to add the final sum of these two words
1.
2.
3.
Introduction to VLSI Circuits and Systems by John P. Uyemura, 2002. Introduction to VLSI Systems A Logic Circuit and System Perspective by Ming-Bo Lin CMOS VLSI Design, A Circuits and Systems Perspective 3rd Edition by Neil H. E. Weste