• DocumentCode
    383830
  • Title

    The union bound for space-time turbo coded modulation over fast fading channels

  • Author

    Tujkovic, Djordje ; Juntti, Markku ; Latva-aho, Matti

  • Author_Institution
    Centre for Wireless Commun., Oulu Univ., Finland
  • Volume
    1
  • fYear
    2002
  • fDate
    15-18 Sept. 2002
  • Firstpage
    79
  • Abstract
    A design method for recursive space-time trellis codes and parallel concatenated space-time turbo coded modulation was recently proposed as a new framework for building optimized, low-complexity, large equivalent constraint-length space-time trellis codes. In this paper the distance spectrum interpretation of the space-time turbo coded modulation is introduced to evaluate the union bound on the frame error rate over fast fading channels. The distance spectrum gives a good insight on the importance of multiplicities in the space-time coding design. Derived bounds are in some cases very tight and provide a designer with the practical tool for further optimization of the constituent space-time trellis codes within the space-time turbo coded modulation framework. Some interesting examples of the convergence of the sub-optimal iterative decoding were also presented.
  • Keywords
    concatenated codes; error statistics; fading channels; iterative decoding; modulation coding; space-time codes; spectral analysis; tree codes; trellis codes; turbo codes; constraint-length codes; convergence; design method; distance spectrum; fast fading channels; frame error rate; low-complexity codes; optimized codes; parallel concatenated space-time turbo coded modulation; recursive space-time trellis codes; space-time turbo coded modulation; sub-optimal iterative decoding; union bound; Buildings; Concatenated codes; Constraint optimization; Convolutional codes; Design methodology; Design optimization; Error analysis; Fading; Modulation coding; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on
  • Print_ISBN
    0-7803-7589-0
  • Type

    conf

  • DOI
    10.1109/PIMRC.2002.1046664
  • Filename
    1046664