Abstract
Recursive digital filters are potentially less computationally expensive than their non-recursive counterparts. However, algorithms for adjusting the coefficients of recursive filters may produce biased or suboptimal estimates of the optimal coefficent values. In addition, recursive filters may become unstable if the adaptive algorithm updates a feedback coefficient so that one of the poles remains outside the unit circle for any length of time. This paper details an adaptive algorithm for optimizing the coefficients of recursive digital filters based on the genetic algorithm. Stability considerations are addressed by implementing the population of adaptive filters as lattice structures which allows the entire feasible, stable coefficient space to be searched whilst ensuring that crossover and mutation do not produce invalid (unstable) filters. Results are presented showing the application of this technique to the tasks of system identification and adaptive data equalization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
