Skip to main content

The Design of an Asynchronous Carry-Lookahead Adder Based on Data Characteristics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3728))

Abstract

Addition is the most important operation in data processing and its speed has a significant impact on the overall performance of digital circuits. Therefore, many techniques have been proposed for fast adder design. An asynchronous ripple-carry adder is claimed to use a simple circuit implementation to gain a fast average performance as long as the worst cases input patterns rarely happen. However, based on the input vectors from a number of benchmarks, we observe that the worst cases are not exceptional but commonly exist. A simple carry-lookahead scheme is proposed in the paper to speed up the worst-case delay of a ripple-carry adder. The experiment result shows the proposed adder is about 25% faster than an asynchronous ripple-carry adder with only small area and power overheads.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.: Computer arithmetic. In: Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers, San Francisco (1990)

    Google Scholar 

  2. Bedrij, O.J.: Carry-select adder. IRE Transactions on Electronic Computers EC-11, 340–346 (1962)

    Article  Google Scholar 

  3. MacSorley, O.L.: High-speed arithmetic in binary computers. IRE proceedings 49, 67–91 (1961)

    Article  MathSciNet  Google Scholar 

  4. Tuttini, S.: Optimal group distribution in carry-skip adders. In: Proceedings of the 9th Symposium on Computer Arithmetic, September 1989, pp. 96–103 (1989)

    Google Scholar 

  5. Martin, J.: Asynchronous datapaths and the design of an asynchronous adder. Formal Methods in System Design 1(1), 119–137 (1992)

    Article  Google Scholar 

  6. Garside, J.D.: A CMOS VLSI Implementation of an Asynchronous ALU. In: Proceedings of the IFIP Working Conference on Asynchronous Design Methodologies, Manchester, England (1993)

    Google Scholar 

  7. Nielsen, L.S., Sparsø, J.: A low-power asynchronous data-path of a FIR filter bank. In: Proceeding of Asyn 1996, pp. 197–207 (1996)

    Google Scholar 

  8. Sparsø, J., Furber, S. (eds.): Principles of Asynchronous Circuit Design: A systems perspective. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  9. Zimmermann, R., Fichtner, W.: Low-Power Logic Styles: CMOS versus Pass- Transistor Logic. IEEE Journal Of Solid State Circuits 32(7), 1079–1090 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Furber, S. (2005). The Design of an Asynchronous Carry-Lookahead Adder Based on Data Characteristics. In: Paliouras, V., Vounckx, J., Verkest, D. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2005. Lecture Notes in Computer Science, vol 3728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556930_66

Download citation

  • DOI: https://doi.org/10.1007/11556930_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29013-1

  • Online ISBN: 978-3-540-32080-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics