Computing the threshold shift for general channels

被引：3

作者：

Ezri, Jeremie ^{[1
]}

Urbanke, Ruediger ^{[1
]}

Montanari, Andrea ^{[2
]}

Oh, Sewoong ^{[2
]}

机构：

[1] Ecole Polytech Fed Lausanne, LTHC, Lausanne, Switzerland

[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA

来源：

2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6 | 2008年

关键词：

D O I：

10.1109/ISIT.2008.4595227

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The 'threshold' of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a finite-blocklength shift parameter. Here we present a new method for computing the shift parameter that can be applied to general binary memoryless symmetric channels, and general message passing algorithms. We check that the new approach recovers the known parameters for erasure correction.

引用

页码：1448 / +

页数：2

共 8 条

[1]

AMRAOUI A, IEEE T INF IN PRESS

[2] How to find good finite-length codes: from art towards science [J].

Amraoui, Abdelaziz ;

Montanari, Andrea ;

Urbanke, Ruediger .

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2007, 18 (05) :491-508

[3]

DEMBO A, 2007, ANN APPL PR IN PRESS

[4]

EZRI J, FINITE LENGTH UNPUB

[5]

EZRI J, 2007, P IEEE INT S INF THE

[6] BROWNIAN-MOTION WITH A PARABOLIC DRIFT AND AIRY FUNCTIONS [J].

GROENEBOOM, P .

PROBABILITY THEORY AND RELATED FIELDS, 1989, 81 (01) :79-109

[7] Efficient erasure correcting codes [J].

Luby, MG ;

Mitzenmacher, M ;

Shokrollahi, MA ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :569-584

[8]

Richardson T.J., 2008, MODERN CODING THEORY

← 1 →