Computer Science – Information Theory
Scientific paper
2009-03-09
Computer Science
Information Theory
To appear in IEEE JSAC On Capacity Approaching Codes. 11 Pages and 6 Figures
Scientific paper
We 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.
Chertkov Michael
Chilappagari Shashi Kiran
Stepanov Mikhail G.
Vasic Bane
No associations
LandOfFree
Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96278