Abstract

In the decoding of the Bose Chaudhuri Hochquenghem (BCH) codes, the most complex block is the Chien search block. In the decoding process of the BCH codes, error correction is performed bit by bit, hence they require parallel implementation. The area required to implement the chien search parallel is more, hence strength reduced parallel architecture for the chien search is presented. In this paper, the syndrome computation is done using conventional method, the inversion-less Berlek amp Massey Algorithm is used for the solving the key equations.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.