Asymptotically optimal cooperative wireless networks with reduced signaling complexity
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.
Additional Information
© Copyright 2007 IEEE. Reprinted with permission. Manuscript received February 1, 2006; revised July 1, 2006. [Posted online: 2007-02-26] This work was carried out while P. Vijay Kumar was on a leave of absence at the Indian Institute of Science Bangalore. This research is also supported in part by NSFITR CCR-0326628 and in part by the DRDO-IISc Program on Advanced Research in Mathematical Engineering. The work of F. Oggier is supported by the Swiss National Science Foundation grant PBEL2-110209.Attached Files
Published - ELIieeejsac07.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:2a5819bbfd1a0e6574f97739f0f04f51
|
988.7 kB | Preview Download |
Additional details
- Eprint ID
- 7547
- Resolver ID
- CaltechAUTHORS:ELIieeejsac07
- CCR-0326628
- NSF
- DRDO-IISc Program on Advanced Research in Mathematical Engineering
- PBEL2-110209
- Swiss National Science Foundation (SNSF)
- Created
-
2007-03-02Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field