Low-complexity probability generation algorithm for stochastic decoding of non-binary LDPC codes

被引：0

作者：

Pang, Bao-Mao ^{[1
,2
]}

Shi, Hao-Shan ^{[1
]}

He, Guang-Hua ^{[3
]}

机构：

[1] Institute of Electric Information, Northwestern Polytechnical University

[2] Telecommunication Engineering Institute, Air Force Engineering University

[3] Telecommunication Institute, Xidian University

来源：

Yingyong Kexue Xuebao/Journal of Applied Sciences | 2012年 / 30卷 / 03期

关键词：

Algorithm complexity; Approximate probability generation; LDPC decoding; M-ary quadrature amplitude modulation (M-QAM);

D O I：

10.3969/j.issn.0255-8297.2012.03.003

中图分类号：

学科分类号：

摘要：

Stochastic decoding algorithms for non-binary LDPC codes have good performance, but high computational complexity in probability generation. In this paper, we propose a simple method for fast generation of the probability, especially in high-order modulation schemes. The algorithm calculates probability using the quantized Euclidean distances between constellation points and the received signal points. It can avoid the probability calculation for all constellation points and the arithmetic of powers. Simulation results show that the proposed algorithm has low complexity and incurs less performance degradation, which is advantageous in hardware implementation.

引用

页码：234 / 238

页数：4