Implementation of 32-Bit Parallel Prefix Adders and Comparative Study forFastest Response
Chilaka Lydia, M. Ashok Kumar
Abstract
Chilaka Lydia, M. Ashok Kumar
Abstract
In this paper, we propose 32 bit Kogge-Stone, Spanning tree parallel prefix adders. In general N-bit adders like Ripple Carry Adders (slow adders compare to other adders), and Carry Look Ahead adders (area consuming adders) and Carry Save Adder are used in earlier days. But now the most Industries are using parallel prefix adders because of their advantages compare to other adders. Parallel prefix adders are faster and area efficient. Parallel prefix adder is a technique for increasing the speed in DSP processor while performing addition. We simulate and synthesis different types of 32-bit prefix adders using Xilinx ISE 14.7 tool. By using these synthesis results, we noted the performance parameters like number of area and delay. We compare these five adders in terms of LUTs (represents area) and delay values.
OpenAlex reports 1 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.
In this paper, we propose 32 bit Kogge-Stone, Spanning tree parallel prefix adders. In general N-bit adders like Ripple Carry Adders (slow adders compare to other adders), and Carry Look Ahead adders (area consuming adders) and Carry Save Adder are used in earlier days. But now the most Industries are using parallel prefix adders because of their advantages compare to other adders. Parallel prefix adders are faster and area efficient. Parallel prefix adder is a technique for increasing the speed in DSP processor while performing addition. We simulate and synthesis different types of 32-bit prefix adders using Xilinx ISE 14.7 tool. By using these synthesis results, we noted the performance parameters like number of area and delay. We compare these five adders in terms of LUTs (represents area) and delay values.
Key concepts: Adder, Carry-save adder, Parallel computing, Computer science, Arithmetic, Carry (investment), Prefix, Serial binary adder