On Optimal Zero-Delay Coding of Vector Markov Sources
نویسندگان
چکیده
منابع مشابه
Fixed-Rate Zero-Delay Source Coding for Stationary Vector-Valued Gauss-Markov Sources
We consider a fixed-rate zero-delay source coding problem where a stationary vector-valued Gauss-Markov source is compressed subject to an average mean-squared error (MSE) distortion constraint. We address the problem by considering the Gaussian nonanticipative rate distortion function (NRDF) which is a lower bound to the zero-delay Gaussian RDF. Then, we use its corresponding optimal “test-cha...
متن کاملOptimal Sequential Vector Quantization of Markov Sources
The problem of sequential vector quantization of a stationary Markov source is cast as an equivalent stochastic control problem with partial observations. This problem is analyzed using the techniques of dynamic programming, leading to a characterization of optimal encoding schemes.
متن کاملOn zero-error coding of correlated sources
The problem of separate zero-error coding of correlated sources is considered. Inner and outer single-letter bounds are established for the achievable rate region, and conditions for their coincidence are investigated. It is shown that successive encoding combined with time sharing is not always an optimal coding strategy. Conditions for its optimality are derived. The inner bound to the achiev...
متن کاملOn asymptotically optimal methods of prediction and adaptive coding for Markov sources with unknown memory
We consider the problem of predicting a sequence x1x2 . . . generated by a discrete source with unknown statistics. Each letter xt+1 is predicted using information on the word x1x2 . . . xt only. To estimate the efficiency of a method of prediction, three quantities are considered: the precision as given by the Kullback-Leibler divergence, the memory size of the program needed to implement the ...
متن کاملOn Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources
The problem of predicting a sequence x1, x2, ... generated by a discrete source with unknown statistics is considered. Each letter xt+1 is predicted using information on the word x1x2 · · · xt only. In fact, this problem is a classical problem which has received much attention. Its history can be traced back to Laplace. To estimate the efficiency of a method of prediction, three quantities are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2346780