2 November 1999 Efficient second-order approximations for reciprocals and square roots
Author Affiliations +
This paper presents a high-speed method for approximating reciprocals and square roots. This method is based on piecewise second-order Taylor expansion, yet it requires one third as many coefficients and has less delay. It can be implemented using a table lookup, a multiplication and a merged operation, which has approximately the same area and delay as a multiplication. The table lookup and merged operation are independent and can be performed in parallel. To reduce the overall hardware requirements, this method can share hardware with an existing multiplier.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kent E. Wires, Michael J. Schulte, "Efficient second-order approximations for reciprocals and square roots", Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); doi: 10.1117/12.367640; https://doi.org/10.1117/12.367640


Novel fast multiplier implemented using FPGA
Proceedings of SPIE (September 11 2015)
Invariant geometric hashing
Proceedings of SPIE (January 29 1999)
SIP-CCME cooperation in multimedia VoIP network
Proceedings of SPIE (October 12 2006)
Accurate fast Hankel matrix solver
Proceedings of SPIE (December 01 1991)

Back to Top