Symmetric minimum noise subspace for multi-input multi-output system identification

This contribution deals with a particular family of blind system identification methods, referred to as Minimum Noise Subspace (MNS). MNS method is a computationally fast version of subspace method. Here, we develop a symmetric version of MNS method (referred to as SMNS) that has the advantage of better robustness and estimation accuracy at the cost of a slight increase of the computational cost in comparison with original MNS. In the same time, we present and compare different algorithms for the block implementation of the SMNS. Finally, we show that under certain additional assumptions on the channel transfer functions, we can go beyond the minimum in the sense that less than ( being the number of outputs and the number of inputs) noise vectors are sufficient for unique identification of channel parameters.

[1]  Karim Abed-Meraim,et al.  Blind system identification , 1997, Proc. IEEE.

[2]  Philippe Loubaton,et al.  Subspace based techniques for second order blind separation of convolutive mixtures with temporally correlated sources , 1997 .

[3]  Y. Hua,et al.  Orthogonal Oja algorithm , 2000, IEEE Signal Processing Letters.

[4]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[5]  Philippe Loubaton,et al.  A subspace algorithm for certain blind identification problems , 1997, IEEE Trans. Inf. Theory.

[6]  Eric Moulines,et al.  Subspace methods for the blind identification of multichannel FIR filters , 1995, IEEE Trans. Signal Process..

[7]  Jonathan H. Manton A new algorithm for computing the extreme eigenvectors of a complex Hermitian matrix , 2001, Proceedings of the 11th IEEE Signal Processing Workshop on Statistical Signal Processing (Cat. No.01TH8563).

[8]  Karim Abed-Meraim,et al.  Blind identification of multi-input multi-output system using minimum noise subspace , 1997, IEEE Trans. Signal Process..