Proceedings. 2003 IEEE International Conference on Field-Programmable Technology (FPT) (IEEE Cat. No.03EX798)
DOI: 10.1109/fpt.2003.1275775
|View full text |Cite
|
Sign up to set email alerts
|

Double precision floating-point arithmetic on FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
1

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(11 citation statements)
references
References 4 publications
0
10
0
1
Order By: Relevance
“…For double precision, a new operation starts every 8 cycles instead of every cycle. Similar to divide, previous implementations of floating-point square root [Li and Chu 1997;Lee and Burgess 2002;Wang and Nelson 2003;Paschalakis and Lee 2003] all use simple digit serial algorithms.…”
Section: Related Workmentioning
confidence: 98%
See 1 more Smart Citation
“…For double precision, a new operation starts every 8 cycles instead of every cycle. Similar to divide, previous implementations of floating-point square root [Li and Chu 1997;Lee and Burgess 2002;Wang and Nelson 2003;Paschalakis and Lee 2003] all use simple digit serial algorithms.…”
Section: Related Workmentioning
confidence: 98%
“…However, it has long latency due to the iterative nature of the algorithm. A number of works [Lee and Burgess 2002;Wang and Nelson 2003;Paschalakis and Lee 2003;Underwood 2004;Govindu et al 2005;Thakkar and Ejnioui 2006] support IEEE single and double precision floating-point format. However, these designs use a digit-recurrence algorithm and exhibit long latency.…”
Section: Related Workmentioning
confidence: 99%
“…These modes are implemented by extending the relevant significands by three bits beyond their Least Significant Bit (LSB) L. These bits are referred to, from the most significant to the least significant, as "guard" (g), "round" (r) and "sticky" (st). The first two are normal extension bits, while the last one is the logical OR of all the bits that are lower than the r bit [13,14]. There are two cases:…”
Section: Rounding and Normalizingmentioning
confidence: 99%
“…In this paper, the pipelined designs of a double precision floating point divider and square root unit are presented. These two units are all IEEE 754 compliant based on the sequential designs presented in [5]. The pipelining of these units is based on unrolling the iterations of the digit recurrence computations and optimizing the operations within each unrolled iteration.…”
Section: Introductionmentioning
confidence: 99%