Decoding for LDPC codes with enhanced residual belief-propagation
-
摘要: 低密度奇偶校验(LDPC,Low-Density Parity-Check)码的剩余度置信度传播(RBP,Residual Belief-Propagation)和基于行的剩余度置信度传播(NWRBP,Node-Wise RBP)解码算法的性能提升非常有限且计算复杂度较高.提出改进的RBP(ERBP,Enhanced RBP)算法,在一个子迭代中,仅更新一个消息,然后设置被更新消息所在行的所有节点的剩余度值为0,使得ERBP解码算法在每个子迭代中使用不同行的消息进行计算,以加速迭代收敛.不同的LDPC码用于对所提出的算法进行性能仿真.仿真结果表明,与其他算法相比,ERBP算法降低了误帧率(FER,Frame Error Ratio),并加快了迭代收敛速度.
-
关键词:
- 信道编码 /
- 低密度奇偶校验码 /
- 迭代译码 /
- 消息传递 /
- 基于行的剩余度置信度传播
Abstract: The performance improvements of residual belief-propagation (RBP) and node-wise RBP (NWRBP) decoding algorithms for low-density parity-check (LDPC) codes are very limited while at cost of high computational complexity. The enhanced RBP (ERBP) decoding algorithm was proposed, which updates only one message and then sets the residuals of all messages in the row of the updated message to 0 in one sub-iteration, thus the ERBP can utilize the messages in different check equations in each sub-iteration to increase the iteration convergence rate. Different LDPC codes were used to test the performance of the proposed algorithm. The simulation results show that the proposed algorithm, when compared with other algorithms, lowers frame error ratio (FER) and speeds up the iterative convergence. -
[1] Gallager R G.Low-density parity-check codes[M].Cambridge,MA:MIT Press,1963:50-100 [2] Mackay D J C,Neal R M.Near Shannon limit performance of low density parity check codes[J].Electronics Letters,1996, 33(6):457-458 [3] Richardson T J,Urbanke R.The capacity of low-density parity check codes under message passing decoding[J].IEEE Trans Inform Theory,2001,47(1):599-618 [4] Hocevar D E.A reduced complexity decoder architecture via layered decoding of LDPC codes[C]//Proc IEEE Workshop on Signal Proc Sys(SIPS.04).Austin,TX:IEEE,2004:107-112 [5] Mohammad M M.A turbo-decoding message-passing algorithm for sparse parity-check matrix codes[J].IEEE Trans Signal Processing,2006,54(11):4376-4392 [6] Elidan G,McGraw I,Koller D.Residual belief propagation: informed scheduling for asynchronous message passing[C]//Proc 22nd Conf on UAI.Cambridge,MA:MIT Press,2006:165-173 [7] Casado A,Griot M,Wesel R D.Informed dynamic scheduling for belief-propagation decoding of LDPC codes[C]//Proc ICC 2007.Glasgow,Scotland:IEEE,2007:932-937 [8] Han G J,Liu X C.An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes[J].IEEE Commun Lett,2009,13(12):950-952 [9] Saejoon K,Karam K.Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes[J].IEEE Commun Lett,2009,13(3):193-195 [10] Gong Y,Liu X C.Effective informed dynamic scheduling for belief propagation decoding of LDPC codes[J].IEEE Trans Commun,2011,59(10):2683-2691 [11] Pearl J.Probabilistic reasoning in intelligent systems[M].San Mateo:Morgan Kaufman,1988:29-236 [12] Etzion T,Trachtenberg A,Vardy A.Which codes have cycle-free Tanner graphs [J].IEEE Trans Inform Theory,1999, 45(6):2173-2181 [13] IEEE P802.16e/2009 IEEE standard for local and metropolitan area network part 16:air interface for fixed and mobile broadband wireless access systems[S] [14] IEEE P802.11n/2009 IEEE standard for information technology-local and metropolitan area networks-specific requirements-part 11:wireless LAN medium access control (MAC)and physical layer (PHY) specifications amendment 5:enhancements for higher throughput[S]
点击查看大图
计量
- 文章访问数: 1388
- HTML全文浏览量: 176
- PDF下载量: 586
- 被引次数: 0