文章摘要
梁仕杰,王彪,张岑.基于稀疏约束的DCD滑动窗RLS水声信道估计算法研究[J].声学技术,2021,40(1):123~127
基于稀疏约束的DCD滑动窗RLS水声信道估计算法研究
Acoustic channel estimation algorithm based on DCD sliding window RLS with norm constraint
投稿时间:2019-09-03  修订日期:2019-10-13
DOI:10.16300/j.cnki.1000-3630.2021.01.019
中文关键词: 二分坐标下降算法  递归最小二乘算法  范数约束  滑动窗  信道估计
英文关键词: dichotomous coordinate descent (DCD) algorithm  recursive least square (RLS) algorithm  norm constraint  sliding window  channel estimation
基金项目:国家自然科学基金(11574120,61401180,U1636117);江苏省“六大人才高峰”计划江苏省研究生科研与实践创新计划项目(KYCX19_1691)
作者单位E-mail
梁仕杰 江苏科技大学电子信息学院, 江苏镇江 212003 1941407485@qq.com 
王彪 江苏科技大学电子信息学院, 江苏镇江 212003  
张岑 江苏科技大学电子信息学院, 江苏镇江 212003  
摘要点击次数: 44
全文下载次数: 61
中文摘要:
      水声信道具有稀疏性的特点,因此高精度低复杂度的稀疏信道估计算法对水声通信具有重要意义。基于自适应滤波算法的信道估计问题本质上是线性回归模型参数的求解问题,传统的最小二乘(Least Square,LS)、最小均方(Least Mean Square,LMS)及递归最小二乘(Recursive Least Squares,RLS)算法在估计稀疏信道时不仅复杂度较高,而且在求解线性回归模型时,因忽略自变量的多重共线性而使稀疏信道估计精度降低。针对上述问题,首先,在经典RLS算法的代价函数中加入信道系数的范数对其进行约束,从而提高了稀疏信道估计的精度,然后,采用滑动窗的方式对其代价函数进行处理以减少算法的计算量。在此基础上又引入二分坐标下降(Dichotomous Coordinate Descent,DCD)算法搜索单次迭代中使代价函数最小的解,进一步降低了算法的复杂度。仿真结果表明,文中所提的算法相较于经典算法在估计精度和复杂度方面具有一定的优越性。
英文摘要:
      The acoustic channel has the characteristics of sparsity, so the sparse channel estimation algorithm with high accuracy and low complexity is of great significance to the underwater acoustic communication. The problem of channel estimation based on adaptive filtering algorithm is essentially a problem of solving parameters of linear regression model. In allusion to the shortcomings of high complexity and low accuracy of traditional Least Square (LS), Least Mean Square (LMS) and Recursive Least Squares (RLS) algorithms in sparse channel estimation, which is due to neglecting multicollinearity of arguments in solving the problem of linear regression model with these algorithms, in this paper the norm of the channel tap coefficient is added to the cost function of the classical RLS algorithm to constrain itself so as to improve the accuracy of sparse channel estimation. Then, a slide window is used to process the cost function to reduce the computational burden of the algorithm. On this basis, the Dichotomous Coordinate Descent (DCD) algorithm is introduced to search for the solution that minimizes the cost function in a single iteration, the complexity of the algorithm can be further reduced. The simulation results show that the proposed algorithm is superior in the estimation accuracy and complexity compared with the classical algorithm.
查看全文   查看/发表评论  下载PDF阅读器
关闭