Cooperative Multiplexing: Toward Higher Spectral Efficiency in Multiple-Antenna Relay Networks

被引:12
作者
Fan, Yijia [1 ]
Wang, Chao [2 ]
Poor, H. Vincent [1 ]
Thompson, John S. [2 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Univ Edinburgh, Inst Digital Commun, Edinburgh EH9 3JL, Midlothian, Scotland
基金
英国工程与自然科学研究理事会;
关键词
CAPACITY THEOREMS; DIVERSITY; TRADEOFF; PROTOCOLS; BOUNDS;
D O I
10.1109/TIT.2009.2023721
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the fundamental tradeoff between the transmission rate and outage probability in multiple-antenna relay networks is given. It follows that multiplexing gains can be obtained at any finite signal-to-noise ratio (SNR), in full-duplex multiple-antenna relay networks. Thus, relaying can offer not only stronger link reliability, but also higher spectral efficiency. Specifically, the decode-and-forward protocol is applied and networks that have one source, one destination, and multiple relays are considered. A receive power gain at the relays, which captures the network large-scale fading characteristics, is also considered. It is shown that this power gain can significantly affect the system diversity-multiplexing tradeoff for any finite SNR value. Several relaying protocols are proposed and are shown to offer nearly the same outage probability as if the transmit antennas at the source and the relay(s) were colocated, given certain SNR and receive power gains at the relays. Thus, a higher multiplexing gain than that of the direct link can be obtained if the destination has more antennas than the source. Much of the analysis in the paper is valid for arbitrary channel fading statistics. These results point to a view of relay networks as a means for providing higher spectral efficiency, rather than only link reliability.
引用
收藏
页码:3909 / 3926
页数:18
相关论文
共 25 条
[1]  
[Anonymous], 802112020 IEEE, P1
[2]  
[Anonymous], 1981, ORDER STAT
[3]   On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels [J].
Azarian, K ;
El Gamal, H ;
Schniter, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4152-4172
[4]   A simple cooperative diversity method based on network path selection [J].
Bletsas, A ;
Khisti, A ;
Reed, DP ;
Lippman, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (03) :659-672
[5]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[6]   Recovering multiplexing loss through successive relaying using repetition coding [J].
Fan, Yijia ;
Wang, Chao ;
Thompson, John ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (12) :4484-4493
[7]  
Foschini G. J., 1996, Bell Labs Technical Journal, V1, P41, DOI 10.1002/bltj.2015
[8]  
Horn R. A., 2012, Matrix Analysis
[9]   Capacity bounds for cooperative diversity [J].
Host-Madsen, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1522-1544
[10]   Capacity bounds and power allocation for wireless relay channels [J].
Host-Madsen, A ;
Zhang, JS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2020-2040