Construction of QC-LDPC Codes with Girth Larger Than Eight Based on GPU

被引：0

作者：

He, Yejun ^{[1
]}

Yang, Jie ^{[1
]}

机构：

[1] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China

来源：

2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2012) | 2012年

关键词：

QC-LDPC; girth; Graphic Processing Unit (GPU); Compute Unified Device Architecture (CUDA);

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Based on the necessary and sufficient conditions for increasing girth, a shortened cycle elimination algorithm to construct Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes with large girth based on the Graphic Processing Unit (GPU) is presented. Firstly, we propose a cycle statistics algorithm based on GPU to search for the elements of base matrix that satisfies the no-cycle conditions. If the search process fails to find qualified elements, we delete the corresponding column in which this element is located in order to make the algorithm converge. And then, we apply GPU to construct QC-LDPC codes and get base matrices of QC-LDPC codes with girth larger than eight.

引用

页数：6

共 50 条

[41] Girth-8 (3, L)-regular QC-LDPC codes based on novel deterministic design technique [J].

Zhang G.-H. ;

Chen C. ;

Yang Y. ;

Wang X.-M. .

Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2010, 32 (05) :1152-1156

[42] Tanner (3,23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution [J].

Wang, Qi ;

Che, Jingping ;

Li, Huaan ;

Luo, Zhen ;

Zhang, Bo ;

Liu, Hui .

IEEE ACCESS, 2024, 12 :26591-26609

[43] A Subtraction Based Method for the Construction of Quasi-Cyclic LDPC Codes of Girth Eight [J].

Bajpai, Ambar ;

Kalsi, Abhishek ;

Wuttisittikulkij, Lunchakorn ;

Kovintavewat, Piya .

2016 INTERNATIONAL SIBERIAN CONFERENCE ON CONTROL AND COMMUNICATIONS (SIBCON), 2016,

[44] Some variations of Tanner's construction for short length QC-LDPC codes [J].

Kim, Wonjun ;

Cho, Hyunwoo ;

Song, Hong-Yeop ;

Song, Min Kyu .

ELECTRONICS LETTERS, 2024, 60 (03)

[45] Efficient Construction for QC-LDPC Convolutional Codes with Periodic Bit-Filling [J].

Zhao, Ming ;

Liu, Zhipeng ;

Zhao, Ling .

2018 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING TECHNOLOGY (CCET), 2018, :39-43

[46] Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6 [J].

Sadeghi, Mohammad-Reza ;

Amirzade, Farzane .

IEEE COMMUNICATIONS LETTERS, 2018, 22 (08) :1528-1531

[47] Girth Analysis of Tanner's (3,17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm [J].

Xu, Hengzhou ;

Duan, Yake ;

Miao, Xiaoxiao ;

Zhu, Hai .

IEEE ACCESS, 2019, 7 :94917-94930

[48] A Novel Construction Method of QC-LDPC Based on BIBD and Protograph [J].

Huang, Sheng ;

Zhang, Rui ;

Jia, Xueting ;

Ao, Xiang ;

Yuan, Jianguo .

PROCEEDINGS OF THE 2017 5TH INTERNATIONAL CONFERENCE ON FRONTIERS OF MANUFACTURING SCIENCE AND MEASURING TECHNOLOGY (FMSMT 2017), 2017, 130 :1125-1131

[49] A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth [J].

Smarandache, Roxana ;

Mitchell, David G. M. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (09) :5802-5822

[50] A construction algorithm with optimized shift value of circulant permutation matrix for QC-LDPC codes [J].

Zheng, Jian ;

Bie, Hong-Xia ;

Lei, Chun-Yang ;

Zhang, Xue-Kun ;

Fang, Ming .

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2014, 37 (01) :16-19

← 1 2 3 4 5 →