The Channel Capacity and Resource Allocation Scheme for Distributed Alamouti Space-Time Code

Laneman J N, Tse D N C, and Wornell G W. Cooperativediversity in wireless networks: efficient protocols and outagebehavior [J].IEEE Trans. on Information Theory.2004, 50(12):3062-3080[2]殷勤业, 张莹, 丁乐,等. 协作分集: 一种新的空域分集技术.西安交通大学学报[J], 2005, 39(6): 551-557.Yin Qinye, Zhang Ying, and Ding Le, et al.. Cooperationdiversity: a new spatial diversity technique [J]. Journal ofXian Jiaotong University, 2005, 39(6): 551-557.[3]Laneman J N and Wornell G W. Distributed space-timecodedprotocols for exploiting cooperative diversity inwireless networks [J].IEEE Trans. on Information Theory.2003, 49(10):2415-2425[4]Scutari G and Barbarossa S. Distributed space-time codingfor regeneraive relay networks [J]. IEEE Trans. on WirelessCommunications, 2005, 4(5): 2387-2399.[5]Deng Xinmin and Haimovich A M. Power allocation forcooperative relaying in wireless networks [J]. IEEECommunications Letters, 2005, 9(11): 994-996.[6]Zhao Yi, Adve R, and Jim Teng Joon. Improvingamplify-and-forward relay networks: optimal powerallocation versus Selection [C]. IEEE InternationalSymposium on Information Theory (ISIT), Seattle, USA, Jul2006: 1234-1238.[7]Liang Yingbin and Veeravalli V V. Gaussian orthogonal relaychannels: optimal resource allocation and capacity [J].IEEETrans. on Information Theory.2005, 51(9):3284-3289[8]Liang Yingbin and Veeravalli V V. Resource allocation forwireless relay channels [C]. Proceeding of AsilomarConference on Signals, Systems and Computers, PacificGrove, CA, USA , Nov. 2004: 1902-1906.[9]Liang Yingbin, Veeravalli V V, and Vincent P H. Resourceallocation for wireless Relay channels: max-min solutions [J].IEEE Trans.on Information Theory.2007, 53(10):3413-3431[10]Cover T M and Gamal A A E. Capacity theorems for therelay channel [J].IEEE Trans. on Information Theory.1979,25(5):572-584[11]Khojastepour M A, Sabharwal A, and Aazhang B. Oncapacity of Gaussian 'cheap' relay channel [C]. IEEEGlobecom, San Francisco, USA, 2003: 1776-1780.[12]Cover T M, Thomas J A, 阮吉寿, 张华. 信息论基础[M]. 北京: 机械工业出版社, 2005: 348-354.[13]张可村. 工程优化的算法与分析[M]. 西安: 西安交通大学出版社, 1987: 235-380.[14]Boyd S and Vandenberghe L. Convex optimization [M].London: Cambridge University Press, 2004: 128-135.[15]Kramer G, Gupta P, and Gastpar M. Information-theoreticmulti-hopping for relay networks [C]. 2004 InternationalZurich Seminar on Communications, Zurich, Switzerland,2004: 192-195.[16]Xie Liangliang and Kumar P R. An achievable rate for themultiple-level relay channel [J].IEEE Trans. on InformationTheory.2005, 51(4):1348-1358