Range and error analysis for a fast Fourier transform computed over Zω

  • Authors:
  • J. H. Cozzens;L. A. Finkelstein

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1987

Quantified Score

Hi-index 754.85

Visualization

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.