Design & implementation of wallace tree multiplier and kogge stone adder

ISSN: 22498958
Citations of this article
Mendeley users who have this article in their library.


An increment in demand of portable devices makes low power device design and becomes an important field of research. Delay is one of the main design objective in integrated circuits after power. Three parameters which are power, area, and delay are always trade off. However speed and area are usually conflicting constraints, so that speed improvement results mostly in larger area. The multiplication and addition of two binary numbers are the most frequently and fundamental used arithmetic operations in microprocessors, data-processing application specific integrated circuits and digital processors. This research work will focuses on analyzing the delay of a Wallace tree multiplier and a Kogge Stone Adder by optimizing their circuits to increase the speed of the different digital circuits which are used in computations. Multipliers and adders are most important part in the digital processing or other applications. Therefore, multipliers and adders should be designed in such a way that their speed would be high and delay would be low. There are many attempts have been made to reduce the partial products which are generated in the multiplications and by using booth algorithm, whereas Wallace tree carry save adder structure have been used to sum the partial products to reduce time. In the full paper, the full implementation and simulation results will be discussed. Greatresults have beenachieved and comparison study has also been done with previous research work.




Gulliya, N., Baliyan, A., & Raj, G. (2019). Design & implementation of wallace tree multiplier and kogge stone adder. International Journal of Engineering and Advanced Technology, 8(5), 1392–1394.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free