An improved 32-bit carry-lookahead adder with Conditional Carry-Selection

An improved 32-bit carry-lookahead adder (CLA) with conditional carry-selection (CSS) is proposed in this paper. The new adder is compared with serial adder and pure carry-lookahead adder. The three adders is simulated in FPGA circuits, the results show that the propagation time of the carry of the new 32-bit adder is reduced 26% compared with Serial Adder and 3.17% with pure Carry-Lookahead Adder.