Abstract

Two operands addition is an essential unit in many embedded and digital signal processors as it is considered as the basic building block for other arithmetic operations. However, as one of the processor's performance issues, the carry propagation during the addition operation limits the speed of arithmetic operation. Thus, efficient adder design and implementation attracted many digital arithmetic designers especially those implemented for reconfigurable hardware such as Field Programmable Gate Array (FPGA) design. In this paper, we provide efficient FPGA implementations of five parallel prefix adders namely: Kogge-Stone Adder (KSA), Brent-Kung Adder (BKA), Han-Carlson Adder (HCA), Sklansky Adder (SkA), and Ladner-Fischer Adder (LFA) using Altera Cyclone IV as a target FPGA device. As a result, the comparison between different adders shows that KSA recorded the best values of critical path delay with 4.504 ns for 64 bits while BKA recorded the least design area results with 223 logic elements for the same bit length. Finally, the comparison with previous designs illustrates that the proposed adders' implementations have enhanced the performance over many state- of-the-art designs with even more than 200%.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.