An algebraic tool for obtaining conditional non-vanishing determinants

An algebraic tool from the theory of central simple algebras is proposed to obtain families of complex matrices satisfying the conditional non-vanishing determinant (CNVD) property. Such property is of great use in e.g. the design of multiuser space-time (ST) codes, in which context it is not always crucial for the transmission matrix to be invertible. On the other hand, whenever it is invertible, it is important that it has a non-vanishing determinant. Also any submatrix of any subset of users multiplied with its transpose conjugate should preferably have a non-vanishing determinant, provided it is non-zero. In recent submissions by Lu et al. it has been shown that, with suitable multiplexing, such property yields a construction of space-time codes that achieve the optimal diversity-multiplexing tradeoff (DMT) of the multiple-input multiple-output (MIMO) multiple access channel (MAC) and outperform the previously known ST codes.

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

[2]  Camilla Hollanti,et al.  On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code , 2008, 2008 IEEE Information Theory Workshop.

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  Jean-Claude Belfiore,et al.  Distributed space-time block codes for the MIMO Multiple Access Channel , 2008, 2008 IEEE International Symposium on Information Theory.

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

[6]  H. Bolcskei,et al.  Multiuser Space-Time/Frequency Code Design , 2006, 2006 IEEE International Symposium on Information Theory.

[7]  Camilla Hollanti,et al.  Construction Methods for Asymmetric and Multiblock Space–Time Codes , 2009, IEEE Transactions on Information Theory.

[8]  Camilla Hollanti,et al.  New Space–Time Code Constructions for Two-User Multiple Access Channels , 2009, IEEE Journal of Selected Topics in Signal Processing.

[9]  Lizhong Zheng,et al.  Diversity-multiplexing tradeoff in multiple-access channels , 2004, IEEE Transactions on Information Theory.

[10]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[11]  Camilla Hollanti,et al.  Order-Theoretic Methods for Space-Time Coding: Symmetric and Asymmetric Designs , 2009 .

[12]  Hesham El Gamal,et al.  On the Optimality of Lattice Coding and Decoding in Multiple Access Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[13]  Roope Vehkalahti,et al.  Class Field Theoretic Methods in the Design of Lattice Signal Constellations , 2008 .

[14]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[15]  Olav Tirkkonen,et al.  Multi-Antenna Transceiver Techniques for 3G and Beyond: Hottinen/Multi-antenna , 2003 .

[16]  Frédérique E. Oggier,et al.  Cyclic Division Algebras: A Tool for Space-Time Coding , 2007, Found. Trends Commun. Inf. Theory.

[17]  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.

[18]  Helmut Bölcskei,et al.  Multiuser Space-Time/Frequency Code Design , 2006, ISIT.

[19]  Wei Zhang,et al.  A Systematic Design of Multiuser Space-Frequency Codes for MIMO-OFDM Systems , 2007, 2007 IEEE International Conference on Communications.

[20]  Camilla Hollanti,et al.  Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels , 2009, 2009 IEEE International Symposium on Information Theory.