SNR Decomposition for Full-Duplex Gaussian Relay Channel

被引:10
作者
Chen, Zhengchuan [1 ,2 ,3 ]
Fan, Pingyi [1 ,2 ]
Ben Letaief, Khaled [4 ,5 ]
机构
[1] Tsinghua Univ, Sch Informat Sci & Technol, Tsinghua Natl Lab Informat Sci & Technol TNList, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Sch Informat Sci & Technol, Dept Elect Engn, Beijing 100084, Peoples R China
[3] Univ Florida, Coll Engn, Dept Elect & Comp Engn, Gainesville, FL 32608 USA
[4] Hong Kong Univ Sci & Technol, Sch Engn, Hong Kong Telecom Inst Informat Technol, Kowloon, Hong Kong, Peoples R China
[5] Hong Kong Univ Sci & Technol, Sch Engn, Dept Elect & Comp Engn, Kowloon, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Gaussian relay channel; SNR decomposition (SD); decode-forward (DF); compress-forward (CF); ACHIEVABLE RATE REGION; CAPACITY THEOREMS; MULTIPLE-ACCESS; STRATEGIES; NETWORKS;
D O I
10.1109/TWC.2014.2361119
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A relay channel (RC), consisting of a source, a relay, and a destination, is a basic transmission unit of cooperative communication networks. The capacity of an RC is not known in general. In this paper, an SNR decomposition (SD) strategy is presented to implement time sharing, which provides a new tractable and achievable rate for a full-duplex Gaussian RC. More specifically, we first expand the SNR of a relay destination channel (SNR-RD) into two terms under the relay power constraint and divide the system into two subbands. Then, we assign the obtained SNR-RD for each subband and employ decode-forward (DF) or compress-forward (CF) according to the assigned SNR-RD. It is shown that the achievable rate of the SD strategy is competitive with that of superposing CF on DF. As the superposition structure requires a sophisticated codeword design, the SD strategy provides another practical combination structure of DF and CF strategies. Approximations for the SNR-RD and bandwidth allocation for subbands are also given. Based on the obtained results, two application scenarios, i.e., mobile relay and quasi-static fading RCs, are also considered. Finally, various numerical results are shown to support our developed theoretical results.
引用
收藏
页码:841 / 853
页数:13
相关论文
共 27 条
[1]   Approximate Capacity of Gaussian Relay Networks [J].
Avestimehr, Amir Salman ;
Diggavi, Suhas N. ;
Tse, David N. C. .
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, :474-+
[2]  
Boyd S., 2003, Convex Optimization
[3]  
Chen ZC, 2014, IEEE ICC, P5438, DOI 10.1109/ICC.2014.6884186
[4]   Multiple multicast for a half-duplex butterfly network: a deterministic approach [J].
Chen, Zhengchuan ;
Fan, Pingyi .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2016, 16 (03) :343-361
[5]   Generalized backward decoding strategies for the relay channel [J].
Chong, Hon-Fah ;
Motani, Mehul ;
Garg, Hari Krishna .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) :394-401
[6]   On Achievable Rates for the General Relay Channel [J].
Chong, Hon-Fah ;
Motani, Mehul .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (03) :1249-1266
[7]  
Costa M.J., 2012, OCEANS 2012, V2012, P1
[8]  
Cover Thomas M., 2006, Elements of Information Theory, V2nd
[9]   AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACK [J].
COVER, TM ;
LEUNG, CSK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) :292-298
[10]   ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :399-404