Coordinate distributed space-time coding for two-antenna-relays networks

Harshan, J. ; Sundar Rajan, B. (2007) Coordinate distributed space-time coding for two-antenna-relays networks In: 2007 IEEE Global Telecommunications Conference, GLOBECOM '07, 26-30 Nov 2007, Washington, DC, USA.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/4411241/

Related URL: http://dx.doi.org/10.1109/GLOCOM.2007.331

Abstract

Distributed space time coding for wireless relay networks where the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. In the first phase of the two-phase transmission model, a T -length complex vector is transmitted from the source to all the relays. At each relay, the inphase and quadrature component vectors of the received complex vectors at the two antennas are interleaved before processing them. After processing, in the second phase, a T x 2R matrix codeword is transmitted to the destination. The collection of all such codewords is called Co-ordinate interleaved distributed space-time code (CIDSTC). Compared to the scheme proposed by Jing-Hassibi, for T ges AR, it is shown that while both the schemes give the same asymptotic diversity gain, the CIDSTC scheme gives additional asymptotic coding gain as well and that too at the cost of negligible increase in the processing complexity at the relays.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:111008
Deposited On:08 Dec 2017 10:28
Last Modified:08 Dec 2017 10:28

Repository Staff Only: item control page