On the Construction of Structured LDPC Codes Free of Small Trapping Sets
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationD. V. Nguyen, S. K. Chilappagari, M. W. Marcellin and B. Vasic, "On the Construction of Structured LDPC Codes Free of Small Trapping Sets," in IEEE Transactions on Information Theory, vol. 58, no. 4, pp. 2280-2302, April 2012, doi: 10.1109/TIT.2011.2173733.
RightsCopyright © 2012 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractWe present a method to construct low-density parity-check (LDPC) codes with low error floors on the binary symmetric channel. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the trapping set ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We evaluate the relative harmfulness of different trapping sets for the sum-product algorithm by using the topological relations among them and by analyzing the decoding failures on one trapping set in the presence or absence of other trapping sets. We apply this method to construct structured LDPC codes. To facilitate the discussion, we give a new description of structured LDPC codes whose parity-check matrices are arrays of permutation matrices. This description uses Latin squares to define a set of permutation matrices that have disjoint support and to derive a simple necessary and sufficient condition for the Tanner graph of a code to be free of four cycles.
VersionFinal accepted manuscript