Search

Abstract: In practical cases for active noise control (ANC), the secondary path has usually a time varying behavior. For these cases, an online secondary path modeling method that uses a white noise as a training signal is required to ensure convergence of the system. The modeling accuracy and the convergence rate are increased when a white noise with a larger variance is used. However, the larger variance increases the residual noise, which decreases performance of the system and additionally causes instability problem to feedback structures. A sudden change in the secondary path leads to divergence of the online secondary path modeling filter. To overcome these problems, this paper proposes a new approach for online secondary path modeling in feedback ANC systems. The proposed algorithm uses the advantages of white noise with larger variance to model the secondary path, but the injection is stopped at the optimum point to increase performance of the algorithm and to prevent the instability effect of the white noise. In this approach, instead of continuous injection of the white noise, a sudden change in secondary path during the operation makes the algorithm to reactivate injection of the white noise to correct the secondary path estimation. In addition, the proposed method models the secondary path without the need of using off-line estimation of the secondary path. Considering the above features increases the convergence rate and modeling accuracy, which results in a high system performance. Computer simulation results shown in this paper indicate effectiveness of the proposed method. [Copyright &y& Elsevier]

This paper proposes a novel diffusion subband adaptive filtering algorithm for distributed networks. To achieve a fast convergence rate and small steady-state errors, a variable step size and a new combination method is developed. For the adaptation step, the upper bound of the mean-square deviation (MSD) of the algorithm is derived and the step size is adaptive by minimizing it in order to attain the fastest convergence rate on every iteration. Furthermore, for a combination step realized by a convex combination of the neighbor-node estimates, the proposed algorithm uses the MSD, which contains information on the reliability of the estimates, to determine combination coefficients. Simulation results show that the proposed algorithm outperforms the existing algorithms in terms of the convergence rate and the steady-state errors. [ABSTRACT FROM AUTHOR]