Sparsity-Aware SSAF Algorithm with Individual Weighting Factors for Acoustic Echo Cancellation
arXiv:2009.08593
Abstract
In this paper, we propose and analyze the sparsity-aware sign subband adaptive filtering with individual weighting factors (S-IWF-SSAF) algorithm, and consider its application in acoustic echo cancellation (AEC). Furthermore, we design a joint optimization scheme of the step-size and the sparsity penalty parameter to enhance the S-IWF-SSAF performance in terms of convergence rate and steady-state error. A theoretical analysis shows that the S-IWF-SSAF algorithm outperforms the previous sign subband adaptive filtering with individual weighting factors (IWF-SSAF) algorithm in sparse scenarios. In particular, compared with the existing analysis on the IWF-SSAF algorithm, the proposed analysis does not require the assumptions of large number of subbands, long adaptive filter, and paraunitary analysis filter bank, and matches well the simulated results. Simulations in both system identification and AEC situations have demonstrated our theoretical analysis and the effectiveness of the proposed algorithms.
17 pages, 12 figures
References in corpus (11)
- Generalized Correntropy for Robust Adaptive Filtering
- Sparse Distributed Learning Based on Diffusion Adaptation
- Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering
- Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems
- Branch-and-Bound Precoding for Multiuser MIMO Systems with 1-Bit Quantization
- Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
- Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems
- Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
- Adaptive Reduced-Rank Minimum Symbol-Error-Rate Receive Processing for Large-Scale Multiple-Antenna Systems
- Direction Finding Algorithms with Joint Iterative Subspace Optimization
- Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation