On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit

被引：964

作者：

Chung, SY

Forney, GD

Richardson, TJ

Urbanke, R

机构：

[1] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA

[2] Flar Technol, Bedminster, NJ 07921 USA

[3] EPFL, Commun Theory Lab, CH-1015 Lausanne, Switzerland

来源：

IEEE COMMUNICATIONS LETTERS | 2001年 / 5卷 / 02期

关键词：

density evolution; low-density parity-check codes; Shannon limit; sum-product algorithm;

D O I：

10.1109/4234.905935

中图分类号：

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

学科分类号：

0809 ;

摘要：

We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold within 0.0045 dB of the Shannon limit of the binary-input additive white Gaussian noise channel. Simulation results with a somewhat simpler code show that we can achieve within 0.04 dB of the Shannon limit at a bit error rate of 10(-6) using a block length of 10(7).

引用

页码：58 / 60

页数：3

共 12 条

[1]

[Anonymous], 1993, PROC IEEE INT C COMM, DOI 10.1109/ICC.1993.397441

[2]

[Anonymous], 2001, IEEE T INFORM THEORY

[3]

Chung S.-Y., 2000, On the construction of some capacity-approaching coding schemes

[4]

CHUNG SY, 2001, IEEE T INFORM THEORY, V47

[5]

FORNEY GD, 2001, IEEE T INFORM THEORY, V47

[6]

Gallager RG, 1963, LOW DENSITY PARITY C

[7] Iterative decoding of binary block and convolutional codes [J].

Hagenauer, J ;

Offer, E ;

Papke, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :429-445

[8] Near Shannon limit performance of low density parity check codes [J].

MacKay, DJC ;

Neal, RM .

ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646

[9] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[10]

RICHARDSON TJ, 2001, IEEE T INFORM THEOR, V47

← 1 2 →