By Topic

STBC-schemes with nonvanishing determinant for certain number of transmit antennas

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T, K. ; Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India ; Rajan, B.S.

A space-time block-code scheme (STBC-scheme) is a family of STBCs {C(SNR)}, indexed by the signal-to-noise ratio (SNR) such that the rate of each STBC scales with SNR. An STBC-scheme is said to have a nonvanishing determinant if the coding gain of every STBC in the scheme is lower-bounded by a fixed nonzero value. The nonvanishing determinant property is important from the perspective of the diversity multiplexing-gain (DM-G) tradeoff: a concept that characterizes the maximum diversity gain achievable by any STBC-scheme transmitting at a particular rate. This correspondence presents a systematic technique for constructing STBC-schemes with nonvanishing determinant, based on cyclic division algebras. Prior constructions of STBC-schemes from cyclic division algebra have either used transcendental elements, in which case the scheme may have vanishing determinant, or is available with nonvanishing determinant only for two, three, four, and six transmit antennas. In this correspondence, we construct STBC-schemes with nonvanishing determinant for the number of transmit antennas of the form 2k, 3·2k, 2·3k, and qk(q-1)/2, where q is any prime of the form 4s+3. For cyclic division algebra based STBC-schemes, in a recent work by Elia et al., the nonvanishing determinant property has been shown to be sufficient for achieving DM-G tradeoff. In particular, it has been shown that the class of STBC-schemes constructed in this correspondence achieve the optimal DM-G tradeoff. Moreover, the results presented in this correspondence have been used for constructing optimal STBC-schemes for arbitrary number of transmit antennas, by Elia et al.

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 8 )