Abstract
A general infinite impulse response (IIR) or recursive adaptive filter co-efficient vector update equation is given by where μ(k) is the adaptation gain sequence, and f(k) is the correction vector. In this paper, we show that improvements in filter convergence can be obtained by appropriately modifying either μ(k) or f(k). In the former case, we force Dvoretzky conditions (from stochastic approximation theory) on μ(k) during the search period, whereas the latter uses delayed error signals (i e, modified f (k)) resulting in a parallel processing technique.We have incorporated these proposed modifications in recursive least mean square (RLMS) and simple hyperstable adaptive recursive filter (SHARF) algorithms. From simulation studies, it has been observed that the modification on f(k) gave improved results for the SHARF, and the RLMS converged quickly with the modification on μ(k). Results of simulation studies are presented in the form of learning curves and parameter tables.
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.
