A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Proceedings of ICC '93 - IEEE International Conference on Communications
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. I -INTRODUCTION Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory
doi:10.1109/icc.1993.397441
fatcat:rf5snn7edjc3hpdthhtna3wpdi