• DocumentCode
    1254427
  • Title

    On limited-delay lossy coding and filtering of individual sequences

  • Author

    Weissman, Tsachy ; Merhav, Neri

  • Author_Institution
    Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
  • Volume
    48
  • Issue
    3
  • fYear
    2002
  • fDate
    3/1/2002 12:00:00 AM
  • Firstpage
    721
  • Lastpage
    733
  • Abstract
    We continue the study of adaptive schemes for the sequential lossy coding of individual sequences which was initiated by Linder and Lugosi (see ibid., p.2533-38, 2001). Specifically, we consider fixed-rate lossy coding systems of fixed (or zero) delay where the encoder (which is allowed to use randomization) and the decoder are connected via a noiseless channel of a given capacity. It is shown that for any finite set of such coding schemes of a given rate, there exists a source code (adhering to the same structural and delay limitations) with the same rate whose distortion is with high probability almost as small as that of the best scheme in that set, uniformly for all individual sequences. Applications of this result to reference classes of special interest are outlined. These include the class of scalar quantizers, trellis encoders with sliding block decoders, and differential pulse code modulator (DPCM)-based source codes. In particular, for the class of all scalar quantizers, a source code is obtained with (normalized) distortion redundancy relative to the best scheme in the reference class of order n -1/3 log n (where n is the sequence length). This improves the n-1/5 log n rate achieved by Linder and Lugosi. More importantly, the decoder here is deterministic and, in particular, does not assume a common randomization sequence available at both encoder and decoder. Finally, we consider the case where the individual sequence is corrupted by noise prior to reaching the coding system, whose goal now is to reconstruct a sequence with small distortion relative to the clean individual sequence. It is shown that for the case of a finite alphabet and an invertible channel transition probability matrix, for any finite set of sliding-window schemes of a given rate, there exists a source code (allowed to use randomization yet adhering to the same delay constraints) whose performance is, with high probability, essentially as good as the best scheme in the class, for all individual sequences
  • Keywords
    channel capacity; delays; differential pulse code modulation; filtering theory; matrix algebra; probability; quantisation (signal); rate distortion theory; sequences; source coding; trellis codes; DPCM; adaptive coding; decoder; delay constraints; differential pulse code modulator; filtering; fixed delay; fixed-rate lossy coding systems; invertible channel transition probability matrix; limited-delay lossy coding; noiseless channel; normalized distortion redundancy; probability; randomization sequence; rate distortion; scalar quantizers; sequences; sequential lossy coding; sliding block decoders; source code; trellis encoders; Code standards; Decoding; Delay; Filtering; Helium; Modulation coding; Neural networks; Pulse modulation; Rate distortion theory; Source coding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.986015
  • Filename
    986015