Analysis of error floors of LDPC codes under LP decoding over the BSC

Authors:
Shashi Kiran Chilappagari;Bane Vasic;Mikhail Stepanov;Michael Chertkov
Affiliations:
Dept. of ECE, University of Arizona, Tucson, AZ;Dept. of ECE, University of Arizona, Tucson, AZ;Dept. of Mathematics, University of Arizona, Tucson, AZ;Theoretical Division, Los Alamos National Lab, Los Alamos, NM
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 6
Cited 1

The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
Pseudocodewords of Tanner Graphs

IEEE Transactions on Information Theory
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes

IEEE Transactions on Information Theory
Eliminating Trapping Sets in Low-Density Parity-Check Codes by Using Tanner Graph Covers

IEEE Transactions on Information Theory
An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC

IEEE Transactions on Information Theory

Trapping set ontology

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Linear Programming (LP) decoding of a fixed Low-Density Parity-Check (LDPC) code over the Binary Symmetric Channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We propose an efficient algorithm termed the Instanton Search Algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton and prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in the input. We obtain the number of unique instantons of different sizes by running the ISA sufficient number of times. We then use the instanton statistics to predict the performance of the LP decoding over the BSC in the error floor region. We also propose an efficient semi-analytical method to predict the performance of LP decoding over a large range of transition probabilities of the BSC.