The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniques over networked systems. One important example consists in the remote state estimation under communication constraints. In this case, an anytime transmission scheme consists of an encoder—which maps the real vector into a sequence of channel inputs—and a decoder—which sequentially updates its estimate of the vector as more and more channel outputs are observed. The encoder performs both source and channel coding of the data. Assuming that no channel feedback is available at the transmitter, this paper studies the rates of convergence to zero of the mean squared error. Two coding strategies are analyzed: the first one has exponential convergence rate but is expensive in terms of its encoder/decoder computational complexity, while the second one has a convenient computational complexity but subexponential convergence rate. General bounds are obtained describing the convergence properties of these classes of methods.

Anytime reliable transmission of real-valued information through digital noisy channels

ZAMPIERI, SANDRO
2010

Abstract

The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniques over networked systems. One important example consists in the remote state estimation under communication constraints. In this case, an anytime transmission scheme consists of an encoder—which maps the real vector into a sequence of channel inputs—and a decoder—which sequentially updates its estimate of the vector as more and more channel outputs are observed. The encoder performs both source and channel coding of the data. Assuming that no channel feedback is available at the transmitter, this paper studies the rates of convergence to zero of the mean squared error. Two coding strategies are analyzed: the first one has exponential convergence rate but is expensive in terms of its encoder/decoder computational complexity, while the second one has a convenient computational complexity but subexponential convergence rate. General bounds are obtained describing the convergence properties of these classes of methods.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2428682
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 36
  • ???jsp.display-item.citation.isi??? 27
social impact