System identification: theory for the user
System identification: theory for the user
An operator pseudo-inversion lemma
SIAM Journal on Applied Mathematics
Adaptive filter theory (3rd ed.)
Adaptive filter theory (3rd ed.)
An extended recursive least-squares algorithm
Signal Processing
Space-time-coded MIMO ZP-OFDM systems: semiblind channel estimation and equalization
IEEE Transactions on Circuits and Systems Part I: Regular Papers
FIR perfect signal reconstruction from multiple convolutions: minimum deconvolver orders
IEEE Transactions on Signal Processing
Super-exponential algorithms for multichannel blind deconvolution
IEEE Transactions on Signal Processing
Matrix pseudoinversion for image neural processing
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part V
Hi-index | 0.00 |
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-1 B(I + BH A-1 B) -1 BH A-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.