D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes
IEEE Transactions on Signal Processing - Part I
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
A distributed space-time coding in asynchronous wireless relay networks
IEEE Transactions on Wireless Communications - Part 2
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
IEEE Transactions on Information Theory
Distributed QAM-Based Space-Time Block Codes for Efficient Cooperative Multiple-Access Communication
IEEE Transactions on Information Theory
EURASIP Journal on Wireless Communications and Networking - Special issue on cooperative communications in wireless networks
To code in space and time or not in multihop relay channels
IEEE Transactions on Signal Processing
Low complexity distributed STBCs with unitary relay matrices for any number of relays
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Combination of MRC and distributed space-time coding in networks with multiple-antenna relays
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
We consider a wireless relay network, where a transmitter node communicates with a receiver node with the help of relay nodes. Most coding strategies considered so far assume that the relay nodes are used for one hop. We address the problem of code design when relay nodes may be used for more than one hop. We consider as a protocol a more elaborated version of amplify-and-forward, called distributed space-time coding, where the relay nodes multiply their received signal with a unitary matrix, in such a way that the receiver senses a space-time code. We first show that in this scenario, as expected, the so-called full-diversity condition holds, namely, the codebook of distributed space-time codewords has to be designed such that the difference of any two distinct codewords is full rank. We then compute the diversity of the channel, and show that it is given by the minimum number of relay nodes among the hops. We finally give a systematic way of building fully diverse codebooks and provide simulation results for their performance.