.png){kind=icon}
.png){kind=icon}
Return
Evolving Order Based Affine Projection Sign Algorithm For Enhanced Adaptive Filtering
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2024.3402343.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The affine projection sign algorithm (APSA) has garnered significant attention in adaptive filtering due to its exceptional robustness and reduced computational demands. Nevertheless, the inherent use of a fixed projection order in APSA can compromise filtering accuracy and convergence speed. To address this issue, we introduce an innovative strategy for dynamically updating the projection order, resulting in an enhanced version of APSA called the evolving order based APSA (E-APSA). This evolving strategy compares the instantaneous power of output error to a threshold determined by the steady-state mean-square error of APSA, thereby enabling variable projection orders. Furthermore, we provide computational complexity and convergence analyses for E-APSA. Simulation results demonstrate that, compared to other related algorithms, E-APSA offers a significantly faster convergence rate while maintaining competitive steady-state misalignment.
Keywords:
Convergence
Vectors
Steady-state
Signal processing algorithms
Heuristic algorithms
Prediction algorithms
Computational complexity
Adaptive filering
variable projection order
non-Gaussian noise
affine projection sign algorithm
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W