Key points are not available for this paper at this time.
In this paper, we investigate a state estimation problem involving finite communication capacity constraints. Unlike classical estimation problems where the observation is a continuous process corrupted by additive noises, there is a constraint that the observations must be coded and transmitted over a digital communication channel with finite capacity. This problem is formulated mathematically, and some convergence properties are defined. Moreover, the concept of a finitely recursive coder-estimator sequence is introduced. A new upper bound for the average estimation error is derived for a large class of random variables. Convergence properties of some coder-estimator algorithms are analyzed. Various conditions connecting the communication data rate with the rate of change of the underlying dynamics are established for the existence of stable and asymptotically convergent coder-estimator schemes.
Building similarity graph...
Analyzing shared references across papers
Loading...
Wing Shing Wong
Chinese University of Hong Kong
R. Brockett
Harvard University
IEEE Transactions on Automatic Control
Harvard University
Chinese University of Hong Kong
Building similarity graph...
Analyzing shared references across papers
Loading...
Wong et al. (Wed,) studied this question.
synapsesocial.com/papers/6a20a3f32e0ff4ae796d891e — DOI: https://doi.org/10.1109/9.623096