Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient

DOI10.1049/IP-CDT:19941386MaRDI QIDQ4323589zbMATH OpenOpenAlexWikidataFDO

Authors P. Montuschi, Luigi Ciminiera, A. Giustina

Publication date 23 February 1995

Published in IEE Proceedings - Computers and Digital Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/ip-cdt:19941386

zbMATH Keywords

convergencedigit-by-digit algorithmsfast divisionNewton-Raphson methodperformances

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• High-precision division and square root
• A fast radix-4 division algorithm and its architecture
• Fast radix-2 division with quotient-digit prediction
• scientific article; zbMATH DE number 40800
• A novel implementation of radix-4 floating-point division/square-root using comparison multiples

Cited in

(4)

• Optimal value for the Newton-Raphson division algorithm
• Optimal initial approximations for the Newton-Raphson division algorithm
• A parametric error analysis of Goldschmidt's division algorithm
• Series expansion based efficient architectures for double precision floating point division

This page was built for publication: Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323589)