首页 | 官方网站   微博 | 高级检索  
     

一种用于离散比特分配的改进注水算法
引用本文:赵力,孙献璞,张海林.一种用于离散比特分配的改进注水算法[J].电子与信息学报,2010,32(3):638-642.
作者姓名:赵力  孙献璞  张海林
作者单位:西安电子科技大学通信工程学院,西安,710071
基金项目:国家自然科学基金(60772317);;西安电子科技大学111工程(B08038)资助课题
摘    要:该文针对OFDM系统的离散比特分配问题,提出一种改进的注水算法。该算法的实现借助于文中定义的比特水线——分配给某个子载波的功率直接满足整数比特约束的注水线。先用最大信道增益子载波的比特水线进行离散比特分配,再调整分配结果以满足总发射功率约束。理论证明和分析显示,该算法能实现最优比特分配,运算复杂度仅与子载波数量有关。

关 键 词:正交频分复用  注水算法  比特分配  贪婪算法
收稿时间:2009-3-13
修稿时间:2009-10-9

An Improved Water-filling Algorithm for Discrete Bit Allocation
Zhao Li,Sun Xian-pu,Zhang Hai-lin.An Improved Water-filling Algorithm for Discrete Bit Allocation[J].Journal of Electronics & Information Technology,2010,32(3):638-642.
Authors:Zhao Li  Sun Xian-pu  Zhang Hai-lin
Affiliation:School of Telecommunication Engineering, Xidian University, Xi’an 710071, China
Abstract:In this paper, an improved water-filling algorithm is proposed for the problem of Discrete Bit Allocation DBA in OFDM systems. The bit-water-level, defined in this paper as the water-filling level under which the power allocated to a certain sub-carrier satisfies the integer bit constraint, is used in the proposed algorithm. First, using the bit-water-levels of the sub-carrier with the maximal channel gain, bits and power are allocated to all the sub-carriers. Then, the allocation results are adapted to satisfy the total transmit power constraint. It is proved that the algorithm yields the optimal solution and its computational complexity depends only on the number of sub-carriers.
Keywords:OFDM  Water-filling algorithm  Bit allocation  Greedy algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号