Article

Partial-Update L∞ -Norm Based Algorithms

Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que.
Circuits and Systems I: Regular Papers, IEEE Transactions on (Impact Factor: 2.24). 03/2007; DOI: 10.1109/TCSI.2006.883863
Source: IEEE Xplore

ABSTRACT The computational complexity of an adaptive filtering algorithm increases with increasing the filter tap length and therefore, the use of such a filter can become prohibitive for certain applications, especially for real-time implementation. In this paper, we develop low-complexity adaptive filtering algorithms by incorporating the concept of partial updating of the filter coefficients into the technique of finding the gradient vector in the hyperplane based on the Linfin-norm criterion. Two specific partial update algorithms based on the sequential and M-Max coefficient updating are proposed. The statistical analyses of the two algorithms are carried out, and evolution equations for the mean and mean-square of the filter coefficient misalignment as well as the stability bounds on the step size are obtained. It is shown that the proposed partial update algorithm employing the M-Max coefficient updating can achieve a convergence rate that is closest to that of the full update algorithm. Finally, simulations are carried out to validate the theoretical results and study the convergence rate of the proposed algorithms

0 Bookmarks
 · 
57 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose a novel affine projection algorithm (APA) that updates the weights intermittently. While the conven- tional APA updates the weights at each time instant, the proposed APA performs an intermittent update of the weights through dynamically adjusting the update interval. The adjustment of the update interval is accomplished by comparing the squared output error with a threshold derived from the steady-state mean-squared error. Experimental results show that the proposed algorithm has improved performance in terms of its convergence rate and steady-state error while reducing the number of updates.
    Circuits and Systems II: Express Briefs, IEEE Transactions on 01/2011; 58-II:763-767. · 1.33 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An Alternating Selection for Parallel Affine Projection Filters
    IEICE Transactions. 01/2011; 94-A:1576-1580.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The sequential partial-update least mean square (S-LMS)-based algorithms are efficient methods for reducing the arithmetic complexity in adaptive system identification and other industrial informatics applications. They are also attractive in acoustic applications where long impulse responses are encountered. A limitation of these algorithms is their degraded performances in an impulsive noise environment. This paper proposes new robust counterparts for the S-LMS family based on M-estimation. The proposed sequential least mean M-estimate (S-LMM) family of algorithms employ nonlinearity to improve their robustness to impulsive noise. Another contribution of this paper is the presentation of a convergence performance analysis for the S-LMS/S-LMM family for Gaussian inputs and additive Gaussian or contaminated Gaussian noises. The analysis is important for engineers to understand the behaviors of these algorithms and to select appropriate parameters for practical realizations. The theoretical analyses reveal the advantages of input normalization and the M-estimation in combating impulsive noise. Computer simulations on system identification and joint active noise and acoustic echo cancellations in automobiles with double-talk are conducted to verify the theoretical results and the effectiveness of the proposed algorithms.
    IEEE Transactions on Industrial Electronics 10/2011; · 6.50 Impact Factor