Low latency BCH decoder using the affine polynomial over the finite field

The paper proposes a low latency BCH decoder with low complexity using parallel computation and simplifying locating errors by finding the roots of the affine polynomial over finite fields. The proposed design can be implemented on low-cost hardware platforms while applicable in very low latency information systems.
Nội dung trích xuất từ tài liệu:
Low latency BCH decoder using the affine polynomial over the finite field