Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs

作者：Dolecek Lara^*; Divsalar Dariush; Sun Yizeng; Amiri Behzad

来源：IEEE Transactions on Information Theory, 2014, 60(7): 3913-3941.

DOI：10.1109/TIT.2014.2316215

• LDPC codes
• nonbinary codes
• protographs
• weight enumerators
• asymptotic analysis
• pseudo-codewords
• trapping sets
• stopping sets
• iterative decoding thresholds
• EXIT chart analysis
• finite-length code design

This paper provides a comprehensive analysis of nonbinary low-density parity check (LDPC) codes built out of protographs. We consider both random and constrained edge-weight labeling, and refer to the former as the unconstrained nonbinary protograph-based LDPC codes (U-NBPB codes) and to the latter as the constrained nonbinary protograph-based LDPC codes (C-NBPB codes). Equipped with combinatorial definitions extended to the nonbinary domain, ensemble enumerators of codewords, trapping sets, stopping sets, and pseudocodewords are calculated. The exact enumerators are presented in the finite-length regime, and the corresponding growth rates are calculated in the asymptotic regime. An EXIT chart tool for computing the iterative decoding thresholds of protograph-based LDPC codes is presented, followed by several examples of finite-length U-NBPB and C-NBPB codes with high performance. Throughout this paper, we provide accompanying examples, which demonstrate the advantage of nonbinary protograph-based LDPC codes over their binary counterparts and over random constructions. The results presented in this paper advance the analytical toolbox of nonbinary graph-based codes.

• 出版日期2014-7