Title :
Achievable rate for multiple-hop Gaussian relay channel with linear relaying
Author :
Deng Zhixiang ; Wang Baoyun ; Lang Fei ; Ma Yayan
Author_Institution :
Coll. of Telecommun. & Inf. Eng., Nanjing Univ. of Posts & Telecommun., Nanjing, China
Abstract :
In this paper, the optimization problem of the multiple-hop relay channel with linear relaying is discussed. The capacity for the multiple-hop Gaussian relay channel with linear relaying is derived, which can be formulated as an optimization problem over the relaying matrices 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 when some certain conditions are satisfied. And 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). Simulation results show that the achievable rate with linear relaying is close to the max-flow min-cut capacity, if channel gain of one certain hop is smaller than that of all the other hops relatively.
Keywords :
amplification; amplify and forward communication; covariance matrices; optimisation; relay networks (telecommunication); TSAF; channel gain; covariance matrix; linear relaying; max-flow min-cut capacity; multiple-hop Gaussian relay channel; multiple-hop relay channel; relaying matrices; single-letter optimization problem; time-sharing amplify and forward; “single-letter” optimization; achievable rate; linear relaying; multiple-hop relay channel; time-sharing AF;
Conference_Titel :
Signal Processing (ICSP), 2012 IEEE 11th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-2196-9
DOI :
10.1109/ICoSP.2012.6491817