期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Robust Digital Non-Linear Self-Interference Cancellation in Full Duplex Radios with Maximum Correntropy Criterion 被引量:3
1
作者 zhirong luan Hua Qu +1 位作者 Jihong Zhao Badong Chen 《China Communications》 SCIE CSCD 2016年第9期53-59,共7页
Full duplex radio increases the frequency efficiency but its performance is limited by the self-interference(SI).We first analyze the multiple noises in the full duplex radio system and model such noises as an distrib... Full duplex radio increases the frequency efficiency but its performance is limited by the self-interference(SI).We first analyze the multiple noises in the full duplex radio system and model such noises as an distribution.Then we formulate a novel non-Gaussian SI problem.Under the maximum correntropy criterion(MCC),a robust digital non-linear self-interference cancellation algorithm is proposed for the SI channel estimation.A gradient descent based algorithm is derived to search the optimal solution.Simulation results show that the proposed algorithm can achieve a smaller estimation error and a higher pseudo signal to interference plus noise ratio(PSINR) than the well-known least mean square(LMS) algorithm and least square(LS) algorithm. 展开更多
关键词 数字非线性 无线电频率 全双工 干扰消除 标准 鲁棒 信号干扰噪声比 消除算法
下载PDF
A Distributed User Association and Resource Allocation Method in Cache-Enabled Small Cell Networks 被引量:1
2
作者 Gongye Ren Hua Qu +2 位作者 Jihong Zhao Shuyuan Zhao zhirong luan 《China Communications》 SCIE CSCD 2017年第10期95-107,共13页
Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allo... Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied. 展开更多
关键词 网络分布式 资源分配机制 CACHE 关联 用户 配方法 非线性规划问题 小区
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部