By Topic

A Matrix Pseudo-Inversion Lemma for Positive Semidefinite Hermitian Matrices and Its Application to Adaptive Blind Deconvolution of MIMO Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

In the simplest case, the matrix inversion Lemma gives an explicit formula of the inverse of a positive-definite matrix A added to a rank-one matrix bbH as follows:(A + bbH )-1 = A-1-A-1 b(1 + bH A-1b)-1bHA-1. It is well known in the literature that this formula is very useful to develop a recursive least-squares algorithm for the recursive identification of linear systems or the design of adaptive filters. We extend this result to the case when the matrix A is singular and present a matrix pseudo-inversion lemma along with some illustrative examples. Such a singular case may occur in a situation where a given problem is overdeter-mined in the sense that it has more equations than unknowns. This lemma is important in its own right, but in order to show the usefulness of the lemma, we apply it to develop an adaptive super-exponential algorithm for the blind deconvolution of multi-input multi-output systems.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:55 ,  Issue: 1 )