Some Other Shift-and-Add Algorithms

  • Jean-Michel Muller


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.


Convergence Domain High Radix Fractional Digit Small Silicon Area Real Exponential Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Jean-Michel Muller
    • 1
  1. 1.CNRS-Laboratoire LIPEcole Normale Superieure de LyonLyon Cedex 07France

Personalised recommendations