A subspace algorithm for certain blind identification problems

DOI10.1109/18.556108zbMath0870.94006OpenAlexW2115723730MaRDI QIDQ4340318

Karim Abed-Meraim, Philippe Loubaton, Eric Moulines

Publication date: 24 September 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.556108

zbMATH Keywords

polynomial matricesstatistical analysisblind identificationsubspace method

Mathematics Subject Classification ID

Estimation and detection in stochastic control theory (93E10) Identification in stochastic control theory (93E12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A recursive blind adaptive equalizer for IIR channels with common zeros ⋮ Identification of certain noisy MA models: new results ⋮ On the almost sure location of the singular values of certain Gaussian block-Hankel large random matrices ⋮ Blind signal separation and equalization with controlled delay for MIMO convolutive systems ⋮ Totally blind channel identification by exploiting guard intervals ⋮ A graph subspace approach to system identification based on errors-in-variables system models ⋮ Blind identification of multi-channel systems with single input and unknown orders ⋮ Convolutive blind source separation based on joint block Toeplitzation and block-inner diagonalization ⋮ Blind identification of MISO-FIR channels ⋮ Polynomial ambiguity resistant precoders: Theory and applications in ISI/multipath cancellation ⋮ Blind multivariable ARMA subspace identification