Tradeoffs between quantization and packet loss in networked control of linear systems

In this paper, we consider to derive the coarsest memoryless quantizer which can stabilize a single-input discrete-time linear time-invariant system with stochastic packet loss in the sense of stochastic quadratic stability. We show that the upper bound of the coarseness is strictly given by the packet loss probability and the unstable poles of the plants. We furthermore deal with permissible dead-zone width around the origin of the quantizers and time-varying finite quantizers in order to realize control using finite quantization steps.