Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have