Loading...
Loading...

Go to the content (press return)

High-radix division and square-root with speculation

Author
Cortadella, J.; Lang, T.
Type of activity
Journal article
Journal
IEEE transactions on computers
Date of publication
1994-08
Volume
43
Number
8
First page
919
Last page
931
DOI
https://doi.org/10.1109/12.295854 Open in new window
Repository
http://hdl.handle.net/2117/124902 Open in new window
URL
https://ieeexplore.ieee.org/document/295854 Open in new window
Abstract
The speed of high-radix digit-recurrence dividers and square-root units is mainly determined by the complexity of the result-digit selection. We present a scheme in which a simpler function speculates the result digit, and, when this speculation is incorrect, a rollback or a partial advance is performed. This results in operations with a shorter cycle time and a variable number of cycles. The scheme can be used in separate division and square-root units, or in a combined one. Several designs wer...
Citation
Cortadella, J., Lang, T. High-radix division and square-root with speculation. "IEEE transactions on computers", Agost 1994, vol. 43, núm. 8, p. 919-931.
Keywords
Digit recurrence, Division, Square-mot, Variable-time operation
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments