Sciweavers

Share
JSAC
2007

Asymptotically optimal cooperative wireless networks with reduced signaling complexity

9 years 1 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (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.
Petros Elia, Frédérique E. Oggier, P
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2007
Where JSAC
Authors Petros Elia, Frédérique E. Oggier, P. Vijay Kumar
Comments (0)
books