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 September 2019 | public
Journal Article

Control over Gaussian Channels With and Without Source-Channel Separation

Abstract

We consider the problem of controlling an unstable linear plant with Gaussian disturbances over an additive white Gaussian noise channel with an average transmit power constraint, where the signaling rate of communication may be different from the sampling rate of the underlying plant. Such a situation is quite common since sampling is done at a rate that captures the dynamics of the plant and that is often lower than the signaling rate of the communication channel. This rate mismatch offers the opportunity of improving the system performance by using coding over multiple channel uses to convey a single control action. In a traditional, separation-based approach to source and channel coding, the analog message is first quantized down to a few bits and then mapped to a channel codeword whose length is commensurate with the number of channel uses per sampled message. Applying the separation-based approach to control meets its challenges: first, the quantizer needs to be capable of zooming in and out to be able to track unbounded system disturbances, and second, the channel code must be capable of improving its estimates of the past transmissions exponentially with time, a characteristic known as anytime reliability. We implement a separated scheme by leveraging recently developed techniques for control over quantized-feedback channels and for efficient decoding of anytime-reliable codes. We further propose an alternative, namely, to perform analog joint source–channel coding, by this avoiding the digital domain altogether. For the case where the communication signaling rate is twice the sampling rate, we employ analog linear repetition as well as Shannon–Kotel'nikov maps to show a significant improvement in stability margins and linear-quadratic costs over separation-based schemes. We conclude that such analog coding performs better than separation, and can stabilize all moments as well as guarantee almost-sure stability.

Additional Information

© 2019 IEEE. Manuscript received August 11, 2018; accepted November 3, 2018. Date of publication April 19, 2019; date of current version August 28, 2019. This work was supported by the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant 708932. The work of E. Riedel Gårding was supported by the National Science Foundation (NSF) under Grant CCF-1566567 through the SURF program. The work of G. M. Pettersson was supported by The Boeing Company under the SURF program. The work of V. Kostina was supported in part by the NSF under Grant CCF-1566567. The work of B. Hassibi was supported in part by the NSF under Grant CNS-0932428, Grant CCF-1018927, Grant CCF-1423663, and Grant CCF-1409204, by a grant from Qualcomm Inc., by NASA's Jet Propulsion Laboratory through the President and Director's Fund, and by King Abdullah University of Science and Technology. This paper was presented in part at the IEEE Conference on Decision and Control, Las Vegas, NV, USA, Dec. 2016. This work was done in part while A. Khina and V. Kostina were visiting the Simons Institute for the Theory of Computing. Recommended by Associate Editor K. Kashima. The authors thank H. Yıldız for valuable discussions and help with parts of the simulation.

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024