STBC-schemes with non-vanishing determinant for certain number of transmit antennas

Kiran, T. ; Sundar Rajan, B. (2005) STBC-schemes with non-vanishing determinant for certain number of transmit antennas In: Proceedings of the International Symposium on Information Theory, 2005. ISIT 2005, 4-9 Sept. 2005, Adelaide, SA, Australia.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/1523527/

Related URL: http://dx.doi.org/10.1109/ISIT.2005.1523527

Abstract

This paper presents a systematic technique for constructing STBC-schemes (space-time block code schemes) with non-vanishing determinant, based on cyclic division algebras. Prior constructions of STBC-schemes with non-vanishing determinant are available only for 2, 3, 4 and 6 transmit antennas. In this paper, by using an appropriate representation of a cyclic division algebra over a maximal subfield, we construct STBC-schemes with non-vanishing determinant for the number of transmit antennas of the form 2k or 3middot2k or 2middot3k or qk(q - 1)/2, where q is a prime of the form 4s + 3 and s is any arbitrary integer. In a recent work, Elia et. al. have proved that non-vanishing determinant is a sufficient condition for STBC-schemes from cyclic division algebra to achieve the optimal Diversity-multiplexing Gain (D-MG) tradeoff; thus proving that the STBC-schemes constructed in this paper achieve the optimal D-MG tradeoff.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:111178
Deposited On:08 Dec 2017 10:31
Last Modified:08 Dec 2017 10:31

Repository Staff Only: item control page