Sciweavers

84 search results - page 7 / 17
» Computational Complexity of Decoding Orthogonal Space-Time B...
Sort
View
GLOBECOM
2006
IEEE
15 years 8 months ago
On Decoding, Mutual Information, and Antenna Selection Diversity for Quasi-Orthogonal STBC with Minimum Decoding Complexity
Abstract— ABBA codes are an important class of quasiorthogonal space-time block codes proposed by Tirkkonen et al.. Recently, they have become more attractive for practical appli...
Dung Ngoc Dao, Chintha Tellambura
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 1 months ago
High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras
It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are singlesymbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-sy...
Sanjay Karmakar, B. Sundar Rajan
ICC
2008
IEEE
120views Communications» more  ICC 2008»
15 years 8 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan
GLOBECOM
2008
IEEE
15 years 8 months ago
High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance
— Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal spacetime block codes (STBC) from Cyclic Division Algebras (CDA) can achi...
Saif K. Mohammed, Ananthanarayanan Chockalingam, B...
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 1 months ago
A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
Jagadeesh Harshan, B. Sundar Rajan