Pseudo-codeword landscape

被引：19
作者：
Chertkov, Michael [1 ]
Stepanov, Mikhail [2 ]
机构：
[1] LANL, Div Theoret, MS B213,T-13, Los Alamos, NM 87545 USA
[2] Univ Arizona, Dept Math, Tucson, AZ 85721 USA
来源：
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年
关键词：
D O I：
10.1109/ISIT.2007.4557442
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
We discuss the performance of Low-Density-ParityCheck (LDPC) codes decoded by means of Linear Programming (LP) at moderate and large Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously introduced pseudocodeword-search method and a new "dendro" trick, which allows us to reduce the complexity of the LP decoding, we analyze the dependence of the Frame-Error-Rate (FER) on the SNR. Under Maximum-A-Posteriori (MAP) decoding the dendro-code, having only checks with connectivity degree three, performs identically to its original code with high-connectivity checks. For a number of popular LDPC codes performing over the Additive-White-Gaussian-Noise (AWGN) channel we found that either an error-floor sets at a relatively low SNR, or otherwise a transient asymptote, characterized by a faster decay of FER with the SNR increase, precedes the error-floor asymptote. We explain these regimes in terms of the pseudo-codeword spectra of the codes.
引用
收藏
页码：1546 / +
页数：2
相关论文
共 26 条
[1]  
BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441
[2]  
CHERTKOV M, 2006, 44 ALL C SEPT 27 29
[3]  
CHERTKOV M, IEEE T INFORM UNPUB
[4]   Using linear programming to decode binary linear codes [J].
Feldman, J ;
Wainwright, MJ ;
Karger, DR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :954-972
[5]  
Forney GD, 2001, IMA VOL MATH APPL, V123, P101
[6]  
Gallager RG, 1963, LOW DENSITY PARITY C
[7]  
*IEEE, 2006, P80211ND105 IEEE
[8]  
KOETTER R, 2003, P 3 INT S TURB COD R, P75
[9]  
Kurtas E. M., 2005, ADV ERROR CONTROL TE
[10]   Good error-correcting codes based on very sparse matrices [J].
MacKay, DJC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431
123