‘Instant’ Fourier transform

Buy article PDF
© The Institution of Electrical Engineers
Published 21/07/2012

Abstract

The fast Fourier transform andd the fast Walsh transform are too slow for some real-time applications. For binary data, an ‘instant’ Fourier transform is based on harmonic analysis in a space of 2n-tuples of 0s and 1s. Simple, modular logic finishes transforming 2n real-time serial binary data one clock pulse after the last datum arrives.

Inspec keywords: harmonic analysis; Fourier transforms

Other keywords: binary data; harmonic analysis; real time data processing applications; instant Fourier transform; modular logic

Subjects: Computational techniques; Other numerical methods; Other numerical methods

References

    1. 1)
      • Brigham, E.O.: , The fast Fourier transform, 1974 (Prentice-Hall)
    2. 2)
    3. 3)
      • Hewitt, E., Ross, K.A.: , Abstract harmonic analysis (SpringerBerlin)
    4. 4)
      • Gibbs, J.E.: `Eine Erweiterung der harmonischen Analyse auf den dyadischen Körper als Funktionenraum', Kolloquium über die Theorie und Anwendung diskrete Signale, 1976, TH Aachen, Kurzfassungen, p. 135–138
    5. 5)
      • Gibbs, J.E.: `Harmonic analysis in the dyadic field regarded as a function space', RSRE seminar, October 1976, p. 24
    6. 6)
      • Fine, N.J.: `The generalized Walsh functions', Trans. Am. Math. Soc., 1950, 69, p. 66-77
Print this page
This is a required field
Please enter a valid email address