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.
KeywordsConvergence Domain High Radix Fractional Digit Small Silicon Area Real Exponential Function
Unable to display preview. Download preview PDF.