A new family of concurrent algorithms for adaptive Volterra andlinear filters

A novel idea for introducing concurrency in least squares (LS) adaptive algorithms by sacrificing optimality has been proposed. The resultant class of algorithms provides schemes to fill the wide gap in the convergence rates of LS and stochastic gradient (SG) algorithms. It will be particularly useful in the real time implementations of large-order linear and Volterra filters for which both the LS and SG algorithms are unsuited     

Filtered-X second-order Volterra adaptive algorithms

The authors propose filtered-X second-order Volterra adaptive algorithms based on a multichannel structure application to active noise control. The developed algorithms can be used as alternatives in the case where the standard filtered-X LMS algorithm does not perform well     

Convergence behavior of affine projection algorithms

A class of equivalent algorithms that accelerate the convergence of the normalized LMS (NLMS) algorithm, especially for colored inputs, has previously been discovered independently. The affine projection algorithm (APA) is the earliest and most popular algorithm in this class that inherits its name. The usual APA algorithms update weight estimates on the basis of multiple, unit delayed, input signal vectors. We analyze the convergence behavior of the generalized APA class of algorithms (allowing for arbitrary delay between input vectors) using a simple model for the input signal vectors. Conditions for convergence of the APA class are derived. It is shown that the convergence rate is exponential and that it improves as the number of input signal vectors used for adaptation is increased. However, the rate of improvement in performance (time-to-steady-state) diminishes as the number of input signal vectors increases. For a given convergence rate, APA algorithms are shown to exhibit less misadjustment (steady-state error) than NLMS. Simulation results are provided to corroborate the analytical results     

Low computational complexity family of affine projection algorithms over adaptive distributed incremental networks

This paper presents the problem of distributed estimation in an incremental network based on the family of affine projection (AP) adaptive algorithms. The distributed selective partial update normalized least mean squares (dSPU-NLMS), the distributed SPU-AP algorithm (dSPU-APA), the distributed selective regressor APA (dSR-APA), the distributed dynamic selection of APA (dDS-APA), dSPU-SR-APA and dSPU-DS-APA are introduced in a unified way. These algorithms have low computational complexity feature and close convergence speed to ordinary distributed adaptive algorithms. In dSPU-NLMS and dSPU-APA, the weight coefficients are partially updated at each node during the adaptation. In dSR-APA, the optimum number of input regressors is selected during the weight coefficients update. The dynamic selection of input regressors is used in dDS-APA. dSPU-SR-APA and dSPU-DS-APA combine SPU with SR and DS approaches. In these algorithms, the weight coefficients are partially updated and the input regressors are optimally/dynamically selected at every iteration for each node. In addition, a unified approach for mean-square performance analysis of each individual node is presented. This approach can be used to establish a performance analysis of classical distributed adaptive algorithms as well. The theoretical expressions for stability bounds, transient, and steady-state performance analysis of various distributed APAs are introduced. The validity of the theoretical results and the good performance of dAPAs are demonstrated by several computer simulations.     

基于sigmoid函数的Volterra自适应有源噪声对消器

该文介绍了一种新颖的非线性自适应有源噪声对消器基于sigmoid函数的Volterra自适应有源噪声对消器,并采用输入信号和瞬时误差归一化的LMS自适应算法调整其系数。这种基于sigmoid函数的Volterra自适应有源噪声对消器具有参数少和便于实现的模快化结构等优点。仿真结果表明:这种基于sigmoid函数的Volterra自适应有源噪声对消系统具有良好的抗噪声性能。     

Color image processing using adaptive multichannel filters

New adaptive filters for color image processing are introduced and analyzed. The proposed adaptive methodology constitutes a unifying and powerful framework for multichannel signal processing. Using the proposed methodology, color image filtering problems are treated from a global viewpoint that readily yields and unifies previous, seemingly unrelated, results. The new filters utilize Bayesian techniques and nonparametric methodologies to adapt to local data in the color image. The principles behind the new filters are explained in detail. Simulation studies indicate that the new filters are computationally attractive and have excellent performance.     

Envelope-constrained filters: adaptive algorithms

We consider an envelope-constrained (EC) optimal filter design problem involving a quadratic cost function and a number of linear inequality constraints. Using the duality theory and the space transformation function, the optimal solution of the dual problem can be computed by finding the limiting point of an ordinary differential equation given in terms of the gradient flow. An iterative algorithm is developed via discretizing the differential equation. From the primal-dual relationship, the corresponding sequence of approximate solutions in the original EC filtering problem is obtained. Based on these results, an adaptive algorithm is constructed for solving the stochastic EC filtering problem in which the input signal is corrupted by an additive random noise. For illustration,a practical example is solved for both noise-free and noisy cases     

Transient and steady-state analysis of filtered-x affine projection algorithms

This paper provides an analysis of transient and steady-state behavior of different filtered-x affine projection algorithms. Algorithms suitable for single-channel and for multichannel active noise controllers are treated within a unified framework. Very mild assumptions are posed on the active noise control system model, which is only required to have a linear dependence of the output from the filter coefficients. Therefore, the analysis applies not only to the linear finite impulse response models but also to nonlinear Volterra filters, i.e., polynomial filters, and other nonlinear filter structures. The convergence analysis presented in this paper relies on energy conservation arguments and does not apply the independence theory, nor does it impose any restriction to the signal distributions. It is shown in the paper that filtered-x affine projection algorithms always provide a biased estimate of the minimum mean square solution. Nevertheless, in many cases, the bias is small and therefore these algorithms can be profitably applied to active noise control.     

Mean-square performance of a family of affine projection algorithms

Affine projection algorithms are useful adaptive filters whose main purpose is to speed the convergence of LMS-type filters. Most analytical results on affine projection algorithms assume special regression models or Gaussian regression data. The available analysis also treat different affine projection filters separately. This paper provides a unified treatment of the mean-square error, tracking, and transient performances of a family of affine projection algorithms. The treatment relies on energy conservation arguments and does not restrict the regressors to specific models or to a Gaussian distribution. Simulation results illustrate the analysis and the derived performance expressions.     

A projection approach for robust adaptive beamforming

It is well known that calibration errors can seriously degrade performance in adaptive arrays, particularly when the input signal-to-noise ratio is large. The effect is caused by the perturbation of the presumed steering vector from its optimal value. Although it is not as widely known, similar degradation occurs in sampled matrix inversion processing when the covariance matrix is estimated while the desired signal is present in the snapshot data. Under these conditions, performance loss is due to errors in the estimated covariance matrix and occurs even when the steering vector is known exactly. In the paper, a new method based of modification of the steering vector is proposed to overcome both the problems of perturbation and of sample covariance errors. The method involves projection of the presumed steering vector onto the observed signal-plus-interference subspace. An analysis is also presented illustrating that the sample covariance errors can be viewed as a particular type of perturbation error and a simple approximation is derived for the expected beamformer performance as a function of the number of data snapshots. Both analytical and experimental results are presented that illustrate the advantages of the proposed method     

Fast adaptive algorithms for multichannel filtering and systemidentification

Fast transversal and lattice least squares algorithms for adaptive multichannel filtering and system identification are developed. Models with different orders for input and output channels are allowed. Four topics are considered: multichannel FIR filtering, rational IIR filtering, ARX multichannel system identification, and general linear system identification possessing a certain shift invariance structure. The resulting algorithms can be viewed as fast realizations of the recursive prediction error algorithm. Computational complexity is then reduced by an order of magnitude as compared to standard recursive least squares and stochastic Gauss-Newton methods. The proposed transversal and lattice algorithms rely on suitable order step-up-step-down updating procedures for the computation of the Kalman gain. Stabilizing feedback for the control of numerical errors together with long run simulations are included     

Systolic architectures for adaptive multichannel least squares lattice filters

A family of systolic array architectures for adaptive multichannel least squares lattice (MLSL) filters is presented. These architectures are based on a recently developed algorithm that provides an efficient, numerically sound, and well-structured set of recursions for realizing MLSL filters. The algorithm is based on the recursive QR decomposition of the forward and backward error correlation matrices. Form input channels andp filter taps,O(pm ²) computations are required per time step. Numerous space-time tradeoffs are available in mapping the algorithm's recursions to systolic architectures, leading to the architectural family presented here.Los Alamos National Laboratory is operated by the University of California for the United States Department of Energy under contract W-7405-ENG-36.     

仿射形变条件下形状匹配的矩阵投影方法

提出了一种仿射形变条件下形状匹配的矩阵投影方法。首先利用二维点集描述具有仿射形变关系的两个形状,提出了形状点集的标准化形式,并证明了标准化形式之间仅存在旋转变换;其次通过矩阵投影的方法找到标准化形状之间的匹配关系,从而通过重构的方法确定初始形状的匹配关系;最后通过匹配关系确定仿射变换参数,并进行形状配准。试验结果表明本文提出方法对仿射形变具有不变性,并且对形状点集的数目不相等的情况具有较高的精度。     

A CONFIGURATION FOR REALIZATION OF THE MULTICHANNEL AND HIGH-ORDER IIR ADAPTIVE FILTERS

This paper develops a new hyperstable adaptive algorithm which can be used inthe multichannel ⅡR conflguration and/or the high-order ⅡR or zero-pole configuration for jointprocess estimation.     

Intelligent learning algorithms for adaptive digital filters

It is wellknown that gradient search fails in adaptive IIR filters, since their mean-square error surfaces may be multi-modal. In the letter a new approach based on learning algorithms is shown to be capable of performing global optimisation. The new algorithms are suitable for both adaptive FIR and IIR filters.<>     

Eigenstructure algorithms for multirate adaptive lossless FIR filters

This paper addresses the problem of adaptively optimizing a two-channel lossless finite-impulse-response (FIR) filter bank, which finds application in subband coding and wavelet signal analysis. Instead of using a gradient decent procedure-with its inherent problem of becoming trapped in local minima of a nonquadratic cost function-two eigenstructure algorithms are proposed. Both algorithms feature a priori bounds on the output variance at any convergent point, which, based on simulations, lead to solutions that lie acceptably close to a global minimum point of an output variance objective function. Moreover, a sufficient condition for such stationary points based on fixed-point theory is shown. It is shown that the convergence rate of both algorithms increases as the separation of eigenvalues of the input covariance matrix increases. Simulations for synthetic and real data support the conclusions.     

QRD-BASED MULTICHANNEL ADAPTIVE LATTICEALGORITHMS FOR THE PARAMETERIDENTIFICATION PROBLEM

A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Using first a prerotation of the input data matrix and then a repetition of the single channel Givens lattice algorithm, the second algorithm can be obtained. Both algorithms have superior numerical properties, particularly the robustness to wordlength limitations. The parameter vector to be estimated can be extracted directly from internal variables in the present algorithms without a backsolve operation with an extra triangular array. The results of computer simulation of the parameter identification of a two-channel system are presented to confirm efficiently the derivation.     

Analysis of gradient algorithms for TLS-based adaptive IIR filters

Steepest descent gradient algorithms for unbiased equation error adaptive infinite impulse response (IIR) filtering are analyzed collectively for both the total least squares and mixed least squares-total least squares framework. These algorithms have a monic normalization that allows for a direct filtering implementation. We show that the algorithms converge to the desired filter coefficient vector. We achieve the convergence result by analyzing the stability of the equilibrium points and demonstrate that only the desired solution is locally stable. Additionally, we describe a region of initialization under which the algorithm converges to the desired solution. We derive the results using interlacing relationships between the eigenvalues of the data correlation matrices and their respective Schur complements. Finally, we illustrate the performance of these new approaches through simulation.     

An adaptive approach for designing phase compensation filters

The objective of this communication is to introduce an adaptive method for designing filters to compensate for nonlinear phase shift introduced into a data stream by fixed (i.e., nonadaptive) recursive digital filters, e.g., those obtained via the bilinear transform.