Computing the structure of finite algebras
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Finding maximal orders in semisimple algebras over Q
Computational Complexity
A Table of Totally Complex Number Fields of Small Discriminants
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Space-time codes from structured lattices
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A new approach to layered space-time coding and signal processing
IEEE Transactions on Information Theory
Diagonal algebraic space-time block codes
IEEE Transactions on Information Theory
A construction of a space-time code based on number theory
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
On optimal multilayer cyclotomic space-time code designs
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Information-Lossless Space–Time Block Codes From Crossed-Product Algebras
IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Maximal Orders in the Design of Dense Space-Time Lattice Codes
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
Some properties of Alamouti-like MISO codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
An algebraic tool for obtaining conditional non-vanishing determinants
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
The coding gain of real matrix lattices: bounds and existence results
IEEE Transactions on Information Theory
Hi-index | 754.96 |
In this paper, the need for the construction of asymmetric and multiblock space-time codes is discussed. Above the trivial puncturing method, i.e., switching off the extra layers in the symmetric multiple-input multiple-output (MIMO) setting, two more sophisticated asymmetric construction methods are proposed. The first method, called the block diagonal method (BDM), can be converted to produce multiblock space-time codes that achieve the diversity-multiplexing tradeoff (DMT). It is also shown that maximizing the density of the newly proposed block diagonal asymmetric space-time (AST) codes is equivalent to minimizing the discriminant of a certain order, a result that also holds as such for the multiblock codes. An implicit lower bound for the density is provided and made explicit for an important special case that contains e.g., the systems equipped with 4Tx +2Rx antennas. Further, an explicit scheme achieving the bound is given. Another method proposed here is the Smart Puncturing Method (SPM) that generalizes the subfield construction method proposed in earlier work by Hollanti and Ranto and applies to any number of transmitting and lesser receiving antennas. The use of the general methods is demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). Computer simulations verify that the newly proposed methods can compete with the trivial puncturing method, and in some cases clearly outperform it. The conquering construction exploiting maximal orders improves upon the punctured perfect code and the DjABBA code as well as the Icosian code. Also extensive DMT analysis is provided.