Two-Hop Gaussian Relay Channel with Linear Relaying： Achievable Rate and Optimization Design

作     者：Deng Zhixiang Wang Baoyun Lang Fei Ma Yayan Liu Chen 

作者机构：State Key Laboratory of Networking and SwitchingBeijing University of Posts and TelecommunicationsBeijing 100876P.R.China College of Telecommunications and Information EngineeringNanjing University of Posts and TelecommunicationsNanjing 210003P.R.China College of AutomationNanjing University of Posts and TelecommunicationsNanjing 210003P.R.China College of Computer and Information EngineeringHohai UniversityChangzhou 213022P.R.China College of Electronic Science EngineeringNanjing University of Posts and TelecommunicationsNanjing 210003P.R.China 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2012年第9卷第2期

页      面：96-104页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 07[理学] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 070104[理学-应用数学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 0701[理学-数学] 

基　　金：supported by the National Natural Science Foundation of China under Grants No.60972045,No.61071089 the Natural Science Foundation of Jiangsu Province under Grant No. BK2010077 the Open Project of State Key Laboratory of Networking and Switching under Grant No.SKLNST-2009-1-12 the Priority Academic Program Development of Jiangsu Province the University Postgraduate Research and Innovation Project in Jiangsu Province under Grant No.CXZZ11_0395 the Fundamental Research Funds for the Central Universities under Grant No.2009B32114 the Excellent Innovative Research Team of High Schools in Jiangsu Province under Grant No.TJ208029 

主　　题：linear relaying two-hop relay channel time-sharing Amplify-and-Forward (AF) 

摘      要：The relay node with linear relaying transmits the linear combination of its past received *** optimization of two-hop relay channel with linear relaying is discussed in this *** capacity for the two-hop Gaussian relay channel with linear relaying is derived,which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the *** is proved that the solution to this optimization problem is equivalent to a single-letter optimization *** also show that the solution to this single-letter optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward(TSAF).In order to solve this equivalent problem,we proposed an iterative *** results show that if channel gain of one hop is relatively smaller,the achievable rate with TSAF is closer to the max-flow min-cut capacity bound,but at a lower complexity.