Improved stopping set elimination by parity-check matrix extension of LDPC codes

Saejoon Kim, Jun Heo, Hyuncheol Park

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

Stopping sets associated with a parity-check matrix of low-density parity-check codes limit the performance of iterative decoding over the binary erasure channel. In this letter, we propose a parity-check matrix extension scheme that eliminates stopping sets of small sizes. The results show that our proposed scheme provides significant performance improvement compared to previously known parity-check matrix extension schemes.

Original languageEnglish
Article number5741762
Pages (from-to)557-559
Number of pages3
JournalIEEE Communications Letters
Volume15
Issue number5
DOIs
Publication statusPublished - 2011 May

Bibliographical note

Funding Information:
Manuscript received November 1, 2010. The associate editor coordinating the review of this letter and approving it for publication was S. Yousefi. S. Kim is with the Department of Computer Science and Engineering, Sogang University, Seoul, Korea (e-mail: saejoon@sogang.ac.kr). J. Heo is with the School of Electrical Engineering, Korea University, Seoul, Korea. H. Park is with the Department of Electrical Engineering, KAIST, Daejeon, Korea. The work of S. Kim was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education, Science and Technology (2010-0016802) and by the Sogang University Research Grant of 2010. Digital Object Identifier 10.1109/LCOMM.2011.032811.102095

Keywords

  • LDPC codes
  • parity-check matrix extension
  • stopping sets

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Improved stopping set elimination by parity-check matrix extension of LDPC codes'. Together they form a unique fingerprint.

Cite this