CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources

by Raghunadh K Bhattar, K R Ramakrishnan, K S Dasgupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 8
Year of Publication: 2010
Authors: Raghunadh K Bhattar, K R Ramakrishnan, K S Dasgupta
10.5120/1274-1794

Raghunadh K Bhattar, K R Ramakrishnan, K S Dasgupta . Article:Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources. International Journal of Computer Applications. 7, 8 ( October 2010), 1-7. DOI=10.5120/1274-1794

@article{ 10.5120/1274-1794,
author = { Raghunadh K Bhattar, K R Ramakrishnan, K S Dasgupta },
title = { Article:Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 7 },
number = { 8 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume7/number8/1274-1794/ },
doi = { 10.5120/1274-1794 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:55:46.347392+05:30
%A Raghunadh K Bhattar
%A K R Ramakrishnan
%A K S Dasgupta
%T Article:Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources
%J International Journal of Computer Applications
%@ 0975-8887
%V 7
%N 8
%P 1-7
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the density evolution technique indicate that the conditional entropy H(X/Y) is nearly constant with source distribution. This feature is useful in calculating the threshold values for any given source distribution analytically. This special feature is true for only LDPC codes. Several well known LDPC codes, both regular and irregular are critically analyzed using density evolution technique. This analysis reveals that the capacity approaching LDPC codes with respect to error correction codes do indeed approach the Slepian-Wolf bound for nonuniform sources as well. The threshold values show that the nonuniform source can be compressed to near about 0.01bits/sample away from Slepian-Wolf bound even for highly decorrelated side information.

References
  1. D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources”, in IEEE Trans on Information Theory, Vol. 19, No. 4 July 1973, pp: 471-480.
  2. A. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder”, in IEEE trans on Information Theory, Vol. 22, No. 1, Jan 1976, pp: 1-10.
  3. S. S. Pradhan and K. Ramachandran, “ Distributed source coding using syndromes (DISCUS): Design and construction”, in IEEE Trans on Information Theory, Vol. 49, No. 3, March 2003, pp: 626-634.
  4. J. Kroll and N. Phamdo, “Source-channel optimized trellis codes for bi-tonal image transmission over awgn channels” in IEEE Trans on Image Processing, July 1999, pp: 899-912.
  5. Jing Li, Zhenyu Tu and Rick S Blum, “Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes” in Proceedings of IEEE Data Compression Conference (DCC) pp : 312-321, Snowbird, UT, March 2004.
  6. V Toto Zarasoa, et.al., “On Distributed Arithmetic Codes and Syndrome Based Turbo Codes for Slepian-Wolf Coding of Nonuniform Sources”, in 17th EuropeanSignal Processing Conference (EUSIPCO 2009), Glasgow, Scotland, Aug 24-28, 2009.
  7. Grangetto M, et al., “Distributed Arithmetic Coding for the Slepian-Wolf Problem”, in IEEE Trans on Signal Processing , Vol. 57, No. 6, June 2009, pp: 2245-2257.
  8. Berrou C, Glavieux A and Thitimajshima, P, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes” in IEEE Proceedings of the Int. Conf. on Communications, Geneva, Switzerland, May 1993 (ICC 1993) pp. 1064-1070.
  9. A.D.Liveris, Z. Xiog and C.N. Georghiades, “Compression of Binary Sources With Side Information at the Decoder Using LDPC Codes”, in IEEE Communications Letters, Vol. 6, No. 10, Oct 2002, pp: 440-442.
  10. William E Ryan, “An Introduction to LDPC Codes”, available online www.ece.arizona.edu/ ~ryan/publications/ldpcchap.pdf.
  11. T. J. Richardson and R. L. Urbanke, “The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding”, in IEEE Trans on Information Theory, Vol. 47, No. 2 Feb 2001, pp: 599-618.
  12. S. Y. Chung, “On the Construction of Some Capacity-Approaching Coding Schemes” PhD Thesis MIT, Sept 2000.
  13. S. Y. Chung, G. D. Forney, T. J. Richardson and R. L. Urbanke, “On Design of Low-Density Parity-Check Codes within 0.0045 dB form Shannon Limit”, in IEEE Comm. Letters, Vol, 5, No. 2, Feb 2001, pp: 58-60.
  14. T. J. Richardson, M. A. Shokrollahi and R. L. Urbanke, “Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes”, in IEEE Trans on Information Theory, Vol. 47, No.2 Feb 2001, pp:619-637.
Index Terms

Computer Science
Information Sciences

Keywords

LDPC Nonuniform Source Slepian-Wolf Coding Density Evolution DSC

Powered by PhDFocusTM