Asymptotically optimal cooperative wireless networks with reduced signaling complexity

Elia, Petros ; Oggier, Frederique ; Vijay Kumar, P. (2007) Asymptotically optimal cooperative wireless networks with reduced signaling complexity IEEE Journal on Selected Areas in Communications, 25 (2). pp. 258-267. ISSN 0733-8716

Full text not available from this repository.

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

Related URL: http://dx.doi.org/10.1109/JSAC.2007.070203

Abstract

This paper considers an orthogonal amplify-and-forward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays are permitted to linearly transform the received signal and where the source and relays transmit for equal time durations. The diversity-multiplexing gain (D-MG) tradeoff of the equivalent space-time channel associated to this protocol is determined and a cyclic-division-algebra-based D-MG optimal code constructed. The transmission or signaling alphabet of this code is the union of the QAM constellation and a rotated version of QAM. The size of this signaling alphabet is small in comparison with prior D-MG optimal constructions in the literature and is independent of the number of participating nodes in the network.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
ID Code:110090
Deposited On:31 Jan 2018 09:59
Last Modified:31 Jan 2018 09:59

Repository Staff Only: item control page