Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Claude Berrou, Alain Glavieux, Punya Thitimajshima
Abstract
Claude Berrou, Alain Glavieux, Punya Thitimajshima
Abstract
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. 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.>
OpenAlex reports 6722 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. 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.>
Key concepts: Turbo code, Serial concatenated convolutional codes, Concatenation (mathematics), Convolutional code, Noisy-channel coding theorem, Decoding methods, Concatenated error correction code, Encoder