A blind multichannel identification algorithm robust to order overestimation

Active research in blind single input multiple output (SIMO) channel identification has led to a variety of second-order statistics-based algorithms, particularly the subspace (SS) and the linear prediction (LP) approaches. The SS algorithm shows good performance when the channel output is corrupted...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 50; no. 6; pp. 1449 - 1458
Main Authors Gazzah, H., Regalia, P.A., Delmas, J.-P., Abed-Meraim, K.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.06.2002
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Active research in blind single input multiple output (SIMO) channel identification has led to a variety of second-order statistics-based algorithms, particularly the subspace (SS) and the linear prediction (LP) approaches. The SS algorithm shows good performance when the channel output is corrupted by noise and available for a finite time duration. However, its performance is subject to exact knowledge of the channel order, which is not guaranteed by current order detection techniques. On the other hand, the linear prediction algorithm is sensitive to observation noise, whereas its robustness to channel order overestimation is not always verified when the channel statistics are estimated. We propose a new second-order statistics-based blind channel identification algorithm that is truly robust to channel order overestimation, i.e., it is able to accurately estimate the channel impulse response from a finite number of noisy channel measurements when the assumed order is arbitrarily greater than the exact channel order. Another interesting feature is that the identification performance can be enhanced by increasing a certain smoothing factor. Moreover, the proposed algorithm proves to clearly outperform the LP algorithm. These facts are justified theoretically and verified through simulations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2002.1003068