Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel

DOI10.1109/TIT.2016.2540800MaRDI QIDQ2976848zbMATH OpenFDO

Authors Iryna Andriyanova, Alexandre Graell I. Amat

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.2003

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05)

Abstract: We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure channel. In particular, we prove threshold saturation of belief propagation decoding to the so called potential threshold, using the proof technique based on potential functions introduced by Yedla extit{et al.}, assuming that the potential function exists. We rewrite the density evolution of nonbinary SC-LDPC codes in an equivalent vector recursion form which is suited for the use of the potential function. We then discuss the existence of the potential function for the general case of vector recursions defined by multivariate polynomials, and give a method to construct it. We define a potential function in a slightly more general form than one by Yedla extit{et al.}, in order to make the technique based on potential functions applicable to the case of nonbinary LDPC codes. We show that the potential function exists if a solution to a carefully designed system of linear equations exists. Furthermore, we show numerically the existence of a solution to the system of linear equations for a large number of nonbinary LDPC code ensembles, which allows us to define their potential function and thus prove threshold saturation.

Recommendations

• Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels
• Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel
• scientific article; zbMATH DE number 3511980
• Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
• New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel
• Low-density parity-check codes over gaussian channels with erasures
• Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel

This page was built for publication: Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976848)