2016
DOI: 10.1109/tc.2015.2448097
|View full text |Cite
|
Sign up to set email alerts
|

Performance/Power Space Exploration for Binary64 Division Units

Abstract: The digit-recurrence division algorithm is used in several high-performance processors because it provides good tradeoffs in terms of latency, area and power dissipation. In this work we develop a minimally redundant radix-8 divider for binary64 (doubleprecision) aiming at obtaining better energy efficiency in the performance-per-watt space. The results show that the radix-8 divider, when compared to radix-4 and radix-16 units, requires less energy to complete a division for high clock rates.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Many nonrestoring algorithms have been designed and implemented, but the SRT algorithm is the most implemented approach. The basic SRT algorithm was implemented in 5,9,12,18,20,25,42,51,62,68,[76][77][78][79][80][81][82][83] for different applications utilizing different aspects of the algorithm. Figure 10 illustrates the comparative analysis regarding the hardware resource utilization of the USP-Awadhoot division algorithm-based divider and other SRT-based radix-n dividers.…”
Section: It Is the Simplest Parallel Computing Algorithmmentioning
confidence: 99%
“…Many nonrestoring algorithms have been designed and implemented, but the SRT algorithm is the most implemented approach. The basic SRT algorithm was implemented in 5,9,12,18,20,25,42,51,62,68,[76][77][78][79][80][81][82][83] for different applications utilizing different aspects of the algorithm. Figure 10 illustrates the comparative analysis regarding the hardware resource utilization of the USP-Awadhoot division algorithm-based divider and other SRT-based radix-n dividers.…”
Section: It Is the Simplest Parallel Computing Algorithmmentioning
confidence: 99%
“…Consider dividend bit count as 4n and divisor bit count as n. We can represent dividends in terms of partitions based on associated weights. Then we can represent the dividend as the addition of number partition as (61)(62)(63)(64).…”
Section: ) Smaller Dividend Division Algorithmmentioning
confidence: 99%
“…Many non-restoring algorithms were designed and implemented, but the SRT algorithm is the most implemented. The basic SRT algorithm was implemented in [7], [11], [17], [51], [57], [63], [64], [67], [69], [71], [32], [74], [76], [78], [81] for different applications utilizing different aspects of algorithm.…”
Section: Implementation Statisticsmentioning
confidence: 99%