Minimum noise subspace: concepts and applications

We present the concepts and some applications of the minimum noise subspace (MNS) technique. The MNS technique has been first introduced as a computationally efficient subspace technique which exploits a minimum number of noise vectors for multichannel blind system identification. It is shown that a noise subspace basis can be obtained in a parallel structure from a set of tuples (combinations) of system outputs that form a properly connected sequence (PCS). The technique of the MNS and particularly the concept of PCS turn out to be powerful tools that can be applied for number of array processing problems. To illustrate the potential of this technique, we present three successful applications related to the problems of blind system identification, source localization, and array calibration respectively.

[1]  Messaoud Benidir,et al.  Source-bearing estimation and sensor positioning with the Propagator method , 1990 .

[2]  Thomas Kailath,et al.  Linear Systems , 1980 .

[3]  Munier.  1 - L'identification de fronts d'ondes corrélés et distordus , 1987 .

[4]  Messaoud Benidir,et al.  Performances analysis of the propagator method for source bearing estimation , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Eric Moulines,et al.  Subspace methods for the blind identification of multichannel FIR filters , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[6]  Messaoud Benidir,et al.  An adaptive tracking algorithm for direction finding and array shape estimation in a nonstationary environment , 1996, J. VLSI Signal Process..

[7]  Messaoud Benidir,et al.  The propagator method for source bearing estimation , 1995, Signal Process..

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

[9]  Mats Viberg,et al.  Subspace-based methods for the identification of linear time-invariant systems , 1995, Autom..

[10]  V. Pisarenko.  The Retrieval of Harmonics from a Covariance Function , 1973 .

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

[12]  Björn E. Ottersten,et al.  Sensor array processing based on subspace fitting , 1991, IEEE Trans. Signal Process..

[13]  Ralph Otto Schmidt,et al.  A signal subspace approach to multiple emitter location and spectral estimation , 1981 .

[14]  S. Marcos,et al.  Statistical analysis of the propagator method for DOA estimation without eigendecomposition , 1996, Proceedings of 8th Workshop on Statistical Signal and Array Processing.

[15]  Thomas Kailath,et al.  Fast subspace decomposition , 1994, IEEE Trans. Signal Process..

[16]  Mats Viberg,et al.  Subspace Methods in System Identification , 1994 .

[17]  J. Cadzow,et al.  Spectral estimation: An overdetermined rational model equation approach , 1982, Proceedings of the IEEE.

[18]  Karim Abed-Meraim,et al.  Blind system identification using minimum noise subspace , 1996, Proceedings of 8th Workshop on Statistical Signal and Array Processing.