A variable Reed-Solomon decoder using separate clocks in its pipelined steps

An efficient architecture for an variable Reed-Solomon (RS) decoder, where the block length n and the message length k can be varied from their minimum allowable values up to their selected values. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. And the error-correcting capability t can be changed adaptively to channel states at every codeword block. The decoder allows efficient decoding in both burst mode and continuous mode, and it permits 3-step pipelined processing based on the modified Euclid´s algorithm (MEA). Each step has been designed to be clocked by a separate clock. Thus, each step can be efficiently pipelined with no help of multiplexing. Also, it makes it possible to employ no additional buffer even when the decoder input and output clocks are different.