摘要
针对传统的凸组合仿射投影符号算法收敛速度慢和计算量大的问题,提出了一种基于S型函数的快速凸组合仿射投影符号算法。该算法用新的S型函数代替传统算法中的sigmoid函数,改进了联合参数的迭代公式,避免了复杂的指数运算,减少了计算量。同时,采用瞬时转移方案,使凸组合算法在初始自适应过程或在突然发生变化之后能加快小步长慢速算法的自适应过程,进而提升凸组合算法的收敛速度。在系统辨识和声学回声消除环境下的仿真实验表明,该算法具有良好的均方性能和跟踪性能,与传统的凸组合仿射投影算法相比具有更快的收敛速度和更低的计算复杂度。
Aiming at the problems of slow convergence speed and heavy computation of traditional convex combinatorial affine projection sign algorithm, a fast convex combinatorial affine projection sign algorithm based on S-type function is proposed. The algorithm uses a new S-type function to replace the sigmoidfunction in the traditional algorithm. It also, improves the iterative formula of joint parameters, avoids complex exponential operation and reduces the amount of calculation. Meanwhile, the instantaneous transfer scheme is adopted to make the convex combination algorithm accelerate the adaptation process of the small-step slow algorithm after the initial adaptation process or a sudden change, so as to improve the speed of the convex combination algorithm. Simulation results in the system identification and acoustic echo cancellation environment show that the algorithm has good mean square performance and tracking performance, and has faster convergence speed and lower computational complexity compared with the traditional convex combination affine projection sign algorithm.
作者
火元莲
连培君
齐永锋
王丹凤
HUO Yuanlian;LIAN Peijun;QI Yongfeng;WANG Danfeng(School of Physics and Electronic Engineering,Northwest Normal University,Lanzhou 730070,China;School of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2022年第1期102-107,共6页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(61561044)
西北师范大学研究生培养与课程改革项目(2019KGLX01018)。
关键词
自适应滤波
仿射投影符号算法
凸组合
S型函数
adaptive filtering
affine projection sign algorithm
convex combination
S-type function
