Symbol-by-symbol MAP detection of differential frequency hopping signals over Rayleigh flat fading channels

In this paper, a symbol-by-symbol MAP (SBS-MAP) detection of differential frequency hopping (DFH) signals over Rayleigh flat fading channels is proposed. Because the frequency sequence of DFH signals can be interpreted as a Markov chain, the algorithm is based on a trellis diagram used to describe the state transition of a Markov source. The SBS-MAP can produce the a posteriori probability for each transmitted symbol by utilizing the a priori information and the correlation information between successive transmitted symbols. Simulation results demonstrate that the proposed detection scheme outperforms others such as fast Fourier transform (FFT) detection and maximum likelihood sequence estimation (MLSE) detection in terms of error rate performance

[1]  D. L. Herrick,et al.  CHESS a new reliable high speed HF radio , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

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

[3]  Ma Yusong,et al.  A design of differential frequency hopping pattern , 2001, 2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01EX479).

[4]  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.

[5]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[6]  Kaihua Liu,et al.  Symbol-by-symbol MAP detection of differential frequency hopping signals for PLC applications , 2005, International Symposium on Power Line Communications and Its Applications, 2005..