A fast carry chain adder using Instantiation design entry on Virtex-5 FPGA
Nagapuri Srinivas, Puli Kishore Kumar
Abstract
Nagapuri Srinivas, Puli Kishore Kumar
Abstract
This paper presents the fast carry chain adder using Instantiation design entry which facilitates the direct design of the components through exact placement of the individual blocks in FPGA. The basic n-bit adder is divided into n/3 number of ripple carry adders with carry inputs generated from separate carry generator. The carry generator is designed on LUT by using all the six inputs with 100% utilization. A 64 bit adder is designed and observed that the proposed scheme is 120.11% and 31.05% faster than the standard carry chain adder and DSP based adder respectively.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents the fast carry chain adder using Instantiation design entry which facilitates the direct design of the components through exact placement of the individual blocks in FPGA. The basic n-bit adder is divided into n/3 number of ripple carry adders with carry inputs generated from separate carry generator. The carry generator is designed on LUT by using all the six inputs with 100% utilization. A 64 bit adder is designed and observed that the proposed scheme is 120.11% and 31.05% faster than the standard carry chain adder and DSP based adder respectively.
Key concepts: Adder, Carry (investment), Carry-save adder, Serial binary adder, Computer science, Field-programmable gate array, Computer hardware, Digital signal processing