How to find good finite-length codes: from art towards science

被引：23

作者：

Amraoui, Abdelaziz

Montanari, Andrea

Urbanke, Ruediger ^{[1
]}

机构：

[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland

[2] Ecole Normale Super, Phys Theor Lab, F-75231 Paris 05, France

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

[4] Stanford Univ, Dept Stat, Stanford, CA 94305 USA

来源：

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS | 2007年 / 18卷 / 05期

关键词：

D O I：

10.1002/ett.1182

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We explain how to optimise finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to model large scale erasures and a union bound involving minimal stopping sets to take into account small error events. We show that the performance of optimised ensembles as observed in simulations is well described by our approximation. Although we only address the case of transmission over the binary erasure channel, our method should be applicable to a more general setting. Copyright (C) 2007 John Wiley & Sons, Ltd.

引用

页码：491 / 508

页数：18