Abstract
This paper studies the identification of finite impulse response (FIR) systems whose output observations are subject to both the binary-valued quantization and the scheduling scheme. By utilizing the statistical property of the system noise and the scheduling policy, an empirical-measure-based identification algorithm is proposed. Under periodical inputs, it is proved that the estimation from the algorithm can converge to the real parameters. The mean-square convergence rate of the estimation error is established, based on which and the Cramer-Rao lower bound, the asymptotic efficiency of algorithm is proved. Moreover, the communication rate is derived and the input design problem is discussed. A numerical example is given to illustrate the main results obtained.
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.
