Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks
arXiv:cs/0512028
Abstract
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.
Cited by in corpus (7)
- Diversity of MIMO Multihop Relay Channels
- Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward
- The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs
- Wireless Coded Caching: A Topological Perspective
- Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
- Performance-Complexity Analysis for MAC ML-based Decoding with User Selection
- Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas