Four channel three-parallel Reed-Solomon decoder using S-DCME algorithm for optical communications

This paper proposes a high-speed and area-efficient three-parallel Reed-Solomon (RS) decoder using the simplified degree computationless modified Euclid (S-DCME) algorithm for the key equation solver (KES) block. To achieve high throughput rate, the inner signals such as syndrome, error locator and error value polynomials are computed in parallel. In addition, key equations are solved by using the S-DCME algorithm to reduce hardware complexity. The proposed RS architecture can reduce about 60% of hardware complexity respect to the KES block. By adopting the S-DCME algorithm to implement the KES block, the other blocks, such as the syndrome computation (SC), chien search and error evaluation (CSEE) blocks of an entire RS decoder are optimized. As a result, the proposed RS architecture has approximately 34% lower hardware complexity and 25% shorter latency compared with conventional 16 channel three-parallel RS architectures.