A deviation-based conditional upper bound on the error floor performance for min-sum decoding of short LDPC codes

Eric T. Psota, Jedrzej Kowalczuk, Lance C Perez

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Conditional upper bounds are given for min-sum decoding of low-density parity-check codes in the error floor region. It is generally thought that absorbing sets, i.e., small collections of variable nodes connected to a relatively small number of unsatisfied check nodes, are the primary source of errors in the error floor region. The conditional upper bounds presented here are based on the assumption that all error floor errors are caused by absorbing sets. In order to bound the probability of error associated with each absorbing set, a directed-edge Tanner graph is used to link absorbing sets to low-weight deviations. These low-weight deviations result when a proportionally large number of nodes within a stopping set belong to an absorbing set contained inside the stopping set. A complete collection of the most problematic absorbing sets, and the minimum deviation weights that result from them, are used to derive a conditional upper bound on the probability of error for min-sum decoding of low-density parity-check codes. Simulation results are given to demonstrate the accuracy of the bound.

Original languageEnglish (US)
Article number6302118
Pages (from-to)3567-3578
Number of pages12
JournalIEEE Transactions on Communications
Volume60
Issue number12
DOIs
StatePublished - Sep 21 2012

Fingerprint

Decoding

Keywords

  • LDPC codes
  • absorbing sets
  • computation trees
  • deviations
  • iterative message-passing decoding
  • stopping sets

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A deviation-based conditional upper bound on the error floor performance for min-sum decoding of short LDPC codes. / Psota, Eric T.; Kowalczuk, Jedrzej; Perez, Lance C.

In: IEEE Transactions on Communications, Vol. 60, No. 12, 6302118, 21.09.2012, p. 3567-3578.

Research output: Contribution to journalArticle

@article{9426d8303c9b41b58a1946b6c08539c0,
title = "A deviation-based conditional upper bound on the error floor performance for min-sum decoding of short LDPC codes",
abstract = "Conditional upper bounds are given for min-sum decoding of low-density parity-check codes in the error floor region. It is generally thought that absorbing sets, i.e., small collections of variable nodes connected to a relatively small number of unsatisfied check nodes, are the primary source of errors in the error floor region. The conditional upper bounds presented here are based on the assumption that all error floor errors are caused by absorbing sets. In order to bound the probability of error associated with each absorbing set, a directed-edge Tanner graph is used to link absorbing sets to low-weight deviations. These low-weight deviations result when a proportionally large number of nodes within a stopping set belong to an absorbing set contained inside the stopping set. A complete collection of the most problematic absorbing sets, and the minimum deviation weights that result from them, are used to derive a conditional upper bound on the probability of error for min-sum decoding of low-density parity-check codes. Simulation results are given to demonstrate the accuracy of the bound.",
keywords = "LDPC codes, absorbing sets, computation trees, deviations, iterative message-passing decoding, stopping sets",
author = "Psota, {Eric T.} and Jedrzej Kowalczuk and Perez, {Lance C}",
year = "2012",
month = "9",
day = "21",
doi = "10.1109/TCOMM.2012.091012.110830",
language = "English (US)",
volume = "60",
pages = "3567--3578",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - A deviation-based conditional upper bound on the error floor performance for min-sum decoding of short LDPC codes

AU - Psota, Eric T.

AU - Kowalczuk, Jedrzej

AU - Perez, Lance C

PY - 2012/9/21

Y1 - 2012/9/21

N2 - Conditional upper bounds are given for min-sum decoding of low-density parity-check codes in the error floor region. It is generally thought that absorbing sets, i.e., small collections of variable nodes connected to a relatively small number of unsatisfied check nodes, are the primary source of errors in the error floor region. The conditional upper bounds presented here are based on the assumption that all error floor errors are caused by absorbing sets. In order to bound the probability of error associated with each absorbing set, a directed-edge Tanner graph is used to link absorbing sets to low-weight deviations. These low-weight deviations result when a proportionally large number of nodes within a stopping set belong to an absorbing set contained inside the stopping set. A complete collection of the most problematic absorbing sets, and the minimum deviation weights that result from them, are used to derive a conditional upper bound on the probability of error for min-sum decoding of low-density parity-check codes. Simulation results are given to demonstrate the accuracy of the bound.

AB - Conditional upper bounds are given for min-sum decoding of low-density parity-check codes in the error floor region. It is generally thought that absorbing sets, i.e., small collections of variable nodes connected to a relatively small number of unsatisfied check nodes, are the primary source of errors in the error floor region. The conditional upper bounds presented here are based on the assumption that all error floor errors are caused by absorbing sets. In order to bound the probability of error associated with each absorbing set, a directed-edge Tanner graph is used to link absorbing sets to low-weight deviations. These low-weight deviations result when a proportionally large number of nodes within a stopping set belong to an absorbing set contained inside the stopping set. A complete collection of the most problematic absorbing sets, and the minimum deviation weights that result from them, are used to derive a conditional upper bound on the probability of error for min-sum decoding of low-density parity-check codes. Simulation results are given to demonstrate the accuracy of the bound.

KW - LDPC codes

KW - absorbing sets

KW - computation trees

KW - deviations

KW - iterative message-passing decoding

KW - stopping sets

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

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

U2 - 10.1109/TCOMM.2012.091012.110830

DO - 10.1109/TCOMM.2012.091012.110830

M3 - Article

AN - SCOPUS:84871671147

VL - 60

SP - 3567

EP - 3578

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 12

M1 - 6302118

ER -