z-logo
Premium
Design of a near‐optimal adaptive filter in digital signal processor for active noise control
Author(s) -
Yang S. M.,
Lee K. F.,
Tsai S. E.
Publication year - 2008
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.959
Subject(s) - control theory (sociology) , adaptive filter , kernel adaptive filter , filter design , computer science , feed forward , adaptive control , digital signal processing , robustness (evolution) , active noise control , controller (irrigation) , digital filter , digital signal processor , noise (video) , filter (signal processing) , control engineering , engineering , algorithm , artificial intelligence , computer hardware , agronomy , biochemistry , chemistry , control (management) , biology , image (mathematics) , computer vision , gene
Abstract Adaptive filter has been applied in adaptive feedback and feedforward control systems, where the filter dimension is often determined by trial‐and‐error. The controller design based on a near‐optimal adaptive filter in digital signal processor (DSP) is developed in this paper for real‐time applications. The design integrates the adaptive filter and the experimental design such that their advantages in stability and robustness can be combined. The near‐optimal set of controller parameters, including the sampling rate, the dimension of system identification model, the dimension (order) of adaptive controller in the form of an FIR filter, and the convergence rate of adaptation is shown to achieve the best possible system performance. In addition, the sensitivity of each design parameter can be determined by analysis of means and analysis of variance. Effectiveness of the adaptive controller on a DSP is validated by an active noise control experiment. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here