By Topic

Near rate-distortion bound performance of sparse matrix 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

1 Author(s)
Murayama, T. ; NTT Commun. Sci. Labs., Nippon Telegraph & Telephone Corp., Kansai Science City, Japan

We study an ill-posed linear inverse problem, where a binary sequence will be reproduced using a sparse matrix of LDPC type. We propose an iterative algorithm based on belief propagation technique. Numerical results show that the algorithm can empirically saturate the theoretical limit for the sparse construction of our codes, which also is very close to the rate-distortion function itself.

Published in:

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference:

27 June-2 July 2004