作者: Michael Chertkov , Mikhail Stepanov
DOI: 10.1109/ISIT.2007.4557442
关键词:
摘要: We discuss the performance of low-density-parity-check (LDPC) codes decoded by means linear programming (LP) at moderate and large signal-to-noise-ratios (SNR). Utilizing a combination previously introduced pseudo-codeword-search method new "dendro" trick, which allows us to reduce complexity LP decoding, we analyze dependence frame-error-rate (FER) on SNR. Under maximum-a-posteriori (MAP) decoding dendro-code, having only checks with connectivity degree three, performs identically its original code high-connectivity checks. For number popular LDPC performing over additive-white-Gaussian-noise (AWGN) channel found that either an error-floor sets relatively low SNR, or otherwise transient asymptote, characterized faster decay FER SNR increase, precedes asymptote. explain these regimes in terms pseudo-codeword spectra codes.