scholarly journals Block sparse memory improved proportionate affine projection sign algorithm

2015 ◽  
Vol 51 (24) ◽  
pp. 2001-2003 ◽  
Author(s):  
J. Liu ◽  
S.L. Grant
Keyword(s):  
Affine Projection ◽  
Sign Algorithm

scholarly journals Modified Combined-Step-Size Affine Projection Sign Algorithms for Robust Adaptive Filtering in Impulsive Interference Environments

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 385
Author(s):  
Guoliang Li ◽  
Hongbin Zhang ◽  
Ji Zhao
Keyword(s):  
Computational Complexity ◽  
System Identification ◽  
Taylor Series Expansion ◽  
Step Size ◽  
Affine Projection ◽  
Active Function ◽  
Independent Variable ◽  
Robust Adaptive ◽  
Sign Algorithm ◽  
Extra Parameter

In this paper, to further improve the filtering performance and enhance the poor tracking capability of the conventional combined step-size affine projection sign algorithm (CSS-APSA) in system identification, we propose a simplified CSS-APSA (SCSS-APSA) by applying the first-order Taylor series expansion to the sigmoidal active function (of which the independent variable is symmetric) of CSS-APSA. SCSS-APSA has lower computational complexity, and can achieve comparable, or even better filtering performance than that of CSS-APSA. In addition, we propose a modification of the sigmoidal active function. The modified sigmoidal active function is a form of scaling transformation based on the conventional one. Applying the modified function to the CSS-APSA, we can obtain the modified CSS-APSA (MCSS-APSA). Moreover, the extra parameter of MCSS-APSA provides the power to accelerate the convergence rate of CSS-APSA. Following the simplification operations of SCSS-APSA, the computational complexity of MCSS-APSA can also be reduced. Therefore, we get the simplified MCSS-APSA (SMCSS-APSA). Simulation results demonstrate that our proposed algorithms are able to achieve a faster convergence speed in system identification.

Sign in / Sign up

Export Citation Format

Share Document