中国邮电高校学报(英文) ›› 2008, Vol. 15 ›› Issue (1): 28-31.doi: 1005-8885 (2008) 01-0028-04

• Wireless • 上一篇    下一篇

Early stopping for the iterative decoding for Q-LDPC

周伟;门爱东;全子一   

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:2007-01-17 修回日期:1900-01-01 出版日期:2008-03-31
  • 通讯作者: 周伟

Early stopping for the iterative decoding for Q-LDPC

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2007-01-17 Revised:1900-01-01 Online:2008-03-31
  • Contact: Zhou Wei

摘要:

Q-ary low-density parity-check (Q-LDPC) codes have a better performance than those of the binary low-density parity-check (B-LDPC) codes, at short and medium block lengths, but the decoder of Q-LDPC has more complexity. In this article, a new stop criterion is proposed. By analyzing the changes of the maximum posteriori probability of the variable node, the criterion decides whether the iteration of the decoder must be stopped. The simulation results show that the stop criterion can effectively reduce the computation complexity of the Q-LDPC decoder with negligible performance loss.

关键词:

Q-ary;LDPC,;stop;criterion,;iterative;decoding

Abstract:

Q-ary low-density parity-check (Q-LDPC) codes have a better performance than those of the binary low-density parity-check (B-LDPC) codes, at short and medium block lengths, but the decoder of Q-LDPC has more complexity. In this article, a new stop criterion is proposed. By analyzing the changes of the maximum posteriori probability of the variable node, the criterion decides whether the iteration of the decoder must be stopped. The simulation results show that the stop criterion can effectively reduce the computation complexity of the Q-LDPC decoder with negligible performance loss.

Key words:

Q-ary LDPC;stop criterion;iterative decoding

中图分类号: