Abstract

The idea of space-time coding devised for multiple-antenna systems is applied to the problem of communication over a wireless relay network, a strategy called distributed space-time coding, to achieve the cooperative diversity provided by antennas of the relay nodes. In this paper, we extend the idea of distributed space-time coding to wireless relay networks with multiple-antenna nodes and fading channels. We show that for a wireless relay network with antennas at the transmit node, antennas at the receive node, and a total of antennas at all the relay nodes, provided that the coherence interval is long enough, the high SNR pairwise error probability (PEP) behaves as if and if , where is the total power consumed by the network. Therefore, for the case of , distributed space-time coding achieves the maximal diversity. For the case of , the penalty is a factor of which, compared to , becomes negligible when is very high.

Highlights

  • It is known that multiple antennas can greatly increase the capacity and reliability of a wireless communication link in a fading environment using space-time coding [1,2,3,4]

  • For a wireless relay network with M antennas at the transmitter, N antennas at the receiver, and a total of R antennas at all the relay nodes, our work shows that when the coherence interval is long enough, a diversity of min{M, N}R if M =/ N and MR(1−(1/M)(log log P/ log P)) if M = N can be achieved, where P is the total power used in the network

  • We show simulated block error rates of three networks with multiple transmit/receive antennas and compare them with the three pairwise error probability (PEP) bounds we derived in (25), (31), and (40). These bounds are addressed as PEP bound 1, PEP bound 2, and PEP bound 3 for the sake of presentation

Read more

Summary

Introduction

It is known that multiple antennas can greatly increase the capacity and reliability of a wireless communication link in a fading environment using space-time coding [1,2,3,4]. This work follows the strategy of [5], where the idea of space-time coding devised for multiple-antennasystems is applied to the problem of communication over a wireless relay network. Similar ideas for networks with one and two relays have appeared in [6, 11].) In [5], the authors consider wireless relay networks in which every node has a single antenna and the channels are fading, and use a cooperative strategy called distributed space-time coding by applying a linear dispersion space-time code [25] among the relays. It is proved that without any channel knowledge at the relays, a diversity of R(1 − log log P/ log P) can be achieved, where R is the number of relays and P is the total power consumed in the whole network This result is based on the assumption that the receiver has full knowledge of the fading channels. Other related papers can be found in [44,45,46]

Objectives
Results
Discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.