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

02/02/2019
by   Amir Saberi, et al.
0

Worst-case models of erasure and symmetric channels are investigated, in which the number of channel errors occurring in each sliding window of a given length is bounded. Upper and lower bounds on their zero-error capacities are derived, with the lower bounds revealing a connection with the topological entropy of the channel dynamics. Necessary and sufficient conditions for linear state estimation with bounded estimation errors via such channels are then obtained, by extending previous results for non-stochastic memoryless channels to those with finite memory. These estimation conditions involve the topological entropies of the linear system and the channel.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2020

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...
research
08/09/2021

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

It is known that for a discrete channel with correlated additive noise, ...
research
02/09/2020

Distributed State Estimation with Bounded Errors over Multiple Access Channels

Although state estimation in networked control systems is a fundamental ...
research
01/10/2020

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels

This paper studies the capacities of input-driven finite-state channels,...
research
10/15/2022

Encoding subshifts through sliding block codes

We prove a generalization of Krieger's embedding theorem, in the spirit ...
research
02/20/2021

Symbol-Level Synchronisation Channel Modelling With Real-World Application: From Davey-Mackay, Fritchman to Markov

Errors in realistic channels contain not only substitution errors, but s...
research
02/01/2023

Agility and Target Distribution in the Dynamic Stochastic Traveling Salesman Problem

An important variant of the classic Traveling Salesman Problem (TSP) is ...

Please sign up or login with your details

Forgot password? Click here to reset