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.