DocumentCode
3097035
Title
The momentary Fourier transformation derived from recursive matrix transformations
Author
Albrecht, Sandor ; Cumming, Ian ; Dudás, József
Author_Institution
Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC, Canada
Volume
1
fYear
1997
fDate
2-4 Jul 1997
Firstpage
337
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
Keywords
discrete Fourier transforms; inverse problems; matrix algebra; recursive estimation; sequences; signal sampling; DFT; discrete-time sequence; inverse momentary Fourier transformation; momentary Fourier transformation; recursive form; recursive matrix transformations; sequence sample; Computational efficiency; Difference equations; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Fourier transforms; Matrices; Time varying systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Signal Processing Proceedings, 1997. DSP 97., 1997 13th International Conference on
Conference_Location
Santorini
Print_ISBN
0-7803-4137-6
Type
conf
DOI
10.1109/ICDSP.1997.628089
Filename
628089
Link To Document