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

doi:10.3969/j.issn.1001-2400.2013.06.020

Abstract

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

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

References

［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]	ZHANG Yamei,ZHOU Lin,CHEN Chen,CHEN Qiwang,HE Yucheng. Sliding window decoding of the spatially coupled LDPC code Over Rayleigh fading channels [J]. Journal of Xidian University, 2020, 47(6): 78-83.
[2]	ZHANG Yamei,ZHOU Lin,CHEN Chen,GUO Rongxin,HE Yucheng. Sliding window decoding algorithm for spatially coupled LDPC codes with a variable window [J]. Journal of Xidian University, 2020, 47(3): 128-134.
[3]	WANG Xiangxu,CHE Shuling,JI Yuhui. Effective construction method for locally repairable codes [J]. Journal of Xidian University, 2019, 46(3): 26-31.
[4]	DAI Jingke;LIN Kailiang. Analysis and optimization of the LDPC code on the land mobile satellite channel [J]. Journal of Xidian University, 2018, 45(3): 52-57.
[5]	ZHANG Zhaoji;LI Ying. Asymmetric spatially-coupled LDPC codes for burst erasure channels [J]. Journal of Xidian University, 2017, 44(5): 1-6.
[6]	FAN Ya'nan;WANG Lichong;YAO Xiujuan;MENG Xin. Overlapped layered belief-propagation LDPC decoding algorithm [J]. Journal of Xidian University, 2017, 44(2): 88-94.
[7]	XU Juan;YAO Rugui;LI Lu;GAO Fanqi. LDPC encoding algorithm based on optimized sparse LU decomposition in the CMMB standard [J]. J4, 2015, 42(2): 127-132.
[8]	JIAO Xiao-peng;MU Jian-jun;ZHOU Li-hua. Novel method for counting short cycles of Tanner graphs [J]. J4, 2010, 37(2): 311-314.
[9]	CHEN Ru-wei1;2;HUANG Hua-wei3;DU Xiao-ni4;DING Yong2;XIAO Guo-zhen1. On the number of shortest cycles of Tanner graphs [J]. J4, 2008, 35(6): 983-985.

Selection algorithm of finite alphabet iterative decoders for LDPC codes

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 9

Metrics

Comments

Recommended 10