DocumentCode
1645686
Title
Optimization of Bilayer Lengthened QC-LDPC Code for Relay Channel Based on Differential Evolution
Author
Xu, Hua
Author_Institution
Sch. of Phys. & Electron. Eng., Yancheng Teachers Univ., Yancheng, China
fYear
2011
Firstpage
1
Lastpage
4
Abstract
A novel optimization algorithm to design a bilayer lengthened QC-LDPC code for relay channel is proposed in this paper, which combine differential evolution algorithm and bilayer graph for LDPC codes. We aim to construct QC-LDPC codes with best girth(maximum girth and minimum numbers of shortest cycles)both at relay node and destination node. Proposed algorithm is composed of two steps, first the exponent matrix of QC-LDPC code for lower graph is searched by differential evolution algorithm, then the exponent matrix of QC-LDPC code for overall graph is also found by differential evolution algorithm based on the obtained exponent matrix for lower graph. Simulation results verify the validity of proposed algorithm. Constructed QC-LDPC codes may perform well both at relay node and destination node.
Keywords
channel coding; evolutionary computation; graph theory; matrix algebra; parity check codes; relays; QC-LDPC code matrix; bilayer graph; bilayer lengthened QC-LDPC code optimization algorithm; destination node; differential evolution algorithm; exponent matrix; relay channel; relay node; Algorithm design and analysis; Bit error rate; Optimization; Parity check codes; Protocols; Relays; Simulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on
Conference_Location
Wuhan
ISSN
2161-9646
Print_ISBN
978-1-4244-6250-6
Type
conf
DOI
10.1109/wicom.2011.6040191
Filename
6040191
Link To Document