Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information
Lists
Only you see this
Abstract
In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space-time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> relay nodes and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> of them down behaves, as far as diversity is concerned, as a network with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> - <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas.
BibTeX
@article{oggier2010cyclic,
author = {Frédérique Oggier and Babak Hassibi},
title = {{Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information}},
journal = {IEEE Trans. Information Theory},
year = {2010},
doi = {10.1109/tit.2009.2034801},
}Loading related content...