Abstract
This correspondence investigates the statistical behavior of two adaptive gradient search algorithms for identifying an unknown Wiener-Hammerstein system (WHS) with Gaussian inputs. The first scheme attempts to identify the WHS with an LMS adaptive filter. The LMS algorithm identifies a scaled version of the convolution of the input and output linear filters of the WHS. The second scheme attempts to identify the unknown WHS with a gradient adaptive WHS when the shape of the nonlinearity is known a priori. The mean behavior of the gradient recursions are analyzed when the WHS nonlinearity is modeled by an error function. The mean recursions yield very good agreement with Monte Carlo simulations for slow learning.
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.
