Tree-based construction of LDPC codes having good pseudocodeword weights

Christine A Kelley, Deepak Sridhara, Joachim Rosenthal

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=ps and d=ps + 1, for p a prime. One class corresponds to the well-known finite-geometry and finite generalized quadrangle LDPC codes; the other codes presented are new. We also present some bounds on pseudocodeword weight for p-ary LDPC codes. Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite-geometry LDPC codes where p > 2.

Original languageEnglish (US)
Pages (from-to)1460-1478
Number of pages19
JournalIEEE Transactions on Information Theory
Volume53
Issue number4
DOIs
StatePublished - Apr 1 2007

Fingerprint

mathematics
Iterative decoding
Geometry

Keywords

  • Iterative decoding
  • Low-density parity-check (LDPC) codes
  • Min-sum iterative decoding
  • P-ary pseudoweight
  • Pseudocodewords

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Tree-based construction of LDPC codes having good pseudocodeword weights. / Kelley, Christine A; Sridhara, Deepak; Rosenthal, Joachim.

In: IEEE Transactions on Information Theory, Vol. 53, No. 4, 01.04.2007, p. 1460-1478.

Research output: Contribution to journalArticle

Kelley, Christine A ; Sridhara, Deepak ; Rosenthal, Joachim. / Tree-based construction of LDPC codes having good pseudocodeword weights. In: IEEE Transactions on Information Theory. 2007 ; Vol. 53, No. 4. pp. 1460-1478.
@article{c7e5edf32deb4e2a8bc9ae7fdf43f841,
title = "Tree-based construction of LDPC codes having good pseudocodeword weights",
abstract = "We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=ps and d=ps + 1, for p a prime. One class corresponds to the well-known finite-geometry and finite generalized quadrangle LDPC codes; the other codes presented are new. We also present some bounds on pseudocodeword weight for p-ary LDPC codes. Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite-geometry LDPC codes where p > 2.",
keywords = "Iterative decoding, Low-density parity-check (LDPC) codes, Min-sum iterative decoding, P-ary pseudoweight, Pseudocodewords",
author = "Kelley, {Christine A} and Deepak Sridhara and Joachim Rosenthal",
year = "2007",
month = "4",
day = "1",
doi = "10.1109/TIT.2007.892774",
language = "English (US)",
volume = "53",
pages = "1460--1478",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Tree-based construction of LDPC codes having good pseudocodeword weights

AU - Kelley, Christine A

AU - Sridhara, Deepak

AU - Rosenthal, Joachim

PY - 2007/4/1

Y1 - 2007/4/1

N2 - We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=ps and d=ps + 1, for p a prime. One class corresponds to the well-known finite-geometry and finite generalized quadrangle LDPC codes; the other codes presented are new. We also present some bounds on pseudocodeword weight for p-ary LDPC codes. Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite-geometry LDPC codes where p > 2.

AB - We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=ps and d=ps + 1, for p a prime. One class corresponds to the well-known finite-geometry and finite generalized quadrangle LDPC codes; the other codes presented are new. We also present some bounds on pseudocodeword weight for p-ary LDPC codes. Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite-geometry LDPC codes where p > 2.

KW - Iterative decoding

KW - Low-density parity-check (LDPC) codes

KW - Min-sum iterative decoding

KW - P-ary pseudoweight

KW - Pseudocodewords

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

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

U2 - 10.1109/TIT.2007.892774

DO - 10.1109/TIT.2007.892774

M3 - Article

VL - 53

SP - 1460

EP - 1478

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -