By Topic

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
$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)
J. Garcia-Frias ; 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:

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