Cart (Loading....) | Create Account
Close category search window

Data compression of correlated non-binary sources using punctured turbo 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
$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)
Ying Zhao ; Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA ; Garcia-Frias, J.

We consider the case of two correlated non-binary sources. Data compression is achieved by transforming the sequences of non-binary symbols into sequences of bits and then using punctured turbo codes as source encoders. Each source is compressed without knowledge about the other source, and no information about the correlation between sources is required in the encoding process. Compression is achieved because of puncturing, which is adjusted to obtain the desired compression rate. The source decoder utilizes iterative schemes over the compressed binary sequences, and recovers the non-binary symbol sequences from both sources. The performance of the proposed scheme is close to the theoretical limit predicted by the Slepian-Wolf (1973) theorem.

Published in:

Data Compression Conference, 2002. Proceedings. DCC 2002

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.