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 ...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.展开更多
This paper studies the achievable rate for three-node discrete memoryless relay channel. Specifically in this mode, we explore two generalized feedbacks simultaneously： the source node actively collects feedback sign...This paper studies the achievable rate for three-node discrete memoryless relay channel. Specifically in this mode, we explore two generalized feedbacks simultaneously： the source node actively collects feedback signals from the channel; and at the same time, the destination node actively transmits feedback signals to the relay node. These two feedback signals, which are called generalized feedback overheard from the channel that is likely to be noisy, induce that all the three nodes are in full duplex mode. The basic coding strategies of Cover and El Gamal are applied to the relay-source feedback transmission by the source forwarding the compressions of the channel output sequences at the relay node to the destination, and are also applied to the destination-relay feedback transmission to improve the decoding ability at the relay. Based on Cover and El Gamal coding, a new coding scheme adopting rate splitting and four-block Markov superposition encoding is proposed and the corresponding achievable rate is achieved. The proposed scheme is able to exploit two feedbacks simultaneously which can effectively eliminate underlying transmission bottlenecks for the channels. The derived achievable rate result generalizes several previously known results by including them as special cases.展开更多
基金supported by the National Natural Science Foundation of China under Grants No.60972045,No.61071089the Natural Science Foundation of Jiangsu Province under Grant No. BK2010077+4 种基金the Open Project of State Key Laboratory of Networking and Switching under Grant No.SKLNST-2009-1-12the Priority Academic Program Development of Jiangsu Provincethe University Postgraduate Research and Innovation Project in Jiangsu Province under Grant No.CXZZ11_0395the Fundamental Research Funds for the Central Universities under Grant No.2009B32114the Excellent Innovative Research Team of High Schools in Jiangsu Province under Grant No.TJ208029
文摘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.
基金supported by the National Natural Science Foundation of China (60972045)the Cultivation and Innovation Project for Jiangsu Provincial Postgraduate (CX10B_192Z)
文摘This paper studies the achievable rate for three-node discrete memoryless relay channel. Specifically in this mode, we explore two generalized feedbacks simultaneously： the source node actively collects feedback signals from the channel; and at the same time, the destination node actively transmits feedback signals to the relay node. These two feedback signals, which are called generalized feedback overheard from the channel that is likely to be noisy, induce that all the three nodes are in full duplex mode. The basic coding strategies of Cover and El Gamal are applied to the relay-source feedback transmission by the source forwarding the compressions of the channel output sequences at the relay node to the destination, and are also applied to the destination-relay feedback transmission to improve the decoding ability at the relay. Based on Cover and El Gamal coding, a new coding scheme adopting rate splitting and four-block Markov superposition encoding is proposed and the corresponding achievable rate is achieved. The proposed scheme is able to exploit two feedbacks simultaneously which can effectively eliminate underlying transmission bottlenecks for the channels. The derived achievable rate result generalizes several previously known results by including them as special cases.
