ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Distributed space-time codes with reduced decoding complexity

Kiran, T and Rajan, Sundar B (2006) Distributed space-time codes with reduced decoding complexity. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA,, pp. 542-546.

[img] PDF
04036021.pdf - Published Version
Restricted to Registered users only

Download (195Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Abstract

We address the problem of distributed space-time coding with reduced decoding complexity for wireless relay network. The transmission protocol follows a two-hop model wherein the source transmits a vector in the first hop and in the second hop the relays transmit a vector, which is a transformation of the received vector by a relay-specific unitary transformation. Design criteria is derived for this system model and codes are proposed that achieve full diversity. For a fixed number of relay nodes, the general system model considered in this paper admits code constructions with lower decoding complexity compared to codes based on some earlier system models.

Item Type: Conference Paper
Additional Information: Copyright 2006 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.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 26 Aug 2010 09:14
Last Modified: 19 Sep 2010 06:12
URI: http://eprints.iisc.ernet.in/id/eprint/30488

Actions (login required)

View Item View Item