Distributed space-time codes with reduced decoding complexity


Autoria(s): Kiran, T; Rajan, Sundar B
Data(s)

2006

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/30488/1/04036021.pdf

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.

Publicador

IEEE

Relação

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4036021&tag=1

http://eprints.iisc.ernet.in/30488/

Palavras-Chave #Electrical Communication Engineering
Tipo

Conference Paper

PeerReviewed