Programmable bit-serial Reed-Solomon encoders

In this paper the design of programmable bit-serial Reed-Solomon encoders is considered using the traditional Berlekamp multiplier. It is suggested that there are certain advantages to be gained by deriving the generator polynomial of the code using combinational logic, or equivalently using look-up tables, rather than using an iterative LFSR based approach. The use of the recently proposed Berlekamp-like bit-serial multiplier is also considered and shown to demonstrate a number of potential advantages over the traditional Berlekamp multiplier in Reed-Solomon encoders.