DocumentCode
2898974
Title
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, CA, USA
fYear
2010
fDate
23-27 May 2010
Firstpage
1
Lastpage
6
Abstract
The computational complexity of optimum decoding for an orthogonal space-time block code 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.
Keywords
block codes; computational complexity; maximum likelihood decoding; orthogonal codes; space-time codes; computational complexity; maximum likelihood metric; optimum decoding; orthogonal space-time block code; Block codes; Communications Society; Computational complexity; Matrix decomposition; Maximum likelihood decoding; Peer to peer computing; Pervasive computing; Receiving antennas; Symmetric matrices; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2010 IEEE International Conference on
Conference_Location
Cape Town
ISSN
1550-3607
Print_ISBN
978-1-4244-6402-9
Type
conf
DOI
10.1109/ICC.2010.5501884
Filename
5501884
Link To Document