一种快速的分组并行比特分配算法  

A fast parallel bit-loading algorithm using sub-channel grouping

作　　者：王思雅[1] 张文军[1] 贺翔[1] 甘小莺[1] 

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

出　　处：《无线电通信技术》2006年第1期14-16,共3页Radio Communications Technology

基　　金：国家高技术研究发展计划(863)项目(2003AA 123310);国家自然科学基金重点项目(60332030)

摘　　要：OFDM 系统的比特加载问题,本身蕴涵着高度的可并行性。这种并行性表现在通过时子信道进行分组,然后在各组内独立进行局部比特分配,可以得到接近最优解的性能。实验表明,该性质通常可使比特分配的速度提高32～64倍,引入的性能损失不超过0．1dB,并且不受天线数多少的限制。利用该性质,根据实际需要,可以方便地设计出并行度不同的比特加载算法。High degree of achievable parallelism is shown to exist in bit allocation for OFDM system, which can be exploited by grouping sub-channels and do local rate allocation independently within each group. Simulation results shows, usually 32- 64 times of increase in speed can be achieved by exploiting this property, and loss in performance is strictly limited to less than 0.1 dB. Furthermore, application of this property is not restricted by antenna numbers. Algorithm with different degree of parallelism can be easily designed to meet different requirements of complexity and latency.

关 键 词：正交频分复用 多天线输入输出 自适应比特加栽 裕量最大化问题 

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