低密度奇偶校驗碼之自適應分群解碼演算法

Adaptive Shuffled Belief-Propagation Decoding Algorithms for LDPC Codes

王鴻軒(Hung-Hsuan Wang)

指導教授 ： 蘇育德

國立交通大學/電機學院/電機學院電信學程/碩士(2016年)

摘要

本篇論文針對低密度奇偶校驗碼提出了一種新的分群信度傳遞解碼演算法。我們提出之演算法在每次疊代解碼時皆會更新分群狀況。為達成此目的我們提出的演算法中包含了3 個步驟。首先先找出相對可靠的變數點(variable node)，再利用這些可靠的變數點找出可靠的校驗點(check node)，最後再選出能連接到最多可靠校驗點的變數點將其分成同一群，同時進行資訊更新。所有的變數點在每一次解碼疊代必會被選中且更新。藉由模擬可知，比起現有之演算法，本論文所提出的演算法能有較佳的效能。

關鍵字

低密度奇偶校驗碼 ； 自適應 ； 分群 ； 演算法

並列摘要

We propose a new group shuffled belief propagation (BP) decoding algorithm for low-density parity check (LDPC) code. In our method, the variable nodes (VNs) will be re-grouped in each iteration. First, we decide if each message sent from a VN to a check node (CN) is reliable. Then, we further identify the CN which can provide reliable information. Based on the filtering of the reliable messages, we select the VNs which are able to obtain most reliable messages in to a group. After VN updating, the above procedure will be re-performed until all VNs are updated in one iteration. Numerical results show that the proposed shuffled BP decoding outperforms the existing shuffled BP decoders for LDPC codes and performance improvements become more distinctive at higher rate.

並列關鍵字

LDPC code ； Shuffled Belief-Propagation Decoding ； Adaptive Decoding

參考文獻

[1] R. G. Gallager, “Low-density parity-check codes,”IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, Jan. 1962.

[2] R. M. Tanner,“A recursive approach to low complexity codes,”IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sep. 1981.

[3] J. Ha and S. W. McLaughlin, ”Optimal puncturing distributions for rate-compatible low-density parity-check codes,” 2003 IEEE International Symposium on Information Theory,, pp. 233, 2003.

[4] L. Zhang, F. Ma, and L. L. Cheng, ”A puncturing scheme for low-density paritycheck codes based on 1-SR node,” IEEE Vehicular Technology Conference(VTC),, pp. 1-6,Sept. 2012.

[5] B. N. Vellambi, F. Fekri, ”Finite-Length rate-compatible LDPC codes: a novel puncturing scheme,” IEEE Transaction on Communication,, vol. 57, pp. 297-301, Feb.