Compression of redundancy free trellis stages in Turbo-Decoder
Résumé
For turbo code with coding rate close to one, the high puncturing rate induces long sequences of trellis without redundancy bit. A simplification technique to compute the final state of a sequence of Redundancy Free Trellis Stage (RFTS) is presented. It compresses a sequence of RFTS of length $N$ into a sequence of RFTS of length $m-1 + (N \mod (m-1))$, where $m$ is the number of states of the trellis. The computation is reduced accordingly.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...