84 search results - page 1 / 17 » Computational Complexity of Decoding Orthogonal Space-Time B... |
TCOM
2011
13 years 22 days ago
2011
— 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 comp...
GLOBECOM
2008
IEEE
14 years 7 days ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
VTC
2010
IEEE
13 years 3 months ago
2010
IEEE
Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding schem...
GLOBECOM
2008
IEEE
14 years 7 days ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
CORR
2008
Springer
13 years 5 months ago
2008
Springer