| MIMO无线通信系统中调度算法分析 |
| |
| 引用本文： | 秦玉娟,周彬.MIMO无线通信系统中调度算法分析[J].信息技术,2011(6):102-104. |
| |
| 作者姓名： | 秦玉娟 周彬 |
| |
| 作者单位： | 兰州工业高等专科学校电子信息工程系,兰州,730050 |
| |
| 摘 要： | 对轮询算法、最大载干比算法和比例公平算法三种经典的调度算法进行了深入的研究,并在MIMO系统环境中,对它们的性能进行了计算机仿真。从基本原理和仿真结果两个方面,对上述三种调度算法的公平性和系统吞吐量性能进行了对比分析,证明了轮询算法具有最好的公平性性能,最大载干比算法具有最好的吞吐量性能,比例公平算法则很好的在两者之间取得了一个平衡。
|
| 关 键 词： | MIMO RR MaxC/I PF |
Analysis of scheduling algorithms in MIMO wireless communication systems |
| |
| QIN Yu-juan,ZHOU Bin.Analysis of scheduling algorithms in MIMO wireless communication systems[J].Information Technology,2011(6):102-104. |
| |
| Authors: | QIN Yu-juan ZHOU Bin |
| |
| Affiliation: | (Electronic Information Engineering Department,Lanzhou Polytechnical College,Lanzhou 730050,China) |
| |
| Abstract: | This paper studies three classic scheduling algorithms,including Round Robin algorithm,MAX C/I algorithm and Proportional Fairness algorithm.Their performances are simulated on computer in MIMO condition,and analyzed through both the simulation results and foundational theories.It proved that Round Robin algorithm is a scheduling algorithm with best fairness,MAX C/I algorithm can provide utmost throughput,while Proportional Fairness algorithm makes a optimal trade-off between the fairness and throughput. |
| |
| Keywords: | MIMO RR Max C/I PF |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
