Construction of LDPC codes over GF(q) with 
modified progressive edge growth

doi:10.1016/S1005-8885(08)60275-7

中国邮电高校学报(英文) ›› 2009, Vol. 16 ›› Issue (5): 103-106.doi: 10.1016/S1005-8885(08)60275-7

Construction of LDPC codes over GF(q) with
modified progressive edge growth

陈昕,门爱东,杨波,全子一

School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

收稿日期:2008-12-09 修回日期:1900-01-01 出版日期:2009-10-30
通讯作者: 陈昕

Construction of LDPC codes over GF(q) with
modified progressive edge growth

CHEN Xin ,MEN Ai-dong, YANG Bo, QUAN Zi-yi

School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2008-12-09 Revised:1900-01-01 Online:2009-10-30
Contact: CHEN Xin

摘要/Abstract

摘要：

A parity check matrix construction method for constructing a low-density parity-check (LDPC) codes over GF(q) (q>2) based on the modified progressive edge growth (PEG) algorithm is introduced. First, the nonzero locations of the parity check matrix are selected using the PEG algorithm. Then the nonzero elements are defined by avoiding the definition of subcode. A proof is given to show the good minimum distance property of constructed GF(q)-LDPC codes. Simulations are also presented to illustrate the good error performance of the designed codes.

关键词:

LDPC;codes;over;GF(q),;progressive;edge;growth,;large;minimum;distance

Abstract:

Key words:

LDPC codes over GF(q);progressive edge growth;large minimum distance

CHEN Xin ,MEN Ai-dong, YANG Bo, QUAN Zi-yi. Construction of LDPC codes over GF(q) with
modified progressive edge growth[J]. Acta Metallurgica Sinica(English letters), 2009, 16(5): 103-106.

参考文献

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. Low-density parity-check codes over GF(q). IEEE Communications Letters, 1998, 2(6): 165-167

4. Hu X Y, Eleftheriou E, Arnold D M. Regular and irregular progressive edge-growth Tanner graphs. IEEE Transactions on Information Theory, 2005, 51(1): 386-398

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

6. Mackay D J C. Optimizing sparse graph codes over GF(q). Cambridge, UK: Cavendish Laboratory, 2003

7. Kimura D, Guilloud F, Pyndiah R M. Construction of parity-check matrices for non-binary LDPC codes. Proceedings of the 4th International symposium on Turbo Codes and Related Topics, Apr 3-7, 2007, Munich, Germany. 2007

8. Vardy A. The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory, 1997, 43(6): 1757-1766

9. Tanner R M. Minimum-distance bounds by graph analysis. IEEE

Transactions on Information Theory, 2001, 47(2): 808-821

10. Mao Y Y, Banihashemi A H. A heuristic search for good low-density parity-check codes at short block lengths. Proceedings of IEEE International Conference on Communications(ICC’01): Vol 1, Jun 11-14, 2001, Helsinki, Finland. Piscataway, NJ, USA: IEEE, 2001: 41-44

11. Hu X Y, Eleftheriou E, Arnold D M. Irregular progressive edge-growth Tanner graphs. Proceedings of IEEE International Symposium on Information Theory (ISIT’02), Jun 30-Jul 5, Lausanne, Switzerland. Piscataway, NJ, USA: IEEE, 2002: 480

[1]	Chai Rong, Duan Xiaofang, Wang Lixuan. GNN-based temporal knowledge reasoning for UAV mission planning systems[J]. 中国邮电高校学报(英文版), 2024, 31(1): 12-25.
[2]	Li Linpei, Zhao Chuan, Su Yu, Huo Jiahao, Huang Yao, Li Haojin. Energy-efficient computation offloading assisted by RIS-based UAV[J]. 中国邮电高校学报(英文版), 2024, 31(1): 37-48.
[3]	Cai Xiumei, He Ningning, Wu Chengmao, Liu Xiao, Liu Hang. Fractional order distance regularized level set method with bias correction[J]. 中国邮电高校学报(英文版), 2024, 31(1): 64-82.
[4]	梁晓林, 戎展毅, 曹旺斌, 刘帅奇, 赵雄文. Performance analysis of different coding schemes for wideband vehicle-to-vehicle MIMO systems [J]. 中国邮电高校学报(英文版), 2023, 30(6): 89-98.
[5]	孟慧任利娜赵宗渠. Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution[J]. 中国邮电高校学报(英文版), 2023, 30(5): 51-60.
[6]	Zhang Luying, Liu Xiaokai, Li Zhao, Xu Fangmin, Zhao Chenglin. Prediction based dynamic resource allocation method for edge computing first networking [J]. 中国邮电高校学报(英文版), 2023, 30(3): 78-87.
[7]	王丹志向键鑫崔岩松. KG-based memory recommendation algorithm for learning path[J]. 中国邮电高校学报(英文版), 2023, 30(2): 36-48.
[8]	路畅方园邱玲梁晓雯. Performance analysis and low complexity receiver design for extra-large scale MIMO systems with residual hardware impairments[J]. 中国邮电高校学报(英文版), 2023, 30(2): 18-25.
[9]	束丰张玲华丁寅. Iterative subspace matching pursuit for joint sparse recovery[J]. 中国邮电高校学报(英文版), 2023, 30(2): 26-35.
[10]	Guo Xiangbo, Wang Jian, Huang Mengjie, Wang Minghui, Yang Jian, Yu Yongtao. Deep knowledge tracking algorithm based on forgetting law[J]. 中国邮电高校学报(英文版), 2023, 30(1): 17-27.
[11]	Wu Hongxin, Lin Zhijian, Chen Pingping, Chen Feng. Joint partial computation offloading and resource allocation in MEC-enable networks[J]. 中国邮电高校学报(英文版), 2023, 30(1): 80-86.
[12]	Zhu Ruijie, Li Gong, Wang Peisen, Zhang Wenchao. Reinforced virtual optical network embedding algorithm in EONs for edge computing [J]. 中国邮电高校学报(英文版), 2022, 29(6): 18-29.
[13]	Wang Jian, Qiao Kuoyuan, Yuan Yanlei, Liu Xiaole, Yang Jian. Adaptive learning path recommendation model for examination-oriented education[J]. 中国邮电高校学报(英文版), 2022, 29(4): 77-88.
[14]	Yang Chao, Li Yimin, Li Tong, Xu Siya, Qi Jun, Zhang Yu. Intelligent Service Function Chain Mapping Framework for Cloud-and-Edge-Collaborative IoT[J]. 中国邮电高校学报(英文版), 2022, 29(3): 54-68.
[15]	韩伊凡冯涛刘晓凯许方敏赵成林. Edge-cloud collaborative intelligent production scheduling based on digital twin[J]. 中国邮电高校学报(英文版), 2022, 29(2): 108-120.

Construction of LDPC codes over GF(q) with
modified progressive edge growth

Construction of LDPC codes over GF(q) with
modified progressive edge growth

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

Construction of LDPC codes over GF(q) with modified progressive edge growth

Construction of LDPC codes over GF(q) with modified progressive edge growth

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

Construction of LDPC codes over GF(q) with
modified progressive edge growth

Construction of LDPC codes over GF(q) with
modified progressive edge growth