Skip to main content
SpringerLink
Log in

Pilot Symbol Based Fixed Bipartite Graph Rate Adaptable Codes for Distributed Video Coding

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The Distributed Video Coding with correlated side information for Quarter Common Interface Format (QCIF) was considered for the implementation presented in this paper. The size of the QCIF video was used to develop the Short length progressive Edge Growth codes. A novel pilot symbol based rate compatible code with same Bipartite graph for all rates is proposed. The pilot symbol algorithm makes the computation of the punctured nodes deterministic and one time process. The insertion of pilot symbols converts the parallel virtual channel to a uniform channel, thereby improves the decoding performance. The proposed solution reduces the complexity of the encoder by 25 % and decoder by a factor of 20–40 %. The performance analysis is also done for non-uniform sources as most of the practical data falls into non-uniform distribution.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Ostermann, J., Bormans, J., List, P., Marpe, D., Narroschke, M., Pereira, F., et al. (2004). Video coding with H.264/AVC: Tools, performance, and complexity. IEEE Circuits and System Magazine, 4(1), 7–28.

    Article  Google Scholar 

  2. Pradhan, S., & Ramchandran, K. (2003). Distributed source coding using syndromes (DISCUS): Design and construction. IEEE Transactions on Information Theory, 49(3), 626–643.

    Article  MathSciNet  MATH  Google Scholar 

  3. Girod, B., Aaron, A., Rane, S., & Rebollo-Monedero, D. (2005). Distributed video coding. Proceedings of the IEEE, 93(1), 71–83.

    Article  Google Scholar 

  4. Kilic, I., & Yilmaz, R. (2009). A hybrid video compression based on zero tree wavelet structure. Arabian Journal for Science and Engineering, 34(1B), 184.

    Google Scholar 

  5. Slepian, D., & Wolf, J. (1973). Noiseless coding of information sources. IEEE Transactions on Information Theory, 19(4), 471–480.

    Article  MathSciNet  MATH  Google Scholar 

  6. Wyner, A., & Ziv, J. (1996). The rate distortion functions for source encoding with side information at the decoder. IEEE Transactions on Information Theory, 22(1), 1–10.

    Article  MathSciNet  Google Scholar 

  7. Chen, J., He, D., & Jagmohan, A. (2009). The equivalence between Slepian–Wolf coding and channel coding under density evolution. IEEE Transactions on Communications, 57(9), 2534–2540.

    Article  MathSciNet  Google Scholar 

  8. Chen, J., He, D., & Jagmohan, A. (2006). Slepian–Wolf code design via source-channel correspondence. In Proceedings of IEEE international symposium on information theory, Seattle, WA (pp. 2433–2437).

  9. Chung, S.-Y., David Forney, G., Richardson, J., & Rudiger Urbanke, T. J. (2001). On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Communications Letters, 5(2), 58–60.

    Article  Google Scholar 

  10. Luby, M. (2002). LT Codes. In: 43rd IEEE symposium on foundations of computer science.

  11. Lee, D., & Song, H. (2011). A robust luby transform encoding pattern-aware symbol packetization algorithm for video streaming over wireless network. IEEE Transactions on Multimedia, 13(4), 788–796.

    Article  Google Scholar 

  12. Ha, J., Kim, J., & McLaughlin, S. W. (2004). Rate-compatible puncturing of low-density parity-check code. IEEE Transactions on Information Theory, 50(11), 2824–2836.

    Article  MathSciNet  MATH  Google Scholar 

  13. Ha, J., & McLaughlin, S. W.. (2003). Optimal puncturing of irregular low density parity-check codes. In Proceedings of IEEE international conference on communications, Anchorage, AK (vol. 5, pp. 3110–3114).

  14. Liu, Z., Cheng, S., Liveris, A., & Xiong, Z. (2006). Slepian–Wolf coded nested lattice quantization for Wyner–Ziv coding: High-rate performance analysis and code design. IEEE Transactions on Information Theory, 52(x), 4358–4379.

    MathSciNet  Google Scholar 

  15. Qian, X., Stankovi’, V., & Xiong, Z. (2007). Distributed joint source-channel coding of video using Raptor codes. IEEE Journal on Selected Areas in Communication, 25(4), 851–861.

    Article  Google Scholar 

  16. Varodayan, D., Lin, Y.-C., & Girod, B. (2012). Adaptive distributed source coding. IEEE Transactions on Image Processing, 21(5), 2630–2640.

    Article  MathSciNet  Google Scholar 

  17. Varodayan, D., Aaron, A., & Girod, B. (2005). Rate-adaptive distributed source coding using low-density parity-check codes. In Proceedings of IEEE 39th Asilomar conference on signal, system and computers (pp. 1203–1207).

  18. Jang, M., Kang, J. W., & Kim, S.-H. (2010). A Design of rate-adaptive LDPC codes for distributed source coding using PEG algorithm. In Proceedings of military communications conference, San Jose, CA (pp. 277–282).

  19. Jiang, J., He, D., & Jagmohan, A. (2007) Rateless Slepian–Wolf coding based on rate adaptive low-density-parity-check codes. In Proceedings of IEEE international symposium on Information theory, Nice, France, Jun 24–29 (pp. 1316–1320).

  20. He, D., Jagmohan, A., Lu, L., & Sheinin, V. (2008). Wyner–Ziv video compression using rateless LDPC codes. In Proceedings of SPIE visual communications and image processing, San Jose, CA, Jan 27–28. doi:10.1117/12.766699.

  21. Pishro-Nik, H., & Fekri, F. (2007). Results on punctured LDPC codes and improved iterative decoding. IEEE Transactions on Information Theory, 53(2), 599–614.

    Article  MathSciNet  Google Scholar 

  22. Richardson, T., & Urbanke, R. (2008). Modern coding theory. New York: Cambridge University Press.

    Book  MATH  Google Scholar 

  23. Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5), 533–547.

    Article  MathSciNet  MATH  Google Scholar 

  24. Liveris, A., Xiong, Z., & Georghiades, C. (2002). Compression of binary sources with side information at the decoder using LDPC codes. IEEE Communications Letters, 6(10), 440–442.

    Article  Google Scholar 

  25. LTHC: LdpcOpt (2001). http://lthcwww.epfl.ch/research/ldpcopt.

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication Engineering, Sethu Institute of technology, Virudhunagar, India

    N. M. Masoodhu Banu

  2. Department of Electronics and Communication Engineering, R.M.D Engineering College, Gummudipoondi Taluk, Thiruvallur District, Chennai, India

    S. Sasikumar

Authors
  1. N. M. Masoodhu Banu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Sasikumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. M. Masoodhu Banu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Masoodhu Banu, N.M., Sasikumar, S. Pilot Symbol Based Fixed Bipartite Graph Rate Adaptable Codes for Distributed Video Coding. Wireless Pers Commun 79, 1145–1161 (2014). https://doi.org/10.1007/s11277-014-1922-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-1922-9

Keywords

Search

Navigation