Iterative decoding threshold analysis for LDPC convolutional codes

Michael Lentmaier; Arvind Sridharan; Daniel J. Costello Jr.; Kamil Zigangirov

doi:10.1109/TIT.2010.2059490

Iterative decoding threshold analysis for LDPC convolutional codes

Michael Lentmaier, Arvind Sridharan, Daniel J. Costello Jr., Kamil Zigangirov

Forskningsoutput: Tidskriftsbidrag › Artikel i vetenskaplig tidskrift › Peer review

2699 Nedladdningar (Pure)

Sammanfattning

An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.

Originalspråk	engelska
Sidor (från-till)	5274-5289
Tidskrift	IEEE Transactions on Information Theory
Volym	56
Nummer	10
DOI	https://doi.org/10.1109/TIT.2010.2059490
Status	Published - 2010

Ämnesklassifikation (UKÄ)

Elektroteknik och elektronik

Tillgång till dokument

10.1109/TIT.2010.2059490

ConvThresholdsFinalSubmission

Citera det här

@article{b25411a66e2a4e40a8c6f7562b5ff562,

title = "Iterative decoding threshold analysis for LDPC convolutional codes",

abstract = "An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.",

keywords = "threshold analysis, density evolution, Belief propagation, iterative decoding, low-density, LDPC convolutional codes, message passing, parity-check (LDPC) codes",

author = "Michael Lentmaier and Arvind Sridharan and {Costello Jr.}, {Daniel J.} and Kamil Zigangirov",

year = "2010",

doi = "10.1109/TIT.2010.2059490",

language = "English",

volume = "56",

pages = "5274--5289",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "10",

}

TY - JOUR

T1 - Iterative decoding threshold analysis for LDPC convolutional codes

AU - Lentmaier, Michael

AU - Sridharan, Arvind

AU - Costello Jr., Daniel J.

AU - Zigangirov, Kamil

PY - 2010

Y1 - 2010

N2 - An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.

AB - An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.

KW - threshold analysis

KW - density evolution

KW - Belief propagation

KW - iterative decoding

KW - low-density

KW - LDPC convolutional codes

KW - message passing

KW - parity-check (LDPC) codes

U2 - 10.1109/TIT.2010.2059490

DO - 10.1109/TIT.2010.2059490

M3 - Article

SN - 0018-9448

VL - 56

SP - 5274

EP - 5289

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

ER -

Iterative decoding threshold analysis for LDPC convolutional codes

Sammanfattning

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här