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

  • Authors:
  • T. R. Fischer;Jianping Pan

  • Affiliations:
  • Sch. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA;-

  • Venue:
  • IEEE Transactions on Information Theory - Part 2
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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