Enhanced degree computationless modified Euclid´s algorithm for Reed-Solomon decoder

This paper proposes an enhanced degree computationless modified Euclid´s (E-DCME) algorithm for Reed-Solomon decoder. The critical path delay of the proposed E-DCME algorithm requires only T_Mul + T _ADD + T_MUX. In addition, the proposed E-DCME algorithm can reduce the used basic cells and has the latency of 2t -1 clock cycles for solving the key equations. Hence, the proposed E-DCME algorithm has short critical path delay and small area compared with the conventional modified Euclid´s algorithm (ME) and the existing DCME algorithm. The gate count of the proposed E-DCME architecture is 17,840. Therefore, the E-DCME architecture can reduce the gate count about 18% compared with the existing DCME architecture