International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 110 | Views: 209

Survey Paper | Electronics & Communication Engineering | India | Volume 3 Issue 6, June 2014

Delay Analysis of Parallel-Prefix Adders

Geeta Rani [4] | Sachin Kumar [15]

Abstract: Parallel-Prefix adders or Carry tree adders are the kind of adders that uses prefix operation in order to do efficient addition. Nowadays Parallel-Prefix adders are the frequently used adders due to the high speed computation properties. So called carry tree adder uses the prefix operation to do the arithmetic addition with way greater speed than the simple parallel adders that is ripple carry adder; carry skip adder; carry select adder etc. Here in this paper we will discuss about the various parallel-prefix adders and analyses there delay with respect to one another so that the fastest adder can be found and also the specific adder for a specific operation can be found. Therefore we will discuss the parallel-prefix adders and compare them in order to find the righteous one.

Keywords: Kogge-Stone adder, Brent-Kung adder, Ladner-Fischer adder, Han-Carlson adder, S Knowles adder, Sklansky Conditional-Sum adder

Edition: Volume 3 Issue 6, June 2014,

Pages: 2339 - 2342

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait