• DocumentCode
    268391
  • Title

    Compression of redundancy free trellis stages in turbo-decoder

  • Author

    Boutillon, E. ; Sánchez-Rojas, J. ; Marchand, Claude

  • Author_Institution
    Lab.-STICC, Univ. de Bretagne Sud, Lorient, France
  • Volume
    49
  • Issue
    7
  • fYear
    2013
  • fDate
    March 28 2013
  • Firstpage
    460
  • Lastpage
    462
  • Abstract
    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.
  • Keywords
    data compression; decoding; trellis codes; turbo codes; RFTS; coding rate; puncturing rate; redundancy free trellis stage sequence; sequence compression; simplification technique; turbo-decoder;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el.2012.4433
  • Filename
    6504963
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=268391