%0 Journal Article
%A LIAN Peijun
%A QI Yongfeng
%A WANG Danfeng
%A HUO Yuanlian
%T A New Fast Convex Combination Affine Projection Sign Algorithm for S-type Functions
%D 2022
%R 10.13190/j.jbupt.2021-118
%J Journal of Beijing University of Posts and Telecommunications
%P 102-107
%V 45
%N 1
%X 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.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2021-118