Some Results in Fixed-Point Fast Fourier Transform Error Analysis
- 1 March 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (3), 305-308
- https://doi.org/10.1109/TC.1977.1674827
Abstract
This correspondence presents some results in fixed-point error analysis of fast Fourier transform algorithms. Two kinds of schemes for preventing overflow are considered in the analysis. The results, obtained for the decimation-in-frequency form of the algorithm, are compared with those of decimation-in-time. The results show that the error performance of the decimation-in-frequency algorithm is better than that of decimation-in-time.Keywords
This publication has 3 references indexed in Scilit:
- Effects of finite register length in digital filtering and the fast Fourier transformProceedings of the IEEE, 1972
- A fixed-point fast Fourier transform error analysisIEEE Transactions on Audio and Electroacoustics, 1969
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967