Kiran, T. ; Sundar Rajan, B. (2006) Distributed space-time codes with reduced decoding complexity In: 2006 IEEE International Symposium on Information Theory, 9-14 July 2006, Seattle, WA, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/4036021/
Related URL: http://dx.doi.org/10.1109/ISIT.2006.261775
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 or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111171 |
| Deposited On: | 08 Dec 2017 10:31 |
| Last Modified: | 08 Dec 2017 10:31 |
Repository Staff Only: item control page
