This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Results in Fixed-Point Fast Fourier Transform Error Analysis
March 1977 (vol. 26 no. 3)
pp. 305-308
M. Sundaramurthy, Sir George Williams University
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.
Index Terms:
Decimation-in-frequency, decimation-in-time, FFT algorithms, roundoff errors, signal-to-noise ratio.
Citation:
M. Sundaramurthy, V.U. Reddy, "Some Results in Fixed-Point Fast Fourier Transform Error Analysis," IEEE Transactions on Computers, vol. 26, no. 3, pp. 305-308, March 1977, doi:10.1109/TC.1977.1674827
Usage of this product signifies your acceptance of the Terms of Use.