CaltechAUTHORS
  A Caltech Library Service

Distortion-rate bounds for fixed- and variable-rate multiresolution source codes

Effros, Michelle (1999) Distortion-rate bounds for fixed- and variable-rate multiresolution source codes. IEEE Transactions on Information Theory, 45 (6). pp. 1887-1910. ISSN 0018-9448. doi:10.1109/18.782109. https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99

[img]
Preview
PDF
See Usage Policy.

946kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99

Abstract

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 (D1,...,DL), this work describes the family of achievable rate vectors (R1,...,RL) for describing a stationary source at L resolutions, where the description at the first resolution is given at rate R1 and achieves an expected distortion no greater than D1, the description at the second resolution includes both the first description and a refining description of rate R2 and achieves expected distortion no greater than D2, 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⩾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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/18.782109DOIUNSPECIFIED
Additional Information:© Copyright 1999 IEEE. Reprinted with permission. Manuscript received April 29, 1998; revised March 1, 1999. This work was supported in part by NSF under Grant MIP-9501977 and under a Grant from the Charles Lee Powell Foundation. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, MA, August 16–21, 1998.
Subject Keywords:Embedded, ergodic and nonergodic source coding theorems, multiuser information theory, progressive transmission, successive refinement, source coding theory, network information theory
Issue or Number:6
DOI:10.1109/18.782109
Record Number:CaltechAUTHORS:EFFieeetit99
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6240
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:29 Nov 2006
Last Modified:08 Nov 2021 20:32

Repository Staff Only: item control page