Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computational Complexity of Decoding Orthogonal Space-Time Block Codes Ender Ayanoglu
 

Summary: 1
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
Ender Ayanoglu
, Erik G. Larsson
, and Eleftherios Karipidis
Abstract
The computational complexity of optimum decoding for an orthogonal space-time block code GN satisfying
GH
N GN = c(
K
k=1 |sk|2
)IN where c is a positive integer is quantified. Four equivalent techniques of optimum
decoding which have the same computational complexity are specified. Modifications to the basic formulation in
special cases are calculated and illustrated by means of examples. This paper corrects and extends [1],[2], and
unifies them with the results from the literature. In addition, a number of results from the literature are extended
to the case c > 1.
I. INTRODUCTION
In [3], an optimum Maximum Likelihood metric is introduced for Orthogonal Space-Time Block Codes
(OSTBCs). A general description of this metric and specific forms for a number of space-time codes can
be found in [4]. This metric is complicated and, in a straightforward implementation, its computational

  

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

 

Collections: Engineering