Asymptotic-Information-Lossless Designs and the Diversity–Multiplexing Tradeoff

It is known that neither the Alamouti nor the V-BLAST scheme achieves the Zheng-Tse diversity-multiplexing tradeoff (DMT) of the multiple-input multiple-output (MIMO) channel. With respect to the DMT curve, the Alamouti scheme achieves the point corresponding to maximum diversity gain only, whereas V-BLAST meets only the point corresponding to maximum multiplexing gain. It is also known that D-BLAST achieves the optimal DMT for n transmit and n receive antennas, but only under the assumption that the leading and trailing zeros are ignored. When these zeros are taken into account, D-BLAST achieves the point corresponding to zero multiplexing gain, but not the point corresponding to zero diversity gain. The first scheme to achieve the DMT is the coding scheme of Yao and Wornell for the case of two transmit and two receive antennas. In this paper, we introduce the notion of an asymptotic-information-lossless (AILL) design and obtain a necessary and sufficient condition under which a design is AILL. Analogous to the result that full-rank designs achieve the point corresponding to the zero multiplexing gain of the optimal DMT curve, we show AILL to be a necessary and sufficient condition for a design to achieve the point on the DMT curve corresponding to zero diversity gain. We also derive a lower bound on the tradeoff achieved by designs from field extensions and show that the tradeoff is very close to the optimal tradeoff in the case of a single receive antenna. A lower bound to the tradeoff achieved by designs from division algebras is presented which indicates that these designs achieve both extreme points (corresponding to zero diversity and zero multiplexing gain) of the optimal DMT curve. Finally, we present simulations results for n transmit and n receive antennas, for n=2,3,4, which suggest that designs from division algebras are likely to have the property of being DMT achieving.

[1]  Hsiao-feng Lu,et al.  Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[2]  B. Sundar Rajan,et al.  STBCs using capacity achieving designs from crossed-product division algebras , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Petre Stoica,et al.  Space-Time Diversity Using Orthogonal and Amicable Orthogonal Designs , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[4]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[5]  Mohamed Oussama Damen,et al.  A construction of a space-time code based on number theory , 2002, IEEE Trans. Inf. Theory.

[6]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[7]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[8]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[9]  Gregory W. Wornell,et al.  Structured space-time block codes with optimal diversity-multiplexing tradeoff and minimum delay , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Sandra Galliou,et al.  A new family of full rate, fully diverse space-time codes based on Galois theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

[11]  Emanuele Viterbo,et al.  Signal Space Diversity: A Power- and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel , 1998, IEEE Trans. Inf. Theory.

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

[13]  Hamid Jafarkhani,et al.  A quasi-orthogonal space-time block code , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[14]  Ari Hottinen,et al.  Complex space-time block codes for four Tx antennas , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[15]  Karim Abed-Meraim,et al.  Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.

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

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

[18]  Georgios B. Giannakis,et al.  Space-time constellation-rotating codes maximizing diversity and coding gains , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[19]  B. Sundar Rajan,et al.  STBCs using capacity achieving designs from cyclic division algebras , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[20]  B. S. Rajan,et al.  Space-time block codes from co-ordinate interleaved orthogonal designs , 2002, Proceedings IEEE International Symposium on Information Theory,.

[21]  B. Sundar Rajan,et al.  High-rate, full-diversity STBCs from field extensions , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[22]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[23]  Xiang-Gen Xia,et al.  Quasi-orthogonal space-time block codes with full diversity , 2002, SPIE Optics + Photonics.

[24]  Pranav Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2005, IEEE Transactions on Information Theory.

[25]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[26]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[27]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[28]  P. Vijay Kumar,et al.  A unified construction of space-time codes with optimal rate-diversity tradeoff , 2005, IEEE Transactions on Information Theory.

[29]  Huan Yao,et al.  Efficient signal, code, and receiver designs for MIMO communication systems , 2003 .

[30]  Robert W. Heath,et al.  Switching Between Multiplexing and Diversity Based on Constelation Distance , 2000 .

[31]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[32]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

[33]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

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

[35]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[36]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

[37]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

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

[39]  Michael P. Fitz,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1999, IEEE Trans. Commun..

[40]  B. Sundar Rajan,et al.  Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.

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

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

[43]  B. Sundar Rajan,et al.  STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennas , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[44]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[45]  J. Belfiore,et al.  Algebraic 3 × 3 , 4 × 4 and 6 × 6 Space-Time Codes with non-vanishing Determinants , 2004 .