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

LDPC codes for compression of multi-terminal sources with hidden Markov correlation

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)
Garcia-Frias, J. ; Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA ; Wei Zhong

We propose the use of low-density parity-check (LDPC) codes for compression of memory correlated binary sources. The correlation model between the sources is defined by a hidden Markov model. The resulting performance is close to the theoretical Slepian-Wolf (1973) limit. No information about the sources statistics is required in the encoding process.

Published in:

Communications Letters, IEEE  (Volume:7 ,  Issue: 3 )

Date of Publication:

March 2003

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.