一种改进的OFDM系统自适应比特分配算法  

An improved adaptive bit allocation algorithm for OFDM system

作　　者：魏巍[1] 安文东[2] 

机构地区：[1]西安邮电大学物联网与两化融合研究院,陕西西安710061 [2]西安邮电大学通信与信息工程学院,陕西西安710121

出　　处：《西安邮电大学学报》2014年第4期49-52,共4页Journal of Xi’an University of Posts and Telecommunications

基　　金：陕西省教育厅科学研究基金资助项目(12JK0541)

摘　　要：针对贪婪算法迭代次数多的不足，提出一种基于 Hughes-Hartogs 算法的自适应比特分配算法。在误比特率和传输比特总数限定下，先使用Chow算法对每个子载波进行比特初始分配，然后再把余下的比特通过贪婪算法分配到各个子载波上，使总功率达到最小。仿真结果表明，在传输比特数一定的情况下，改进贪婪算法的迭代次数仅是贪婪算法的7．4％～34％，并且在性能上十分逼近贪婪算法。An adaptive bit allocation algorithm based on Hughes-Hartogs algorithm is proposed in this paper to improve the shortage of greedy algorithm which requires a large number of itera-tions.Under the constraint of bit error rata and the total number of transmission bit,the im-proved algorithm firstly uses the Chow algorithm to allocate some of the bits,and then uses the greedy algorithm to allocate the remaining bits to each subcarrier.When minimizing the total power by this algorithm,iterations of this algorithm are significantly less than that by the greedy algorithm.Computer simulation results show that,with fixed transmission rate,the iterations number of this improved algorithm is 7 .4%~34% of that of the greedy algorithm,and the per-formance of this algorithm is very close to that of the greedy algorithm.

关 键 词：正交频分复用 贪婪算法 自适应 比特分配 

分 类 号：TN914.3[电子电信—通信与信息系统]