The proportionate recursive least squares(PRLS)algorithm has shown faster convergence and better performance than both proportionate updating(PU)mechanism based least mean squares(LMS)algorithms and RLS algorithms wit...The proportionate recursive least squares(PRLS)algorithm has shown faster convergence and better performance than both proportionate updating(PU)mechanism based least mean squares(LMS)algorithms and RLS algorithms with a sparse regularization term.In this paper,we propose a variable forgetting factor(VFF)PRLS algorithm with a sparse penalty,e.g.,l_(1)-norm,for sparse identification.To reduce the computation complexity of the proposed algorithm,a fast implementation method based on dichotomous coordinate descent(DCD)algorithm is also derived.Simulation results indicate superior performance of the proposed algorithm.展开更多
Two novel Cd(Ⅱ) coordination polymers, [Cd 2(C 10H 2O 8)\5(H 2O) 6] n (1) and [Cd 4(C 6H 4O 2N) 8(H 2O) 4] n (2) (C 10H 2O 8=1,2,4,5-benzenetetracarboxyl and C 6H 4O 2N=nicotinato), were hydrothermally synthesized an...Two novel Cd(Ⅱ) coordination polymers, [Cd 2(C 10H 2O 8)\5(H 2O) 6] n (1) and [Cd 4(C 6H 4O 2N) 8(H 2O) 4] n (2) (C 10H 2O 8=1,2,4,5-benzenetetracarboxyl and C 6H 4O 2N=nicotinato), were hydrothermally synthesized and characterized by X-ray diffraction of the single-crystal and fluorescence spectra. Complex 1 crystallizes in triclinic system, space group P1 with a=0.559 62(7) nm, b=0.777 58(6) nm, c=0.969 75(10) nm, α=111.981(5)°, β=101.649(6)°, γ=98.240(5)°, and Z=1. Final R=0.024 8(wR=0.078 5). Complex 2 belongs to orthorhombic system, space group Pbca with unit cell dimensions a=1.144 94(19) nm, b=1.209 69(6) nm, c=1.740 73(8) nm and Z=8. Final R=0.018 5(wR=0.034 8). Both the two complexes are coordination polymers with a two-dimensional infinite structure, the repeat unit is [Cd 2(C 10H 2O 8)(H 2O) 6] (1) and [Cd 4(C 6H 4O 2N) 8(H 2O) 4] (2) which are bridged by the ligands of 1,2,4,5-benzenetetracarboxyl(C 10H 2O 8) and nicotinato(NA), respectively. The two polymers show strong fluorescence with λ em=433 nm(λ ex=333 nm, 1) and λ em=423 nm(λ ex=330 nm, 2) in the solid state at room temperature. The emissions observed in the polymers are tentatively assigned to the ligands fluorescence(LLCT).展开更多
水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)...水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)及递归最小二乘(Recursive Least Squares,RLS)算法在估计稀疏信道时不仅复杂度较高,而且在求解线性回归模型时,因忽略自变量的多重共线性而使稀疏信道估计精度降低。针对上述问题,首先,在经典RLS算法的代价函数中加入信道系数的范数对其进行约束,从而提高了稀疏信道估计的精度,然后,采用滑动窗的方式对其代价函数进行处理以减少算法的计算量。在此基础上又引入二分坐标下降(Dichotomous Coordinate Descent,DCD)算法搜索单次迭代中使代价函数最小的解,进一步降低了算法的复杂度。仿真结果表明,文中所提的算法相较于经典算法在估计精度和复杂度方面具有一定的优越性。展开更多
The massive connectivity and limited energy pose significant challenges to deploy the enormous devices in energy-efficient and environmentally friendly in the Internet of Things(IoT).Motivated by these challenges,this...The massive connectivity and limited energy pose significant challenges to deploy the enormous devices in energy-efficient and environmentally friendly in the Internet of Things(IoT).Motivated by these challenges,this paper investigates the energy efficiency(EE)maximization problem for downlink cooperative non-orthogonal multiple access(C-NOMA)systems with hardware impairments(HIs).The base station(BS)communicates with several users via a half-duplex(HD)amplified-and-forward(AF)relay.First,we formulate the EE maximization problem of the system under HIs by jointly optimizing transmit power and power allocated coefficient(PAC)at BS,and transmit power at the relay.The original EE maximization problem is a non-convex problem,which is challenging to give the optimal solution directly.First,we use fractional programming to convert the EE maximization problem as a series of subtraction form subproblems.Then,variable substitution and block coordinate descent(BCD)method are used to handle the sub-problems.Next,a resource allocation algorithm is proposed to maximize the EE of the systems.Finally,simulation results show that the proposed algorithm outperforms the downlink cooperative orthogonal multiple access(C-OMA)scheme.展开更多
To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAV...To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.展开更多
文摘针对超密集网络(ultra dense network,UDN)中基站密集部署导致的严重层间干扰问题,构建了考虑频谱复用和共信道干扰条件下最大化系统总吞吐量问题模型,提出了一种基于块坐标下降(block coordinate descent,BCD)法的联合频谱资源优化(joint resource optimization based on BCD,JROBB)方法。该方法将原问题分解为分簇、子信道分配和功率分配三个子问题,通过BCD法迭代优化子信道分配和功率分配,逼近原问题的最优解。仿真分析表明,在复杂度提升有限的情况下,系统总吞吐量比现有典型算法平均至少提升22%,可以有效提升频谱利用率。
基金supported by National Key Research and Development Program of China(2020YFB0505803)National Key Research and Development Program of China(2016YFB0501700)。
文摘The proportionate recursive least squares(PRLS)algorithm has shown faster convergence and better performance than both proportionate updating(PU)mechanism based least mean squares(LMS)algorithms and RLS algorithms with a sparse regularization term.In this paper,we propose a variable forgetting factor(VFF)PRLS algorithm with a sparse penalty,e.g.,l_(1)-norm,for sparse identification.To reduce the computation complexity of the proposed algorithm,a fast implementation method based on dichotomous coordinate descent(DCD)algorithm is also derived.Simulation results indicate superior performance of the proposed algorithm.
文摘Two novel Cd(Ⅱ) coordination polymers, [Cd 2(C 10H 2O 8)\5(H 2O) 6] n (1) and [Cd 4(C 6H 4O 2N) 8(H 2O) 4] n (2) (C 10H 2O 8=1,2,4,5-benzenetetracarboxyl and C 6H 4O 2N=nicotinato), were hydrothermally synthesized and characterized by X-ray diffraction of the single-crystal and fluorescence spectra. Complex 1 crystallizes in triclinic system, space group P1 with a=0.559 62(7) nm, b=0.777 58(6) nm, c=0.969 75(10) nm, α=111.981(5)°, β=101.649(6)°, γ=98.240(5)°, and Z=1. Final R=0.024 8(wR=0.078 5). Complex 2 belongs to orthorhombic system, space group Pbca with unit cell dimensions a=1.144 94(19) nm, b=1.209 69(6) nm, c=1.740 73(8) nm and Z=8. Final R=0.018 5(wR=0.034 8). Both the two complexes are coordination polymers with a two-dimensional infinite structure, the repeat unit is [Cd 2(C 10H 2O 8)(H 2O) 6] (1) and [Cd 4(C 6H 4O 2N) 8(H 2O) 4] (2) which are bridged by the ligands of 1,2,4,5-benzenetetracarboxyl(C 10H 2O 8) and nicotinato(NA), respectively. The two polymers show strong fluorescence with λ em=433 nm(λ ex=333 nm, 1) and λ em=423 nm(λ ex=330 nm, 2) in the solid state at room temperature. The emissions observed in the polymers are tentatively assigned to the ligands fluorescence(LLCT).
文摘水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)及递归最小二乘(Recursive Least Squares,RLS)算法在估计稀疏信道时不仅复杂度较高,而且在求解线性回归模型时,因忽略自变量的多重共线性而使稀疏信道估计精度降低。针对上述问题,首先,在经典RLS算法的代价函数中加入信道系数的范数对其进行约束,从而提高了稀疏信道估计的精度,然后,采用滑动窗的方式对其代价函数进行处理以减少算法的计算量。在此基础上又引入二分坐标下降(Dichotomous Coordinate Descent,DCD)算法搜索单次迭代中使代价函数最小的解,进一步降低了算法的复杂度。仿真结果表明,文中所提的算法相较于经典算法在估计精度和复杂度方面具有一定的优越性。
基金partially supported by the National Natural Science Foundation of China under Grant 61701064Chongqing Natural Science Foundation under Grant cstc2019jcyj-msxmX0264Sichuan Science and Technology Program under Grant 2022YFQ0017。
文摘The massive connectivity and limited energy pose significant challenges to deploy the enormous devices in energy-efficient and environmentally friendly in the Internet of Things(IoT).Motivated by these challenges,this paper investigates the energy efficiency(EE)maximization problem for downlink cooperative non-orthogonal multiple access(C-NOMA)systems with hardware impairments(HIs).The base station(BS)communicates with several users via a half-duplex(HD)amplified-and-forward(AF)relay.First,we formulate the EE maximization problem of the system under HIs by jointly optimizing transmit power and power allocated coefficient(PAC)at BS,and transmit power at the relay.The original EE maximization problem is a non-convex problem,which is challenging to give the optimal solution directly.First,we use fractional programming to convert the EE maximization problem as a series of subtraction form subproblems.Then,variable substitution and block coordinate descent(BCD)method are used to handle the sub-problems.Next,a resource allocation algorithm is proposed to maximize the EE of the systems.Finally,simulation results show that the proposed algorithm outperforms the downlink cooperative orthogonal multiple access(C-OMA)scheme.
基金supported by Project funded by China Postdoctoral Science Foundation(No.2021MD703980)。
文摘To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.
