IOSR Journal of Electronics and Communication Engineering · 2013 · 21 citations · 11 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureData StructuresParallel ComputingHardware AccelerationParallel Prefix ComputationTiming AnalysisAdder DesignAddersCarry Lookahead AdditionKogge-stone Prefix NetworkLadner-fischer Prefix NetworkParallel Prefix CircuitsPrefix Adder DesignRipple-carry Logic
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.
11
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
A Regular Layout for Parallel Adders
Brent, Kung · IEEE Transactions on Computers · 1982 · 1.1K citations
IBM Journal of Research and Development · 1981 · 261 citations
A taxonomy of parallel prefix networks
David Harris · 2004 · 177 citations