Design of a Carry Tree Adder

The core of every microprocessor and digital signal processor is its data path. The heart of data-path and addressing units in turn are arithmetic units which include adders. Parallel-prefix adders offer a highly efficient solution to the binary addition problem and are well suited for VLSI implementations. This paper investigates four types of carry-tree adders the Brent-Kung, Kogge-Stone, the Slansky and Han-Carlson adder and compares them to the simple Ripple Carry Adder (RCA). Due to the presence of a fast carry-chain, the RCA designs exhibit better delay performance up to 128 bits.

Resource Details

Provided by:
International Journal of Pure and Applied Research in Engineering and Technology (IJPRET)