Also Available Domains Arithmetic Core|Xilinx ISE
In this project, a high-speed area-efficient adder technique is proposed to perform the three operands binary addition for efficient computation of modular arithmetic used in cryptography and PRBG applications
Three-operand binary adder is the basic functional unit to perform the modular arithmetic in various cryptography and Pseudo Random Bit Generator (PRBG) algorithms and also used in many applications. Carry Save Adder (CS3A) is the widely used technique to perform the three-operand addition.
In carry save adder at final stage uses ripple carry adder which will cause large critical path delay. Moreover, a parallel prefix two-operand adder such as Han-Carlson Adder (HCA) can also be used for three-operand addition that significantly reduces the critical path delay with more area complexity.
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 and less delay. The effectiveness of the proposed design is synthesized and simulated using Xilinx Vivado software.
Keywords: Arithmetic Circuits, Three-operand adder, Carry Save Adder (CSA), Han-Carlson Adder (HCA)
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.
Software Requirements:
Hardware Requirements: