Fast detection of OFDM systems using graphical models

In this paper, we investigate the effect of four different message schedules on the performance of an OFDM receiver with unknown carrier frequency and phase noise offsets. One of the methods uses a serial schedule and the remaining three techniques use non-serial message schedules. The serial schedule is shown to give good estimates in less number of iterations compared to the non-serial message schedules. The results also show that fast graphical estimators can be designed by using non-serial message schedules with damping to approach the bit error rates of the serial schedule while reducing the computational time for convergence. In particular, the damped flooding message schedule using four iterations reduces the computational time for convergence by more than 30 % compared to the serial message schedule using one iteration for signal to noise ratios lower than 20 dB.

[1]  Erwin Riegler,et al.  Message-passing algorithms for channel estimation and decoding using approximate inference , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[2]  Justin Dauwels,et al.  Phase estimation by message passing , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[4]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[5]  IEEE Signal Processing and Signal Processing Education Workshop, SP/SPE 2015, Salt Lake City, UT, USA, August 9-12, 2015 , 2015, SP/SPE.

[6]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[7]  Loïc Brunel,et al.  Joint channel estimation and decoding using Gaussian approximation in a factor graph over multipath channel , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.

[8]  Philip Schniter,et al.  A Message-Passing Receiver for BICM-OFDM Over Unknown Clustered-Sparse Channels , 2011, IEEE Journal of Selected Topics in Signal Processing.

[9]  Gunther Auer,et al.  Multi-Dimensional Graph-Based Soft Iterative Receiver for MIMO-OFDM , 2012, IEEE Transactions on Communications.

[10]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[11]  Michael Collins,et al.  Forward-Backward Algorithm , 2009, Encyclopedia of Biometrics.

[12]  Marc Moeneclaey,et al.  BER sensitivity of OFDM systems to carrier frequency offset and Wiener phase noise , 1995, IEEE Trans. Commun..

[13]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[14]  Giorgio Matteo Vitetta,et al.  A Factor Graph Approach to the Iterative Detection of OFDM Signals in the Presence of Carrier Frequency Offset and Phase Noise , 2007, IEEE Transactions on Wireless Communications.

[15]  Giorgio M. Vitetta,et al.  A Factor Graph Approach to the Iterative Detection of OFDM Signals in the Presence of Carrier Frequency Offset and Phase Noise , 2008, IEEE Trans. Wirel. Commun..

[16]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..

[17]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[18]  Juntan Zhang,et al.  Shuffled belief propagation decoding , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[19]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[20]  Giuseppe Caire,et al.  Algorithms for iterative decoding in the presence of strong phase noise , 2005, IEEE Journal on Selected Areas in Communications.

[21]  Amir H. Banihashemi,et al.  Decoding low-density parity-check codes with probabilistic schedule , 2001, 2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233).

[22]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[23]  H. Kfir,et al.  Parallel versus sequential updating for belief propagation decoding , 2002, cond-mat/0207185.

[24]  M. Pretti.  A message-passing algorithm with damping , 2005 .

[25]  Simon Litsyn,et al.  Analysis of LDPC decoding schedules , 2009, 2009 IEEE International Symposium on Information Theory.