By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. R. Fischer ; Sch. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA ; Jianping Pan

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

Published in:

IEEE Transactions on Information Theory  (Volume:41 ,  Issue: 6 )