Low Power Parallel Prefix Adder

Abstract:

Addition is a fundamental operation of all Arithmetic and Logic Units (ALU).The speed of addition operation decides the computational frequency of ALU. In order to improve the performance of the binary adder, the parallel prefix adder are preferred. There are various parallel prefix adders available. This work focuses on designing 8-bit prefix adders such as Brent Kung ,Kogge Stone and Sklansky adders using GDI technique. The performance of these GDI based prefix adders are compared with that of CMOS based prefix adder. GDI based prefix adders out performs CMOS based prefix adders in terms of power delay product (PDP). The design is implemented and simulated by DSCH2 and MICROWIND tool .The simulation result reveal about 31%,40% and 50 % of power saving is attained and the number of transistors also reduced.

• Periodical: Applied Mechanics and Materials (Volume 573)
• Pages: 194-200
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.573.194
• Online since: June 2014
• Authors: P. Kowsalya, M. Malathi, Palaniappan Ramanathan*
• Keywords: Brent Kung Adder, CMOS, GDI, Kogge Stone Adder, Parallel Prefix Adder, Power Delay Product, Sklansky Adder

References

[1] V. Ionescu, I. Bostan, & L. Ionescu, Systematic Design for Integrated Digital Circuit Structures, IEEE Journal of Semiconductor Conference, 2004, Volume 2, p.467 – 470, (2004).

DOI: 10.1109/smicnd.2004.1403050

[2] Kogge P & Stone H, A Parallel Algorithm For The Efficient Solution Of A Several Class Of Recurrence Solution, IEEE trans compu, C-22 (1973)786-793.

DOI: 10.1109/tc.1973.5009159

[3] Giorgos Dimitrakopoulos and Dimitric Nikolos, High Speed Parallel –Prefix VLSI Ling Adders, IEEE Trans on computers, Vol. 54, No. 2, Feb (2005).

DOI: 10.1109/tc.2005.26

[4] P. M. Kogge and H. S. Stone, A Parallel Algorithm For The Efficient Solution Of A General Class Of Recurrence Equations, Computers, IEEE Transactions on, vol. C-22, no. 8, pp.786-793, Aug. (1973).

DOI: 10.1109/tc.1973.5009159

[5] P.G. Clem J. Sklansky, Conditional-sum addition logic, Electronic Computers, IRE Transactions on, vol. EC-9, no. 2, pp.226-231, June (1960).

DOI: 10.1109/tec.1960.5219822

[6] Information. R. Brent and H. Kung, A regular layout for parallel adders, Computers, IEEE Transac-tions on, vol. C-31, no. 3, pp.260-264, March (1982).

DOI: 10.1109/tc.1982.1675982

[7] B. Nireesha, E. Mahender Reddy & S. Latha, Simulation of Tree Adder Designed With Complementary Path Adiabatic Logic, IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 3, Issue 4 (Nov. – Dec. 2013), PP 27-33.

DOI: 10.9790/4200-0342733

[8] SkalanskyJ, Conditional-Sum addition logic , IRE trans Electron compu, EC-9(1960)226-231.

[9] FPGAs David H. K. Hoe, Chris Martinez and Sri Jyothsna Vundavalli, Design and Characterization of Parallel Prefix Adders, IEEE 43rd Southeastern Symposium on system theory, March (2011).

DOI: 10.1109/ssst.2011.5753800

[10] Anitha R& V Bagyaveereswaran , High Performance Parallel Prefix Adders With Fast Carry Chain Logic, International Journal Of Advanced Research In Engineering and Technology (Ijaret) volume 3, issue 2, july-december (2012), pp.01-10.

[11] V. Ionescu, I. Bostan, & L. Ionescu, Systematic Design for Integrated Digital Circuit Structures, IEEE Journal of Semiconductor Conference, 2004, Volume 2, p.467 – 470, (2004).

DOI: 10.1109/smicnd.2004.1403050

[12] R. P Brent & H. T. Kung, A Regular Layout for Parallel Adders, IEEE Trans. Computers, Vol C-31, pp.260-264, (1982).

DOI: 10.1109/tc.1982.1675982

[13] M. M. Ziegler & M. R. Stan, A Unified Design Space for Regular Parallel Prefix Adders, IEEE Journal of Design, Automation and Test in Europe Conference and Exhibition, Volume 2, pp.1386-1387, (2004).

DOI: 10.1109/date.2004.1269100

[14] Dan Wang, Maofeng Yang, Wu Cheng, Xuguang Guan, Zhangming Zhu, Yintang Yang, 'Novel Low Power Full Adder Cells in 180nm CMOS Technology, IEEE ICIEA (2009).

DOI: 10.1109/iciea.2009.5138242