A Fast Exact Filtering Approach to a Family of Affine Projection-type Algorithms Proposed to Achieve Complexity Reduction
Jul 28, 2014 Email"> PrintText Size
In adaptive filtering, the least-mean-square-type algorithms are widely used but suffer from slow convergence for colored signals. The affine projection (AP) algorithm was proposed to speed up the convergence, which produces a good tradeoff between the convergence speed and the complexity. Nevertheless, as the projection order increases, the convergence rate of the AP algorithm is improved at a relatively high complexity. Many efforts have been made to reduce the complexity.
However, most of the efficient versions of the AP-type algorithms are based on the fast approximate filtering (FAF) scheme originally proposed in the fast AP (FAP) algorithm. The approximation leads to degraded convergence performance. To overcome this limitation, a fast exact filtering (FEF) approach to the AP algorithm (FEAP) was presented by Y. Zakharov. Still, in the FEAP algorithm, calculation of the error vector requires the update of the weight vector explicitly that provides the largest contribution towards the algorithm complexity.
Lately, researchers from the Key Laboratory of Noise and Vibration Research, Institute of Acoustics (IOA), Chinese Academy of Sciences proposed an enhanced FEF approach to the AP (EFEAP) algorithm to further reduce the complexity of the FEAP algorithm, given that the calculation of the weight vector is not the primary objective for the application at hand.
The proposed FEF scheme is then extended to a family of AP-type algorithms such as the dichotomous coordinate descent (DCD)-AP, affine projection sign, and modified filtered-x affine projection algorithms. The complexity of AP-type algorithms based on the proposed FEF approach is comparable to that based on the FAF scheme. Moreover, computer simulations results show that the complexity reduction of the new algorithms is achieved without any performance degradation. A detailed comparison (memory size, computational complexity) of different implementation methods in hardware platforms such as FPGA and DSP is the future work.
Complexity comparison of several fast AP algorithms, L=1024 (Image by IOA)
References:
YANG Feiran, WU Ming, YANG Jun, KUANG Zheng. A Fast Exact Filtering Approach to a Family of Affine Projection-type Algorithms. Signal Processing (Vol.101, August 2014, Pages 1–10). DOI: 10.1016/j.sigpro.2014.01.030
CONTACT:
YANG Jun
Key Laboratory of Noise and Vibration Research, Institute of Acoustics, Chinese Academy of Sciences,
Beijing 100190, China
Email: jyang@mail.ioa.ac.cn
In adaptive filtering, the least-mean-square-type algorithms are widely used but suffer from slow convergence for colored signals. The affine projection (AP) algorithm was proposed to speed up the convergence, which produces a good tradeoff between the convergence speed and the complexity. Nevertheless, as the projection order increases, the convergence rate of the AP algorithm is improved at a relatively high complexity. Many efforts have been made to reduce the complexity.
However, most of the efficient versions of the AP-type algorithms are based on the fast approximate filtering (FAF) scheme originally proposed in the fast AP (FAP) algorithm. The approximation leads to degraded convergence performance. To overcome this limitation, a fast exact filtering (FEF) approach to the AP algorithm (FEAP) was presented by Y. Zakharov. Still, in the FEAP algorithm, calculation of the error vector requires the update of the weight vector explicitly that provides the largest contribution towards the algorithm complexity.
Lately, researchers from the Key Laboratory of Noise and Vibration Research, Institute of Acoustics (IOA), Chinese Academy of Sciences proposed an enhanced FEF approach to the AP (EFEAP) algorithm to further reduce the complexity of the FEAP algorithm, given that the calculation of the weight vector is not the primary objective for the application at hand.
The proposed FEF scheme is then extended to a family of AP-type algorithms such as the dichotomous coordinate descent (DCD)-AP, affine projection sign, and modified filtered-x affine projection algorithms. The complexity of AP-type algorithms based on the proposed FEF approach is comparable to that based on the FAF scheme. Moreover, computer simulations results show that the complexity reduction of the new algorithms is achieved without any performance degradation. A detailed comparison (memory size, computational complexity) of different implementation methods in hardware platforms such as FPGA and DSP is the future work.
Complexity comparison of several fast AP algorithms, L=1024 (Image by IOA)
References:
YANG Feiran, WU Ming, YANG Jun, KUANG Zheng. A Fast Exact Filtering Approach to a Family of Affine Projection-type Algorithms. Signal Processing (Vol.101, August 2014, Pages 1–10). DOI: 10.1016/j.sigpro.2014.01.030
CONTACT:
YANG Jun
Key Laboratory of Noise and Vibration Research, Institute of Acoustics, Chinese Academy of Sciences,
Beijing 100190, China
Email: jyang@mail.ioa.ac.cn
CAS Institutes
There are 124 Institutions directly under the CAS by the end of 2012, with 104 research institutes, five universities & supporting organizations, 12 management organizations that consist of the headquarters and branches, and three other units. Moreover, there are 25 legal entities affiliated and 22 CAS invested holding enterprisesThere are 124 I...>> more
Contact Us
Chinese Academy of Sciences
Add: 52 Sanlihe Rd., Xicheng District, Beijing, China
Postcode: 100864
Tel: 86-10-68597592 (day) 86-10-68597289 (night)
Fax: 86-10-68511095 (day) 86-10-68512458 (night)
E-mail: cas_en@cas.cn