Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Low Complexity Decoding of BICM STBC Enis Akay and Ender Ayanoglu
 

Summary: Low Complexity Decoding of BICM STBC
Enis Akay and Ender Ayanoglu
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 ayanoglu@uci.edu
Abstract-- It was shown earlier that the combination of bit in-
terleaved 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.11a/g networks. Simulation

  

Source: Ayanoglu, Ender - Department of Electrical and Computer Engineering, University of California, Irvine

 

Collections: Engineering