Abstract
We develop a tractable algorithms for finding the optimal power spectral density of the Gaussian input excitation for identifying a Wiener model. This problem is known as a difficult problem for two reasons. Firstly, the estimation accuracy depends on the higher order joint moments of the potentially infinitely many past samples of the input signal. In addition, the covariancematrix of the parameter estimates is thought to be a highly non-convex function of the power spectral density function. In this contribution we show that under Gaussian assumption it is possible to completely parameterize the set of all admissible information matrices with only a finite number of parameters. We present a convex algorithm to solve the D-optimal design problem. This idea can be extended further to design Gaussian mixture designs.
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.
