Log in

Application of LDPC Code Decoding Algorithm in Digital Watermarking

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

At present, while there are many conveniences in people’s lives, lots of problem have also appeared with the development of information technology. In order to solve the problem of increasingly serious intellectual property disputes, the research on digital watermarking is particularly important. Due to the digital watermarking for real-time requirement is not high. We improve the decoding algorithm in response to the oscillating iterative phenomenon that occurs during the LDPC code decoding algorithm; and the improved decoding algorithm has been introduced into the digital watermark technology. Finally, the simulation is realized through MATLAB, the results show that the improved LDPC code decoding algorithm significantly improves the robustness of digital watermarking obviously.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.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 includes VAT (Germany)

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

Similar content being viewed by others

REFERENCES

  1. Mackay, D.J.C., Near Shannon limit performance of low density parity check codes, Electron. Lett., 1997, vol. 40, no. 6, pp. 457–458.

    Article  Google Scholar 

  2. Cui, H., Lin, J., and Wang, Zh., Information storage bit-flip** decoder for LDPC codes, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2020, vol. 28, no. 11, pp. 2464–2468.  https://doi.org/10.1109/TVLSI.2020.3009270

    Article  Google Scholar 

  3. Oh, J., Han, S., and Ha, J., An improved symbol-flip** algorithm for nonbinary LDPC Codes and its application to NAND flash memory, IEEE Trans. Magn., 2019, vol. 55, no. 9, p. 3500113.  https://doi.org/10.1109/TMAG.2019.2918985

    Article  Google Scholar 

  4. Amiri, A. and Mirzakuchaki, S., A digital watermarking method based on NSCT transform and hybrid evolutionary algorithms with neural networks, SN Appl. Sci., 2020, vol. 2, p. 1669.  https://doi.org/10.1007/s42452-020-03452-0

    Article  Google Scholar 

  5. Yuan, S., Magayane, D.A., Liu, X., Zhou, X., Lu, G., Wang, Zh., Zhang, H., and Li, Zh., A blind watermarking scheme based on computational ghost imaging in wavelet domain, Opt. Commun., 2021, vol. 482, p. 126568. https://doi.org/10.1016/j.optcom.2020.126568

    Article  Google Scholar 

  6. Li, Z., Dai, Q., Deng, L., Zheng, G., and Li, G., Structural-color nanoprinting with hidden watermarks, Opt. Lett., 2021, vol. 46, no. 3, pp. 480–483.

    Article  Google Scholar 

  7. Veni, M. and Meyyappan, T., Digital image watermark embedding and extraction using oppositional fruit fly algorithm, Multimedia Tools Appl., 2019, vol. 78, no. 19, pp. 27491–27510.  https://doi.org/10.1007/s11042-019-7650-0

    Article  Google Scholar 

  8. Chen, K., Yan, F., Iliyasu, A.M., and Zhao, J., Dual quantum audio watermarking schemes based on quantum discrete cosine transform, Int. J. Theor. Phys., 2019, vol. 58, no. 2, pp. 502–521.  https://doi.org/10.1007/s10773-018-3950-9

    Article  MATH  Google Scholar 

  9. Li, H. and Guo, X., Embedding and extracting digital watermark based on DCT algorithm, J. Comput. Commun., 2018, vol. 6, no. 11, pp. 287–298.  https://doi.org/10.4236/jcc.2018.611026

    Article  Google Scholar 

  10. Lydia, E.L., Raj, J.S., Selvam, R.P., Elhoseny, M., and Shankar, K., Application of discrete transforms with selective coefficients for blind image watermarking, Trans. Emerging Telecommun. Technol., 2019, vol. 32, no. 2, p. e3771.  https://doi.org/10.1002/ett.3771

    Article  Google Scholar 

  11. Zhao, Yu., Fang, Yi, and Yang, Zh., Interleaver design for small-coupling-length spatially coupled protograph LDPC-coded BICM systems over wireless fading channels, IEEE Access, 2020, vol. 8, pp. 33500–33510.  https://doi.org/10.1109/ACCESS.2020.2974002

    Article  Google Scholar 

  12. Wymeersch, H., Steendam, H., and Moeneclaey, M., Log-domain decoding of LDPC codes over GF(q), IEEE Int. Conf. on Communications, Paris, 2004, IEEE, 2004, pp. 772–776.  https://doi.org/10.1109/ICC.2004.1312606

  13. Lee, S.H., Lee, W.H., Bae, S.J., Lee, S.I., and Joo, E.K., Bit probability transition characteristics of LDPC code, Int. Conf. on Telecommunications, 2003. ICT 2003, Papeete, France, 2003, IEEE, 2003, vol. 1, pp. 553–557.  https://doi.org/10.1109/ICTEL.2003.1191469

  14. Gounai, S. and Ohtsuki, T., Decoding algorithms based on oscillation for low-density parity check codes, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005, vol. E88-A, no. 8, pp. 2216–2226.  https://doi.org/10.1093/ietfec/e88-a.8.2216

    Article  Google Scholar 

  15. Zhou, M. and Gao, X., Improved augmented belief propagation decoding based on oscillation, 14th Asia-Pacific Conf. on Communications, Akihabara, Japan, IEEE, 2008, pp. 1–4.

  16. Gounai, S., Ohtsuki, T., and Kaneko, T., Modified belief propagation decoding algorithm for low-density parity check code based on oscillation, IEEE 63rd Vehicular Technology Conf., Melbourne, Australia, 2006, IEEE, 2006, pp. 1467–1471.  https://doi.org/10.1109/VETECS.2006.1683079

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongxun Wang.

Ethics declarations

The authors declare that they have no conflicts of interest.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhongxun Wang, Bao, Z. & Meng, L. Application of LDPC Code Decoding Algorithm in Digital Watermarking. Aut. Control Comp. Sci. 56, 393–402 (2022). https://doi.org/10.3103/S0146411622050091

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411622050091

Keywords:

Navigation