A Novel VLSI Design On CSKA Of Binary Tree Adder With Compaq Area And High Throughput

Ms. M. Deepika, Ms. VVVSSS Harini


Addition is one of the most basic operations performed in all computing units, including microprocessors and digital signal processors. It is also a basic unit utilized in various complicated algorithms of multiplication and division. Efficient implementation of an adder circuit usually revolves around reducing the cost to propagate the carry between successive bit positions. Multi-operand adders are important arithmetic design blocks especially in the addition of partial products of hardware multipliers. The multi-operand adders (MOAs) are widely used in the modern low-power and high-speed portable very-large-scale integration systems for image and signal processing applications such as digital filters, transforms, convolution neural network architecture. Hence, a new high-speed and area efficient adder architecture is proposed using pre-compute bitwise addition followed by carry prefix computation logic to perform the three-operand binary addition that consumes substantially less area, low power and drastically reduces the adder delay. Further, this project is enhanced by using Modified carry bypass adder to further reduce more density and latency constraints. Modified carry skip adder introduces simple and low complex carry skip logic to reduce parameters constraints. In this proposal work, designed binary tree adder (BTA) is analyzed to find the possibilities for area minimization. Based on the analysis, critical path of carry is taken into the new logic implementation and the corresponding design of CSKP are proposed for the BTA with AOI, OAI.


S. Yu and E. E. Swartzlander, “DCT implementation with distributed arithmetic”, IEEE Transactions on Computers, vol. 50, no. 9, pp. 985–991, Sept. 2001.

T.-S. Chang, C. Chen, and C.-W. Jen, “New distributed arithmetic algorithm and its application to IDCT,” IEE Proceedings Circuits, Devices and Systems, vol. 146, no. 4, pp. 159–163, Aug. 1999.

T.-S. Chang and C.-W. Jen, “Hardware-efficient implementations for discrete function transforms using LUT-based FPGAs,” IEE Proceedings Circuits, Devices and Systems, vol.146, no. 6, pp. 309–315, Nov. 1999.

F. de Dinechin, H. D. Nguyen and B. Pasca, Pipelined FPGA Adders, LIP Research Report no. ensl00475780, Apr. 2010.

J. Hormigo, M. Ortiz, F. Quiles, F. J. Jaime, J. Villalba and E.L. Zapata, Efficient Implementation of CarrySave Adders in FPGAs, 20th IEEE international Conference on Application-Specific Systems, Architectures and Processors, pp. 207–210, Jul. 2009.

P. M. Martinez, V. Javier, and B. Eduardo, On the design of FPGA-based Multioperand Pipeline Adders, XII Design of Circuits and Integrated System Conference, 1997.

H. Parandeh-Afshar, P. Brisk, and P. Ienne, “Efficient Synthesis of Compressor Trees on FPGAs,” in Asia and South Pacific Design Automation Conference (ASPDAC). IEEE, 2008, pp. 138–143.

Xilinx Inc., Virtex-6 User Guide, 2009, http://www.xilinx.com/.

S. Xing and W. H. Yu, FPGA Adders: Performance Evaluation and Optimal Design, IEEE Design and Test of Computers, vol. 15, no. 1, pp. 24–29, Jan.- Mar. 1998.

R. D. Kenney and M. J. Schulte, “High-Speed Multioperand Decimal Adders”, IEEE Transactions on Computers, vol. 54, no. 8, pp. 953-963, Aug. 2005.

J. Villalba, J. Hormigo, J. M. Prades and E. L. Zapata, “On–line Multioperand Addition Based on On–line Full Adders∗”, in Proc. Int. Conf. on ApplicationSpecific Systems, Architecture Processors (ASAP'05), pp. 322-327, 2005

M. Ortiz, F. Quiles, J. Hormigo, F. J. Jaime, J. Villalba, and E. L. Zapata, “Efficient Implementation of CarrySave Adders in FPGAs,” in IEEE International Conference on Application-specific Systems Architectures and Processors (ASAP), 2009, pp. 207– 210.

W. Kamp, A. Bainbridge-Smith, and M. Hayes, “Efficient Implementation of Fast Redundant Number Adders for Long Word- Lengths in FPGAs,” in 2009 International Conference on Field- Programmable Technology (FPT). IEEE, 2009, pp. 239–246.

J. Hormigo, J. Villalba, and E. L. Zapata, “Multioperand Redundant Adders on FPGAs,” submitted to IEEE Transactions on Computers, vol. 62, no. 10, pp. 2013– 2025, 2013.


S. Singh and D. Waxman, “Multiple Operand Addition and Multiplication”, IEEE Transactions on Computers, vol. C-22, no. 2, pp. 113-120, Feb. 1973.

C. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Transactions on Electronic Computers, no. 1, pp. 14– 17, 1964.

L. Dadda, “Some Schemes For Parallel Multipliers,” Alta Frequenza, vol. 45, no. 5, pp. 349–356, 1965.

A. Omondi and B. Premkumar, Residue Number Systems: Theory and Implementation. Imperial College Press, 2007.

A. R. Meo, “Arithmetic Networks and Their Minimization Using a New Line of Elementary Units,” submitted to IEEE Transactions on Computers and currently under review, vol. C-24, no. 3, pp. 258– 280, 1975.

K.A.C. Bickerstaff, M. Schulte, and E.E. Swartzlander, “Reduced area multipliers,” in Application-Specific Array Processors, 1993

Suhas B. Shirol, S. Ramakrishna and Rajashekar B. Shettar, “Design and Implementation of Adders and Multiplier in FPGA Using ChipScope: A Performance Improvement”, Information and Communication Technology for Competitive Strategies pp 11-19, 31 August 2018

Duncan J. M. Moss , David Boland, and Philip H. W. Leong, “A Two-Speed, Radix-4, Serial–Parallel Multiplier”, IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, ( Volume: 27 , Issue: 4 , April 2019 ) Page no. 769 – 777.

Martin Kumm and Johannes Kappauf.” Advanced Compressor Tree Synthesis for FPGAs”, IEEE Transactions on Computers ( Volume: 67 , Issue: 8 , Aug. 1 2018).

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.