期刊文献+

Two-Hop Gaussian Relay Channel with Linear Relaying: Achievable Rate and Optimization Design 被引量:1

Two-Hop Gaussian Relay Channel with Linear Relaying: Achievable Rate and Optimization Design
下载PDF
导出
摘要 The relay node with linear relaying transmits the linear combination of its past received signals.The optimization of two-hop relay channel with linear relaying is discussed in this paper.The 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 source.It is proved that the solution to this optimization problem is equivalent to a "single-letter" optimization problem.We 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 algorithm.Simulation 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. The relay node with linear relaying transmits the linear combination of its past received signals. The optimization of two-hop relay channel with linear relaying is discussed in this paper. The 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 source. It is proved that the solu- tion to this optimization problem is equivalent to a "single-letter" optimization problem. We 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 For- ward (TSAF). In order to solve this equivalent problem, we proposed an iterative algorithm. Simulation 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.
出处 《China Communications》 SCIE CSCD 2012年第2期96-104,共9页 中国通信(英文版)
基金 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) 中继信道 线性组合 优化设计 高斯 协方差矩阵 优化问题 速率 容量约束
  • 相关文献

参考文献1

二级参考文献18

  • 1DONG L,HAN Z,PETROPULU A P,POOR H V.Improving wireless physical layer security via cooperating relays[J].IEEE Transactions on Signal Processing,2010,58(3):1875-1888. 被引量:1
  • 2MEULEN E C.Three-terminal communication channels[J].Advances in Applied Probability,1971,3:120-154. 被引量:1
  • 3COVER T,GAMAL A E.Capacity theorems for the relay channel[J].IEEE Transactions on Information Theory,1979,25(5):572-584. 被引量:1
  • 4XIANG H,YENER A.Cooperation with an untrusted relay:a secrecy perspective[J].IEEE Transactions on Information Theory,2010,56(8):3807-3827. 被引量:1
  • 5XIANG H,YENER A.Two-hop secure communication using an untrusted relay[J].EURASIP Journal on Wireless Communications and Networking,2009,2009(2009):305146. 被引量:1
  • 6XIANG H,YENER A.Secrecy and reliable Byzantine detection in a Gaussian untrusted two-hop link[C] //IEEE on Information Theory Workshop,2010:1-5. 被引量:1
  • 7AGGARNAL V,SANKAR L,CALDERBANK A R,POORH V.Secrecy capacity of a class of orthogonal relay eavesdropper channels[J].EUROSIP Journal of Wireless Communications and Networking,2009,2009(2009):494696. 被引量:1
  • 8OOHHAMA Y,WATANABE S.Capacity results for relay channels with confidential messages[P/OL].2010,HTTP:// arxiv.org/PS_cache /arxiv/pdf/1009/1009.5829v2.pdf. 被引量:1
  • 9AMIR S,SOMAYEM S.A new achievable rateequivocation region for the relay-eavesdropper channel[C] //Iranian Conference on Electrical Engineering(ICEE),2010:188-193. 被引量:1
  • 10SHANNON C E.Communication theory of secrecy systems[J].Bell System Technical Journal,1949,28:656-715. 被引量:1

共引文献1

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部