DocumentCode :
943067
Title :
Range and error analysis for a fast Fourier transform computed over ![Z[{\\omega }]](/images/tex/147.gif)
Author :
Cozzens, John H. ; Finkelstein, Larry A.
Volume :
33
Issue :
4
fYear :
1987
fDate :
7/1/1987 12:00:00 AM
Firstpage :
582
Lastpage :
590
Abstract :
A range and error analysis is developed for a discrete Fourier transform (fast Fourier transform) computed using the ring of cyclotomic integers. Included are derivations of both deterministic and statistical upper bounds for the range of the resulting processor and formulas for the ratio of the mean square error to mean square signal, in terms of the pertinent parameters. Comparisons of theoretical predictions with empirical results are also presented.
Keywords :
DFT; Discrete Fourier transforms (DFT´s); Residue arithmetic; Residue coding; Discrete Fourier transforms; Discrete transforms; Encoding; Error analysis; Fast Fourier transforms; Mean square error methods; Predictive models; Signal processing; Upper bound; Very large scale integration;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1987.1057322
Filename :
1057322
Link To Document :
