The equivalence of decimation in time and decimation in frequency in FFT computations (Q1107953): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0016-0032(87)90372-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2015425419 / rank | |||
Normal rank |
Revision as of 20:43, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The equivalence of decimation in time and decimation in frequency in FFT computations |
scientific article |
Statements
The equivalence of decimation in time and decimation in frequency in FFT computations (English)
0 references
1987
0 references
The author extends his data and error complexity concepts in real division-free floating-point computations [IEEE Trans. Comput. C-30, 758- 771 (1981; Zbl 0464.68047)] to complex floating-point computations inclusively matrix-vector products and applies them to the analysis of round-off error propagation in two different power-of-2 fast Fourier transform (FFT) algorithms - the decimation in time FFT and the decimation in frequency FFT. Both algorithms are shown to be ``equivalent'' (they produce the same error characteristics on output) under the assumption that all components of the input vector are ``equivalent'' as well. This theoretical result is very well evidenced with several numerical experiments and reaffirms previous conclusions based on statistical mean error behaviour.
0 references
data and error complexity
0 references
real division-free floating-point computations
0 references
complex floating-point computations
0 references
matrix-vector products
0 references
round-off error propagation
0 references
fast Fourier transform
0 references
statistical mean error behaviour
0 references