The source coding theorem for stationary sources describes the optimal performance theoretically achievable by fixed- and variable-rate block quantizers. The source coding theorem may be generalized by considering the problem of multiresolution or successive refinement source coding, which is the topic of this work. Given a distortion vector (D/sub 1/,...,D/sub L/), this work describes the family of achievable rate vectors (R/sub 1/,...,R/sub L/) for describing a stationary source at L resolutions, where the description at the first resolution is given at rate R/sub 1/ and achieves an expected distortion no greater than D/sub 1/, the description at the second resolution includes both the first description and a refining description of rate R/sub 2/ and achieves expected distortion no greater than D/sub 2/, and so on. The work includes performance bounds for both fixed- and variable-rate source codes on discrete-time stationary ergodic sources and discrete-time stationary nonergodic sources for any integer number of resolutions L/spl ges/1. For L=1, the source coding theorems for stationary sources result. For L<1, the results extend previous theorems for discrete-alphabet memoryless sources.
展开▼
机译：固定源的源编码定理描述了固定速率和可变速率块量化器理论上可实现的最佳性能。源编码定理可以通过考虑多分辨率或逐次细化源编码的问题来推广，这是本工作的主题。给定一个失真矢量（D / sub 1 /，...，D / sub L /），这项工作描述了可实现的速率矢量族（R / sub 1 /，...，R / sub L /），用于描述一个L分辨率的固定源，其中以R / sub 1 /的速率给出第一分辨率的描述，并且实现不大于D / sub1 //的预期失真，第二分辨率的描述包括第一描述和a细化速率R / sub 2 /的描述，并实现不大于D / sub 2 /的预期失真，依此类推。这项工作包括在离散整数固定分辨率L / splges / 1下，固定时间和可变速率源代码在离散时间固定遍历源和离散时间固定非遍历源上的性能范围。对于L = 1，将得出固定源的源编码定理。对于L <1，结果扩展了离散字母无记忆源的先前定理。
展开▼
