• DocumentCode
    2191153
  • Title

    On The Complexity of Joint Demodulation and Convolutional Decoding

  • Author

    Gkrimpas, D. ; Paliouras, V.

  • Author_Institution
    Electrical and Computer Engineering Dept., University of Patras, 26 500, Patras, Greece
  • fYear
    2007
  • fDate
    17-19 Oct. 2007
  • Firstpage
    669
  • Lastpage
    674
  • Abstract
    This paper investigates the combined computational complexity of demodulation and decoding of QAM signals. Four combinations of demodulation and decoding techniques are compared in terms of bit error rate (BER) vs. signal-to-noise (SNR) behavior, finite word length effects, and hardware complexity. It is found that joint demodulation and decoding using a high-radix trellis can be more efficient for higher orders of modulation, while a decoding strategy which produces soft values, followed by a Viterbi decoder is more efficient for lower modulation orders. Complexity formulas that take into account word lengths and modulation order are introduced.
  • Keywords
    Bit error rate; Computational complexity; Convolution; Convolutional codes; Decoding; Demodulation; Quadrature amplitude modulation; Quantization; Very large scale integration; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Systems, 2007 IEEE Workshop on
  • Conference_Location
    Shanghai, China
  • ISSN
    1520-6130
  • Print_ISBN
    978-1-4244-1222-8
  • Electronic_ISBN
    1520-6130
  • Type

    conf

  • DOI
    10.1109/SIPS.2007.4387629
  • Filename
    4387629