Strong convergence of the empirical distribution of eigenvalues of large dimensional random matrices
Journal of Multivariate Analysis
Multiuser Detection
Cooperative diversity in wireless networks: algorithms and architectures
Cooperative diversity in wireless networks: algorithms and architectures
IEEE Transactions on Information Theory
Spectral efficiency of CDMA with random spreading
IEEE Transactions on Information Theory
Linear multiuser receivers: effective interference, effective bandwidth and user capacity
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
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
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Decode and forward relays: full diversity with randomized distributed space-time coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Orthogonal matrix precoding for relay networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
| Hi-index | 0.01 |
This paper presents a communication system where point-to-point transmissions are aided by L half-duplex, amplify and forward relays which access a common channel by means of random spreading matrices. During the relaying phase, the source can either remain silent or send new symbols. The two cases are compared in terms of spectral efficiency, showing that the latter is always preferable. Next, a sufficient condition for the superiority of the presented relaying scheme over the simple direct-link channel is derived. Particularizing to the one-relay case, this condition turns out to be also necessary and allows to identify which is the best time-sharing strategy between relay receiving and transmitting phases. We conclude the paper by discussing the suboptimal linear-minimum-mean-square-error receiver, which is known to be the linear filter that guarantees the maximum signal to noise and interference ratio at its output. To avoid dealing with the randomness introduced by the spreading matrices, the analysis is carried out in the asymptotic regime, i.e. when letting the number of transmitted symbols and the signature length grow without bound but with constant ratio. Under these hypotheses, indeed, random matrix theory results show that it is possible to derive deterministic almost sure equivalents which are excellent approximations of the finite reality.