Performance of hybrid turbo codes
Résumé
In 1993, Berrou et al. [l] showed that it was possible to transmit digital information at a rate close to channel capacity as predicted by Shannon in 1948 [2]. For this, a coding scheme based on the parallel concatenation of two recursive systematic convolutional (RSC) codes was used, associated with an original iterative decoding algorithm. This iterative decoding algorithm uses soft input and output decoding of the component codes. In 1994, Pyndiah et al. [3] proposed a new iterative decoding algorithm for decoding product codes, introduced by Elias [4] in 1954. This iterative decoding algorithm is also based on soft input and output decoding of the component codes. This new coding scheme showed exceptional performance for high code rates, typically for R 0.75. This new concept is known as a ‘turbo-code' and is widely accepted [5]. In this Letter, we investigate the performance of iterative decoding in the case of a block code (extended BCH) serially concatenated with a convolutional code (RSC).
Origine : Fichiers produits par l'(les) auteur(s)
Loading...