Approaching the shannon limit through parallel concatenation of regular LDGM codes

Approaching the shannon limit through parallel concatenation of regular LDGM codes
复制标题

DOI:
10.1109/isit.2005.1523646
复制
发表时间:
2005-10
期刊:
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
影响因子:
--
通讯作者:
W. Zhong;Huiqiong Chai;J. Garcia-Frías
W. Zhong;Huiqiong Chai;J. Garcia-Frías
中科院分区:
其他
文献类型:
--
作者:
W. Zhong;Huiqiong Chai;J. Garcia-Frías

文献摘要

被引文献

相似文献

提出了一种并行级联码方案,其组成码是具有低密度生成矩阵的规则系统线性码(LDGM码)。该系统提供了一种简单的方法来降低单个规则LDGM码的差错平坦特性,并且以更低的编/译码复杂度获得了与Turbo码和非规则LDPC码相似的性能。虽然整个级联码实际上是单个非规则LDGM码,但其作为并行方案的解释便于设计,允许以非常简单的方式实现良好的非规则LDGM码。通过密度演化对系统性能进行了研究,并通过仿真结果进行了验证
We propose a parallel concatenated coding scheme in which the constituent codes are regular systematic linear codes with low-density generator matrix (LDGM codes). The proposed system provides a simple way to reduce the error floors characteristic of single regular LDGM codes, and leads to a performance similar to that of turbo and irregular LDPC codes with less encoding/decoding complexity. Although the whole concatenated code is in fact a single irregular LDGM code, its interpretation as a parallel scheme facilitates the design, allowing the implementation of good irregular LDGM codes in a very simple manner. The system performance is studied through density evolution and validated by simulation results