By Topic

Lossy distributed source coding using graphs

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

1 Author(s)
Suhan Choi ; was with the Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA. He is now with Samsung Electronics, South Korea (e-mail: suhanc@umich.edu).

In this letter, lossy distributed source coding using graphs is considered. This corresponds to the source coding part of the graph-based framework for transmission of analog correlated sources over the multiple-access channel (MAC). Consequently, it is shown that a pair of analog correlated sources can be reliably represented into a bipartite graph by allowing certain amount of distortion. An achievable rate-distortion region for this problem is also provided. Therefore, it can be concluded that, for transmission of any (both discrete and continuous) set of correlated sources over MACs, graphs can be used as discrete interface between source coding and channel coding modules.

Published in:

IEEE Communications Letters  (Volume:13 ,  Issue: 4 )