| 一种快速的分组并行比特分配算法 |
| |
| 引用本文： | 王思雅,张文军,贺翔,甘小莺.一种快速的分组并行比特分配算法[J].无线电通信技术,2006,32(1):14-16. |
| |
| 作者姓名： | 王思雅 张文军 贺翔 甘小莺 |
| |
| 作者单位： | 上海交通大学电子工程系,上海,200030 |
| |
| 基金项目： | 国家科技攻关项目;国家高技术研究发展计划(863计划) |
| |
| 摘 要： | OFDM 系统的比特加载问题,本身蕴涵着高度的可并行性。这种并行性表现在通过时子信道进行分组,然后在各组内独立进行局部比特分配,可以得到接近最优解的性能。实验表明,该性质通常可使比特分配的速度提高32～64倍,引入的性能损失不超过0．1dB,并且不受天线数多少的限制。利用该性质,根据实际需要,可以方便地设计出并行度不同的比特加载算法。
|
| 关 键 词： | 正交频分复用 多天线输入输出 自适应比特加载 裕量最大化问题 |
| 文章编号： | 1003-3114（2006）01-14-3 |
| 收稿时间： | 2005-07-10 |
| 修稿时间： | 2005-07-10 |
A fast parallel bit-loading algorithm using sub-channel grouping |
| |
| WANG Si-ya,ZHANG Wen-jun,HE Xiang,GAN Xiao-ying.A fast parallel bit-loading algorithm using sub-channel grouping[J].Radio Communications Technology,2006,32(1):14-16. |
| |
| Authors: | WANG Si-ya ZHANG Wen-jun HE Xiang GAN Xiao-ying |
| |
| Affiliation: | Dept. of Electronic Eng., Shanghai Jiaotong Univ., Shanghai 200030, China |
| |
| Abstract: | 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. |
| |
| Keywords: | OFDM MIMO adaptive bit loading max margin problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
