中文

Journal of Applied Sciences ›› 2012, Vol. 30 ›› Issue (3): 234-238.doi: 10.3969/j.issn.0255-8297.2012.03.003

• Communication Engineering • Previous Articles     Next Articles

Low-Complexity Probability Generation Algorithm for Stochastic Decoding of Non-binary LDPC Codes

PANG Bao-mao1;2, SHI Hao-shan1, HE Guang-hua3   

  1. 1. Institute of Electric Information, Northwestern Polytechnical University, Xi’an 710072, China
    2. Telecommunication Engineering Institute, Air Force Engineering University, Xi’an 710077, China
    3. Telecommunication Institute, Xidian University, Xi’an 710071, China
  • Received:2011-11-14 Revised:2012-02-20 Online:2012-05-30 Published:2012-05-30

PDF

1456

Cited

3

Abstract:

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.

Key words: LDPC decoding, approximate probability generation, M-ary quadrature amplitude modulation (M-QAM), algorithm complexity

CLC Number: