Referenced Items are not available for this document.
Floating-point error is conducted for three algorithms commonly used for the calculation of two-dimensional fast Fourier transforms (FFTs), namely, the conventional row-column FFT, the vector-radix FFT, and the polynomial-transform FFT. The respective errors are determined both analytically and on the basis of computer simulation. Comparison shows that the vector-radix FFT and the polynomial-transform FFT, even though computationally more efficient than the row-column FFT, show approximately the same (and sometimes reduced) susceptibility to errors in floating-point arithmetic
Published in:
Circuits and Systems, IEEE Transactions on
(Volume:35
,
Issue:
1
)
Date of Publication: Jan 1988
- Page(s):
- 112 - 115
- ISSN :
- 0098-4094
- INSPEC Accession Number:
- 3133391
- Digital Object Identifier :
- 10.1109/31.1706
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1988
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
