Quasi Cyclic-LDPC codes based on PEG algorithm with maximized girth property

Simple item page
dc.contributor.authorPrompakdee, Patanasak
dc.contributor.authorPhakphisut, Watid
dc.contributor.authorSupnithi, Pornchai
dc.date.accessioned2026-08-06T10:03:17Z
dc.date.available2026-08-06T10:03:17Z
dc.date.issued2011-12-01
dc.description.abstractIn this paper, we propose a method to construct parity-check matrices of Quasi Cyclic (QC) LDPC codes based on the progressive edge-growth (PEG) algorithm with maximized girth property. The proposed algorithm can eliminate short cycles and improve the decoding performance. Simulation results illustrate that the codes constructed with the proposed algorithm have superior performance to the previous PEG-QC codes over the additive white Gaussian noise (AWGN) channel. At the BER of 10 <sup>7</sup>, the coding gain of 0.005 dB. © 2011 IEEE.
dc.identifier.citation2011 International Symposium on Intelligent Signal Processing and Communications Systems the Decade of Intelligent and Green Signal Processing and Communications Ispacs 2011, 2011
dc.identifier.doi10.1109/ISPACS.2011.6146165
dc.identifier.other2-s2.0-84857301753
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/3922
dc.source2011 International Symposium on Intelligent Signal Processing and Communications Systems the Decade of Intelligent and Green Signal Processing and Communications Ispacs 2011
dc.subjectLDPC codes
dc.subjectprogressive edge growth (PEG) algorithm
dc.subjectquasi-cyclic LDPC codes
dc.titleQuasi Cyclic-LDPC codes based on PEG algorithm with maximized girth property
dc.typeConference Paper

Files

Collections

Research