Sciweavers

5 search results - page 1 / 1
» High-rate, Double-Symbol-Decodable STBCs from Clifford Algeb...
Sort
View
GLOBECOM
2006
IEEE
13 years 10 months ago
High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras
— For the number of transmit antennas N = 2a the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a 2aâˆ...
Sanjay Karmakar, B. Sundar Rajan
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 4 months ago
Multigroup-Decodable STBCs from Clifford Algebras
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
Sanjay Karmakar, B. Sundar Rajan
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 4 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
GLOBECOM
2008
IEEE
13 years 11 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
2007
Springer
84views Education» more  CORR 2007»
13 years 4 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan