2 research outputs found
Instanton analysis of Low-Density-Parity-Check codes in the error-floor regime
In this paper we develop instanton method introduced in [1], [2], [3] to
analyze quantitatively performance of Low-Density-Parity-Check (LDPC) codes
decoded iteratively in the so-called error-floor regime. We discuss statistical
properties of the numerical instanton-amoeba scheme focusing on detailed
analysis and comparison of two regular LDPC codes: Tanner's (155, 64, 20) and
Margulis' (672, 336, 16) codes. In the regime of moderate values of the
signal-to-noise ratio we critically compare results of the instanton-amoeba
evaluations against the standard Monte-Carlo calculations of the
Frame-Error-Rate.Comment: 5 pages, 5 figure
Reducing the Error Floor
We discuss how the loop calculus approach of [Chertkov, Chernyak '06],
enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06]
and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding
of graph based codes in the error-floor domain. The utility of the new, Linear
Programming based, decoding is demonstrated via analysis and simulations of the
model code.Comment: 6 pages, 1 figure, invited talk at ITW'07 Taho