Real-time Estimation of a Markov Process Over a Noisy Digital Communication Channel

Qing Xu and Raja Sengupta

Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley

Abstract: We study the real-time estimation of a Markov process over a memoryless noisy digital communication channel. The goal of system design is to minimize the mean squared estimation error. We first show the optimal encoder and decoder can be memoryless in terms of the source symbols. We then prove the optimal encoder separates the real space with hyperplanes. In the case of the binary symmetric channel and scalar source, the optimal encoder can be a threshold. A recursive algorithm is given to jointly find a locally optimal encoder and decoder for the binary symmetric channel. For a memoryless Gaussian vector source and a binary symmetric channel, we show the optimal policy is to encode the principal component. We derive the minimum mean squared error as a function of the variance of source and the channel noise.

Keywords: Engineering (search for similar items in EconPapers)
Date: 2005-11-01
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/9zw067v1.pdf;origin=repeccitec (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cdl:itsrrp:qt9zw067v1

Access Statistics for this paper

More papers in Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().