By Topic

A Matrix Pseudoinversion Lemma and Its Application to Block-Based Adaptive Blind Deconvolution for 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)
Kohno, K. ; Dept. of Electron. Control Eng., Yonago Nat. Coll. of Technol., Yonago, Japan ; Kawamoto, M. ; Inouye, Y.

The matrix inversion lemma gives an explicit formula of the inverse of a positive definite matrix A added to a block of dyads (represented as BBH) as follows: (A+BBH)-1= A-1- A-1B(I + BHA-1B)-1BHA-1. It is well known in the literature that this formula is very useful to develop a block-based recursive least squares algorithm for the block-based 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 pseudoinversion lemma along with some illustrative examples. Based on this result, we propose a block-based adaptive multichannel superexponential algorithm. We present simulation results for the performance of the block-based algorithm in order to show the usefulness of the matrix pseudoinversion lemma.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:57 ,  Issue: 7 )