Institutional Repository
Technical University of Crete
EN  |  EL



My Space

An iterative algorithm for the computation of the MVDR filter

Pados Dimitris A., Karystinos Georgios

Full record

Year 2001
Type of Item Peer-Reviewed Journal Publication
Bibliographic Citation D. A. Pados and G. N. Karystinos, “An iterative algorithm for the computation of the MVDR filter,” IEEE Transactions on Signal Processing, vol. 49, no. 2, pp. 290-300, Feb. 2001. doi: 10.1109/78.902111
Appears in Collections


Statistical conditional optimization criteria lead to the development of an iterative algorithm that starts from the matched filter (or constraint vector) and generates a sequence of filters that converges to the minimum-variance-distortionless-response (MVDR) solution for any positive definite input autocorrelation matrix. Computationally, the algorithm is a simple, noninvasive, recursive procedure that avoids any form of explicit autocorrelation matrix inversion, decomposition, or diagonalization. Theoretical analysis reveals basic properties of the algorithm and establishes formal convergence. When the input autocorrelation matrix is replaced by a conventional sample-average (positive definite) estimate, the algorithm effectively generates a sequence of MVDR filter estimators; the bias converges rapidly to zero and the covariance trace rises slowly and asymptotically to the covariance trace of the familiar sample-matrix-inversion (SMI) estimator. In fact, formal convergence of the estimator sequence to the SMI estimate is established. However, for short data records, it is the early, nonasymptotic elements of the generated sequence of estimators that offer favorable bias covariance balance and are seen to outperform in mean-square estimation error, constraint-LMS, RLS-type, orthogonal multistage decomposition, as well as plain and diagonally loaded SMI estimates. An illustrative interference suppression example is followed throughout this presentation