2013IOSR Journal of Electronics and Communication EngineeringOpen access

Design of 32 bit Parallel Prefix Adders

Priyanka Kumari

Open full text 21 citations

Abstract

In this paper, we propose 32 bit Kogge-Stone, Brent-Kung, Ladner-Fischer 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) 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 10.1i tool.By using these synthesis results, we noted the performance parameters like number of LUTs and delay.We compare these three adders in terms of LUTs (represents area) and delay values.

Open-access reader

About this research paper

What this paper is about

In this paper, we propose 32 bit Kogge-Stone, Brent-Kung, Ladner-Fischer 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) 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 10.1i tool.By using these synthesis results, we noted the performance parameters like number of LUTs and delay.We compare these three adders in terms of LUTs (represents area) and delay values.

Why it matters

OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we propose 32 bit Kogge-Stone, Brent-Kung, Ladner-Fischer 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) 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 10.1i tool.By using these synthesis results, we noted the performance parameters like number of LUTs and delay.We compare these three adders in terms of LUTs (represents area) and delay values.

Key concepts: Adder, Carry-save adder, Computer science, Arithmetic, Parallel computing, Serial binary adder, Digital signal processing, Electronic circuit

Related papers

Back to paper searchBrowse research topicsOriginal source
Design of 32 bit Parallel Prefix Adders — Research Paper | ScholarLens