i-manager Publications

A Survey on Brent-Kung, Han-Carlson and Kogge-Stone Parallel Prefix Adders for Their Area, Speed and Power Consumption

C. Ruth Vinutha*, M. Bharathi**, D. Divya***

*,*** PG Scholar, Department of Electronics and Communication Engineering, SVEC, Tirupati, Chitoor, India.

** Assistant Professor, Department of Electronics and Communication Engineering, SVEC, Tirupati, Chitoor, India.

Periodicity:September - November'2015
DOI : https://doi.org/10.26634/jcir.3.4.5929

Abstract

The Parallel Prefix Adder (PPA) is one of the fastest type of adders that had been created and developed from carry look ahead adders. Three common types of parallel prefix adders are Brent-Kung, Han-Carlson and Kogge-Stone adders. This research involves an investigation of the performances of these three adders in terms of computational delay, Power, Speed and design area. The investigation and comparison for these adders was conducted for a 16 bit size. By using the Xilinx 14.5 design software, the designs for Brent Kung, Han-Carlson and Kogge Stone adders were developed. Comparison of area, delay, speed and area for 16 bit Kogge Stone, Han-Carlson and Brent Kung adders show that the Kogge Stone adder is best in terms of speed and the reduced area is obtained from the Han-Carlson adder. The results and simulation are verified using Xilinx 14.5 software.

Keywords

Brent Kung (BK) Adder, Kogge Stone (KS) Adder, Han-Carlson (HC) Adder, Area, Speed, Power, Delay.

How to Cite this Article?

Vinutha, C. R., Bharathi, M., and Divya, D. (2015). A Survey on Brent-Kung, Han-Carlson and Kogge-Stone Parallel Prefix Adders for Their Area, Speed and Power Consumption. i-manager’s Journal on Circuits and Systems, 3(4), 37-41. https://doi.org/10.26634/jcir.3.4.5929

References

[1]. D. Esposito et al., (2015). “Variable Latency Speculative Han-Carlson Adder”. IEEE Transactions on Circuits and Systems, Vol. 62, No. 5, pp. 1353-1361.

[2]. Peter M. Kogge and Harold S. Stone, (1973). “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”. IEEE Trans. Computers, Vol. C-22, No. 8, pp. 786-793.

[3]. I. Koren, (2002). Computer Arithmetic Algorithms. AK Peters Series. Massachusetts:A K Peters.

[4]. S. G., Maddasani, R. B., and P. C. (2012). “Design and Implementation of carry Tree Adders using Low Power FPGA'S”. International Journal of Advanced Research in Computer Engineering & Technology, pp. 295-299.

[5]. T. Han and David A. Carlson, (1987). “Fast areath efficient VLSI adders”. In Proc. IEEE 8 Symp. Comput. Arith (ARITH), pp. 49-56.

[6]. R. P. Brent and M. T. Kung, (1982). “A regular layout for parallel adders”. IEEE Trans. Comput, Vol. C-31, No. 3, pp. 260-264.

[7]. R. Zimmemann, (1998). “Binary adder architectures force based VLSI and their synthesis”. Swiss Federal Institute of Technology, (ETH) Zurich, Zurich, Switzerland.

[8]. R. E. Ladner and M. J. Fischer, (1980). “Parallel prefix computation”. JCAM, Vol. 27, No. 4, pp. 831-838.

[9]. S. Knowles, (2001). “A Family of Adders”. Proc. 15 IEEE Symposium on Computer Arithmetic, pp. 277-281.

[10]. Nurdiani Zamhari, Peter Voon, Kuryati Kipli, Kho Loe Chin and Husin, M. H. (2012). “Comparison of Parallel Prefix Adder (PPA)”. Proceedings of The World Congress on Engineering, pp. 816-818.

[11]. Sudhakar, S. M., Kumar P. Chidambaram and Swartzlande E. E (2012). “Hybrid Han-Carlson adder”. th Circuits and Systems (MWSCAS), 2012 IEEE 55 International Midwest Symposium, pp. 818-821.

A Survey on Brent-Kung, Han-Carlson and Kogge-Stone Parallel Prefix Adders for Their Area, Speed and Power Consumption

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25