By Topic

On the redundancy of universal trellis lossy source coding

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
$31 $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)
Jun Yang ; Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA ; Zhen Zhang

In this paper, we construct an adaptive entropy coded trellis lossy source coding coding scheme for memoryless sources. The scheme utilizes a fully connected trellis with a set of fixed-rate state codebooks and adaptive probability mass function for the codewords. Since the usage frequency of each codeword is known at the decoder, no overhead is necessary for adapting the probabilities mass functions of the codebooks. Thus, using recent redundancy result in trellis coding [G.-C. Zhou et al., 2002] and universal random block codes designed in [E.-H. Yang et al., 2001], we show that the proposed coding scheme is universal and its redundancy is also of the form O(1/n), which is the same order as that of trellis source coding with known statistics.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003