Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Author

Ayanoglu, Ender ; Larsson, Erik G. ; Karipidis, Eleftherios

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Univ. of California Irvine, Irvine, CA, USA

Volume

59

Issue

4

fYear

2011

fDate

4/1/2011 12:00:00 AM

Firstpage

936

Lastpage

941

Abstract

The computational complexity of optimum decoding for an orthogonal space-time block code G_N satisfying G_N^HG_N = c(Σ_k=1^K |s_k|²)I_N 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, 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.

Keywords

computational complexity; decoding; orthogonal codes; space-time block codes; computational complexity; decoding orthogonal space-time block codes; optimum decoding; orthogonal space-time block code G_N; Computational complexity; Maximum likelihood decoding; Measurement; Quadrature amplitude modulation; Receiving antennas; OSTBC; decoding QAM; maximum likelihood decoding; quadrature amplitude modulation (QAM); square QAM;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2011.012711.090613

Filename

5708206