Code Design for Multihop Wireless Relay Networks

Abstract

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.