Jing, Yindi and Hassibi, Babak (2005) Cooperative diversity in wireless relay networks with multiple-antenna nodes. In: International Symposium on Information Theory, 2005. ISIT 2005. Proceedings. IEEE , Piscataway, NJ, pp. 815-819. ISBN 0-7803-9151-9. https://resolver.caltech.edu/CaltechAUTHORS:20150210-070058052
![]() |
PDF
- Published Version
See Usage Policy. 288kB |
![]() |
PDF
- Submitted Version
See Usage Policy. 355kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150210-070058052
Abstract
In [1], the idea of distributed space-time coding was proposed to achieve a degree of cooperative diversity in a wireless relay network. In particular, for a relay network with a single-antenna transmitter and receiver and R single-antenna relays, it was shown that the pairwise error probability (PEP) decays as ((log P)/P)^R, where P is the total transmit power. In this paper, we extend the results to wireless relay networks where the transmitter, receiver, and/or relays may have multiple antennas. Assuming that the transmitter has M antennas, the receiver has N antennas, the sum of all the antennas at the relay nodes is R, and the coherence interval is long enough, we show that the PEP behaves as (1/P)^(min{M,N}R), if M ≠ N, and ((log^(1/M)P)/p)^(MR), if M=N. Therefore, for the case of M ≠ N, distributed space-time coding has the same PEP performance as a multiple-antenna system with min{M, N}R transmit and a single receive antenna. For the case of M = N, the penalty on the PEP compared to a multiple-antenna system is a log^(1/M) P factor, which is negligible at high SNR. We also show that for a fixed total transmit power across the entire network, the optimal power allocation is for the transmitter to expend half the power and for the relays to share the other half with the power used by each relay being proportional to the number of antennas it has.
Item Type: | Book Section | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||||||
Additional Information: | © 2005 IEEE. This work is supported in part by the National Science Foundation under grant numbers CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking. | ||||||||||
Funders: |
| ||||||||||
DOI: | 10.1109/ISIT.2005.1523450 | ||||||||||
Record Number: | CaltechAUTHORS:20150210-070058052 | ||||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20150210-070058052 | ||||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||
ID Code: | 54618 | ||||||||||
Collection: | CaltechAUTHORS | ||||||||||
Deposited By: | Shirley Slattery | ||||||||||
Deposited On: | 10 Feb 2015 18:12 | ||||||||||
Last Modified: | 10 Nov 2021 20:35 |
Repository Staff Only: item control page