Construction of QC-LDPC codes based on PSO algorithm

The well known Tanner codes are not encodable, in this paper, we derived an encodable QC LDPC codes and use PSO algorithm to determine the parameters of the parity check matrices of the QC LDPC codes. The proposed PSO code construction considers the girth 4 and BER performance to be the constrained...

Full description

Saved in:
Bibliographic Details
Published in4th IET International Conference on Wireless, Mobile & Multimedia Networks (ICWMMN 2011) pp. 118 - 122
Main Authors Yang, Yang, Yang, Xiao
Format Conference Proceeding
LanguageEnglish
Published Stevenage IET 2011
The Institution of Engineering & Technology
Subjects
Codes
random codes
parity check codes
PSO algorithm
Tanner codes
QC LDPC codes
code construction
parity check matrices
Online AccessGet full text
ISBN9781849195072
1849195072
DOI10.1049/cp.2011.0971

Cover

More Information
Summary:The well known Tanner codes are not encodable, in this paper, we derived an encodable QC LDPC codes and use PSO algorithm to determine the parameters of the parity check matrices of the QC LDPC codes. The proposed PSO code construction considers the girth 4 and BER performance to be the constrained conditions in the fitness function of PSO algorithm. Simulation results show that the QC codes constructed by the proposed method have better performance than that of random LDPC codes.
Bibliography:ObjectType-Article-1
ObjectType-Feature-2
SourceType-Conference Papers & Proceedings-1
content type line 22
ISBN:9781849195072
1849195072
DOI:10.1049/cp.2011.0971