Adaptive mixed scheduling for correcting errors in trapping sets of LDPC codes

Saejoon Kim; Seunghyuk Lee; Jun Heo; Chong S. Rim

doi:10.1109/LCOMM.2010.07.092417

Adaptive mixed scheduling for correcting errors in trapping sets of LDPC codes

Saejoon Kim, Seunghyuk Lee, Jun Heo, Chong S. Rim

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. In this letter, we propose an adaptive mixed scheduling scheme that provides significantly improved code performance compared to existing mixed scheduling schemes.

Original language	English
Article number	5545624
Pages (from-to)	664-666
Number of pages	3
Journal	IEEE Communications Letters
Volume	14
Issue number	7
DOIs	https://doi.org/10.1109/LCOMM.2010.07.092417
Publication status	Published - 2010 Jul

Bibliographical note

Funding Information:
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 (2009-0074611), and by the Special Research Grant of Sogang University 200911057.01. The work of J. Heo was supported by a Korea University Grant 2007. Digital Object Identifier 10.1109/LCOMM.2010.07.092417

Keywords

LDPC codes
mixed scheduling
trapping sets

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2010.07.092417

Cite this

@article{73bb5a986b244dcc826951abb0d4b6e4,

title = "Adaptive mixed scheduling for correcting errors in trapping sets of LDPC codes",

abstract = "Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. In this letter, we propose an adaptive mixed scheduling scheme that provides significantly improved code performance compared to existing mixed scheduling schemes.",

keywords = "LDPC codes, mixed scheduling, trapping sets",

author = "Saejoon Kim and Seunghyuk Lee and Jun Heo and Rim, {Chong S.}",

note = "Funding Information: 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 (2009-0074611), and by the Special Research Grant of Sogang University 200911057.01. The work of J. Heo was supported by a Korea University Grant 2007. Digital Object Identifier 10.1109/LCOMM.2010.07.092417",

year = "2010",

month = jul,

doi = "10.1109/LCOMM.2010.07.092417",

language = "English",

volume = "14",

pages = "664--666",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Adaptive mixed scheduling for correcting errors in trapping sets of LDPC codes

AU - Kim, Saejoon

AU - Lee, Seunghyuk

AU - Heo, Jun

AU - Rim, Chong S.

N1 - Funding Information: 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 (2009-0074611), and by the Special Research Grant of Sogang University 200911057.01. The work of J. Heo was supported by a Korea University Grant 2007. Digital Object Identifier 10.1109/LCOMM.2010.07.092417

PY - 2010/7

Y1 - 2010/7

N2 - Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. In this letter, we propose an adaptive mixed scheduling scheme that provides significantly improved code performance compared to existing mixed scheduling schemes.

AB - Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. In this letter, we propose an adaptive mixed scheduling scheme that provides significantly improved code performance compared to existing mixed scheduling schemes.

KW - LDPC codes

KW - mixed scheduling

KW - trapping sets

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

U2 - 10.1109/LCOMM.2010.07.092417

DO - 10.1109/LCOMM.2010.07.092417

M3 - Article

AN - SCOPUS:77955592770

SN - 1089-7798

VL - 14

SP - 664

EP - 666

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 7

M1 - 5545624

ER -

Adaptive mixed scheduling for correcting errors in trapping sets of LDPC codes

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this