Training based maximum likelihood channel identification

In this paper, we address the problem of identifying convolutive channels in a maximum likelihood (ML) fashion when a constant training sequence is periodically inserted in the transmitted signal. We consider the case where the channel is quasi-static (i.e. the sampling period is several orders of magnitude below the coherence time of the channel). There are no requirements on the length of the training sequence and all the received symbols that contain contributions from the training symbols are exploited. We first propose an iterative method that converges to the ML estimate of the channel. We then derive a closed form expression of the ML channel estimate.

[1]  Petre Stoica,et al.  Decentralized Control , 2018, The Control Systems Handbook.

[2]  Luc Deneire,et al.  Training sequence versus cyclic prefix-a new look on single carrier communication , 2001, IEEE Communications Letters.

[3]  Marc Moonen,et al.  Channel Identification for Block Transmission , 2003 .

[4]  M. Moonen,et al.  Semi-blind channel estimation for block transmissions with non-zero padding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[5]  Luc Deneire,et al.  Training sequence vs. cyclic prefix a new look on single carrier communication , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[6]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[7]  J. Cavers An analysis of pilot symbol assisted modulation for Rayleigh fading channels (mobile radio) , 1991 .

[8]  Thomas Kailath,et al.  Optimal training for frequency-selective fading channels , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).