检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河海大学计算机及信息工程学院,江苏常州213022
出 处:《现代电子技术》2008年第21期13-15,18,共4页Modern Electronics Technique
摘 要:通过对迭代注水算法的分析,提出了一种功率分配的新算法,该算法不需要多次迭代,并且能在一定功率约束的条件下,有效地提高系统吞吐量。给出了具体的算法实现步骤和复杂度分析,表明该算法复杂度明显低于迭代注水算法。最后,对该算法进行了仿真分析,并以信噪比为8 dB时为例,分析了两算法的吞吐量性能。仿真结果表明,在低信噪比环境中该算法对系统容量的改善更为显著,且所提算法的吞吐量性能完全逼近迭代注水算法。In this paper,a novel scheme of power allocation is proposed through analyzing the iterated waterfilling power allocation. It maximizes the overall system rate under power constraint without time after time iterative calculation. The steps of algorithm accomplished and analysis of complexity are shown. It shows that the complexity of this algorithm is lower than iterated water - filling power allocation. The simulation analysis research for this algorithm is presented. Taking 8dB for example, the throughput of this algorithm is analysed. The simulation results show that this algorithm is more evident in low SNR and the throughput of linear water - filling power allocation approaches the algorithm of iterated water - filling power allocation completely.
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.52