Abstract
The adaptive filter is an important workhorse of digital signal processing having a vast variety of applications in almost every branch of modern electronics. Today there is an abundance of algorithms with different performance and computational characteristics. In this paper we address the class of delayless subband adaptive filters (SAF). Although this class of adaptive filters have been popular for some time, there are still aspects related to convergence speed and filter bank design for such adaptive filters that are not fully understood nor fully explored. The aim of this paper is to present a first step in closing this knowledge gap by developing explicit and general equation sets, directly related to the Wiener-Hopf equation, that the delayless SAFs attempt to solve. By doing so we provide a firm basis for algorithm analysis and parameter selection that can now be undertaken in much the same way as the analysis of simpler adaptive filtering algorithms.
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.
