Abstract
For decoding Reed-Solomon (RS) codes, the Belekamp-Messay algorithm, Euclid's algorithm and modified Euclid's algorithm (MEA) have been developed among which the MEA becomes the most popular decoding scheme. We propose an efficient recursive cell architecture suitable for the MEA. The proposed architecture uses about 25% less clock cycles required in the MEA operation than the conventional scheme. In addition, the number of recursive MEA cells can be reduced when the number of clock cycles spent in the MEA operation is larger than code word length n. Thereby buffer requirement for the received words can be reduced. For demonstration, the MEA circuitry for (128, 124) RS code has been described and the MEA operation is verified through VHDL modeling.
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.
