Optimizing chien search in BCH decoder

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.