一种低复杂度NBLDPC码硬可靠度译码
A Low Complexity HardReliability Decoding for NonBinary LDPC Codes
摘要
针对改进迭代硬可靠度(IHRB)大数逻辑译码复杂度高等问题,提出了一种改进迭代硬性可靠性的低复杂度非二进制低密度奇偶校验(NBLDPC)码的大数逻辑译码算法。在初始化时,对来自信道的接收信息进行可靠度区分;在迭代处理时,使用可靠性大的符号来计算解码算法中其他符号的硬可靠性,同时使用校验方程校验出最可靠的符号,最可靠的符号无需更新,以此降低译码复杂度。仿真结果表明,与NBLDPC大数逻辑译码算法相比,所提算法在纠错性能和译码迭代复杂度之间提供了有效的折中。对于维度为64的伽罗华域上的NBLDPC码,与IHRB译码算法相比,其迭代复杂度降低了约51%。
Abstract
This paper presents a novel method to improve the Iterative HardReliability (IHRB) based majoritylogic decoding algorithm for NonBinary LowDensity ParityCheck (NBLDPC) codes. The method uses the most reliable symbols to calculate hardreliability of other symbols in the decoding algorithm, which will not calculate the hardreliability of poor reliable symbols and most reliable symbols. The proposed algorithm can provide effective tradeoff between error performance and decoding iterative complexity compared to the nonbinary majoritylogic algorithm. For an NBLDPC code over Galois field of 64 elements, the iterative complexity is reduced by about 51% compared with that of the conventional decoding algorithm.
高涛, 马秀荣, 杨胜寒, 司雨鑫. 一种低复杂度NBLDPC码硬可靠度译码[J]. 光通信研究, 2019, 45(4): 66. GAO Tao, MA Xiurong, YANG Shenghan, SI Yuxin. A Low Complexity HardReliability Decoding for NonBinary LDPC Codes[J]. Study On Optical Communications, 2019, 45(4): 66.