• DocumentCode
    1087248
  • Title

    Enumeration encoding and decoding algorithms for pyramid cubic lattice and trellis codes

  • Author

    Fischer, Thomas R. ; Pan, Jianping

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA
  • Volume
    41
  • Issue
    6
  • fYear
    1995
  • fDate
    11/1/1995 12:00:00 AM
  • Firstpage
    2056
  • Lastpage
    2061
  • Abstract
    A pyramid source code is a code that assigns equal-length binary strings to all reproduction codevectors of equal (weighted) ε1 norm. A pyramid source encoding is partitioned into two concatenated mappings; the first from source word to reproduction codeword within a codebook; the second from the reproduction codevector to a binary string. The first mapping allows distortion and is accomplished using lattice quantization or trellis-coded quantization. The second mapping is noiseless and is denoted as enumeration. Efficient pyramid enumeration encoding and decoding algorithms are presented, for use with fixed-rate or variable-rate pyramid lattice and trellis codes
  • Keywords
    concatenated codes; decoding; source coding; trellis codes; binary string; binary strings; concatenated mappings; distortion; fixed-rate codes; lattice quantization; pyramid cubic lattice codes; pyramid enumeration decoding algorithms; pyramid enumeration encoding algorithms; pyramid source code; reproduction code-vectors; reproduction codevector; reproduction codeword; source word; trellis codes; trellis-coded quantization; variable-rate codes; Concatenated codes; Convolutional codes; Decoding; Discrete transforms; Encoding; Image coding; Laplace equations; Lattices; Partitioning algorithms; Quantization;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.476336
  • Filename
    476336