Design of Convergence-Optimized Non-binary LDPC Codes over Binary Erasure Channel

2020/03/03 by Yu, Yang, Chen, Wen, Wei, Lili
#FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2003.01340

Abstract

In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes with convergence-optimized degree distributions. The resulting one-step decoding tree is cycle-free and achieves lower decoding complexity. Experimental studies show that the proposed convergence-optimization algorithm accelerates the convergence process by 33%.

Related

• Extended Non-Binary Low-Density Parity-Check Codes over Erasure Channels
• A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC\n Codes in BEC
• Non binary LDPC codes over the binary erasure channel: density evolution analysis
• Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
• Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels