A Lower-Bound for Variable-Length Source Coding in Linear-Quadratic-Gaussian Control With Shared Randomness (original) (raw)

Rate of Prefix-free Codes in LQG Control Systems with Side Information

2021 55th Annual Conference on Information Sciences and Systems (CISS), 2021

In this work, we study an LQG control system where one of two feedback channels is discrete and incurs a communication cost. We assume that a decoder (co-located with the controller) can make noiseless measurements of a subset of the state vector (referred to as side information) meanwhile a remote encoder (co-located with a sensor) can make arbitrary measurements of the entire state vector, but must convey its measurements to the decoder over a noiseless binary channel. Use of the channel incurs a communication cost, quantified as the time-averaged expected length of prefix-free binary codeword. We study the tradeoff between the communication cost and control performance. The formulation motivates a constrained directed information minimization problem, which can be solved via convex optimization. Using the optimization, we propose a quantizer design and a subsequent achievability result.

Free PDF

Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels

Information Theory, IEEE Transactions on, 2004

This paper considers communication over coherent multiple-input multiple-output (MIMO) flat-fading channels where the channel is only known at the receiver. For this setting, we introduce the class of LAttice Space-Time (LAST) codes. We show that these codes achieve the optimal diversity-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-Lambda scheme to the MIMO case. In our ...

Free PDF

A Lower-Bound for Variable-Length Source Coding in Linear-Quadratic-Gaussian Control With Shared Randomness (original) (raw)

Free related PDFsRelated papers