Some Other Shift-and-Add Algorithms
Jean‐Michel Muller · Birkhäuser Boston eBooks · 2016
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. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.