Abstract
In this paper we consider the implementation of Reed-Solomon (RS) codecs. It: is suggested that the most appropriate basis for RS codecs to operate over is the dual basis. The bit-serial Berlekamp multiplier has long been known to be suitable for implementation in RS encoders, but here we also consider its use in RS decoders. The Berlekamp multiplier was previously thought suitable only for use in constant multipliers because it operates over both the dual basis and the polynomial basis. However, work on establishing optimal dual bases to the polynomial basis allows for the design of fist and hardware-efficient 2-variable input dual basis multipliers which can be utilized in RS decoders. Accordingly, we quantify the advantages of utilizing these dual basis multipliers throughout RS codecs. These multipliers have also been utilized in the design of two codecs, a (15, 11) RS codec and a (31, 9) RS codec.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
