Introduction to Shift-and-Add Algorithms

Jean-Michel Muller ()
Additional contact information
Jean-Michel Muller: CNRS, École Normale Supérieure de Lyon, Laboratoire de l’Informatique du Parallélisme (LIP)

Chapter Chapter 8 in Elementary Functions, 2016, pp 139-163 from Springer

Abstract: Abstract We present the simplest shift-and-add algorithms and the notions that will be useful for designing more sophisticated algorithms.

Keywords: Correct Choice; Number System; Correction Step; Division Algorithm; Convergence Domain (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4899-7983-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9781489979834

DOI: 10.1007/978-1-4899-7983-4_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().