Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes

The aim of this paper is to show the connection between certain, previously constructed multi-block and asymmetric space-time codes. The Gram determinants of the two constructions coincide, and hence the corresponding lattices share the same density. Using the notion of density, we define the normalized minimum determinant and give an implicit lower bound depending on the center of the cyclic division algebra in use. The calculation of the normalized minimum determinant is then performed in practice by using explicit code constructions.

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

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

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

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

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

[6]  P. Vijay Kumar,et al.  Space-Time Codes Meeting The Diversity-Multiplexing Gain Tradeo With Low Signalling Complexity , 2005 .

[7]  E. Viterbo,et al.  A COMPARISON OF HIGH RATE ALGEBRAIC AND NON-ORTHOGONAL STBCS , 2007 .

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

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

[10]  Jean-Claude Belfiore,et al.  Quaternionic lattices for space-time coding , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[11]  A. Albert.  Structure of Algebras , 1939 .

[12]  Hsiao-feng Lu.  Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing Tradeoff , 2006, 2006 IEEE International Symposium on Information Theory.

[13]  Jyrki Lahtonen.  Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[14]  Lajos Hanzo,et al.  Space–time Block Codes † , 2005 .

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

[16]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.