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 Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
 

Summary: Low-Complexity Maximum Likelihood Detection of
Orthogonal Space-Time Block Codes
Luay Azzam 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
email: lazzam@uci.edu, ayanoglu@uci.edu
Abstract-- In this paper, we propose a low complexity Maxi-
mum Likelihood (ML) decoding algorithm for orthogonal space-
time block codes (OSTBCs) based on the real-valued lattice
representation and QR decomposition. We show that for a system
with rate r = K/T, where K is the number of transmitted
symbols per T time slots; the proposed algorithm decomposes the
original complex-valued system into a parallel system represented
by 2K real-valued components, thus allowing for a simple
and independent detection of the real and imaginary parts of
each complex transmitted symbol. We further show that for
a system employing the well-known Alamouti OSTBC and 16-
QAM modulation scheme, the new approach achieves > 82%

  

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

 

Collections: Engineering