Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Review on Decoding Algorithms useful in Modified Low Density Parity Check Code for Optical Fibre Communication

Print
PDF
IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013
© 2013 by IJCA Journal
NCIPET2013 - Number 6
Year of Publication: 2013
Authors:
Bhavinee U. Parihar
Y. A. Nafde

Bhavinee U Parihar and Y A Nafde. Article: Review on decoding algorithms useful in Modified Low density parity check code for Optical fibre communication. IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013 NCIPET 2013(6):23-25, December 2013. Full text available. BibTeX

@article{key:article,
	author = {Bhavinee U. Parihar and Y. A. Nafde},
	title = {Article: Review on decoding algorithms useful in Modified Low density parity check code for Optical fibre communication},
	journal = {IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013},
	year = {2013},
	volume = {NCIPET 2013},
	number = {6},
	pages = {23-25},
	month = {December},
	note = {Full text available}
}

Abstract

Low-density parity-check (LDPC) codes are linear block codes. It is called low density parity check code because their parity-check matrix contains only a few 1's in comparison to the amount of 0's. These codes were first introduced by Gallager. It is a very powerful code for forward error correction system. The presently used LDPC code in optical fibre communication systems is not meeting the requirements of the high speed fibre optics communication systems. So the LDPC code can be modified and with which the quality factor can be improved. This modification is beneficial for the high speed fibre optic communication systems. We present here a comprehensive review of decoding algorithm of modified Low density parity check code useful in Optical fibre communication. BP and the MS decoding algorithms which are modified decoding algorithm are use for a better performance in high speed fibre optic communication.

References

  • B. Xu J. Xie, "Low-density parity-check code for high-speed fibre-optic communication and its experimental verification", IET Commun. , 2010, Vol. 4, Iss. 10, pp. 1247–1252
  • VASIC B. , DJORDJEVIC I. : 'Low-density parity check codes for long-haul optical communication systems', IEEE Photonics Technol. Lett. , 2002, 14, (8), pp. 1208–1210
  • C. Berrou and A. Glavieux, "Near optimum error-correcting coding and decoding: Turbo codes,"IEEE Trans. Commun. , vol. 44, pp. 1261–1271, Oct. 1996.
  • ZHANG J. , FOSSORIER M. , GU D. , ZHANG J. :'Improved min-sum decoding of LDPC codes using 2-dimensional normalization'. Proc. IEEE GLOBECOM, 2005, pp. 1187–1192
  • J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, CA: Morgan Kaufmann, 1988.
  • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding,"IEEE Trans. Inf Theory, vol. 47, pp. 599-618, Feb. 2001.
  • T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf Theory, vol. 47, pp. 619-637, Feb. 2001
  • Jun Fan,Yang Xiao, and Kiseon Kim, "Design LDPC Codes without Cycles of Length 4 and 6", Hindawi Publishing Corporation, Research Letters in Communications, Volume 2008, Article ID 354137
  • Sae-Young Chung, Member, IEEE, Thomas J. Richardson, and Rüdiger L. Urbanke "Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation" IEEE 2001
  • Jinghu Chen and Marc P. C. Fossorid "Density Evolution for BP-Based Decoding Algorithms of LDPC Codes and Their Quantized Versions" IEEE 2002
  • Bernhard M. J. Leiner "LDPC Codes – a brief Tutorial" April 8, 2005