A New Block Exact Affine Projection Algorithm
نویسنده
چکیده
A block affine projection algorithm that it is mathematically equivalent to a recently proposed Gauss-Seidel Pseudo Affine Projection (GS -PAP) algorithm is proposed. A partitioning method is applied to the original sample-bysample algorithm. It is shown that the derived algorithm has better convergence, tracking abilities and much reduced complexity than the NLMS algorithm. Its application in an acoustic echo cancellation system is investigated.
منابع مشابه
A block exact fast affine projection algorithm
This paper describes a block (affine) projection algorithm that has exactly the same convergence rate as the original sample-by-sample algorithm and smaller computational complexity than the fast affine projection algorithm. This is achieved by 1) introducing a correction term that compensates for the filter output difference between the sample-by-sample projection algorithm and the straightfor...
متن کاملFast Implementation of a Subband Adaptive Algorithm for Acoustic Echo Cancellation
The block subband adaptive algorithm in [1] has illustrated significant improvement in performance over the NLMS and other frequency domain adaptive algorithms. However, it is known that block processing algorithms have lower tracking capabilities than the their sample-by-sample counterparts. The Fast Affine Projection (FAP) algorithm [2] also outperforms the NLMS with a slight increase in comp...
متن کاملBlock Sparse Memory Improved Proportionate Affine Projection Sign Algorithm
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 sig...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملA fast exact filtering approach to a family of affine projection-type algorithms
The affine projection (AP)-type algorithms produce a good tradeoff between convergence speed and complexity. 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 (FA...
متن کامل