电讯技术2017，Vol.57Issue(3)：251-256,6.DOI:10.3969/j.issn.1001-893x.2017.03.001
一种低复杂度的多元LDPC译码算法
A Low Complexity Decoding Algorithm for Nonbinary LDPC Codes
摘要
Abstract
For the large decoding complexity and high latency in nonbinary low density parity check ( LD-PC) decoding,a low complexity decoding algorithm based on hard-information for nonbinary LDPC codes is presented in this paper. The received signals from the channel are quantized with a non-uniform quanti-zation scheme. During the decoding procedure,binary hard reliability information is transmitted from check nodes to variable nodes. At variable nodes,the reliability messages are accumulated and updated bit-by-bit without any scaling operations. Furthermore,full messages rather than extrinsic messages are employed at the variable nodes to pass back the information. Simulation results show that,compared with the bit-reli-ability based(BRB) algorithm,the presented algorithm can achieve about 0. 3 dB performance gain with low quantization bits and lower decoding complexity.关键词
多元LDPC码/译码算法/硬信息/比特可靠度/全信息/低复杂度Key words
nonbinary LDPC codes/decoding algorithm/hard-information/bit reliability/full-message/low complexity分类
信息技术与安全科学引用本文复制引用
黎相成,陈海强,覃团发,孙友明,万海斌..一种低复杂度的多元LDPC译码算法[J].电讯技术,2017,57(3):251-256,6.基金项目
国家自然科学基金资助项目(61261023,61362010,61661005) （61261023,61362010,61661005）
广西自然科学基金资助项目(2014GXNSFBA118276) （2014GXNSFBA118276）
