Structured LDPC codes from permutation matrices free of small trapping sets

Dung Viet Nguyen, Bane Vasić, Michael Marcellin, Shashi Kiran Chilappagari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

This paper introduces a class of structured low-density parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some matrix operations. They are chosen so that the Tanner graphs do not contain subgraphs harmful to iterative decoding algorithms. The construction of column-weight-three codes is presented. Although the codes are optimized for the Gallager A/B algorithm over the binary symmetric channel (BSC), their error performance is very good on the additive white Gaussian noise channel (AWGNC) as well.

Original languageEnglish (US)
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: Aug 30 2010Sep 3 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Other

Other2010 IEEE Information Theory Workshop, ITW 2010
CountryIreland
CityDublin
Period8/30/109/3/10

ASJC Scopus subject areas

  • Information Systems
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Structured LDPC codes from permutation matrices free of small trapping sets'. Together they form a unique fingerprint.

  • Cite this

    Nguyen, D. V., Vasić, B., Marcellin, M., & Chilappagari, S. K. (2010). Structured LDPC codes from permutation matrices free of small trapping sets. In 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings [5592767] (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings). https://doi.org/10.1109/CIG.2010.5592767