A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
A fast recursive algorithm for system identification and model reduction using rational wavelets
Proceedings of 27th Asilomar Conference on Signals, Systems and Computers
In earlier work [Pati and Krishnaprasa d 1992] it was shown that rational wavelet frame decomposi tions of the Hardy space H 2 (llj may be used to ef ficiently capture time-frequen cy localized behavior of stable linear systems, for purposes of system identifi cation and model-reduc tion. In this paper we exam ine the problem of efficient computation of low-order rational wavelet approximatio ns of stable linear sys tems. We describe a variant of the Matching Pursuit algorithm [Mallat and Zhang
doi:10.1109/acssc.1993.342464
fatcat:y5tpovivf5d23dyujdvbhpoqdm