Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/11962
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, H.P.-
dc.contributor.authorShripathi, Acharya U.-
dc.contributor.authorShetty, K.R.-
dc.date.accessioned2020-03-31T08:36:00Z-
dc.date.available2020-03-31T08:36:00Z-
dc.date.issued2012-
dc.identifier.citationInternational Journal of Electronics, 2012, Vol.99, 5, pp.683-693en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/11962-
dc.description.abstractIn this article, we propose a high-speed decoding algorithm for binary BCH codes that can correct up to 7bits in error. Evaluation of the error-locator polynomial is the most complicated and time-consuming step in the decoding of a BCH code. We have derived equations for specifying the coefficients of the error-locator polynomial, which can form the basis for the development of a parallel architecture for the decoder. This approach has the advantage that all the coefficients of the error locator polynomial are computed in parallel (in one step). The roots of error-locator polynomial can be obtained by Chien's search and inverting these roots gives the error locations. This algorithm can be employed in any application where high-speed decoding of data encoded by a binary BCH code is required. One important application is in Flash memories where data integrity is preserved using a long, high-rate binary BCH code. We have synthesized generator polynomials for binary BCH codes (error-correcting capability, s) that can be employed in Flash memory devices to improve the integrity of information storage. The proposed decoding algorithm can be used as an efficient, high-speed decoder in this important application. 2012 Taylor & Francis.en_US
dc.titleHigh-speed and parallel approach for decoding of binary BCH codes with application to Flash memory devicesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
11962.pdf814.62 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.