Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

TCOM
2011

favoriteEmaildiscussreport

108views more TCOM 2011»

Computational Complexity of Decoding Orthogonal Space-Time Block Codes

12 years 11 months ago

Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Download gram.eng.uci.edu

— The computational complexity of optimum decoding for an orthogonal space-time block code is quantiﬁed. Four equivalent techniques of optimum decoding which have the same computational complexity are speciﬁed. Modiﬁcations to the basic formulation in special cases are calculated and illustrated by means of examples.

Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip

Real-time Traffic

Computational Complexity | Equivalent Techniques | Orthogonal Space-Time Block | TCOM 2011 |

claim paper

Related Content

» LowComplexity Maximum Likelihood Detection of Orthogonal SpaceTime Block Codes

» SpaceTime Codes with BlockOrthogonal Structure and Their Simplified ML and NearML Decoding

» LowComplexity SQRBased Decoding Algorithm for QuasiOrthogonal SpaceTime Block Codes

» On the Search for HighRate QuasiOrthogonal SpaceTime Block Code

» Differential Transmit Diversity Based on QuasiOrthogonal SpaceTime Block Code

» SingleSymbolDecodable Differential SpaceTime Modulation Based on QOSTBC

» Bit Error Performance of Orthogonal SpaceTime Block Codes over TimeSelective Channel

» LowComplexity Optimal Detection for Hybrid SpaceTime Block Coding and Spatial Multiplexing

» Distributed DoubleDifferential Orthogonal SpaceTime Coding for Cooperative Networks

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCOM
Authors	Ender Ayanoglu, Erik G. Larsson, Eleftherios Karipidis

Comments (0)