Abstract

This paper considers the linear system identification with batched binary-valued observations. An iterative parameter estimate algorithm is constructed to achieve the Maximum Likelihood (ML) estimate. The first interesting result is that there exists at most one finite ML solution for this specific maximum likelihood problem, which is induced by the fact that the Hessian matrix of the log-likelihood function is negative definite under binary data and Gaussian system noises. The global concave property and local strongly concave property of the log-likelihood function are obtained. Under mild conditions on the system input, the ML function can be proved to have unique maximum point. The second main result is that the proposed iterative estimate algorithm converges to a fixed vector with an exponential rate which are proved by constructing a Lyapunov function. The more interesting result is that the limit of the iterative algorithm achieves the maximization of the ML function. Numerical simulations are illustrated to support the theoretical results obtained in this paper well.

Full Text
Paper version not known

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

Disclaimer: 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.