|Table of Contents|

[1] Liu Xiaojian, Zhao Chunming, Wu Xiaofu,. Improved parallel weighted bit-flipping algorithm [J]. Journal of Southeast University (English Edition), 2009, 25 (4): 423-426. [doi:10.3969/j.issn.1003-7985.2009.04.001]
Copy

Improved parallel weighted bit-flipping algorithm()
改进型并行比特翻转算法
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
25
Issue:
2009 4
Page:
423-426
Research Field:
Information and Communication Engineering
Publishing date:
2009-12-30

Info

Title:
Improved parallel weighted bit-flipping algorithm
改进型并行比特翻转算法
Author(s):
Liu Xiaojian Zhao Chunming Wu Xiaofu
National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
刘晓健 赵春明 吴晓富
东南大学移动通信国家重点实验室, 南京 210096
Keywords:
low-density parity-check(LDPC) parallel weighted bit-flipping(PWBF) improved modified weighted bit-flipping(IMWBF)algorithm weighted-sum weighted bit-flipping(WSWBF)algorithm
低密度奇偶校验(LDPC) 并行比特翻转 改进的权重型比特翻转算法 校验和加权的权重型比特翻转算法
PACS:
TN911.22
DOI:
10.3969/j.issn.1003-7985.2009.04.001
Abstract:
An improved parallel weighted bit-flipping(PWBF)algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0.1 to 0.3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time.The improvement is particularly effective for decoding quasi-cyclic low-density parity-check(QC-LDPC)codes.
提出一种改进的并行比特翻转算法. 为了加快校验节点和变量节点之间的信息传递速率, 算法中的比特翻转及校验和更新2个步骤采用并行化处理. 仿真结果表明, 改进后的算法相对于原有的并行比特翻转算法在误帧率性能上能够取得0.1~0.3 dB的增益. 同时, 改进算法在译码吞吐率的性能上也有所改善. 此外, 还讨论了翻转门限的选择方法, 这些门限决定了每次迭代中哪些比特需要被翻转. 通过选择合适的翻转门限, 可使错误的比特尽量多地被翻转, 并避免翻转正确的比特. 该改进算法比较适用于对具有准循环结构的LDPC码进行译码.

References:

[1] Richardson T, Urbanke R. The capacity of low-density parity-check nodes under message-passing decoding [J]. IRE Trans Inform Theory, 2001, 47(2): 599-618.
[2] Wiberg N. Codes and decoding on general graphs [D]. Linköping, Sweden: Department of Electrical Engineering of Linköping University, 1996.
[3] Kschischang F R, Frey B J, Loeliger H A. Factor graphs and the sum-product algorithm [J]. IRE Trans Inform Theory, 2001, 47(2): 498-519.
[4] Shan M, Zhao C M, Jiang M. Improved weighted bit-flipping algorithm for decoding LDPC codes [J]. IEE Proc Commun, 2005, 152(6): 919-922.
[5] Wu Xiaofu, Zhao Chunming, You Xiaohu. Parallel weighted bit-flipping decoding [J]. IEEE Commun Lett, 2007, 11(8): 671-673.
[6] Wu Xiaofu, Ling Cong, Jiang Ming, et al. Towards understanding weighted bit-flipping decoding [C]//IEEE Int Symp Inform Theory 07. Nice, France, 2007: 1666-1670.
[7] Zhang Juntan, Fossorier Marc P C. A modified weighted bit-flipping decoding of low-density parity-check codes [J]. IEEE Commun Lett, 2004, 8(3): 165-167.
[8] Liu Zhenyu, Pados Dimitris A. A decoding algorithm for finite-geometry LDPC codes [J]. IEEE Trans Commun, 2005, 53(3): 415-421.
[9] Jiang Ming, Zhao Chunming, Shi Zhihua, et al. An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes [J]. IEEE Commun Lett, 2005, 9(9): 814-816.
[10] Kou Y, Lin S, Fossorier M P C. Low-density parity-check codes based on finite geometries: a rediscovery and new results [J]. IEEE Trans Info Theory, 2001, 47(7): 2711-2736.
[11] Song S, Lan L, Lin S, et al. Construction of quasi-cyclic LDPC codes based on the primitive elements of finite fields [C]//IEEE Information Sciences and Systems. Princeton, NJ, USA, 2006: 22-24.
[12] Kim Sunghwan, No Jong-Seon, Chung Habong, et al. Quasi-cyclic low-density parity-check codes with girth larger than 12 [J]. IEEE Trans Inform Theory, 2007, 53(8): 2885-2891.
[13] Li Zongwang, Chen Lei, Zeng Lingqi, et al. Efficient encoding of quasi-cyclic low-density parity-check codes [C]//IEEE Global Telecommunications Conference. St Louis, MO, USA, 2005: 71-81.
[14] Liva G, Ryan W E, Chiani M. Quasi-cyclic generalized LDPC codes with low error floors[J]. IEEE Trans Commun, 2008, 56(1): 49-57.
[15] Sha Jin, Gao Minglun, Zhang Zhongjin, et al. Efficient decoder implementation for QC-LDPC codes [C]//Proceedings of International Conference on Communications, Circuits and Systems. Guangzhou, China, 2006: 2498-2502.

Memo

Memo:
Biographies: Liu Xiaojian(1982—), female, graduate; Zhao Chunming(corresponding author), male, doctor, professor, cmzhao2@seu.edu.cn.
Foundation items: The National High Technology Research and Development Program of China(863 Program)(No.2009AA01Z235, 2006AA01Z263), the Research Fund of the National Mobile Communications Research Laboratory of Southeast University(No.2008A10).
Citation: Liu Xiaojian, Zhao Chunming, Wu Xiaofu. Improved parallel weighted bit-flipping algorithm[J]. Journal of Southeast University(English Edition), 2009, 25(4): 423-426.
Last Update: 2009-12-20