检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈斌[1] 李有明[1] 郭涛[1] 雷鹏[1] 刘小青[1]
出 处:《电信科学》2014年第6期73-78,共6页Telecommunications Science
基 金:国家自然科学基金资助项目(No.61071119);宁波市自然科学基金资助项目(No.2012A610017);宁波市科技创新团队项目(No.2011B81002);宁波大学校级研究生科研创新基金资助项目(No.010-D00615138000)
摘 要:针对多用户协作中继系统中的功率最小化问题,提出了一种基于联合子载波配对及分配的资源分配算法。首先根据不同用户的目标速率要求及平均信道增益进行子载波数目的分配;然后以信道条件最佳为准则,提出了一种联合子载波配对及分配的多用户迭代算法,以实现对每个用户的中继链路和直传链路分别进行子载波配对及虚拟配对;最后利用注水算法对子载波进行功率分配,从而保证各用户以最小功率进行传输。仿真结果表明,该算法在满足用户目标速率的情况下,能够进行有效的子载波配对及分配,从而最小化系统的发射功率。For the power minimization problem in multi-user cooperative relay communications,a resource allocation algorithm based on joint subcarrier pairing and assignment was proposed.Firstly,according to the average channel gain and the target rates of user,the assignment of subcarrier numbers was addressed.Then,in order to choose the subcarrier with best channel condition,a multi-user iterative algorithm for joint subcarrier pairing and assignment was proposed,which could achieve the subcarrier pairing in the cooperative transmissions and virtual pairing in the direct transmission,respectively.Finally,the power allocation was conducted by the water-filling algorithm,so that each user could use the minimum power for transmission.The simulation results indicate that the proposed algorithm can conduct subcarrier pairing and assignment effectively to minimize the total transmission power while meeting the users' target rate requirement.
关 键 词:多用户协作中继 功率最小化 联合子载波配对及分配 资源分配
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63