Open AccessConstruction of girth‐eight quasi‐cyclic low‐density parity‐check codes with low encoding complexity
Author(s) -
Wang Ruyan,
Li Yong,
Zhao Hui,
Qin Liang,
Zhang Hong
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0056
Subject(s) - parity check matrix , mathematics , low density parity check code , diagonal , encoding (memory) , girth (graph theory) , algorithm , parity (physics) , discrete mathematics , decoding methods , computer science , combinatorics , arithmetic , physics , particle physics , geometry , artificial intelligence
A construction method for girth‐eight quasi‐cyclic low‐density parity‐check codes (QC‐LDPCs) with low encoding complexity is proposed in this study. To avoid short cycles and further improve the performance of the authors proposed codes, the greatest common divisor (GCD)‐based method is utilised to construct the information part with girth‐eight of the parity‐check matrix with systematic form. Furthermore, the quasi‐dual‐diagonal structure is adopted as the parity part of the parity‐check matrix for fast encoding, which not only maintains the parity‐check matrix with girth‐eight, but also efficiently decreases the encoding complexity of their proposed codes. Simulation results show that their proposed codes perform better than Mackay's codes and the QC‐LDPCs constructed by the GCD‐based method, and have comparable performance compared with progressive edge growth based QC‐LDPCs. Besides, their proposed codes have lower encoding complexity due to the property of fast encoding.