Blind system identification using minimum noise subspace

Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common source is important for wireless communications. In this letter, we present a new method that exploits a minimum noise subspace (MNS). The MNS is computed from a set of channel output pairs which form a "tree". The "tree" exploits with minimum redundancy the diversity among all channels. The MNS method is much more efficient in computation and only slightly less robust to channel noise than the subspace method by Moulines et al. (1995).

[1]  Jr. G. Forney,et al.  Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

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

[3]  Yingbo Hua,et al.  Blind system identification using multiple sensors , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[4]  B. Anderson,et al.  Greatest common divisor via generalized Sylvester and Bezout matrices , 1978 .

[5]  Lang Tong,et al.  A new approach to blind identification and equalization of multipath channels , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[6]  Yingbo Hua,et al.  Fast maximum likelihood for blind identification of multiple FIR channels , 1996, IEEE Trans. Signal Process..

[7]  John G. Proakis,et al.  Digital Communications , 1983 .