Semi-blind maximum a posteriori multipath fast fading channel estimation for TDMA systems

We propose a maximum a posteriori burst-by-burst multipath fast fading channel estimation algorithm for TDMA systems. This algorithm performs a semi-blind iterative channel estimation using the SAGE algorithm. It uses both CAZAC reference sequences and unknown symbols in the optimization of this channel estimation. It requires a convenient representation of the multipath fading channel using a discrete version of the Karhunen-Loeve expansion theorem. It also requires a trellis representation of the channel for an optimum characterization of data symbols by their a posteriori conditional probabilities. The computation of these probabilities can be realized via the Bahl or BCJR algorithm. The performance of our algorithm is evaluated by simulation for 4-PSK modulated TDMA systems.

[1]  Marc P. C. Fossorier,et al.  On the equivalence between SOVA and max-log-MAP decodings , 1998, IEEE Communications Letters.

[2]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[3]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[4]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[5]  Thomas Haug,et al.  The GSM System for Mobile Communications , 1992 .

[6]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

[8]  Alfred O. Hero,et al.  Space-alternating generalized expectation-maximization algorithm , 1994, IEEE Trans. Signal Process..

[9]  U. H. Rohrs,et al.  Some unique properties and applications of perfect squares minimum phase CAZAC sequences , 1992, Proceedings of the 1992 South African Symposium on Communications and Signal Processing.

[10]  Andrzej Milewski,et al.  Periodic Sequences with Optimal Properties for Channel Estimation and Fast Start-Up Equalization , 1983, IBM J. Res. Dev..