By Topic

A Non-orthogonal Distributed Space-Time Coded Protocol Part II: Code Construction and DM-G Tradeoff

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)
Rajan, G.S. ; Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore ; Rajan, B.S.

This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in part-I, a construction of a new family of distributed space-time codes based on co-ordinate interleaved orthogonal designs (CIOD) which result in reduced maximum likelihood (ML) decoding complexity at the destination is proposed. Further, it is established that the recently proposed Toeplitz space-time codes as well as space-time block codes (STBCs) from cyclic division algebras can be used in GNAF protocol. Finally, a lower bound on the optimal diversity-multiplexing gain (DM-G) tradeoff for the GNAF protocol is established and it is shown that this bound approaches the transmit diversity bound asymptotically as the number of relays and the number of channels uses increases

Published in:

Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE

Date of Conference:

22-26 Oct. 2006