An Area Efficient (31, 16) BCH Decoder for Three Errors

An Area Efficient (31, 16) BCH Decoder for Three Errors

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2014 by IJETT Journal
Volume-10 Number-13
Year of Publication : 2014
Authors : M. Prashanthi , P. Samundiswary
  10.14445/22315381/IJETT-V10P323

Citation 

M. Prashanthi , P. Samundiswary. "An Area Efficient (31, 16) BCH Decoder for Three Errors", International Journal of Engineering Trends and Technology (IJETT), V10(13),616-620 April 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

Bose, Ray- Chaudhuri, Hocquenghem (BCH) codes are one of the efficient error-correcting codes used to correct errors occurred during the transmission of the data in the unreliable communication mediums. This paper presents a low-complexity and area efficient error-correcting BCH decoder architecture for detecting and correcting three errors. The advanced Peterson error locator computation algorithm, which significantly reduces computational complexity, is proposed for the IBM block in the (31,6) BCH decoder. In addition, a modified syndrome calculator and chien search are proposed to reduce hardware complexity. The design methodologies of the proposed BCH decoder models have considerably less hardware complexity and latency than those using conventional algorithms. The proposed (31, 16) BCH decoder over GF (5), leads to a reduction in complexity compared to that of conventional BCH decoder. The enhanced BCH decoder is designed using hardware description language called Verilog and synthesized in Xilinx ISE 13.2.

References

1. Xinmiao Zhang and Zhongfeng Wang, “A Low-Complexity Three-Error-Correcting BCH Decoder for Optical Transport Network”, IEEE transactions on circuits and systems—II: express briefs, vol. 59, pp. 10 , Oct 2012.
2. Nahmadi and MH Sirojuddiin, “An Optimal Architecture of BCH Decoder”, Proceedings of IEEE Conference Asian on Information Theory, Indonesia,pp.65-72,Nov-2011 .
3. Hans Kristian, Hernando Wahyono, Kiki Rizki and Trio Adiono, “Ultra-Fast-scalable BCH Decoder with Efficient-Extended Fast Chien Search”, Proceedings of IEEE International Mideast Symposium Circuits and System,china, pp. 5941–5994 , May -2010.
4. Hlou Lamari, EL habti EL idrissi Anas and Elgouri Rachid ,“A Low Power Error Detection in the Chien Search Block for Reed-Solomon Code” ,IEEE Transactions on Information Theory, vol IT-15, pp.122–127 , Feb-2012.
5. R. Huynh, G. Ning, and Y.Huazhung, “A Low Power Error detection in the syndrome calculator Block for Reed- Solomon codes RS: (248, 1881),” Proceedings of IEEE on J. Tsinghua Science and Technology, vol. 14, pp 474-477, August 2009.
6. Hans Kristian, Hernando Wahyono, Kiki Rizki and Trio Adiono, “Ultra-Fast-scalable BCH Decoder with Efficient-Extended Fast Chien Search”, Proceedings of IEEE International Mideast Symposium Circuits and System, pp. 5941–5994 , May -2010.
7. Hung-Yuan Tsai, Chi-Heng Yang, and Hsie-Chia Chang, “An Efficient BCH Decoder with 124-bit Correct ability for Multi-Channel SSD Applications”, Proceedings of IEEE Asian Conferences on Solid-State Circuits,Japan,pp.65-72, November,2012 .

Keywords
BCH decoder, Peterson’s algorithm, chien Search, VLSI design.