Anatoly Khina

Dr. Anatoly Khina


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 April 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AKAnatoly Khina
Anatoly Khina
EGElias Riedel Gårding
Elias Riedel Gårding
GPGustav M. Pettersson
Gustav M. Pettersson
VKVictoria Kostina
Victoria Kostina
BHBabak Hassibi
Babak Hassibi
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.

25 June 2018 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
AKAnatoly Khina
Anatoly Khina
VKVictoria Kostina
Victoria Kostina
AKAshish Khisti
Ashish Khisti
BHBabak Hassibi
Babak Hassibi
We consider the problem of tracking the state of Gauss-Markov processes over rate-limited erasure-prone links. We concentrate first on the scenario in which several independent processes are seen by a single observer. The observer maps the processes into finite-rate packets that are sent over the erasure-prone links to a state estimator, and are acknowledged upon packet arrivals. The aim of the state estimator is to track the processes with zero delay and with minimum mean square error (MMSE). We show that, in the limit of many processes, greedy quantization with respect to the squared error distortion is optimal. That is, there is no tension between optimizing the MMSE of the process in the current time instant and that of future times. For the case of packet erasures with delayed acknowledgments, we connect the problem to that of compression with side information that is known at the observer and may be known at the state stimator - where the most recent packets serve as side information that may have been erased, and demonstrate that the loss due to a delay by one time unit is rather small. For the scenario where only one process is tracked by the observer-state estimator system

30 September 2020 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
MKMohammad Javad Khojasteh
Mohammad Javad Khojasteh
AKAnatoly Khina
Anatoly Khina
MFMassimo Franceschetti
Massimo Franceschetti
TJTara Javidi
Tara Javidi
We introduce the problem of learning-based attacks in an abstraction of cyber-physical systems that may be subject to an attack that overrides the sensor readings and the controller actions. The attacker attempts to learn the dynamics of the plant and subsequently override the controller's actuation signal, to destroy the plant without being detected. The attacker can feed fictitious sensor readings to the controller using its estimate of the plant dynamics and mimic the legitimate plant operation. The controller, on the other hand, is constantly on the lookout for an attack; once the controller detects an attack, it immediately shuts the plant off. We derive lower bounds for the attacker's deception probability for linear plants by assuming a specific authentication test that inspects the empirical variance of the system disturbance. We also show how the controller can improve the security of the system by superimposing a carefully crafted privacy-enhancing signal on top of the control policy. Finally, for nonlinear scalar dynamics that belong to the Reproducing Kernel Hilbert Space, we investigate the performance of attacks based on Gaussian-processes regression.

1 July 2008
Verified
Conference Paper
Closed access
YKYuval Kochman
Yuval Kochman
AKAnatoly Khina
Anatoly Khina
UEUri Erez
Uri Erez
RZRam Zamir
Ram Zamir
The Gaussian parallel relay network problem consists of transmitting a message from a single source node to a single destination node, through a layer of parallel relay nodes. The source is connected to the relays by a Gaussian broadcast channel, while the relays are connected to the destination by a Gaussian multiple access channel. When the channels are all white with the same bandwidth, and the relays cannot decode the message, the best known strategy is "amplify and forward", which achieves the coherence gain of multiple relays. We propose a strategy which achieves this gain even when the noises are colored or the channels have different bandwidths. To that end we use analog modulo-lattice modulation of the codewords in the BC, and then forward the estimated codeword by each of the relays to the MAC. This modulation allows the relays to re-match the signal to the optimal spectrum of the MAC, thus demonstrating how a channel problem can gain from a joint source/channel approach. We show that this strategy is asymptotically optimal in some limiting cases, and that it outperforms the known alternatives in most other cases, where the optimum is unknown. We also demonstrate how to improve the achievable rate in the original white problem, for some signal to noise ratio values.

1 December 2017
Verified
Conference Paper
Closed access
AKAnatoly Khina
Anatoly Khina
YNYorie Nakahira
Yorie Nakahira
YSYu Su
Yu Su
BHBabak Hassibi
Babak Hassibi
We consider a discrete-time linear quadratic Gaussian networked control setting where the (full information) observer and controller are separated by a fixed-rate noiseless channel. The minimal rate required to stabilize such a system has been well studied. However, for a given fixed rate, how to quantize the states so as to optimize performance is an open question of great theoretical and practical significance. We concentrate on minimizing the control cost for first-order scalar systems. To that end, we use the Lloyd-Max algorithm and leverage properties of logarithmically-concave functions to construct the optimal quantizer that greedily minimizes the cost at every time instant. By connecting the globally optimal scheme to the problem of scalar successive refinement, we argue that its gain over the proposed greedy algorithm is negligible. This is significant since the globally optimal scheme is often computationally intractable. All the results are proven for the more general case of disturbances with logarithmically-concave distributions.

1 June 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AKAnatoly Khina
Anatoly Khina
YKYuval Kochman
Yuval Kochman
AKAshish Khisti
Ashish Khisti
The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve this capacity. In this work, we use linear operations along with successive interference cancellation to attain effective parallel single-antenna wiretap channels. By using independent scalar Gaussian wiretap codebooks over the resulting parallel channels, the capacity of the MIMO wiretap channel is achieved. The derivation of the schemes is based upon joint triangularization of the channel matrices.We find that the same technique can be used to re-derive capacity expressions for the MIMO wiretap channel in a way that is simple and closely connected to a transmission scheme. This technique allows to extend the previously proven strong security for scalar Gaussian channels to the MIMO case. We further consider the problem of transmitting confidential messages over a two-user broadcast MIMO channel. For that problem, we find that derivation of both the capacity and a transmission scheme is a direct corollary of the proposed analysis for the MIMO wiretap channel.