Abstract
Recent developments with General Purpose Graphical Processing units (GPGPU) within gaming and mobile platform has attracted researchers to contribute efficient methods to correct errors for Bose-Chaudhuri-Hocquenghem (BCH) codes. Three-bit error correction is widely used in Single Level Cell (SLC) flash memory arrays, and Optical Transport Networks (OTN). In this paper, we propose an optimized method for correcting three-bit errors in such system. Precisely, we optimize the kernel routine for key-equation solver to have better performance. We have devised an engine, on a GPGPU, that decodes code size of (n=1023, k=963, t=3) and compare it against the conventional inversion-less Berlekamp-Massey algorithm (iBMA). Then, we extend the same scheme to different code sizes, and the results have shown that there is a 20% increase in performance by reducing the latency incurred by the key equation solver routine.
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.
