TY - GEN
T1 - Achievable Performance of Zero-Delay Variable-Rate Coding in Rate-Constrained Networked Control Systems with Channel Delay
AU - Barforooshan, Mohsen
AU - Østergaard, Jan
AU - Stavrou, Fotios
PY - 2017
Y1 - 2017
N2 - This paper presents an upper bound on the minimum data rate required to achieve a prescribed closed-loop performance level in networked control systems (NCSs). The considered feedback loop includes a linear time-invariant (LTI) plant with single measurement output and single control input. Moreover, in this NCS, a causal but otherwise unconstrained feedback system carries out zero-delay variable-rate coding, and control. Between the encoder and decoder, data is exchanged over a rate-limited noiseless digital channel with a known constant time delay. Here we propose a linear source-coding scheme that with the use of entropy-coded dithered quantizers (ECDQs), attains each quadratic performance level with a rate that exceeds the lower bound in [1] by at most (approximately) 1.254 bits per sample. The upper bound obtained by ECDQ is demonstrated, via simulations, to be an increasing function of the channel time delay at any given performance. In other words, attaining a specific performance level necessitates achieving a higher data rate when the channel time delay grows. The theoretical framework is demonstrated via an illustrative example.
AB - This paper presents an upper bound on the minimum data rate required to achieve a prescribed closed-loop performance level in networked control systems (NCSs). The considered feedback loop includes a linear time-invariant (LTI) plant with single measurement output and single control input. Moreover, in this NCS, a causal but otherwise unconstrained feedback system carries out zero-delay variable-rate coding, and control. Between the encoder and decoder, data is exchanged over a rate-limited noiseless digital channel with a known constant time delay. Here we propose a linear source-coding scheme that with the use of entropy-coded dithered quantizers (ECDQs), attains each quadratic performance level with a rate that exceeds the lower bound in [1] by at most (approximately) 1.254 bits per sample. The upper bound obtained by ECDQ is demonstrated, via simulations, to be an increasing function of the channel time delay at any given performance. In other words, attaining a specific performance level necessitates achieving a higher data rate when the channel time delay grows. The theoretical framework is demonstrated via an illustrative example.
UR - https://css.paperplaza.net/conferences/conferences/CDC17/program/CDC17_ContentListWeb_4.html#frb14_02
U2 - 10.1109/CDC.2017.8264566
DO - 10.1109/CDC.2017.8264566
M3 - Article in proceeding
T3 - I E E E Conference on Decision and Control. Proceedings
SP - 5991
EP - 5996
BT - 56th IEEE Conference on Decision and Control
PB - IEEE
CY - Melbourne, Australia
T2 - 56th IEEE Conference on Decision and Control (CDC)
Y2 - 12 December 2017 through 15 December 2017
ER -