Very-high radix division with prescaling and selection by rounding

DOI10.1109/12.295853MaRDI QIDQ4419745zbMATH OpenOpenAlexWikidataFDO

Authors Milos D. Ercegovac, Tomas Lang, P. Montuschi

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.295853

zbMATH Keywords

computer arithmeticredundant representation

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 3862439
• scientific article; zbMATH DE number 1542822
• A fast radix-4 division algorithm and its architecture
• Fast radix-2 division with quotient-digit prediction
• A radix-4 new Svobota-Tung divider with constant timing complexity for prescaling

Cited in

(10)

• Two suggestions for high-speed nonrestoring division
• Very-high radix CORDIC rotation based on selection by rounding
• A parametric error analysis of Goldschmidt's division algorithm
• scientific article; zbMATH DE number 3862439 (Why is no real title available?)
• A fast radix-4 division algorithm and its architecture
• High-radix division and square-root with speculation
• Choices of operand truncation in the SRT division algorithm
• scientific article; zbMATH DE number 1542822 (Why is no real title available?)
• Fast radix-2 division with quotient-digit prediction
• Pipelined area-efficient digit serial divider

This page was built for publication: Very-high radix division with prescaling and selection by rounding

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