Proceedings IEEE Symposium on FPGAs for Custom Computing Machines
DOI: 10.1109/fpga.1995.477421
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative analysis of floating point arithmetic on FPGA based custom computing machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
55
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 116 publications
(55 citation statements)
references
References 4 publications
0
55
0
Order By: Relevance
“…FP division algorithm [6,7,9] Floating point division involves the following steps: 6. Round the above result to the allowed number (24 bits) of mantissa bits.…”
Section: Check Resultant Exponent For Overflow/underflowmentioning
confidence: 99%
“…FP division algorithm [6,7,9] Floating point division involves the following steps: 6. Round the above result to the allowed number (24 bits) of mantissa bits.…”
Section: Check Resultant Exponent For Overflow/underflowmentioning
confidence: 99%
“…Much work in the past has been done on designing floating-point units on FPGAs [9]. Some of the work has concentrated on optimizing the large bitwidth fixed-point adder/multipliers, shifters, priority encoders etc.…”
Section: Related Workmentioning
confidence: 99%
“…To implement the division unit, a lookup table approach is used. This technique is faster and uses less energy compared with other division algorithms [11]. To calculate a/b, we first obtain 1/b via a lookup table and perform the multiplication a×(1/b).…”
Section: Optimizations For Time and Energy Efficiencymentioning
confidence: 99%