Error Detection Mechanism Based on Bch Decoder and Root Finding of Polynomial Over Finite Fields

Volume 12, Issue 4, pp 271-281 http://dx.doi.org/10.22436/jmcs.012.04.03

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 4107 Downloads
• 4599 Views

Authors

Saeideh Nabipour - Technical Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran. Javad Javidan - Technical Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran. Gholamreza Zare Fatin - Technical Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran.

Abstract

Error Correction Code is very important in modern communication systems. BCH (Bose, Chaudhuri, and Hocqunghem) codes are being widely used in variety communication and storage systems. In this paper the construction and decoding BCH codes which are based on finite field arithmetic is introduced and also an improved algorithm for finding roots of polynomials over finite fields is proposed. This makes possible significant speed up of the decoding process of BCH codes.

Share and Cite

Keywords

• Error Correction Code
• BCH code
• root-finding polynomial
• Chien Search
• BRS algorithm.

MSC

•  94Bxx
•  94B35
•  13P05

References

• [1] S. Lin, D. J. Costello, Error control coding: fundamentals and applications, Prentice-Hall Inc., (2004)
  • Google Scholar
  • MATH


• [2] R. T. Chien, B. D. Cunningham, I. B. Oldham, Hybrid methods for finding roots of a polynomial with application to BCH decoding, IEEE Transactions on Information Theory, 15(2) (1969. ), 329-335
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [3] T.-K. Truong, J.-H. Jeng, I. S. Reed, Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders, IEEE Transactions on Communications, 49(5) (2001), 779-783
  • View Article
  • Google Scholar
  • MATH


• [4] C. Paar, Optimized arithmetic for Reed–Solomon encoders, in Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, Jun.–Jul., (1997), 250–250.
  • View Article
  • Google Scholar


• [5] O. Ore, On a special class of polynomials, Trans. Am. Math. Soc., 35 (1933), 559–584
  • Google Scholar


• [6] S. Lin, D. J. Constello, Error Control coding, Englewood Cliffs, NJ:Prentice-Hall (1983)
  • Google Scholar


• [7] A. Hocquenghem, Codes correcteurs d’erreurs, Chiffres, 2 (1959), 147- 56
  • Google Scholar


• [8] R. E. Blahut, Algebraic Codes for Data Transmission, U.K.: Cambridge Univ. Press, Cambridge (2003)
  • Google Scholar


• [9] Y.-M. Lin et al., A 26.9K 314.5 Mb/s Soft (32400, 32208) BCH Decoder Chip for DVB-S2 System, IEEE J. Solid- State Circuits, 45(11) (2010), 2330-2340
  • View Article
  • Google Scholar


• [10] C.-C. Chu, Y.-M. Lin, C.-H. Yang, H.-C. Chang, A fully parallel BCH codec with double error correcting capability for NOR flash applications, in Proc. IEEE Int. Conf. Acoust. Speech, Signal Process, (2012), 1605–1608.
  • View Article
  • Google Scholar


• [11] Dr. M. H. L. Chen, D. Fredmon, R. W. Donaldson, Performance enhancment using Forward error correction on Power line Communication channels , m IEEE Trans. on Power Del. , vol 9. no. 2 (1994)
  • View Article
  • Google Scholar


• [12] L. Biard, D. Noguet , Reed Solomon Codes for Low Power Communication, Journal of Communications, 3(2) (2008), 13-21.
  • Google Scholar