High-Speed Area-Efficient VLSI Architecture of Three Operand Binary Adder

This paper proposes a novel high-speed three-operand binary adder architecture, namely the Han-Carlson adder, which mitigates the inherent limitations of traditional Carry Save Adders (CSAs). The CSA's drawbacks, including slow carry propagation and increased power consumption, are alleviated by the Han-Carlson adder's innovative prefix computation and carry lookahead architecture.The Han-Carlson adder's design exploits the benefits of prefix computation to generate the carry signals in parallel, thereby reducing the critical path delay. Furthermore, the carry lookahead mechanism enables the adder to propagate the carry signals rapidly, resulting in improved speed and reduced power consumption.The proposed Han-Carlson adder is specifically designed for high-performance digital systems, where fast and efficient addition of multiple operands is crucial. Simulation results demonstrate the superiority of the Han-Carlson adder over traditional CSAs, showcasing its potential as a high-speed and area-efficient solution for digital arithmetic applications. Keywords Han-Carlsonadder,Three-operand binary adder, CarrySave Adder (CSA) ,Prefix computation ,Carry lookahead architecture