Open AccessCompression of redundancy free trellis stages in turbo‐decoder
Author(s) -
Boutillon E.,
SánchezRojas J.,
Marchand C.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2012.4433
Subject(s) - puncturing , redundancy (engineering) , space–time trellis code , trellis (graph) , algorithm , computer science , turbo , computation , turbo code , convolutional code , sequence (biology) , coding (social sciences) , decoding methods , mathematics , concatenated error correction code , telecommunications , block code , engineering , statistics , biology , automotive engineering , genetics , operating system
For turbo codes with a coding rate close to one, the high puncturing rate induces long sequences of trellis without a redundancy bit. A simplification technique to compute the final state of a sequence of redundancy free trellis stages (RFTSs) is presented. It compresses a sequence of RFTSs of length N into a sequence of RFTSs of length m − 1 + ( N mod ( m − 1)), where m is the number of states of the trellis. The computation is reduced accordingly.