IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Communications, IEEE Transact ...> Volume:59 Issue:4 Help

Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ayanoglu, E. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California Irvine, Irvine, CA, USA ; Larsson, E.G. ; Karipidis, E.

The computational complexity of optimum decoding for an orthogonal space-time block code GN satisfying GNHGN = c(Σk=1K |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, 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.

Published in:
Communications, IEEE Transactions on  (Volume:59 ,  Issue: 4 )

Date of Publication: April 2011

Page(s):
936 - 941
ISSN :
0090-6778
INSPEC Accession Number:
11944367
Digital Object Identifier :
10.1109/TCOMM.2011.012711.090613
Product Type:
Journals & Magazines
Date of Publication :
04 February 2011
Date of Current Version :
15 April 2011
Issue Date :
April 2011
Sponsored by :
IEEE Communications Society

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.