In this paper, the optimization of quantizer’s segment threshold is done. The quantizer is designed on the basis of approximative spline functions. Coefficients on which we form approximative spline functions are cal...In this paper, the optimization of quantizer’s segment threshold is done. The quantizer is designed on the basis of approximative spline functions. Coefficients on which we form approximative spline functions are calculated by minimization mean square error (MSE). For coefficients determined in this way, spline functions by which optimal compressor function is approximated are obtained. For the quantizer designed on the basis of approximative spline functions, segment threshold is numerically determined depending on maximal value of the signal to quantization noise ratio (SQNR). Thus, quantizer with optimized segment threshold is achieved. It is shown that by quantizer model designed in this way and proposed in this paper, the SQNR that is very close to SQNR of nonlinear optimal companding quantizer is achieved.展开更多
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...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 Cramér-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.展开更多
基金Serbian Ministry of Education and Science through Mathematical Institute of Serbian Academy of Sciences and Arts(Project III44006)Serbian Ministry of Education and Science(Project TR32035)
文摘In this paper, the optimization of quantizer’s segment threshold is done. The quantizer is designed on the basis of approximative spline functions. Coefficients on which we form approximative spline functions are calculated by minimization mean square error (MSE). For coefficients determined in this way, spline functions by which optimal compressor function is approximated are obtained. For the quantizer designed on the basis of approximative spline functions, segment threshold is numerically determined depending on maximal value of the signal to quantization noise ratio (SQNR). Thus, quantizer with optimized segment threshold is achieved. It is shown that by quantizer model designed in this way and proposed in this paper, the SQNR that is very close to SQNR of nonlinear optimal companding quantizer is achieved.
基金supported by the National Key R&D Program of China under Grant No.2018YFA0703800the National Natural Science Foundation of China under Grant Nos.T2293770,62025306,62303452,and 122263051+2 种基金CAS Project for Young Scientists in Basic Research under Grant No.YSBR-008China Postdoctoral Science Foundation under Grant No.2022M720159Guozhi Xu Postdoctoral Research Foundation.
文摘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 Cramér-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.