Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Design of trellis codes for source coding with side information at the decoder

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)
Xin Wang ; Dept. of Electr. Eng., Princeton Univ., NJ, USA ; Orchard, M.T.

The problem of source coding with side information at the decoder arises in many practical scenarios. Although this problem has been well characterized in information theory, particularly by the work of Wyner and Ziv (1976), there is still lack of successful algorithms for it. In this paper, we use trellis codes to approach the theoretical limit. An embedded trellis code structure is proposed, and its properties are examined. Using this structure, we can achieve the granular gain at the encoder as well as the coding gain at the decoder. Simulation results show that the proposed scheme outperforms the algorithms reported in the literature. It is also indicated that the performance of the proposed algorithm can approach the information-theoretic limit at high rate as the trellis complexity increases

Published in:

Data Compression Conference, 2001. Proceedings. DCC 2001.

Date of Conference:

2001