Showing 3 results for Selective Partial Update
M. Sh. Esfand Abadi, V. Mehrdad, M. Noroozi,
Volume 5, Issue 3 (9-2009)
Abstract
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 are established by this general formalism. In these algorithms, the filter coefficients are partially updated rather than the entire filter coefficients at every iteration which is computationally efficient. Following this, the transient and steady-state performance analysis of this family of adaptive filter algorithms are studied. This analysis is based on energy conservation arguments and does not need to assume a Gaussian or white distribution for the regressors. We demonstrate the performance of the presented algorithms through simulations in system identification and acoustic echo cancellation scenarios. The good agreement between theoretically predicted and actually observed performances is also demonstrated
M. Shams Esfand Abadi, S. Nikbakht,
Volume 7, Issue 2 (6-2011)
Abstract
Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (TD-VSS-APA), the TD set-membership NLMS (TD-SM-NLMS), the TD-SM-APA, the TD selective partial update NLMS (TD-SPU-NLMS), and the TD-SPU-APA are presented. In TD-VSS adaptive filters, the step-size changes during the adaptation which leads to improve the performance of the algorithms. In TD-SM adaptive filter algorithms, the filter coefficients are not updated at each iteration. Therefore, the computational complexity is reduced. In TD-SPU adaptive algorithms, the filter coefficients are partially updated which reduce the computational complexity. We demonstrate the good performance of the proposed algorithms thorough several simulation results in TD adaptive noise cancellation (TD-ANC) for image restoration. The results are compared with the classical TD adaptive filters such as TD-LMS, TD-NLMS, and TD-APA
M. Shams Esfand Abadi, M.s. Shafiee,
Volume 9, Issue 1 (3-2013)
Abstract
This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse
response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computational complexity of VSSNSAF, the VSS selective partial update NSAF (VSS-SPU-NSAF) is proposed where the filter coefficients are partially updated in each subband at every iteration. We demonstrated the good performance of the proposed algorithms in convergence speed and steady-state MSD for a system identification set-up.
