Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction

Since the cyclic division algebras and their orders have become standard material for researchers seeking to construct good MIMO-lattices. The usual construction of the actual lattice corresponds to a cyclic submodule of an order. In a recent submission we studied the problem of identifying those cyclic division algebras that consume the least amount of the available signal space for a given minimum determinant. In this semi-tutorial note some of the material from is recapped together with hopefully illuminating examples. We also motivate our concept of density by previewing upper and lower bounds, and taking a closer look at some of the suggested MIMO-lattices in relation to these bounds.

[1]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Hesham El Gamal,et al.  A new approach to layered space-Time coding and signal processing , 2001, IEEE Trans. Inf. Theory.

[3]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[4]  Camilla Hollanti,et al.  Maximal Orders in the Design of Dense Space-Time Lattice Codes , 2008, IEEE Transactions on Information Theory.

[5]  Frédérique E. Oggier,et al.  Algebraic lattice constellations: bounds on performance , 2006, IEEE Transactions on Information Theory.

[6]  B. Sundar Rajan,et al.  STBC-schemes with non-vanishing determinant for certain number of transmit antennas , 2005, ISIT.

[7]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[8]  Roope Vehkalahti.  Constructing Optimal Division Algebras for Space-Time Coding , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[9]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[10]  Camilla Hollanti,et al.  Optimal Matrix Lattices for MIMO Codes from Division Algebras , 2006, 2006 IEEE International Symposium on Information Theory.

[11]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[12]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[13]  Camilla Hollanti,et al.  On the Densest MIMO Lattices From Cyclic Division Algebras , 2007, IEEE Transactions on Information Theory.

[14]  B. Sundar Rajan,et al.  STBC-schemes with nonvanishing determinant for certain number of transmit antennas , 2005, IEEE Transactions on Information Theory.

[15]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[16]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[17]  Camilla Hollanti,et al.  Asymmetric Space-Time Block Codes for MIMO Systems , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[18]  J. Belfiore,et al.  Algebraic 3x3, 4x4, 6x6 Space-Time Codes with non-vanishing Determinants , 2004 .