Near optimum error correcting coding and decoding: Turbo-codes

被引：1752

作者：

Berrou, C

Glavieux, A

机构：

[1] Ecole Nationale Supérieure des Télécommunications de Bretagne, 29285 Brest Cedex

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1996年 / 44卷 / 10期

关键词：

D O I：

10.1109/26.539767

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving, Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.

引用

页码：1261 / 1271

页数：11

共 13 条

[1] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].

BAHL, LR ;

COCKE, J ;

JELINEK, F ;

RAVIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287

[2]

BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441

[3] PUNCTURED CONVOLUTIONAL CODES OF RATE (N-1)-N AND SIMPLIFIED MAXIMUM LIKELIHOOD DECODING [J].