Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Real-Valued Maximum Likelihood Decoder for Quasi-Orthogonal Space-Time Block Codes
 

Summary: 1
Real-Valued Maximum Likelihood Decoder for
Quasi-Orthogonal Space-Time Block Codes
Luay Azzam, Student Member, IEEE, and Ender Ayanoglu, Fellow, IEEE
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
University of California, Irvine
Abstract
In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for quasi-
orthogonal space-time block codes (QOSTBCs) based on the real-valued lattice representation and QR
decomposition. We show that for a system with rate r = ns/T, where ns is the number of transmitted
symbols per T time slots; the proposed algorithm decomposes the original complex-valued system into
a parallel system with ns 2 2 real-valued components, thus allowing for a simple joint decoding of
two real symbols. For a square QAM constellation with L points (L-QAM), this algorithm achieves full
diversity by properly incorporating two-dimensional rotation using the optimal rotation angle and the
same rotating matrix for any number of transmit antennas (N 4). We show that the complexity gain
becomes greater when N or L becomes larger. The complexity of the proposed algorithm is shown to
be linear with the number of transmitted symbols ns.
Index Terms
Quasi-orthogonal space-time block codes, pairwise symbol decoding, multiple-input multiple-output

  

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

 

Collections: Engineering