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

Rajan, Susinder G and Rajan, Sundar B (2006) A Non-orthogonal Distributed Space-Time Coded Protocol, Part-II:Code construction and DM-G Tradeoff. In: IEEE Information Theory Workshop (ITW 2006), 22-26 October, Chengdu,China.

Preview

PDF test.pdf Download (246kB)

Abstract

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 spacetime 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.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Distributed space-time codes;Cooperative diversity;Protocol
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:34
URI:	http://eprints.iisc.ac.in/id/eprint/9496

Actions (login required)

View Item