45 search results - page 3 / 9 » Four-Group Decodable Space-Time Block Codes |
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...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MM...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
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...
TWC
2008
13 years 5 months ago
2008
We present a space-time coded system which achieves high throughput and good performance using lowcomplexity detection and decoding. We focus on a Rate 2 quasiorthogonal space-time...