Abstract
The authors consider pseudorandom multilevel sequences (PRMS) for the identification of nonlinear systems modeled via a truncated Volterra series with a finite degree of nonlinearity and finite memory length. It is shown that PRMS are persistently exciting (PE) for a Volterra series model with nonlinearities of polynomial degree N if and only if the sequence takes on N+1 or more distinct levels. A computationally efficient least squares identification algorithm based on PRMS inputs is developed that avoids forming the inverse of the data matrix. Simulation results comparing identification accuracy using PRMS and Gaussian white noise are given. >
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.
