# Exact minimum number of bits to stabilize a linear system

arXiv: https://arxiv.org/abs/1807.07686 · HTML: https://mlsanity.com/paper/1807.07686/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Jul 2018.

## Built on by (most cited first, 1 of 1)

- [Time-invariant Prefix Coding for LQG Control](https://mlsanity.com/paper/2204.00588/) (2022)

## Abstract (arXiv)

We consider an unstable scalar linear stochastic system, Xn+1=a Xn + Zn - Un, where a ≥ 1 is the system gain, Zn's are independent random variables with bounded α-th moments, and Un's are the control actions that are chosen by a controller who receives a single element of a finite set 1, ldots, M as its only information about system state Xi. We show new proofs that M > a is necessary and sufficient for β-moment stability, for any β < α. Our achievable scheme is a uniform quantizer of the zoom-in / zoom-out type that codes over multiple time instants for data rate efficiency; the controller uses its memory of the past to correctly interpret the received bits. We analyze its performance using probabilistic arguments. We show a simple proof of a matching converse using information-theoretic techniques. Our results generalize to vector systems, to systems with dependent Gaussian noise, and to the scenario in which a small fraction of transmitted messages is lost.