Block Sparse Memory Improved Proportionate Affine Projection Sign Algorithm

TL;DR

This paper introduces BS-MIP-APSA, a novel algorithm for block sparse system identification that enhances convergence speed, robustness to impulsive noise, and tracking ability, outperforming existing methods.

Contribution

The paper proposes BS-MIP-APSA, combining memory improvements with block sparsity and impulsive noise robustness, advancing the state-of-the-art in adaptive system identification.

Findings

Faster convergence rate compared to APSA and MIP-APSA

Enhanced robustness to impulsive noise

Improved tracking ability in block sparse systems

Abstract

A block sparse memory improved proportionate affine projection sign algorithm (BS-MIP-APSA) is proposed for block sparse system identification under impulsive noise. The new BS-MIP-APSA not only inherits the performance improvement for block-sparse system identification, but also achieves robustness to impulsive noise and the efficiency of the memory improved proportionate affine projection sign algorithm (MIP-APSA). Simulations indicate that it can provide both faster convergence rate and better tracking ability under impulsive interference for block sparse system identification as compared to APSA and MIP-APSA.