Linear-Programming Decoding of Nonbinary Linear Codes

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP-based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the ldquomaximum-likelihood (ML) certificaterdquo property. It is also shown that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. It is also proved that if the modulator-channel combination satisfies a particular symmetry condition, the codeword error rate performance is independent of the transmitted codeword. Two alternative polytopes for use with LP decoding are studied, and it is shown that for many classes of codes these polytopes yield a complexity advantage for decoding. These polytope representations lead to polynomial-time decoders for a wide variety of classical nonbinary linear codes. LP decoding performance is illustrated for ternary Golay code with ternary phase-shift keying (PSK) modulation over additive white Gaussian noise (AWGN), and in this case it is shown that the performance of the LP decoder is comparable to codeword-error-rate-optimum hard-decision-based decoding. LP decoding is also simulated for medium-length ternary and quaternary low-density parity-check (LDPC) codes with corresponding PSK modulations over AWGN.

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

[2]  Jon Feldman,et al.  A New Linear Programming Approach to Decoding Linear Block Codes , 2008, IEEE Transactions on Information Theory.

[3]  Jon Feldman,et al.  Cascaded Formulation of the Fundamental Polytope of General Linear Block Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[6]  Shlomo Shamai,et al.  Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels , 2009, IEEE Transactions on Information Theory.

[7]  Mark F. Flanagan,et al.  Codeword-independent performance of nonbinary linear codes under linear-programming and sum-product decoding , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  J. Lodge,et al.  Good LDPC codes over GF(q) for bandwidth efficient transmission , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).

[10]  Wen-Ching Winnie Li,et al.  Characterizations of Pseudo-Codewords of LDPC Codes , 2005, ArXiv.

[11]  G. David Forney,et al.  Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.

[12]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

[13]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[14]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[15]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[16]  Jon Feldman,et al.  Decoding error-correcting codes via linear programming , 2003 .

[17]  D. Mackay,et al.  Low-Density Parity Check Codes over , 1998 .

[18]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[19]  P. Vontobel,et al.  Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.

[20]  R. Koetter,et al.  On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .

[21]  Mark F. Flanagan,et al.  Lower bounds on the minimum pseudodistance for linear codes with q-ary PSK modulation over AWGN , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[22]  Michael Chertkov,et al.  Pseudo-codeword Landscape , 2007, 2007 IEEE International Symposium on Information Theory.

[23]  David Burshtein,et al.  On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.

[24]  David Burshtein,et al.  Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels , 2005, IEEE Transactions on Information Theory.

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

[26]  Joachim Rosenthal,et al.  Pseudocodeword weights for non-binary LDPC codes , 2006, 2006 IEEE International Symposium on Information Theory.

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

[28]  Xiaodong Li,et al.  Bit-interleaved coded modulation with iterative decoding , 1997, IEEE Communications Letters.