Abstract
The shift-and-add algorithms presented in Chapters 8 and 9 allow us to obtain an n-bit approximation of the function being computed after about n iterations. This property makes most of these algorithms rather slow; their major interest lies in the simplicity of implementation, and in the small silicon area of designs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
More precisely, to the nearest integer in \(\{-10, \ldots , 10\}\) if \(n \ge 3\); in \(\{-8, \ldots , 8\}\) if \(n=2\).
- 2.
Since \(\bar{A}\),A, and \(\tilde{L}_n^x\) have at most \(p_1\) fractional digits, if \(\tilde{L}_n^x > \bar{A} - 2^{-p_1}\), then \(\tilde{L}_n^x \ge \bar{A}\).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this chapter
Cite this chapter
Muller, JM. (2016). Some Other Shift-and-Add Algorithms. In: Elementary Functions. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4899-7983-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7983-4_10
Published:
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4899-7981-0
Online ISBN: 978-1-4899-7983-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)