检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何云[1,2] 申敏[1,2] 张梦 HE Yun;SHEN Min;ZHANG Meng(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;Innovation Team of Communication Core Chip,Protocols and System Application,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学通信核心芯片、协议及系统应用团队,重庆400065
出 处:《电子与信息学报》2021年第7期1886-1892,共7页Journal of Electronics & Information Technology
基 金:重庆市教育委员会科学技术研究项目(KJQN201800618)。
摘 要:该文研究多载波超密集网络(UDN)上行链路能效最优功率分配方案,基于非合作博弈论提出一种抗干扰分布式功率分配方案,使每个小区独立优化能效的同时抑制邻小区干扰。由于最大传输功率和QoS约束下的能效函数具有不易解决的非凸特性,且小小区间存在严重干扰。针对以上挑战,该文在最佳响应过程中设计了一种高精度低复杂度的阶梯注水算法,基于该算法利用干扰信道增益提出了一种多用户抗干扰功率分配算法。仿真结果和数值分析表明该算法运算复杂度低,且能在保证系统频谱效率的同时大幅度提升系统能效。The energy-efficient power allocation is studied in the uplink of the multi-carrier Ultra-Dense Networks(UDN).Based on the non-cooperative game theory,a distributed anti-interference power allocation scheme is proposed so that each cell can independently optimize energy efficiency while suppressing the intercell interference.Due to the fact that the energy efficiency problem under the constrains of the Quality of Service(QoS)and the maximum transmitter power is a challenging nonconvex problem and small cells suffer from the severe inter-cell interference,an accurate and low-complexity stair water-filling algorithm is proposed to solve the nonconvex problem in the best response process.Based on this algorithm,a multi-user antiinterference power allocation algorithm is proposed using interference channel gains.Simulation results and numerical analysis show that this algorithm can improve the system energy efficiency with no reduction in spectrum efficiency performance.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.17