Cooperative diversity in wireless networks: algorithms and architectures
Cooperative diversity in wireless networks: algorithms and architectures
Cooperation in Wireless Networks: Principles and Applications: Real Egoistic Behavior Is to Cooperate!
MIMO Wireless Communications
Introduction to Space-Time Wireless Communications
Introduction to Space-Time Wireless Communications
Random DS/CDMA for the amplify and forward relay channel
IEEE Transactions on Wireless Communications
Randomized Space-Time Coding for Distributed Cooperative Communication
IEEE Transactions on Signal Processing
Large system performance of linear multiuser receivers in multipath fading channels
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Orthogonal matrix precoding for relay networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
| Hi-index | 0.00 |
This paper analyzes a cooperative communications system where a set of decode and forward relays provides support to a point to point communication. Each relay linearly transforms the K received symbols, if correctly decoded, into N new ones to be sent to the destination. The coding matrices are randomly generated, making the system simple to design, scalable and robust to synchronism errors. It is shown that such a random code, together with the optimal maximum-likelihood receiver, achieves full diversity for any value of the ratio α = K/N. This is not true for the linear minimum mean square error receiver, which loses diversity when α increases beyond a given threshold. To avoid dealing with the randomness of the code, the analysis is carried out in the asymptotic domain, i.e. for K and N growing without bound but with ratio converging to a finite quantity α. Random matrix theory results are used to derive this asymptotic approximation.