Simplified Compression of Redundancy Free Trellis Sections in Turbo Decoder - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Communications Letters Année : 2014

Simplified Compression of Redundancy Free Trellis Sections in Turbo Decoder

Résumé

It has been recently shown that a sequence of R=q(M-1) redundancy free trellis stages of a recursive convolutional decoder can be compressed in a sequence of L=M-1 trellis stages, where M is the number of states of the trellis and q is a positive integer. In this paper, we show that for an M state Turbo decoder, among the L compressed trellis stages, only m = 3 or even m = 2 are necessary. The so-called $m$-min algorithm can either be used to increase the throughput for decoding a high rate turbo-code and/or to reduce its power consumption.

Domaines

Electronique
Fichier principal
Vignette du fichier
Trois_min_accepted_soumission.pdf (215.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00978579 , version 1 (14-04-2014)

Identifiants

  • HAL Id : hal-00978579 , version 1

Citer

Emmanuel Boutillon, José-Luis Sanchez-Rojas, Cédric Marchand. Simplified Compression of Redundancy Free Trellis Sections in Turbo Decoder. IEEE Communications Letters, 2014, 18 Issue: 6 DOI: 10.1109/LCOMM.2014.2319257 Publication Year: 2014 Page(s): (6), pp.941 - 944. ⟨hal-00978579⟩
214 Consultations
387 Téléchargements

Partager

Gmail Facebook X LinkedIn More