Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:W1-5
Session:
Number:W1-5-4
Construction of Column-Weight-Two Irregular LDPC Codes with a Predetermined High Girth
Gan Srirutchataboom, Nut Tantibut, Piya Kovintavewat, Lunchakorn Wuttisittikulkij, Kritsada Mamat, Watid Phakphisut ,
pp.759-762
Publication Date:2016/7/10
Online ISSN:2188-5079
Summary:
A girth is one of the parameters that can determine the performance of low-density parity-check (LDPC) codes. Because a full Tanner graph of a parity- check matrix, H, can be generated from a small graph, we propose a novel algorithm for constructing irreg- ular column-weight-two LDPC codes with a predeter- mined large girth. The proposed algorithm carefully add edges and vertices in the graph until it fully expands to represent the required H matrix. Simulation results show that the proposed algorithm can provide the H matrix with a very high girth if compared to a well- known progressive-edge growth (PEG) algorithm, and also yields a good bit-error rate performance.