基于裕量最大的多载波快速最优比特分配算法  

An Optimal Bit Loading Algorithm for Max Margin Problem in Multi-Carrier Modulation

作　　者：盖颖坤[1] 张海滨[1] 宋文涛[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《上海交通大学学报》2006年第1期32-35,共4页Journal of Shanghai Jiaotong University

基　　金：国家高技术发展计划(863)资助项目(2003AA123310)

摘　　要：提出了一种基于裕量最大的多载波最优比特分配算法.算法根据多径信道选择性衰落的特性,结合查表法和拉格朗日乘子的混合迭代搜索法,最优地分配各个子载波的传输比特数.仿真表明,与已有最优算法相比,本算法具有快速收敛的特性,收敛速度加快了30%;与非最优算法相比,该算法在算法复杂度相当的条件下,可以获得更好的性能.An optimal multi-carrier bit loading algorithm was proposed based on the margin-maximum criterion. Based on the characteristic of multi-path frequency selective channel, the algorithm combines rapid table lookup and Lagrange-multiplier method to iteratively search the optimal bit allocation scheme. The simulation results show that a better convergence with more than 30% improvement is obtained compared to existing methods. With regards to non-optimum approachs, it obtains better performance on the same complexity.

关 键 词：正交频分复用 拉格朗日乘子法 比特加载 最大裕量问题 

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