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 条

[31] A new algorithm of counting the number of small Stopping sets and girth in QC-LDPC Codes [J].

Kong, Lingjun ;

Xiao, Yang .

ICSP: 2008 9TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-5, PROCEEDINGS, 2008, :1772-1775

[32] Design of good QC-LDPC codes without small girth in the p-plane [J].

Lingjun Kong and Yang Xiao Institute of Information Science Beijing Jiaotong University Beijing P R China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming P R China .

JournalofSystemsEngineeringandElectronics, 2011, 22 (02) :183-187

[33] Design of good QC-LDPC codes without small girth in the p-plane [J].

Kong, Lingjun ;

Xiao, Yang .

JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2011, 22 (02) :183-187

[34] Shortening for Irregular QC-LDPC Codes [J].

Liu, Xiaojian ;

Wu, Xiaofu ;

Zhao, Chunming .

IEEE COMMUNICATIONS LETTERS, 2009, 13 (08) :612-614

[35] Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten [J].

ZHANG GuoHua WANG JuHua LI XueYuan WANG XinMei State Key Laboratory of Integrated Service Networks Xidian University Xian China China Academy of Space Technology Xian Xian China .

Chinese Science Bulletin, 2011, 56 (12) :1277-1283

[36] Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten [J].

Zhang GuoHua ;

Wang JuHua ;

Li XueYuan ;

Wang XinMei .

CHINESE SCIENCE BULLETIN, 2011, 56 (12) :1272-1277

[37] Performance Analysis of QC-LDPC Construction Based on Distance Graph [J].

Li, Lixin ;

Zhu, Meng ;

Yang, Fan ;

Zhang, Yang .

PROCEEDINGS OF THE 2013 IEEE 8TH CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2013, :1162-1166

[38] Construction of girth-8 (3,L)-QC-LDPC codes of smallest CPM size using column multipliers [J].

Singh, Jasvinder ;

Gupta, Manish ;

Bhullar, Jaskarn Singh .

DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (01) :41-49

[39] Construction of girth-8 (3,L)-QC-LDPC codes of smallest CPM size using column multipliers [J].

Jasvinder Singh ;

Manish Gupta ;

Jaskarn Singh Bhullar .

Designs, Codes and Cryptography, 2020, 88 :41-49

[40] Construction of QC-LDPC Codes Based on Pre-Masking and Local Optimal Searching [J].

Wang, Dongdong ;

Wang, Liqian ;

Chen, Xue ;

Fei, Aimei ;

Ju, Chen ;

Wang, Zhirong .

IEEE COMMUNICATIONS LETTERS, 2018, 22 (06) :1148-1151

← 1 2 3 4 5 →