Simplified Degree Computationless Modified Euclid´s Algorithm and its Architecture

This paper proposes a new simplified degree computationless modified Euclid´s algorithm (S-DCME) and its architecture for Reed-Solomon decoders. The proposed S-DCME algorithm uses the new initial conditions, and thus, it can combine the data path for loading initial values and the data path for a switching operation. Hence, the S-DCME algorithm can reduce the number of multiplexers and has high performance compared with the existing DCME algorithm and the RiBM algorithm. The gate count using the MagnaChip HSI 0.25mum standard cell library is 17,800.