Efficient standard basis Reed-Solomon encoder

This paper presents an efficient Reed-Solomon encoder based on standard basis. The key operation in Reed-Solomon encoding is the multiplication of a feedback term with several (possibly) known terms. We present an efficient structure to implement this operation. The hardware complexity of this encoder is identical to the well-known Berlekamp encoder. It however, offers two advantages over the Berlekamp encoder-a critical path independent of the order of Reed-Solomon code being implemented and the ability to encode without any need for basis conversion