Fast Carry Propagating Cmos Full Adder
Original Publication Date: 1989-Jan-01
Included in the Prior Art Database: 2005-Jan-26
The circuit described hereafter has been designed to have a rather high carry propagation time when used in a ripple carry adder. A possible way to implement a Full Adder is to map the following equations into circuits with logic functions. - Sum = (A Xor B) Xor Cin - Cout = (A Xor B).Cin + A.B But this solution gives a rather slow carry propagation when the carry has to ripple from one bit to another. In the present approach, the logic tables have been mapped directly into design with transfer gates.