Abstract
ALU is at the core of each and every processing unit, as well as the adder circuit would be at the core of any ALU. The adder performs subtraction and is the fundamental component of multipliers’ circuitry. Due to the fact that additions are the most basic arithmetic function and adder has become the most essential arithmetic part of the processing unit, the topic of VLSI arithmetic must have captivated numerous modern VLSI researchers over the decades. Numerous conventional and creative ways have been developed over the years to maximize the efficiency of the addition in latency, energy consumption, and area. This article reviews a few classical addition methods, evaluates their efficiency, and afterwards assesses and analyses the performance of different parallel prefix adders. These prefix adders have become currently the most effective method for DSP processors. The objective is to choose the optimal adder from among those presented for a specific application in terms of on-chip power usage, resource use, and computation speed. The adders have been designed in Verilog HDL using Vivado Design Suite on Xilinx ZYNQ-7000 series SoCs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Oklobdzija VG, VLSI arithmetic. University of California. [Online] Available: http://www.ece.ucdavis.edu/acsel
Parhami B, Computer arithmetic. Oxford University Press. ISBN: 978-0-19-532848-6
Abbas K, Handbook of digital CMOS technology, circuits and systems. Springer, ISBN: 978-3-030-37194-4
Kanaka Durga T, Nagaraju CH (2015) Implementation of carry select adder with Area-Delay-Power and efficiency. Int J Sci Eng Tech Res 11916–11920
Veeramachaneni S (2015) Design of efficient VLSI arithmetic circuits. International Institute of Information Technology, Hyderabad. [Online] Available: https://shodhganga.inflibnet.ac.in/handle/10603/45300
Kilburn T, Edwards DBG, Aspinall D (1959) Parallel addition in digital computers: a new fast carry circuit. In: Proceedings of IEE, vol 106, pt. B, p 464
Kogge P, Stone H (1973) A parallel algorithm for the efficient solution of a general class of recurrence relations. IEEE Trans Comput C-22(8):786–793
Brent RP, Kung HT (1982) A regular layout for parallel adders. IEEE Trans Comput C-31(3):260–264
Han T, Carlson D (1987) Fast area-efficient VLSI adders. In: Proceedings of 8th symposium computer arithmetic, pp 49–56
Ladner R, Fischer M (1980) Parallel prefix computation. J ACM 27(4):831–838
Choi Y (2004) Prallel prefix adder design. The University of Texas at Austin. [Online] Available: https://repositories.lib.utexas.edu/handle/2152/1300
Knowles S (2001) A family of adders. In: Proceedings of 15th IEEE symposium computer arithmetic, pp 277–281
Xilinx (2020) Vivado design suite user guide, UG904 (v2020.1). [Online] Available: https://www.xilinx.com/support/documentation/sw_manuals/xilinx2020_1/ug904-vivado-implementation.pdf
AVNET (2014) ZedBoard hardware user’s guide, v2.2. [Online] Available: http://zedboard.org/sites/default/files/documentations/ZedBoard_HW_UG_v2_2.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Fayaz Begum, S., Kavya Sree, M., Amzadhali, S., Venkata Sai Sushma, J., Sai Kumar, S. (2023). Analysis of the Efficiency of Parallel Prefix Adders. In: Kumar, A., Mozar, S., Haase, J. (eds) Advances in Cognitive Science and Communications. ICCCE 2023. Cognitive Science and Technology. Springer, Singapore. https://doi.org/10.1007/978-981-19-8086-2_11
Download citation
DOI: https://doi.org/10.1007/978-981-19-8086-2_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-8085-5
Online ISBN: 978-981-19-8086-2
eBook Packages: Computer ScienceComputer Science (R0)