Abstract
This paper derives a least squares-based and a gradient-based iterative identification algorithms for Wiener nonlinear systems. These methods separate one bilinear cost function into two linear cost functions, estimating directly the parameters of Wiener systems without re-parameterization to generate redundant estimates. The simulation results confirm that the proposed two algorithms are valid and the least squares-based iterative algorithm has faster convergence rates than the gradient-based iterative algorithm.
Full Text
Paper version not known (
Free)
Published Version
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 call