论文标题
基于原始的低密度平价检查HADAMARD代码
Protograph-Based Low-Density Parity-Check Hadamard Codes
论文作者
论文摘要
在本文中，我们提出了一种设计新方法来设计低密度奇偶校验检查Hadamard（LDPC-HADAMARD）代码，这是一种接近通道代码的最终Shannon-limit。该技术基于在基于普遍的原始LDPC代码中对检查节点的hadamard约束，然后抬高广义原理。我们将基于原始的LDPC HADAMARD（PLDPC-HADAMARD）代码命名。我们还提出了一种修改的原始外部信息传输（PEXIT）算法，用于分析和优化PLDPC-HADAMARD代码设计。所提出的算法进一步允许分析具有1和/或刺破节点的PLDPC-HADAMARD代码。我们发现的代码为阈值范围从-1.53 dB到-1.42 dB。在1E-5的BER中，我们的代码差距到最终的香农限制范围为0.40 dB（速度= 0.0494）至0.16 dB（速度= 0.003）。此外，我们的代码的错误性能与传统的LDPC-HADAMARD代码相当。最后，对刺穿后代码的BER表现进行了模拟和比较。
In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the generalized protograph. We name the codes formed protograph-based LDPC Hadamard (PLDPC-Hadamard) codes. We also propose a modified Protograph Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing PLDPC-Hadamard code designs. The proposed algorithm further allows the analysis of PLDPC-Hadamard codes with degree-1 and/or punctured nodes. We find codes with decoding thresholds ranging from -1.53 dB to -1.42 dB. At a BER of 1e-5, the gaps of our codes to the ultimate-Shannon-limit range from 0.40 dB (for rate = 0.0494) to 0.16 dB (for rate = 0.003). Moreover, the error performance of our codes is comparable to that of the traditional LDPC-Hadamard codes. Finally, the BER performances of our codes after puncturing are simulated and compared.
