Cooperative diversity in wireless networks: algorithms and architectures
Cooperative diversity in wireless networks: algorithms and architectures
Random DS/CDMA for the amplify and forward relay channel
IEEE Transactions on Wireless 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
Randomized Space-Time Coding for Distributed Cooperative Communication
IEEE Transactions on Signal Processing
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Spectral efficiency in the wideband regime
IEEE Transactions on Information Theory
MMSE analysis of certain large isometric random precoded systems
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Asymptotic analysis of optimum and suboptimum CDMA downlink MMSE receivers
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A distributed random linear-dispersion space-time block coding for relay networks is presented. The coding matrix assigned to each relay is built by a set of columns (or rows) of an independent random Haar-distributed unitary matrix. Within each transmitter, the particular structure of the codes allows to reduce interference in the multiplexed symbols, with respect to similar codes with random i.i.d. entries. The system is shown to have an asymptotically deterministic behavior (the convergence is in probability) as the dimensions of the code grow large while keeping constant the coding rate. The limiting performance can be characterized by means of free-probability theory: more specifically, the rectangnlar R-transform is employed to compute the asymptotic distribution of the singnlar values of a sum of rectangnlar matrices, which completely characterizes the asymptotic spectral efficiency of the corresponding channel.