Skip to main content

Logarithmic Number System for Low-Power Arithmetic

  • Conference paper
  • First Online:
Integrated Circuit Design (PATMOS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1918))

Abstract

In this paper, properties of the Logarithmic Number System (LNS) are investigated which can lead to power savings in a digital system. To quantitatively establish power savings, the equivalence of an LNS to a linear fixed-point system is, initially, explored and a related theorem is introduced. It is shown that LNS leads to reduction of the average bit assertion probability by more than 50%, in certain cases, over an equivalent linear representation. Finally, the impact of LNS on hardware architecture and, by means of that, to power dissipation, is discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. P. Chandrakasan and R. W. Brodersen, Low Power Digital CMOS Design. Boston: Kluwer Academic Publishers, 1995.

    Google Scholar 

  2. B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs. New York: Oxford University Press, 2000.

    Google Scholar 

  3. K. Parhi, VLSI Digital Signal Processing Systems. New York: Wiley-In terscience, 1999.

    Google Scholar 

  4. W. L. Freking and K. K. Parhi, “Low power properties of Residue Number System processors”, IEEE Transactions on Circuits and Systems-Part II. To appear.

    Google Scholar 

  5. E. Swartzlander and A. Alexopoulos, “The sign/logarithm number system”, IEEE Transactions on Computers, December 1975.

    Google Scholar 

  6. I. Koren, Computer Arithmetic Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1993.

    Google Scholar 

  7. T. Stouraitis, Logarithmic Number System: Theory, Analysis and Design. PhD thesis, University of Florida, 1986.

    Google Scholar 

  8. P. Z. Peebles, Jr., Probability, Random Variables, and Random Signal Principles. New York: McGraw-Hill, 1987.

    Google Scholar 

  9. I. Orginos, V. Paliouras, and T. Stouraitis, “A novel algorithm for multi-operand Logarithmic Number System addition and subtraction using polynomial approximation”, in Proceedings of the 1995 IEEE International Symposium on Circuits and Systems (ISCAS’95), pp. III.1992–III.1995, 1995.

    Google Scholar 

  10. V. Paliouras and T. Stouraitis, “A novel algorithm for accurate logarithmic number system subtraction”, in Proceedings of the 1996 IEEE Symposium on Circuits and Systems (ISCAS’96), vol. 4, pp. 268–271, May 1996.

    Google Scholar 

  11. F. Taylor, R. Gill, J. Joseph, and J. Radke, “A 20 bit Logarithmic Number System processor”, IEEE Transactions on Computers, vol. 37, pp. 190–199, Feb. 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paliouras, V., Stouraitis, T. (2000). Logarithmic Number System for Low-Power Arithmetic. In: Soudris, D., Pirsch, P., Barke, E. (eds) Integrated Circuit Design. PATMOS 2000. Lecture Notes in Computer Science, vol 1918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45373-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45373-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41068-3

  • Online ISBN: 978-3-540-45373-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics