一种LDPC码有限字母表迭代译码器选择算法

doi:10.3969/j.issn.1001-2400.2013.06.020

J4 ›› 2013, Vol. 40 ›› Issue (6): 111-115.doi: 10.3969/j.issn.1001-2400.2013.06.020

一种LDPC码有限字母表迭代译码器选择算法

郭军军;慕建君

(西安电子科技大学计算机学院，陕西西安 710071)

收稿日期:2012-08-30 出版日期:2013-12-20 发布日期:2014-01-10
通讯作者: 郭军军
作者简介:郭军军(1977-)，男，西安电子科技大学博士研究生，E-mail: eyebyeye@126.com．
基金资助:
国家自然科学基金资助项目(61001132, 61271004)

Selection algorithm of finite alphabet iterative decoders for LDPC codes

GUO Junjun;MU Jianjun

(School of Computer Science and Technology, Xidian Univ., Xi'an 710071， China)

Received:2012-08-30 Online:2013-12-20 Published:2014-01-10
Contact: GUO Junjun

摘要/Abstract

摘要：

提出了一种有效的低密度校验码有限字母表迭代译码器优选算法．针对一些典型的低密度校验码，利用Tanner图上变量节点译码规则构造了一组候选译码器，并通过对叠加了陷阱集偏置噪声的信道接收信息进行译码评估，从这些候选译码器中快速地找到统计最优的有限字母表迭代译码器．

关键词: 有限字母表迭代译码器, Tanner图, 陷阱集, 低密度校验码

Abstract:

An efficient selection algorithm for finite alphabet iterative decoders (FAIDs) is presented for LDPC (low-density parity-check) codes over the BSC (binary symmetric channel). By taking advantage of the characteristics of decoding rules for variable nodes on Tanner graphical presentations, a set of candidate FAIDs is constructed for some typical LDPC codes. Based on the evaluation of decoding performance for the received channel messages with various additional bias noise inputs derived from trapping sets, the statistical optimal FAID can be rapidly selected from the candidate FAIDs. Finally, simulation results show the validity of the proposed algorithm.

Key words: finite alphabet iterative decoder, Tanner graph, trapping set, low density parity check codes

郭军军;慕建君. 一种LDPC码有限字母表迭代译码器选择算法[J]. J4, 2013, 40(6): 111-115.

GUO Junjun;MU Jianjun. Selection algorithm of finite alphabet iterative decoders for LDPC codes[J]. J4, 2013, 40(6): 111-115.

参考文献

［1］ Gallager R G. Low-density Parity-check Codes ［J］. IRE Transcations on Information Theory, 1962, 8(1): 21-28.
［2］ MacKay D J C, Neal R M. Near Shannon Limit Performance of Low Density Parity Check Codes ［J］. Electronic Letters, 1997, 32(18): 1645-1646.
［3］ Di C, Proietti D, Emre T, et al. Finite Length Analysis of Low-density Parity-check Codes on the Binary Erasure Channel［J］. IEEE Transcations on Information Theory, 2002, 48(6): 1570-1579.
［4］ Kelley C, Sridhara D. Pseudocodewords of Tanner Graphs ［J］. IEEE Transcations on Information Theory, 2007, 53(11): 4013-4038.
［5］陈霖, 冯大政. 一种快速的渐进边增长算法［J］. 西安电子科技大学学报, 2009, 36(3): 406-409.
Chen Lin, Feng Dazheng. Fast Progressive Edge-growth Algorithm ［J］. Journal of Xidian University, 2008, 36(3): 406-409
［6］ Richardson T. Error Floor of LDPC Codes ［C］//41st Annual Conference on Communication, Control and Computing. Piscataway: IEEE, 2003: 1426-1435.
［7］ Planjery S K, Declercq D, Chilappagari S K, et al. Mulitilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel ［C］//IEEE International Symposium Information Theory. Piscataway: IEEE, 2010: 769-773.
［8］ Danjean L, Declercq D, Planjery S K, et al. On the Selection of Finite Alphabet Iterative Decoders for LDPC Codes on the BSC ［C］//IEEE Information Theory Workshop. Piscataway: IEEE, 2011: 345-349.
［9］ Planjery S K, Declercq D, Danjean L, et al. Finite Alphabet Iterative Decoders for LDPC Codes Surpassing Floating-point Iterative Decoders ［J］. Electronic Letters, 2011, 47(16): 919-921.
［10］ MacKay D J C. Encyclopedia of Sparse Graph Codes［DB/OL］. ［2012-2-9］. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.49.9987&rep=repl&type=pdf.

[1]	周沈洋,白宝明,任兆丰,朱敏,李秉豪,唐瑞波. 面向高吞吐传输的级联极化码BP List译码算法[J]. 西安电子科技大学学报, 2020, 47(6): 58-65.
[2]	王祥旭,车书玲,纪玉晖. 一种有效的局部可修复码的构造方法[J]. 西安电子科技大学学报, 2019, 46(3): 26-31.
[3]	王彪;慕建君;焦晓鹏;王钟斐. LDPC码ADMM惩罚译码的早停止方法[J]. 西安电子科技大学学报, 2018, 45(5): 43-49.
[4]	孙成;徐恒舟;冯丹;白宝明;张玉龙. 可分解的可分组设计构造的LDPC码[J]. 西安电子科技大学学报, 2017, 44(3): 31-35+42.
[5]	徐娟;姚如贵;李路;高凡琪. 优化稀疏LU分解的LDPC编码算法研究 [J]. J4, 2015, 42(2): 127-132.
[6]	陈超;白宝明;王新梅. 一类具有低密度生成矩阵的非二元准循环LDPC码[J]. J4, 2010, 37(3): 412-416.
[7]	焦晓鹏;慕建君;周利华. 一种Tanner图短环计数新方法[J]. J4, 2010, 37(2): 311-314.
[8]	陈霖;冯大政. 一种快速的渐进边增长算法[J]. J4, 2009, 36(3): 406-409.
[9]	陈汝伟1;2;黄华伟3;杜小妮4;丁勇2;肖国镇1. Tanner 图中最短圈的计数 [J]. J4, 2008, 35(6): 983-985.
[10]	王单;童胜;李颖;王新梅. LDPC码的快速收敛译码算法[J]. J4, 2005, 32(1): 103-107.
[11]	童胜;王鹏;王单;王新梅. LDPC码量化和积译码的高效实现[J]. J4, 2004, 31(5): 709-713.
[12]	贺玉成;孙韶辉;慕建君;王新梅. 快速低密度校验码迭代译码量化算法[J]. J4, 2002, 29(2): 338-343.

一种LDPC码有限字母表迭代译码器选择算法

Selection algorithm of finite alphabet iterative decoders for LDPC codes

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

Metrics

本文评价

推荐阅读 10