On causal coding of markovian sources with general alphabets

Serdar Yüksel, Tamer Başar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the structure of optimal causal encoder for a kth order Markovian source, minimizing the total rate subject to a mean-square distortion constraint. In our setup, the source has a general alphabet and the encoder is allowed to be variable-rate. This leads to an optimization problem in an infinite-dimensional space, for which we prove the existence of a solution. We further show that, for k > 1, the optimal causal encoder for a kth order Markovian source uses only the last k source symbols and the information available at the receiver. For k = 0, however, the optimal causal encoder is memoryless. We also consider the infinite-horizon problem, and provide an existence result for an optimal stationary solution. We further show that for coding of a linear source, the quantization of the innovation is an almost optimal scheme in the limit of low-distortion.

Original languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
Pages4927-4932
Number of pages6
StatePublished - Dec 1 2006
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other45th IEEE Conference on Decision and Control 2006, CDC
CountryUnited States
CitySan Diego, CA
Period12/13/0612/15/06

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'On causal coding of markovian sources with general alphabets'. Together they form a unique fingerprint.

Cite this