Wescon/96
DOI: 10.1109/wescon.1996.554588
|View full text |Cite
|
Sign up to set email alerts
|

Fixed-point math in time-critical C applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Since floating point operations are known to be computationally costly on standard PCs, we have implemented the same forward differencing technique using fixed point representation given enough padding for any overflow caused from accumulation operations. (For a description of the use of fixed point representation, see Kraeling, 1996). Floating point numbers such as the coefficients in Eqs.…”
Section: Real Time Image Alignmentmentioning
confidence: 99%
“…Since floating point operations are known to be computationally costly on standard PCs, we have implemented the same forward differencing technique using fixed point representation given enough padding for any overflow caused from accumulation operations. (For a description of the use of fixed point representation, see Kraeling, 1996). Floating point numbers such as the coefficients in Eqs.…”
Section: Real Time Image Alignmentmentioning
confidence: 99%