The equivalence of decimation in time and decimation in frequency in FFT computations

DOI10.1016/0016-0032(87)90372-3zbMath0653.65034OpenAlexW2015425419MaRDI QIDQ1107953

Nai-Kuan Tsao

Publication date: 1987

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(87)90372-3

zbMATH Keywords

fast Fourier transformmatrix-vector productsround-off error propagationcomplex floating-point computationsdata and error complexityreal division-free floating-point computationsstatistical mean error behaviour

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Numerical methods for trigonometric approximation and interpolation (65T40)

Cites Work

• Unnamed Item
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
• Fast Algorithms for Partial Fraction Decomposition
• A Round-Off Error Model with Applications to Arithmetic Expressions
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Accumulation of Round-Off Error in Fast Fourier Transforms
• Roundoff Error Analysis of the Fast Fourier Transform