The momentary Fourier transformation derived from recursive matrix transformations

TitleThe momentary Fourier transformation derived from recursive matrix transformations
Publication TypeConference Paper
Year of Publication1997
AuthorsAlbrecht, S., I. Cumming, and J. Dudas
Conference NameDigital Signal Processing Proceedings, 1997. DSP 97., 1997 13th International Conference on
Pagination337 -340 vol.1
Date Publishedjul.
KeywordsDFT, discrete Fourier transforms, discrete-time sequence, inverse momentary Fourier transformation, inverse problems, matrix algebra, momentary Fourier transformation, recursive estimation, recursive form, recursive matrix transformations, sequence sample, sequences, signal sampling
Abstract

The momentary Fourier transform (MFT) computes the DFT of a discrete-time sequence for every new sample of the sequence. It has an efficient recursive form, and an alternate derivation is given using matrix transformations. A recursive form of the inverse MFT is also given, which is particularly efficient as it involves no multiplications

URLhttp://dx.doi.org/10.1109/ICDSP.1997.628089
DOI10.1109/ICDSP.1997.628089

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia