Threshold Selection and Resource Allocation for Quantized Identification

This paper is concerned with the optimal threshold selection and resource allocation problems of quantized identification, whose aims are improving identification efficiency under limited resources. Firstly, the first-order asymptotically optimal quantized identification theory is extended to the weak persistent excitation condition. Secondly, the characteristics of time and space complexities are established based on the Cramer-Rao lower bound of quantized systems. On these basis, the optimal selection methods of fixed thresholds and adaptive thresholds are established under aperiodic signals, which answer how to achieve the best efficiency of quantized identification under the same time and space complexity. In addition, based on the principle of maximizing the identification efficiency under a given resource, the optimal resource allocation methods of quantized identification are given for the cases of fixed thresholds and adaptive thresholds, respectively, which show how to balance time and space complexity to realize the best identification efficiency of quantized identification.