Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
| Paper: | DISPS-P2.4 |
| Session: | Fast Algorithms |
| Time: | Friday, May 21, 09:30 - 11:30 |
| Presentation: |
Poster |
| Topic: |
Design and Implementation of Signal Processing Systems: Fast Algorithms |
| Title: |
COMPLEXITY REDUCTION AND REGULARIZATION OF A FAST AFFINE PROJECTION ALGORITHM FOR OVERSAMPLED SUBBAND ADAPTIVE FILTERS |
| Authors: |
Edward Chau; Dspfactory Ltd. | | |
| | Hamid Sheikhzadeh; Dspfactory Ltd. | | |
| | Robert Brennan; Dspfactory Ltd. | | |
| Abstract: |
The Affine Projection Algorithm (APA) has been shown to improve the performance of Over-Sampled Subband Adaptive Filters (OS-SAFs) compared to classical Normalized Least Mean Square (NLMS) algorithms. Because of the complexity of APA, however, only low-order APAs are practical for real-time implementation. Thus, in this paper, we propose a reduced-complexity version of the Gauss-Seidel Fast APA (GSFAPA) for adapting the subband filters in OS-SAF systems. We propose modifying the GSFAPA with a complexity reduction method based on partial filter update, and also with a low-cost method for combined regularization and step size control. We show the advantage of the new algorithm -- termed Low-Cost Gauss-Seidel Fast Affine Projection -- compared to the APA in a subband echo canceller application. |
| |
| Back | |