Abstract
In this paper, a hard-decision (HD) scheme is presented to facilitate faster decoding of the (47, 24, 11) quadratic residue (QR) code. The new HD algorithm uses the previous scheme of decoding the (47, 24, 11) QR code up to three errors, but corrects four and five errors with new different methods. In the four-error case, the new algorithm directly determines the coefficients of the error-locator polynomial by eliminating unknown syndromes in Newton identities and simplifies the condition that exactly indicates the occurrence of four errors. Subsequently, the reliability-based shift-search algorithm can be utilized to decode weight-5 error patterns. In other words, a five-error case can be decoded in terms of a four-error case after inverting an incorrect bit of the received word. Simulation results show that the new HD algorithm not only significantly reduces the decoding complexity in terms of CPU time but also saves a lot of memory while maintaining the same error-rate performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.