Non-Binary LDPC Erasure Codes With Separated Low-Degree Variable Nodes
Non-Binary LDPC Erasure Codes With Separated Low-Degree Variable Nodes
复制标题
具有分离低度变量节点的非二进制 LDPC 纠删码
DOI：
10.1109/tcomm.2015.2468232
复制
发表时间：
2015
影响因子：
8.3
通讯作者：
G. Liva
中科院分区：
文献类型：
--
作者：
G. Garrammone;E. Paolini;B. Matuz;G. Liva
讨论了在最大后验译码条件下，用于擦除信道的非二进制低密度校验码的设计问题。特别是，提出了一种部分结构化的集成代码，其特征在于通过仔细控制的量和小度的变量节点的连接性。所确定的合奏的代码进行了分析，在渐近阈值和权重分布，它示出，从合奏的代码提供了显着的瀑布性能，错误地板，和解码复杂性之间的权衡。例如，在低解码复杂度下，短（256，128）码在无记忆16元擦除信道上的性能曲线至少在码字错误率为10-9时紧密地接近Singleton界。
The code design of non-binary low-density paritycheck codes for the erasure channel, under maximum a posteriori decoding, is addressed. In particular, a partially structured ensemble of codes, characterized by a careful control of the amount and of the connectivity of the variable nodes of small degrees, is proposed. The identified ensemble of codes is analyzed in terms of asymptotic thresholds and weight distribution and it is shown that codes from the ensemble provide a remarkable trade-off between waterfall performance, error floor, and decoding complexity. As an example, the performance curve of a short (256,128) code on the memoryless 16-ary erasure channel tightly approaches the Singleton bound at least down to a codeword error rate of 10-9, at low decoding complexity.