• DocumentCode
    58178
  • Title

    Reduced-Complexity Syndrome-Based TTCM Decoding

  • Author

    Babar, Zunaira ; Soon Xin Ng ; Hanzo, Lajos

  • Author_Institution
    Sch. of Electron. & Comput. Sci., Univ. of Southampton, Southampton, UK
  • Volume
    17
  • Issue
    6
  • fYear
    2013
  • fDate
    Jun-13
  • Firstpage
    1220
  • Lastpage
    1223
  • Abstract
    The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we conceive the syndrome-based block decoding of TTCM, which is capable of reducing the decoding complexity by disabling the decoder, when syndrome becomes zero. Quantitatively, we demonstrate that a decoding complexity reduction of at least 17% is attained at high SNRs, with at least 20% and 45% reduction in the 5^{th} and 6^{th} iterations, respectively.
  • Keywords
    block codes; computational complexity; iterative decoding; radio receivers; trellis coded modulation; turbo codes; TTCM decoding; complexity reduction; computational complexity; decoding complexity; iterative decoder; receiver; reduced-complexity syndrome; syndrome-based block decoding; turbo trellis coded modulation; Bit error rate; Complexity theory; Convolutional codes; Decoding; Hamming weight; Iterative decoding; Signal to noise ratio; Syndrome decoding; TTCM; block syndrome decoding; error trellis; iterative decoding;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2013.050313.130182
  • Filename
    6515488