Low-Complexity Decoding of Nonbinary LDPC Codes
This paper presents a low-complexity decoding algorithm for the nonbinary Low-Density Parity-Check (LDPC) codes. Compared to other recently developed decoding schemes, such as Min-Max and EMS algorithm, the message memory as well as the average number of iterations has been reduced using the proposed decoding method. Meanwhile, a novel elementary step computation method has been proposed to reduce the decoding complexity.
Nonbinary low-density parity-check (LDPC) codes Min-Max EMS decoding algorithm
Kai He Jin Sha Jun Lin Li Li Zhongfeng Wang
School of Electronic Science and Engineering Nanjing University Nanjing, China Broadcom Corporation Irvine, California, USA
国际会议
海口
英文
44-48
2011-02-22(万方平台首次上网日期,不代表论文的发表时间)