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

DOI10.1016/0016-0032(87)90372-3MaRDI QIDQ1107953zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
• Floating point error analysis of two-dimensional, fast Fourier transform algorithms
• An improved fast Fourier transform algorithm using mixed frequency and time decimations
• Some results in fixed point error analysis of the Bruun-FTT algorithm
• Fast and precise Fourier transforms

Cites work

• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
• A Round-Off Error Model with Applications to Arithmetic Expressions
• Accumulation of Round-Off Error in Fast Fourier Transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• Fast Algorithms for Partial Fraction Decomposition
• Roundoff Error Analysis of the Fast Fourier Transform

This page was built for publication: The equivalence of decimation in time and decimation in frequency in FFT computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107953)