Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Novel Maximum Likelihood Detection Algorithm for Orthogonal Space-Time Block
 

Summary: 1
A Novel Maximum Likelihood Detection
Algorithm for 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
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
square L-QAM constellations, the proposed algorithm reduces the decoding computational complexity
from O(L) for conventional ML to O(

L) without sacrificing the performance.
I. INTRODUCTION

  

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

 

Collections: Engineering