Showing papers on "Carry-lookahead adder published in 1982"

Relaxed pinout constraints yield improved parallel adders for VLSI-based systems

Abstract: Relaxation of pinout constraints on the msi-based carry lookahead adder algorithm leads to a refined implementation which requires fewer gates and increases the speed by 30percent. This is accomplished by increasing the level of parallelism in the algorithm. The revised algorithm and its implementation are discussed. 10 references.