• DocumentCode
    443430
  • Title

    Low Complexity Decoding of BICM STBC

  • Author

    Akay, Enis ; Ayanoglu, Ender

  • Author_Institution
    Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science The Henry Samueli School of Engineering University of California, Irvine Irvine, California 92697-2625; Email: eakay@uci.edu
  • Volume
    2
  • fYear
    2005
  • fDate
    30 May-1 June 2005
  • Firstpage
    715
  • Lastpage
    718
  • Abstract
    It was shown earlier that the combination of bit interleaved coded modulation (BICM) with space time block codes (STBC) for OFDM systems leads to the maximum diversity order in space and frequency. In this paper we present low complexity decoding of BICM-STBC systems. First, the maximum likelihood (ML) bit metric calculations are simplified from a distance on the complex plane to a distance on the real line. Furthermore, we present log-likelihood-ratio (LLR) approximations to maximum likelihood (ML) decoding metrics to achieve easier to implement soft decision bit metrics with the same high performance. The LLR bit metrics are specifically calculated for M-ary QAM signal constellations used in IEEE 802.1la/g networks. Simulation results also show that while achieving a substantial improvement in decoder complexity, the proposed bit metrics achieve the same high performance.
  • Keywords
    Block codes; Constellation diagram; Frequency diversity; Interleaved codes; Intersymbol interference; Maximum likelihood decoding; Modulation coding; OFDM modulation; Pervasive computing; Quadrature amplitude modulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st
  • ISSN
    1550-2252
  • Print_ISBN
    0-7803-8887-9
  • Type

    conf

  • DOI
    10.1109/VETECS.2005.1543397
  • Filename
    1543397