Computing the reduced rank Wiener filter by IQMD
Authors:
- M. NikpourMNM. Nikpour
- 1 September 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 6 (9) , 240-242
Abstract
The reduced-rank Wiener filter (RRWF) is a generic tool for data compression and filtering. This letter presents an iterative quadratic minimum distance (IQMD) algorithm for computing the RRWF. Although it is iterative in nature, the IQMD algorithm is shown to be globally and exponentially convergent under some weak conditions. While the conventional algorithms for computing the RRWF require an order of n/sup 3/ flops, the IQMD algorithm requires only an order of n/sup 2/ flops at each iteration where n is the dimension of data. The number of iterations required in practice is often small due to the exponential convergence rate of the IQMD.Keywords
This publication has 5 references indexed in Scilit:
- Generalized Karhunen-Loeve transformIEEE Signal Processing Letters, 1998
- Wiener filters in canonical coordinates for transform coding, filtering, and quantizingIEEE Transactions on Signal Processing, 1998
- Maximum likelihood parameter and rank estimation in reduced-rank multivariate linear regressionsIEEE Transactions on Signal Processing, 1996
- Relative Karhunen-Loeve transformIEEE Transactions on Signal Processing, 1996
- The SVD and reduced rank signal processingSignal Processing, 1991