Early stopping for the iterative decoding for Q-LDPC

doi:1005-8885 (2008) 01-0028-04

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

Early stopping for the iterative decoding for Q-LDPC

周伟;门爱东;全子一

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

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

摘要/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.

关键词:

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

Abstract:

Key words:

Q-ary LDPC;stop criterion;iterative decoding

中图分类号:

TN911

参考文献

1. Gallager R G. Low density parity check codes. IRE Transactions on Inform Theory, 1962, 8(1): 21-28

2. MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes . Electronics Letters 1996, 32(18): 1645-1646

3. Davey M C, MacKay D J C. Low Density Parity-Check Codes over GF(q). IEEE Communications Letters, 1998, 2(6): 165-167

4. Davey M C. Error-correction using low-density parity-check codes. Cambridge, UK: University of Cambridge, 1999

5. Richardson T, Shokrollahi A, Urbanke R. Design of capacity- approaching low-density parity-check codes. IEEE Transactions on Information Theory, 2001, 47(2): 619-637

6. Song Hong-xin, CRUZ J R. Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. IEEE Transactions on Magnetic, 2003, 39 (3): 1081-1087

7. Wymerrsch H, Steendam H, Moeneclaey M. Log domain decoding of LDPC codes over GF(q). Proceeding of 2004 International Conference on Communications (ICC’ 04): Vol 2, Jun 20-24, 2004, Paris, France. Piscataway, NJ, USA: IEEE, 2004: 772-776

8. Bennatan A, Burshtein D. Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels. IEEE Transactions on Informations Theory, 2006, 52(2): 549-583

9. Declercq D, Fossorier M. Extended minsum algorithm for decoding LDPC codes over GF(q). Proceedings of International Symposium on Information Theory (ISIT’ 05),Sep 4-9, 2005, Adelaide, Australia. Piscataway, NJ, USA: IEEE, 2005: 464-468

10. Kienle F, Wehn N. Low complexity stopping criterion for LDPC code decoders. Proceedings of 61 the Vehicular Technology Conference(VTC’2005-Spring): Vol. 1, May 30-June 1, 2005, Stockholm, Sweden. Piscataway, NJ, USA: IEEE, 2005: 606-609

11. Divsalar D, Dolinar S, Pollara F. Low complexity turbo-like codes. Proceedings of The 2nd International Symposium on Turbo Codes and related topics, Sep 4-7, 2000, Brest, France. 2000: 73-80

12. Richardson T J, Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 2001, 47(2): 599-618

13. Brink S, Convergence behaviour of iteratively decoded parallel concatenated codes. IEEE Transactions on Communications, 2001, 49(10): 1727-1737

14. MACKAY D J C. Encyclopedia of sparse graph codes [2005- 10-21]. http://www.inference.phy.cam.ac.uk/mackay/codes/data.html.

[1]	梁晓林, 戎展毅, 曹旺斌, 刘帅奇, 赵雄文. Performance analysis of different coding schemes for wideband vehicle-to-vehicle MIMO systems [J]. 中国邮电高校学报(英文版), 2023, 30(6): 89-98.
[2]	罗智勇刘心彤许海峰谢志强李杰. Accuracy optimization of virtual iterative reduction algorithm under time constraint [J]. 中国邮电高校学报(英文版), 2023, 30(2): 49-60.
[3]	张志军牛凯董超. Iterative list decoding approach for Reed-Solomon codes[J]. 中国邮电高校学报(英文版), 2019, 26(3): 8-14.
[4]	Yuan Fang, Tian Bin. Modified min-sum SCAN decoding algorithm for polar codes[J]. 中国邮电高校学报(英文版), 2018, 25(6): 90-96.
[5]	孙书龙 Linmin. Low complexity NB-LDPC decoder based on shared comparator architecture for ECN/EVN[J]. 中国邮电高校学报(英文版), 2018, 25(3): 65-70.
[6]	韩宇南袁思雨孙晓昱梅超凡. Design of low-pass filter with 3-interations Koch fractal Pi-shaped DGS[J]. 中国邮电高校学报(英文版), 2018, 25(3): 92-96.
[7]	Wang Xiuli, Hao Yakun. Two constructions of LDPC codes based on pseudo-symplectic geometry over finite fields[J]. 中国邮电高校学报(英文版), 2018, 25(2): 49-59.
[8]	赵哲高飞郑浩 YinXue. Area-efficient analog decoder design for low density parity check codes in deep-space applications[J]. 中国邮电高校学报(英文版), 2017, 24(4): 69-75.
[9]	Zheng Hao, Zhang Shuyi, Li Lintao, Gao Yuan, Shao Liwei. Probability stopping criterion for analog decoding of LDPC codes[J]. 中国邮电高校学报(英文版), 2017, 24(1): 35-39.
[10]	雷维嘉陈胜男. Performance analysis of complexity reduction BP decoding of rateless codes by deleting low reliable symbols[J]. 中国邮电高校学报(英文版), 2016, 23(5): 26-31.
[11]	卞建超刘会霞罗守山查雅行李伟. Proof of Retrievability Based on LDPC Codes[J]. Acta Metallurgica Sinica(English letters), 2015, 22(4): 17-25.
[12]	卿浩博刘元安谢刚刘凯明刘芳. Parametric channel modeling based OFDM channel estimation[J]. Acta Metallurgica Sinica(English letters), 2014, 21(5): 1-8.
[13]	郭一珺郝建军乐光新. Reduce the decoding complexity: segment linear network coding[J]. Acta Metallurgica Sinica(English letters), 2013, 20(6): 55-61.
[14]	张金玲张洪欣 LU Ying-hua ZHANG Li-kun. Dual-band-stop filters with unsymmetrical T-shape DGS resonators[J]. Acta Metallurgica Sinica(English letters), 2013, 20(4): 112-115.
[15]	刘淑华李勇朝张海林刘英挺. Threshold-based piecewise companding transform for PAPR reduction in OFDM systems[J]. Acta Metallurgica Sinica(English letters), 2013, 20(2): 1-6.

Early stopping for the iterative decoding for Q-LDPC

Early stopping for the iterative decoding for Q-LDPC

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价