Small area parallel Chien search architectures for long BCH codes.

Small area parallel Chien search architectures for long BCH codes.

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 algori...

Full description

Bibliographic Details
Published in:IEEE Transactions on VLSI systems 12, 5 (2004).
Main Author: Yanni Chen
Format: Article
Language:English
Subjects:
BCH codes.
Bose-Chaud-huri-Hochquenghem codes.
Chien search hardware complexity.
Finite field multiplier.
Group matching scheme.
Iterative matching algorithm.
Parallel Chien search architectures.