00000cab a22000003a 4500 UP-99796217609624492 Buklod 20231007234423.0 m |o d | ta 110118s xx d | ||r ||||| || DENGII eng Yanni Chen Small area parallel Chien search architectures for long BCH codes. pp. 545-549 To implement parallel BCH (Bose-Chaudhuri-Hochquenghem) decoders in an area-efficient manner, this paper presents a novel group matching scheme to reduce the Chien search hardware complexity by 60% for BCH(2047, 1926, 23) code as opposed to only 26% if directly applying the iterative matching algorithm. The proposed scheme exploits the substructure sharing within a finite field multiplier (FFM) and among groups of FFMs. BCH codes. Bose-Chaud-huri-Hochquenghem codes. Chien search hardware complexity. Finite field multiplier. Group matching scheme. Iterative matching algorithm. Parallel Chien search architectures. IEEE Transactions on VLSI systems 12, 5 (2004). FO UPD DENG-II Article