学会官网  |  加入学会  |  登录学会  |  English 

电子学报

• 学术论文 • 上一篇    下一篇

基于节点子集和k阶信息截断的多元LDPC译码算法

孙友明1,2,4, 陈海强3,4, 黎相成1,3,4, 万海斌3,4, 覃团发3,4   

  1. 1. 华南理工大学电子与信息学院, 广东广州 510640;
    2. 广西大学物理科学与工程技术学院, 广西南宁 530004;
    3. 广西大学计算机与电子信息学院, 广西南宁 530004;
    4. 广西多媒体通信与网络技术重点实验室培育基地/广西高校多媒体通信与信息处理重点实验室, 广西南宁 530004
  • 收稿日期:2016-05-12 修回日期:2016-11-08 出版日期:2017-08-25
    • 通讯作者:
    • 覃团发
    • 作者简介:
    • 孙友明,男,1975年出生于湖南隆回,华南理工大学博士研究生,广西大学物理科学与工程技术学院讲师,主要研究方向为编译码理论等.E-mail:ymsun@gxu.edu.cn
    • 基金资助:
    • 国家自然科学基金 (No.61261023，No.61362010，No.61661005）; 广西自然科学基金 (No.2014GXNSFBA118276）

Decoding Algorithm for Non-Binary LDPC Codes Based on Node-Subset and k-Order Message Truncation

SUN You-ming1,2,4, CHEN Hai-qiang3,4, LI Xiang-cheng1,3,4, WAN Hai-bin3,4, QIN Tuan-fa3,4   

  1. 1. School of Electronics and Information Engineering, South China University of Technology, Guangzhou, Guangdong 510640, China;
    2. School of Physical Science and Technology, Guangxi University, Nanning, Guangxi 530004, China;
    3. School of Computer, Electronics and Information, Guangxi University, Nanning, Guangxi 530004, China;
    4. Guangxi Key Laboratory of Multimedia Communication and Network Technology, Guangxi University Cultivating Base, Nanning, Guangxi 530004, China
  • Received:2016-05-12 Revised:2016-11-08 Online:2017-08-25 Published:2017-08-25
    • Supported by:
    • National Natural Science Foundation of China (No.61261023, No.61362010, No.61661005); Natural Science Foundation of Guangxi Zhuang Autonomous Region,  China (No.2014GXNSFBA118276)

PDF

摘要： 本文提出一种低复杂度的多元LDPC译码算法，从以下两个方面降低复杂度：（1）提出一种节点截断策略，构造处理/非处理校验节点子集，使得一部分足够可靠的校验节点不进行信息更新，从而减少运算量；（2）针对处理校验节点子集，本文进而提出一种k阶信息截断准则，对Trellis图上的边和状态进行划分.在迭代递归过程中，只有"活"的状态/边才参与运算，可进一步降低校验节点的计算量.仿真表明，本文算法的译码性能与现有的几种EMS改进算法非常接近；在译码复杂度方面，不管对高阶域还是低阶域的多元LDPC码，本文算法的复杂度都是最小的.

关键词: 多元LDPC码, Trellis, 节点子集, 信息截断

Abstract: This paper presents a low complexity non-binary LDPC decoding algorithm,whose complexity can be reduced in the following two ways.First,a new truncation scheme is presented to define the processing/non-processing check node subsets.The check nodes with relatively high reliability are not required to be processed,which can reduce the complexity.Second,for the check nodes in the processing subset,we further present a k-order message truncation for the states and branches of the check node Trellis.In the decoding iterations,only those "live" states/branches are involved in the message updating process,which can further reduce the computational loads at check nodes.Simulation results show that the presented algorithm performs very closely to several existing improved EMS decoding algorithms,but it has the lowest complexity when decoding the non-binary LDPC codes constructed both in low/high order fields.

Key words: non-binary LDPC codes, trellis, node subset, message-truncation

中图分类号: 

京ICP备12041980号-1　版权所有 ©《电子学报》编辑部