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 1

Fingerprint

LDPC Codes
Parity
Elimination
Iterative Decoding
Iterative decoding
Low-density Parity-check (LDPC) Codes
Eliminate
Binary

Keywords

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

ASJC Scopus subject areas

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

Cite this

Improved stopping set elimination by parity-check matrix extension of LDPC codes. / Kim, Saejoon; Heo, Jun; Park, Hyuncheol.

In: IEEE Communications Letters, Vol. 15, No. 5, 5741762, 01.05.2011, p. 557-559.

Research output: Contribution to journalArticle

@article{74ff80d26c3f4051aec7023446d3cc06,
title = "Improved stopping set elimination by parity-check matrix extension of LDPC codes",
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.",
keywords = "LDPC codes, parity-check matrix extension, stopping sets",
author = "Saejoon Kim and Jun Heo and Hyuncheol Park",
year = "2011",
month = "5",
day = "1",
doi = "10.1109/LCOMM.2011.032811.102095",
language = "English",
volume = "15",
pages = "557--559",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

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

AU - Kim, Saejoon

AU - Heo, Jun

AU - Park, Hyuncheol

PY - 2011/5/1

Y1 - 2011/5/1

N2 - 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.

AB - 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.

KW - LDPC codes

KW - parity-check matrix extension

KW - stopping sets

UR - http://www.scopus.com/inward/record.url?scp=79956216230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956216230&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2011.032811.102095

DO - 10.1109/LCOMM.2011.032811.102095

M3 - Article

AN - SCOPUS:79956216230

VL - 15

SP - 557

EP - 559

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 5

M1 - 5741762

ER -