Share Email Print

Proceedings Paper

Reciprocal approximation theory with table compensation
Author(s): Albert A. Liddicoat; Michael J. Flynn
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Schwarz demonstrates the reuse of a multiplier partial product array (PPA) to approximate higher-order functions such as the reciprocal, division, and square root. This work presents techniques to decrease the worst case error for the reciprocal approximation computed on a fixed height PPA. In addition, a compensation table is proposed that when combined with the reciprocal approximation produces a fixed precision result. The design space for a 12-bit reciprocal is then studied and the area- time tradeoff for three design points is presented. Increasing the reciprocal approximation computation decreases the area needed to implement the function while increasing the overall latency. Finally, the applicability of the proposed technique to the bipartite ROM reciprocal table is discussed. The proposed technique allows hardware reconfigurability. Programmable inputs for the PPA allow the hardware unit to be reconfigured to compute various higher-order function approximations.

Paper Details

Date Published: 13 November 2000
PDF: 12 pages
Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); doi: 10.1117/12.406501
Show Author Affiliations
Albert A. Liddicoat, Stanford Univ. (United States)
Michael J. Flynn, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 4116:
Advanced Signal Processing Algorithms, Architectures, and Implementations X
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?