An area-efficient architecture for modified euclid algorithm in RS decoding

The 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 RS codes can be summarized into four steps. Especially, the block to solve the key equation occupying the largest area of the RS decoder. In this paper, we use a modified euclid algorithm for solving the key equation and propose a new area-efficient architecture for it. A proposed architecture has only 8 GF-multipliers and 4 GF-adders