Instanton-based techniques for analysis and reduction of error floors of LDPC codes
AffiliationUniv Arizona, Dept Elect & Comp Engn
linear programming decoding
low-density parity-check codes
MetadataShow full item record
CitationS. K. Chilappagari, M. Chertkov, M. G. Stepanov and B. Vasic, "Instanton-based techniques for analysis and reduction of error floors of LDPC codes," in IEEE Journal on Selected Areas in Communications, vol. 27, no. 6, pp. 855-865, August 2009, doi: 10.1109/JSAC.2009.090804.
RightsCopyright © 2009 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractWe describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.
VersionFinal accepted manuscript