Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Analysis on crossover probability estimation using LDPC syndrome

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Correlation estimation is a critical issue that impacts the application of Slepian-Wolf coding (SWC) in practice. Dynamic online correlation estimation is a type of newly-appearing approaches, in which the decoder estimates the virtual correlation channel between two correlated sources using both side information and the compressed SWC bitstream of the source. Since the compressed SWC bitstream usually contains partial information of the source, the emergence of dynamic online correlation estimation is helpful to solving the problem of correlation estimation in the SWC and further makes the SWC realisable. Currently, the SWC is usually implemented by LDPC codes. In this case, the SWC bitstream is just the LDPC syndrome of the source. It has been revealed that there are residual redundancies in LDPC syndromes, which can be used to estimate the crossover probability between two correlated binary sequences. However, this algorithm has not been well justified yet. This paper makes use of the central limit theorem (CLT) to establish a mathematic model for analyzing the performance of this algorithm. Especially, for irregular LDPC codes, the optimization of weight vectors is discussed in detail. Representative experimental results are provided to validate the analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Slepian D, Wolf J K. Noiseless coding of correlated information sources. IEEE Trans Inf Theory, 1973, 19: 471–480

    Article  MathSciNet  MATH  Google Scholar 

  2. Wyner A, Ziv J. The rate-distortion function for source coding with side information at the decoder. IEEE Trans Inf Theory, 1976, 22: 1–10

    Article  MathSciNet  MATH  Google Scholar 

  3. Xiong Z, Liveris A, Cheng S. Distributed source coding for sensor networks. IEEE Signal Process Mag, 2004, 21: 80–94

    Article  Google Scholar 

  4. Garcia-Frias J, Zhao Y. Compression of correlated binary sources using turbo codes. IEEE Commun Lett, 2001, 5: 417–419

    Article  Google Scholar 

  5. Liveris A, Xiong Z, Georghiades C. Compression of binary sources with side information at the decoder using LDPC codes. IEEE Commun Lett, 2002, 6: 440–442

    Article  Google Scholar 

  6. Fang Y. Distribution of distributed arithmetic codewords for equiprobable binary sources. IEEE Signal Process Lett, 2009, 16: 1079–1082

    Article  Google Scholar 

  7. Guillemot C, Pereira F, Torres L, et al. Distributed monoview and multiview video coding. IEEE Signal Process Mag, 2007, 24: 67–76

    Article  Google Scholar 

  8. Fang Y, Jeong J. Correlation parameter estimation for LDPC-based Slepian-Wolf coding. IEEE Commun Lett, 2009, 13: 67–76

    Google Scholar 

  9. Brites C, Pereira F. Correlation noise modeling for efficient pixel and transform domain Wyner-Ziv video coding. IEEE Trans Circuits Syst Video Technol, 2008, 18: 1177–1190

    Article  Google Scholar 

  10. Cheung N M, Wang H S, Ortega A. Sampling-based correlation estimation for distributed source coding under rate and complexity constraints. IEEE Trans Image Process, 2008, 17: 2122–2137

    Article  MathSciNet  Google Scholar 

  11. Slowack J, Mys S, Skorupa J, et al. Accounting for quantization noise in online correlation noise estimation for distributed video coding. In: Proc IEEE Picture Coding Symposium, Chicago, USA, 2009. 37-40

  12. Fang Y. Crossover probability estimation using mean-intrinsic-LLR of LDPC syndrome. IEEE Commun Lett, 2009, 13: 67–76

    Google Scholar 

  13. Fang Y, Jeon G, Jeong J. Rate-adaptive compression of LDPC syndromes for Slepian-Wolf coding. In: Proc IEEE Picture Coding Symposium, Chicago, USA, 2009. 341–344

  14. Grangetto M, Magli E, Olmo G. Decoder-driven adaptive distributed arithmetic coding. In: Proc IEEE Int Conf Image Processing, San Diego, USA, 2008. 1128-1131

  15. Girod B, Aaron A, Rane S, et al. Distributed video coding. Proc IEEE, 2005, 93: 71–83

    Article  Google Scholar 

  16. Varodayan D, Aaron A, Girod B. Rate-adaptive codes for distributed source coding. Signal Process, 2006, 86: 3123–3130

    Article  MATH  Google Scholar 

  17. Wang J, Milstein L B. CDMA overlay situations for microcellular mobile communications. IEEE Trans Commun, 1995, 43: 603–614

    Article  Google Scholar 

  18. Gallager R. Low-density parity-check codes. IRE Trans Inf Theory, 1962, 8: 21–28

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Fang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, Y. Analysis on crossover probability estimation using LDPC syndrome. Sci. China Inf. Sci. 54, 1895–1904 (2011). https://doi.org/10.1007/s11432-011-4311-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4311-y

Keywords