A short-time Fourier transform analysis technique is proposed in which the influences of the window on a spectral estimate can essentially be removed entirely (an unbiased estimator) by linearly combining biased estimates. As a result, section (FFT) lengths for analysis may be made small, thereby increasing the speed of the algorithm without sacrificing accuracy. The method assumes that the system to be identified is a finite impulse response (FIR) system. The proposed algorithm has the property that as the number of samples used in the estimate increases, the solution rapidly approaches the least squares analysis (LSA) (theoretically optimum) solution. The method also uses a fixed discrete Fourier transform (DFT) length independent of the amount of data being analyzed allowing the estimate to be recursively updated as more data is made available.
|Original language||English (US)|
|Number of pages||7|
|Journal||National Conference Publication - Institution of Engineers, Australia|
|State||Published - Jan 1 1979|
|Event||Proc, Jt Autom Control Conf - Denver, CO, USA|
Duration: Jun 17 1979 → Jun 21 1979
ASJC Scopus subject areas