9 citations · 17 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2007★ 8 cited
Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras
Sanjay Karmakar, B. Sundar Rajan
It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matr…
cs.IT2007★ 9 cited
High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras
Sanjay Karmakar, B. Sundar Rajan
It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are single-symbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-sy…