水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)...水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)及递归最小二乘(Recursive Least Squares,RLS)算法在估计稀疏信道时不仅复杂度较高,而且在求解线性回归模型时,因忽略自变量的多重共线性而使稀疏信道估计精度降低。针对上述问题,首先,在经典RLS算法的代价函数中加入信道系数的范数对其进行约束,从而提高了稀疏信道估计的精度,然后,采用滑动窗的方式对其代价函数进行处理以减少算法的计算量。在此基础上又引入二分坐标下降(Dichotomous Coordinate Descent,DCD)算法搜索单次迭代中使代价函数最小的解,进一步降低了算法的复杂度。仿真结果表明,文中所提的算法相较于经典算法在估计精度和复杂度方面具有一定的优越性。展开更多
Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while...Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.展开更多
This paper presents a hardware architecture using mixed pipeline and parallel processing for complex division based on dichotomous coordinate descent(DCD) iterations. The objective of the proposed work is to achieve l...This paper presents a hardware architecture using mixed pipeline and parallel processing for complex division based on dichotomous coordinate descent(DCD) iterations. The objective of the proposed work is to achieve low-latency and resource optimized complex divider architecture in adaptive weight computation stage of minimum variance distortionless response(MVDR)algorithm. In this work, computation of complex division is modeled as a 2×2 linear equation solution problem and the DCD algorithm allows linear systems of equations to be solved with high degree of computational efficiency. The operations in the existing DCD algorithm are suitably parallel pipelined and the performance is optimized to 2 clock cycles per iteration. To improve the degree of parallelism, a parallel column vector read architecture is devised.The proposed work is implemented on the field programmable gate array(FPGA) platform and the results are compared with state-of-art literature. It concludes that the proposed architecture is suitable for complex division in adaptive weight computation stage of MVDR beamformer. We demonstrate the performance of the proposed architecture for MVDR beamformer employed in medical ultrasound imaging applications.展开更多
针对现有的波达方向(direction of arrival,DOA)估计方法在低信噪比、小快拍、多信源条件下估计精度较低的问题,提出一种基于并行坐标下降算法的DOA估计方法.首先,对空域等角度均匀划分,构造超完备冗余字典;其次,采用并行坐标下降算法...针对现有的波达方向(direction of arrival,DOA)估计方法在低信噪比、小快拍、多信源条件下估计精度较低的问题,提出一种基于并行坐标下降算法的DOA估计方法.首先,对空域等角度均匀划分,构造超完备冗余字典;其次,采用并行坐标下降算法的思想对稀疏信号进行重构,得到信号在空域的稀疏系数矩阵;最后,将稀疏矩阵行向量的l2-范数映射到空域网格上,得到准确的DOA估计值.仿真实验结果表明:在低信噪比、小快拍、多信源条件下,该方法优于子空间类算法、贪婪类算法以及凸优化类算法,具有更低的均方根误差(RMSE)、更高的DOA估计精度和运行效率.展开更多
For solving large inconsistent linear systems,we research a novel format to enhance the numerical stability and control the complexity of the model.Based on the idea of two subspace iterations,we propose the max-resid...For solving large inconsistent linear systems,we research a novel format to enhance the numerical stability and control the complexity of the model.Based on the idea of two subspace iterations,we propose the max-residual two subspace coordinate descent(M2CD)method.To accelerate the convergence rate,we further present the cyclic block coordinate descent(CBCD)method.The convergence properties of these methods are analyzed,and their effectiveness is illustrated by numerical examples.展开更多
为验证收发器硬件损耗对通信系统性能的影响,在考虑收发器硬件损耗的情况下,对智能反射面(intelligent reflecting surface,IRS)辅助的携能通信(simultaneous wireless information and power transfer,SWIPT)系统的鲁棒性传输设计进行...为验证收发器硬件损耗对通信系统性能的影响,在考虑收发器硬件损耗的情况下,对智能反射面(intelligent reflecting surface,IRS)辅助的携能通信(simultaneous wireless information and power transfer,SWIPT)系统的鲁棒性传输设计进行研究.在考虑基站的最大发射功率、能量收集器的最小接收能量和IRS无源波束成形的约束下,将优化目标设为最大化所有信息接收者的加权和速率,并使用块坐标下降(block coordinate descent,BCD)算法将优化问题分解成多个优化子问题,交替优化.对于基站有源波束成形和IRS无源波束成形的优化问题,分别采用拉格朗日对偶方法和最优化最大化(majorization minimization,MM)算法来解决.仿真结果验证了收发器硬件损耗对系统性能的影响,也证实了信息接收端的硬件损耗要比基站发射端的硬件损耗对系统造成的性能下降更明显.展开更多
文摘水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)及递归最小二乘(Recursive Least Squares,RLS)算法在估计稀疏信道时不仅复杂度较高,而且在求解线性回归模型时,因忽略自变量的多重共线性而使稀疏信道估计精度降低。针对上述问题,首先,在经典RLS算法的代价函数中加入信道系数的范数对其进行约束,从而提高了稀疏信道估计的精度,然后,采用滑动窗的方式对其代价函数进行处理以减少算法的计算量。在此基础上又引入二分坐标下降(Dichotomous Coordinate Descent,DCD)算法搜索单次迭代中使代价函数最小的解,进一步降低了算法的复杂度。仿真结果表明,文中所提的算法相较于经典算法在估计精度和复杂度方面具有一定的优越性。
基金supported by the National Natural Science Foundation of China (6057407560705004)
文摘Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.
基金supported by Microelectronics Division of the Ministry of Electronics and Information Technology,Government of India,under SMDP-C2SD Project(9(1)/2014–MDD)
文摘This paper presents a hardware architecture using mixed pipeline and parallel processing for complex division based on dichotomous coordinate descent(DCD) iterations. The objective of the proposed work is to achieve low-latency and resource optimized complex divider architecture in adaptive weight computation stage of minimum variance distortionless response(MVDR)algorithm. In this work, computation of complex division is modeled as a 2×2 linear equation solution problem and the DCD algorithm allows linear systems of equations to be solved with high degree of computational efficiency. The operations in the existing DCD algorithm are suitably parallel pipelined and the performance is optimized to 2 clock cycles per iteration. To improve the degree of parallelism, a parallel column vector read architecture is devised.The proposed work is implemented on the field programmable gate array(FPGA) platform and the results are compared with state-of-art literature. It concludes that the proposed architecture is suitable for complex division in adaptive weight computation stage of MVDR beamformer. We demonstrate the performance of the proposed architecture for MVDR beamformer employed in medical ultrasound imaging applications.
文摘针对现有的波达方向(direction of arrival,DOA)估计方法在低信噪比、小快拍、多信源条件下估计精度较低的问题,提出一种基于并行坐标下降算法的DOA估计方法.首先,对空域等角度均匀划分,构造超完备冗余字典;其次,采用并行坐标下降算法的思想对稀疏信号进行重构,得到信号在空域的稀疏系数矩阵;最后,将稀疏矩阵行向量的l2-范数映射到空域网格上,得到准确的DOA估计值.仿真实验结果表明:在低信噪比、小快拍、多信源条件下,该方法优于子空间类算法、贪婪类算法以及凸优化类算法,具有更低的均方根误差(RMSE)、更高的DOA估计精度和运行效率.
基金National Natural Science Foundation of China(No.11401305,No.11571171)Shenzhen Science and Technology Program,China(No.JCYJ2023080714-2002006).
文摘For solving large inconsistent linear systems,we research a novel format to enhance the numerical stability and control the complexity of the model.Based on the idea of two subspace iterations,we propose the max-residual two subspace coordinate descent(M2CD)method.To accelerate the convergence rate,we further present the cyclic block coordinate descent(CBCD)method.The convergence properties of these methods are analyzed,and their effectiveness is illustrated by numerical examples.
文摘为验证收发器硬件损耗对通信系统性能的影响,在考虑收发器硬件损耗的情况下,对智能反射面(intelligent reflecting surface,IRS)辅助的携能通信(simultaneous wireless information and power transfer,SWIPT)系统的鲁棒性传输设计进行研究.在考虑基站的最大发射功率、能量收集器的最小接收能量和IRS无源波束成形的约束下,将优化目标设为最大化所有信息接收者的加权和速率,并使用块坐标下降(block coordinate descent,BCD)算法将优化问题分解成多个优化子问题,交替优化.对于基站有源波束成形和IRS无源波束成形的优化问题,分别采用拉格朗日对偶方法和最优化最大化(majorization minimization,MM)算法来解决.仿真结果验证了收发器硬件损耗对系统性能的影响,也证实了信息接收端的硬件损耗要比基站发射端的硬件损耗对系统造成的性能下降更明显.
