Optimal causal quantization of Markov Sources with distortion constraints
Optimal causal quantization of Markov Sources with distortion constraints
复制标题
具有失真约束的马尔可夫源的最优因果量化
DOI:
--
复制
发表时间:
2008
期刊:
影响因子:
--
通讯作者:
S. Meyn
中科院分区:
文献类型:
--
作者:
S. Yuksel;T. Başar;S. Meyn
For Markov sources, the structure of optimal causal encoders minimizing the total communication rate subject to a mean-square distortion constraint is studied. The class of sources considered lives in a continuous alphabet, and the encoder is allowed to be variable-rate. Both the finite-horizon and the infinite-horizon problems are considered. In the finite-horizon case, the problem is non-convex, whereas in the infinite-horizon case the problem can be convexified under certain assumptions. For a finite horizon problem, the optimal deterministic causal encoder for a kth-order Markov source uses only the most recent k source symbols and the information available at the receiver, whereas the optimal causal coder for a memoryless source is memoryless. For the infinite-horizon problem, a convex-analytic approach is adopted. Randomized stationary quantizers are suboptimal in the absence of common randomness between the encoder and the decoder. If there is common randomness, the optimal quantizer requires the randomization of at most two deterministic quantizers. In the absence of common randomness, the optimal quantizer is non-stationary and a recurrence-based time-sharing of two deterministic quantizers is optimal. A linear source driven by Gaussian noise is considered. If the process is stable, innovation coding is almost optimal at high-rates, whereas if the source is unstable, then even a high-rate time-invariant innovation coding scheme leads to an unstable estimation process.