Abstract
The shift-and-add algorithms presented in the previous chapters 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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Muller, JM. (1997). Some Other Shift-and-Add Algorithms. In: Elementary Functions. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-2646-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2646-6_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-2648-0
Online ISBN: 978-1-4757-2646-6
eBook Packages: Springer Book Archive