The momentary Fourier transformation derived from recursive matrix transformations

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.

[1]  R. Bitmead,et al.  Adaptive frequency sampling filters , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[2]  J. H. Lilly.  Efficient DFT-based model reduction for continuous systems , 1991 .

[3]  D. M. Monro,et al.  Moving discrete Fourier transform , 1992 .