Asymptotically optimal cooperative wireless networks with reduced signaling complexity

  • Authors:
  • Petros Elia;Frederique Oggier;P. Vijay Kumar

  • Affiliations:
  • Dept. of EE- Syst., Univ. of Southern California, Los Angeles, CA;-;-

  • Venue:
  • IEEE Journal on Selected Areas in Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.13

Visualization

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