z-logo
Premium
Bounds on the optimal quantization performance of dynamically quantized linear systems with bounded noise
Author(s) -
Ling Qiang,
Gu Huihui,
Lin Hai,
Kang Yu
Publication year - 2012
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.363
Subject(s) - quantization (signal processing) , upper and lower bounds , bounded function , infimum and supremum , trellis quantization , mathematics , computer science , linde–buzo–gray algorithm , control theory (sociology) , algorithm , discrete mathematics , control (management) , mathematical analysis , artificial intelligence , image (mathematics) , image processing , image compression
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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here