分布式Alamouti空时码的信道容量及最优资源分配方案

种稚萌; 任品毅; 朱世华; 吕刚明

doi:10.3724/SP.J.1146.2007.00997

分布式Alamouti空时码的信道容量及最优资源分配方案

doi: 10.3724/SP.J.1146.2007.00997

基金项目:

国家自然科学基金(60372055)，博士点基金(20030698027)和国家高技术研究发展计划(2006AA01Z262) 资助课题

计量
- 文章访问数: 3576
- HTML全文浏览量: 80
- PDF下载量: 803
- 被引次数: 0
出版历程
- 收稿日期: 2007-06-18
- 修回日期: 2007-11-05
- 刊出日期: 2009-01-19

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

摘要

摘要: 该文针对基于译码转发协议的分布式Alamouti空时码(DF-DASTC)系统的信道容量以及最优资源分配策略问题。利用退化中继信道模型，推导得到了DF-DASTC系统在衰落信道下的信道容量闭式解。以DF-DASTC信道容量最大化为目标，对该系统在固定带宽分配时，中继及信源节点的最优功率分配方案进行了研究，推导得到了DF-DASTC系统的最优功率分配方案的闭式解。利用凸优化理论，将以DF-DASTC信道容量最大化为目标函数的多目标优化问题转换为非线性不等式约束的单目标凸优化问题，进一步得到了可变带宽分配时的DF-DASTC系统的最优带宽和功率分配策略。理论分析和系统仿真表明，该文所提出的资源分配策略，比平均分配的资源方案具有更大的信道容量。另外，该文的最优资源分配策略适用于具有多个中继节点的无线中继网络，具有普适性。
- 分布式空时码;信道容量;凸优化;资源分配
Abstract: In this paper, the channel capacity and the optimal resource allocation scheme for Distributed Alamouti Space-Time Code based on Decode-and-Forward (DF-DASTC) protocol are investigated. Using the degraded relay channel model, the channel capacity of DF-DASTC under fading channels is derived. To maximize the capacity of DF-DASTC, the closed-formed analytical expression of the optimal power allocation scheme with fixed bandwidth allocation is derived for DF-DASTC. Based on the convex optimization theory, the multi-objective optimization issue to maximize the capacity of DF-DASTC is converted into the general single objective optimization problem, and the optimal resource allocation scheme with variable bandwidth allocation is derived. Both theoretical analysis and simulations show that the resource allocation scheme can significantly increase the channel capacity of DF-DASTC. Moreover, the resource allocation scheme is a generalized method, which can be used in wireless relay networks with multiple relay nodes.

HTML全文

参考文献(1)

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

施引文献

资源附件(0)

访问统计