English

应用科学学报 ›› 2012, Vol. 30 ›› Issue (3): 234-238.doi: 10.3969/j.issn.0255-8297.2012.03.003

• 论文 • 上一篇    下一篇

多元LDPC随机译码的似然概率快速生成算法

庞宝茂1;2， 史浩山1， 何光华3   

  1. 1. 西北工业大学电子信息学院，西安710072
    2. 空军工程大学电讯工程学院，西安710077
    3. 西安电子科技大学通信学院，西安710071
  • 收稿日期:2011-11-14 修回日期:2012-02-20 出版日期:2012-05-30 发布日期:2012-05-30
  • 通信作者: 庞宝茂，博士生，研究方向：移动通信和通信网络技术，E-mail: pangbaomao@msn.com；
  • 作者简介:庞宝茂，博士生，研究方向：移动通信和通信网络技术，E-mail: pangbaomao@msn.com；史浩山，教授，博导，研究方向：数据通信与通信网，E-mail: shilaoshi@nwpu.edu.cn
  • 基金资助:

    陕西省重点实验室项目基金（No.201102Y05）资助

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

1442

摘要：

多元随机译码算法能有效解决译码复杂度高的问题，但似然概率生成的计算仍有较高的计算复杂度. 为解决这一问题，文中提出一种针对M阶正交振幅调制下的多元低密度奇偶校验码的随机译码算法. 通过计算星座图中部分星座点和接收信号点之间的欧几里德距离来确定随机译码的似然概率，而不必计算所有星座点的似然概率，省去了复杂的幂次运算. 仿真结果表明，该算法能有效降低多元LDPC码随机译码的计算复杂度，性能损失较小，是一种适合多元LDPC译码器前端实现的译码算法.

关键词: LDPC译码, 似然概率生成, M阶正交振幅调制M-QAM, 算法复杂度

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

中图分类号: