Abstract

It’s not uncommon to use Error-Correction Codes (ECCs) with higher correction capacity at the system level to protect memory from Multiple Bit Upsets (MBUs). As a result, developing ECCs with enhanced error correction and less repetition, particularly for adjoining ECCs, has become a key challenge.. The existing codes such as center around for reducing MBU can able to adjust up to 3-bit errors. The affected bits can be undoubtedly increment to more than three-bit error with the innovation scales and cell division distance decline. As a result, previous approaches are no longer adequate to meet the accuracy requirements of applications in harsh environments. A method for increasing three bit burst error-correction coding with QAEC is provided in this paper. The design requirements are first given, and then a search algorithm is devised to locate coding strategies that adhere to the constraints. The H matrices of the acquired three bit error correction with QAEC are shown. With a three-bit burst error code, they don’t require any extra parity check bits. The performance of three-bit BEC is significantly improved by applying the novel technique to earlier three-bit burst error codes. An example is used to show the suggested codes’ encoding and decoding methods. The 45-nm library was used for the design of encoders and decoders and the results demonstrating that the codes have a medium amount of delay and area in order to meet the required correction capability extension.

Full Text
Paper version not known

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.