A minimized modified Euclid architecture

Reed-Solomon (RS) coding is one of the most powerful and standardized techniques for error and erasure correction. Owing to its excellent capability for correcting burst errors, it has been widely used for digital communication systems and storage devices such as digital VCRs and disk drives. The decoding architecture of an RS code can be summarized into four steps. The block to solve key equation occupies the largest area of the RS decoder. In this paper, we use the modified Euclid algorithm for solving the key equation and propose a new area-efficient architecture for it. The proposed architecture has only 8 GF-multipliers and 4 GF-adders