Paper
13 November 2000 Reciprocal approximation theory with table compensation
Albert A. Liddicoat, Michael J. Flynn
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Albert A. Liddicoat and Michael J. Flynn "Reciprocal approximation theory with table compensation", Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); https://doi.org/10.1117/12.406501
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Computing systems

Algorithms

Electrical engineering

Logic devices

Radon

Signal processing

RELATED CONTENT

High-speed floating-point divider with reduced area
Proceedings of SPIE (September 03 2009)
Scheduling Linearly Indexed Assignment Codes
Proceedings of SPIE (May 17 1989)
RNS bases and conversions
Proceedings of SPIE (October 26 2004)
Some improvements on RNS Montgomery modular multiplication
Proceedings of SPIE (November 13 2000)
Accurate fast Hankel matrix solver
Proceedings of SPIE (December 01 1991)

Back to Top