Architecture for decoding adaptive Reed-Solomon codes with varying block length

In this paper, we present an architecture of an adaptive Reed-Solomon (RS) decoder based on a modified Euclid algorithm (MEA). The decoder can be programmed to decode RS codes with any message length k as well as any block length n. This eliminates the need of inserting zeros for decoding shortened RS codes. Also, these parameters n, k and hence t can be altered at every codeword block. Thus, when a return channel is available, this decoder which adaptively alters the error-correcting capability according to channel state can be combined with an ARQ system. It can decode codewords received not only in burst mode, but also in continuous mode. It can be used in a wide range of applications because of its versatility.