By Topic

Simulation study of LDPC codes for nonuniform sources with side information in Slepian-Wolf coding

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

3 Author(s)
Bhattar, R.K. ; EE Dept., Indian Inst. of Sci., Bangalore, India ; Ramakrishnan, K.R. ; Dasgupta, K.S.

The principles of distributed source coding or Slepian-Wolf coding, primarily employed for compression of correlated sources with side information, can also be used for reducing the encoder complexity of a single source. This effectively shifts the encoder complexity to the decoder. This exchange of computational complexities has opened up the door for many applications in wireless video and image communications. Till now, most of the research efforts are concentrated around compression of correlated sources which are uniformly distributed. But nonuniform sources are not uncommon in real world. In this paper, we have studied and demonstrated the suitability and optimality of LDPC syndrome codes for distributed source coding of nonuniform sources using Monte-Carlo simulation. Our study reveals that several capacity approaching LDPC codes, indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte-Carlo simulation results show that, highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.

Published in:

Communications (NCC), 2010 National Conference on

Date of Conference:

29-31 Jan. 2010