Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2021 | Submitted
Journal Article Open

Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits

Abstract

We study the stabilization of a linear control system with an unbounded random system gain where the controller must act based on a rate-limited observation of the state. More precisely, we consider the system X_(n+1)=A_nX_n+W_n−U_n, where the A_n's are drawn independently at random at each time n from a known distribution with unbounded support, and where the controller receives at most R bits about the system state at each time from an encoder. We provide a time-varying achievable strategy to stabilize the system in a second-moment sense with fixed, finite R. While our previous result provided a strategy to stabilize this system using a variable-rate code, this work provides an achievable strategy using a fixed-rate code. The strategy we employ to achieve this is time-varying and takes different actions depending on the value of the state. It proceeds in two modes: a normal mode (or zoom-in), where the realization of A_n is typical, and an emergency mode (or zoom-out), where the realization of A_n is exceptionally large. To analyze the performance of the scheme we construct an auxiliary sequence that bounds the state X_n, and then bound auxiliary sequence in both the zoom-in and zoom-out modes.

Additional Information

© 2021 IEEE. Manuscript received August 6, 2019; revised July 20, 2020; accepted December 7, 2020. Date of publication February 1, 2021; date of current version March 18, 2021. The work of Victoria Kostina was supported in part by the National Science Foundation (NSF) under Grant CCF-1751356 and in part by the Simons Institute for the Theory of Computing. The work of Yuval Peres was supported in part by NSF under Grant DMS-1900008. The work of Gireeja Ranade was supported by the Simons Institute for the Theory of Computing. This article was presented in part at the 2018 IEEE International Symposium on Information Theory. The authors would like to thank Miklós Rácz and Serdar Yüksel for interesting discussions regarding this problem. They are very grateful to the reviewers whose feedback has greatly improved the presentation of this work, as well as to the reviewers of the ISIT paper. They would also like to thank Microsoft Research, where part of the work was performed.

Attached Files

Submitted - 1805.05535.pdf

Files

1805.05535.pdf
Files (339.1 kB)
Name Size Download all
md5:ccdaaad5e3448396189911f2f2b26d52
339.1 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 23, 2023