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

Saejoon Kim, Jun Heo, Hyuncheol Park

Research output: Contribution to journalArticle

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

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