Near Shannon limit error-correcting coding and decoding

Near Shannon limit error-correcting coding and decoding (1993)

Cached

Download Links

[www.cs.huji.ac.il]

by Claude Berrou , Alain Glavieux , Punya Thitimajshima

Citations:

979 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Near Shannon limit error-correcting coding and decoding	INFERENCE
AUTHOR NAME	Claude Berrou	SVM HeaderParse 0.2
AUTHOR AFFIL	Claude Berrou, Integrated Circuits for Telecommunication Laboratory; Alain Glavieux and Punya Thitimajshima, Digital Communication Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Ecole Nationale SuNrieure des Ttlkommunications de Bretagne, France; (1) Patents No 9105279 (France), No 92460011.7 (Europe), No 07/870,483 (USA)	SVM HeaderParse 0.2
AUTHOR NAME	Alain Glavieux	SVM HeaderParse 0.2
AUTHOR AFFIL	Claude Berrou, Integrated Circuits for Telecommunication Laboratory; Alain Glavieux and Punya Thitimajshima, Digital Communication Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Ecole Nationale SuNrieure des Ttlkommunications de Bretagne, France; (1) Patents No 9105279 (France), No 92460011.7 (Europe), No 07/870,483 (USA)	SVM HeaderParse 0.2
AUTHOR NAME	Punya Thitimajshima	SVM HeaderParse 0.2
AUTHOR AFFIL	Claude Berrou, Integrated Circuits for Telecommunication Laboratory; Alain Glavieux and Punya Thitimajshima, Digital Communication Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	Ecole Nationale SuNrieure des Ttlkommunications de Bretagne, France; (1) Patents No 9105279 (France), No 92460011.7 (Europe), No 07/870,483 (USA)	SVM HeaderParse 0.2
ABSTRACT	Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K-1. The input to the encoder at time k is a bit dk and the corresponding codeword	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1064--1070	INFERENCE
CITATIONS	2 found	ParsCit 1.0