Please use this identifier to cite or link to this item:
|Title:||Bounds on the optimal quantization performance of dynamically quantized linear systems with bounded noise||Authors:||Ling, Q.
|Keywords:||dynamic quantization policy
Quantized control system
|Issue Date:||Mar-2012||Citation:||Ling, Q., Gu, H., Lin, H., Kang, Y. (2012-03). Bounds on the optimal quantization performance of dynamically quantized linear systems with bounded noise. Asian Journal of Control 14 (2) : 538-547. ScholarBank@NUS Repository. https://doi.org/10.1002/asjc.363||Abstract:||This paper studies a class of quantized linear control systems with diagonalizable system matrices and perturbed by bounded noise. The quantization performance of such systems is measured with the supremum of the quantization error sequence. Our goal is to improve this performance (reduce the quantization error) through designing appropriate quantization policies. Due to their efficiency, the dynamic quantization policies are considered in this paper. A lower bound on the optimal (minimum) quantization error is provided. We also propose a new quantization policy, whose quantization error is an upper bound on the optimal one. A more tractable upper quantization error bound is derived from the new policy. It is shown through simulations that the new policy's quantization error is very close to the lower bound, which confirms both the tightness of the lower bound and the efficiency of the new policy. The achieved lower and upper quantization error bounds, together with the quantization error of the new quantization policy, may provide a good indication on the optimal quantization performance. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society.||Source Title:||Asian Journal of Control||URI:||http://scholarbank.nus.edu.sg/handle/10635/55227||ISSN:||15618625||DOI:||10.1002/asjc.363|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.