Reciprocal and reciprocal square root units with operand modification and multiplication

DOI10.1007/S11265-006-4186-0zbMath1103.68306OpenAlexW2063893713MaRDI QIDQ2432144

Kent E. Wires, Michael J. Schulte

Publication date: 25 October 2006

Published in: Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11265-006-4186-0

zbMATH Keywords

Newton-Raphson iterationfunction approximationreciprocalcomputer arithmetictable lookupreciprocal square root

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Square-Rooting Algorithms for High-Speed Digital Circuits
• Hardware designs for exactly rounded elementary functions
• The Generation of Square Roots on a Computer with Rapid Multiplication Compared with Division
• On Division by Functional Iteration
• A Binary Multiplication Scheme Based on Squaring
• Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication

This page was built for publication: Reciprocal and reciprocal square root units with operand modification and multiplication