Zero-Error Feedback Capacity of Finite-State Additive Noise Channels for Stabilization of Linear Systems

by   Amir Saberi, et al.

It is known that for a discrete channel with correlated additive noise, the ordinary capacity with or without feedback is equal log q-ℋ_ch, where ℋ_ch is the entropy rate of the noise process and q is the alphabet size. In this paper, for a class of finite-state additive noise channels, it is shown that the zero-error feedback capacity is either zero or C_0f =log q -h_ch, where h_ch is the topological entropy of the noise process. A topological condition is given to determine when the zero-error capacity with or without feedback is zero. We explicitly compute C_0f for several examples, including channels with isolated errors and a Gilbert-Elliot channel. Furthermore, the zero-error feedback capacity of a general channel model is revisited and uniform zero-error feedback codes are introduced. It is revealed that there is a close connection between zero-error communication and control of linear systems with bounded disturbances. A necessary and sufficient condition for stabilization of unstable linear systems over general channels with memory is obtained, assuming no state information at either end of the channel. It is shown that C_0f is the figure of merit for determining when bounded stabilization is possible. This leads to a "small-entropy theorem", stating that stabilization over finite-state additive noise channels can be achieved if and only if the sum of the topological entropies of the linear system and the channel is smaller than log q.



There are no comments yet.


page 1


An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise Channels

It is known that for a discrete channel with correlated additive noise, ...

Bounded state Estimation over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity

We investigate bounded state estimation of linear systems over finite-st...

State Estimation over Worst-Case Erasure and Symmetric Channels with Memory

Worst-case models of erasure and symmetric channels are investigated, in...

On the Semi-Decidability of Remote State Estimation and Stabilization via Noisy Communication Channels

We consider the task of remote state estimation and stabilization of dis...

On the entropy of coverable subshifts

A coloration w of Z^2 is said to be coverable if there exists a rectangu...

Distributed State Estimation with Bounded Errors over Multiple Access Channels

Although state estimation in networked control systems is a fundamental ...

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback

The zero-error capacity of state-dependent channels with noiseless feedb...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.