Analog Digital Belief Propagation

We introduce a message passing belief propagation (BP) algorithm for factor graph over linear models that uses messages in the form of Gaussian-like distributions. With respect to the regular Gaussian BP, the proposed algorithm adds two operations to the model, namely the wrapping and the discretization of variables. This addition requires the derivation of proper modifications of message representations and updating rules at the BP nodes. We named the new algorithm Analog-Digital-Belief-Propagation (ADBP). The ADBP allows to construct iterative decoders for mod-M ring encoders that have a complexity independent from the size M of the alphabets, thus yielding efficient decoders for very high spectral efficiencies.

[1]  S. R. Jammalamadaka,et al.  Topics in Circular Statistics , 2001 .

[2]  David Declercq,et al.  Low-complexity decoding for non-binary LDPC codes in high order fields , 2010, IEEE Transactions on Communications.

[3]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[4]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[5]  Thomas E. Fuja,et al.  LDPC codes over rings for PSK modulation , 2005, IEEE Transactions on Information Theory.

[6]  Guido Montorsi Analog Digital Belief Propagation: From theory to practice , 2012, 2012 IEEE International Conference on Communications (ICC).

[7]  Li Ping,et al.  The Factor Graph Approach to Model-Based Signal Processing , 2007, Proceedings of the IEEE.

[8]  Rüdiger L. Urbanke,et al.  Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes , 2005, ArXiv.

[9]  C. Berrou,et al.  Non-binary convolutional codes for turbo coding , 1999 .