Computer Science – Information Theory
Scientific paper
2005-12-07
Computer Science
Information Theory
Scientific paper
In this work we explicitly provide the first ever optimal, with respect to the Zheng-Tse diversity multiplexing gain (D-MG) tradeoff, cooperative diversity schemes for wireless relay networks. The schemes are based on variants of perfect space-time codes and are optimal for any number of users and all statistically symmetric (and in some cases, asymmetric) fading distributions. We deduce that, with respect to the D-MG tradeoff, channel knowledge at the intermediate relays and infinite delay are unnecessary. We also show that the non-dynamic selection decode and forward strategy, the non-dynamic amplify and forward, the non-dynamic receive and forward, the dynamic amplify and forward and the dynamic receive and forward cooperative diversity strategies allow for exactly the same D-MG optimal performance.
Elia Petros
Kumar Vijay P.
No associations
LandOfFree
Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442930