Towards an optimal parallel decoding of turbo codes
Konferenz: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
03.04.2006 - 07.04.2006 in Munich, Germany
Tagungsband: TURBO - CODING - 2006
Seiten: 6Sprache: EnglischTyp: PDF
Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Autoren:
Gnaedig, David; Tousch, Jacky (TurboConcept, 115 rue Claude Chappe, 29280 Plouzane, France)
Boutillon, Emmanuel (LESTER – Unité CNRS FRE 2734, UBS, BP 92116, 56321 Lorient Cedex, France)
Jézéquel, Michel (GET/ENST Bretagne/PRACOM – Unité CNRS UMR 2658, CS 83818, 29238 Brest Cedex 3, France)
Inhalt:
High throughput decoding of turbo-codes can be achieved thanks to parallel decoding. However, for finite block sizes, the initialisation duration of each half-iteration reduces the activity of the processing units, especially for higher degrees of parallelism. To solve this issue, a new decoding scheduling is proposed, with a partial processing overlapping of two successive half iterations. Potential memory conflicts introduced by this new scheduling are solved by a constrained interleaver design. An example of application of the proposed technique shows that the complexity of the decoder is reduced by 25 % compared to a conventional approach.