Abstract
Division and square root, based on the digitrecurrence
algorithm, can be implemented in a combined unit.
Several implementations of combined division/square root units
have been presented mostly for radices 2 and 4. Here, we
present a combined radix-16 unit obtained by overlapping
two radix-4 result digit selection functions, as it is normally
done for division only units. The latency of the unit is
reduced by retiming and low power methods are applied as
well. The proposed unit is compared to a radix-4 combined
division/square root unit, and to a radix-16 unit, obtained
by cascading two radix-4 stages, which is similar to the one
implemented in a state-of-the-art processor.
| Original language | English |
|---|---|
| Title of host publication | 2011 20th IEEE Symposium on Computer Arithmetic (ARITH) |
| Publisher | IEEE |
| Publication date | 2011 |
| Pages | 169-176 |
| ISBN (Print) | 978-1-4244-9457-6 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 20th IEEE Symposium on Computer Arithmetic - Tübingen, Germany Duration: 25 Jul 2011 → 27 Jul 2011 Conference number: 20 https://ieeexplore.ieee.org/xpl/conhome/5991607/proceeding |
Conference
| Conference | 20th IEEE Symposium on Computer Arithmetic |
|---|---|
| Number | 20 |
| Country/Territory | Germany |
| City | Tübingen |
| Period | 25/07/2011 → 27/07/2011 |
| Internet address |
| Series | Proceedings of the Symposium on Computer Arithmetic |
|---|---|
| ISSN | 1063-6889 |
Fingerprint
Dive into the research topics of 'Radix-16 Combined Division and Square Root Unit'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver