Hughes-Hartogs算法运算量的分析仿真  

Analysis and Simulation of Computational Complexity of Hughes-Hartogs Algorithm

作　　者：叶庆丰[1] 连捷珍[1] 梁晓雯[1] 李玉虎[1] 

机构地区：[1]中国科学技术大学电子工程与信息科学系,安徽合肥230027

出　　处：《计算机仿真》2007年第4期289-292,296,共5页Computer Simulation

摘　　要：一些文献认为Hughes-Hartogs比特分配算法在向多个子载波分配比特时,运算复杂度太大、速度太慢,实时性差。鲜有文献对它的运算量进行具体的分析。文中对Hughes-Hartogs比特分配算法的运算量进行了理论分析,得出了衡量它的运算量的方法。并在有线信道双绞线模型下,通过Matlab仿真,从发送总比特数和运算量两个方面,比较了Hughes-Hartogs算法与最优化的贪心算法的性能,得出了可用发送功率和量化间隔对Hughes-Hartogs算法性能的影响,以及怎样选择合适的参数既使Hughes-Hartogs算法的运算复杂度尽量小又使发送总比特数尽量大。并提出算法的改进方案,可以看到改进后的算法能够满足实时应用的需求。Some literatures have a conclusion that the computational complexity of the Hughes - Hartogs bit - loading algorithm is too large to be practical ,when it assigns bits to muhicarriers. But few of literatures make a analysis of its computational complexity. In this paper, a method for evaluating the computational complexity is obtained from the theoretical analysis of computational complexity of Hughes - Hartogs algorithm. The comparison of performance between this algorithm and the optimized greedy approach by Matlab simulation indicates how the available transmit power and the step value of quantification affect the performance of this algorithm, and how to choose proper parameters to make the computational complexity smaller and the total transmit number of bits larger. Some approaches are proposed to improve the performance ,which can meet the practical demands.

关 键 词：比特分配算法 运算量 仿真 

分 类 号：TN919[电子电信—通信与信息系统]