Abstract
This paper proposes an enhanced degree computationless modified Euclid's (E-DCME) algorithm for Reed-Solomon decoder. The critical path delay of the proposed E-DCME algorithm requires only T/sub Mul/ + T/sub ADD/ + T/sub MUX/. In addition, the proposed E-DCME algorithm can reduce the used basic cells and has the latency of 2t -1 clock cycles for solving the key equations. Hence, the proposed E-DCME algorithm has short critical path delay and small area compared with the conventional modified Euclid's algorithm (ME) and the existing DCME algorithm. The gate count of the proposed E-DCME architecture is 17,840. Therefore, the E-DCME architecture can reduce the gate count about 18% compared with the existing DCME architecture.
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.
