Abstract

Bose-Chaudhuri-Hocquenghem (BCH) code is normally utilized in communication systems in order to enhance its reliability. The main computational complexity and high power consumption stages in BCH come from its two main stages, the key equation solving (KES) and Chien search (CS). This paper presents two different algorithms to reduce the computational process and hence reduce the total power consumption. These algorithms are the verification algorithm and the two-step parallel CS architecture which are utilized in KES and CS stages, respectively. The whole proposed system is implemented using LABVIEW tools from NI. The results show that the proposed BCH algorithm provides an enhanced performance when compared to the conventional one.

Full Text

Published Version

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 call

Disclaimer: 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.