Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-7nlkj Total loading time: 0 Render date: 2024-07-27T20:22:14.354Z Has data issue: false hasContentIssue false

5 - Fundamentals of digital arithmetic

Published online by Cambridge University Press:  03 May 2010

Ryan Kastner
Affiliation:
University of California, San Diego
Anup Hosangadi
Affiliation:
University of California, Santa Barbara
Farzan Fallah
Affiliation:
Stanford University, California
Get access

Summary

Chapter overview

This chapter describes some of the basic ideas in digital arithmetic that are necessary to understand the polynomial and linear system optimizations presented in the later chapters. The chapter is divided into five sections.Section 5.2 discusses elementary properties of number systems, focusing on binary number representations including signed digit representations. It provides a high-level overview of both fixed and floating point representations. Section 5.3 gives background material on two-operand addition including ripple carry, carry propagate, and pipelined addition architectures. Then Section 5.4 provides an overview of multiple-operand addition. It gives details on sequential and parallel carry propagate multiple-operand architectures, as well as redundant digit summations using carry save adders and other higher-order counters and compressors. The section ends with a discussion on distributed arithmetic architecture for multiple-operand summations that are typically found in dot product operations. Section 5.5 summarizes the chapter.

Basic number representation

Number representation plays an important role in the design of algorithms for digital arithmetic. This section provides a brief and concise discussion on number representations that serves as a basis for understanding the topics presented in this book. There are a number of textbooks on digital arithmetic that deal with these topics in great detail [1–3].

Properties of number systems

Before we consider specific number representations, we should discuss fundamental properties that can be used to characterize a number system.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ercegovac, M. D. and Lang, T., Digital Arithmetic. San Francisco, CA: Morgan Kaufmann Publishers, 2004.Google Scholar
Parhami, B., Computer Arithmetic: Algorithms and Hardware Designs. New York, NY: Oxford University Press, 2000.Google Scholar
Hwang, K., Computer Arithmetic: Principle, Architecture and Design. New York, NY: Wiley, 1979.Google Scholar
Knuth, D. E., The Art of Computer Programming/Seminumerical Algorithms, 2, second edition. Boston, MA: Addison-Wesley, 1981.Google Scholar
Booth, A. D., A signed binary multiplication technique, The Quarterly Journal of Mechanics and Applied Mathematics, 4, 235–40, 1951.CrossRefGoogle Scholar
Arno, S. and Wheeler, F. S., Signed digit representations of minimal Hamming weight, IEEE Transactions on Computers, C-42, 1007–10, 1993.CrossRefGoogle Scholar
Reitwiesner, G. W., Binary arithmetic, Advances in Computers, 1, 231–308, 1960.CrossRefGoogle Scholar
Parhami, B., Generalized signed-digit number systems: a unifying framework for redundant number representations, IEEE Transactions on Computers, 39, 89–98, 1990.CrossRefGoogle Scholar
Etiemble, D. and Navi, K., Algorithms and multi-valued circuits for the multioperand addition in the binary stored-carry number system, International Symposium on Computer Arithmetic, Ontario 1993. Ascafaway, AJ: IEEE, 1993.Google Scholar
IEEE, IEEE 754: Standard for Binary Floating-Point Arithmetic.
Schulte, M. J., Lindberg, N., and Laxminarain, A., Performance evaluation of decimal floating-point arithmetic, Proceedings of the 6th IBM Austin Center for Advanced Studies Conference, 2005. IBM, 2005.
Croisier, A., Esteban, D. J., Levilion, M. E., and Rizo, V., Digital filter for PCM encoded signals. United States Patent 3 777 130, December 3, 1973.Google Scholar
Zohar, S., The counting recursive digital filter, IEEE Transactions on Computers, C22, 328–38, 1973.CrossRefGoogle Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×