Abstract
This paper proposes a low-latency ordered statistics decoding (OSD) algorithm for BCH codes. The OSD latency is mainly caused by Gaussian elimination (GE) that produces a systematic generator matrix of the code. Considering BCH codes is binary subcodes of Reed-Solomon (RS) codes, we show that the BCH codeword candidates can be produced through the systematic generator matrix of the corresponding RS code. The systematic generator matrix of an RS code can be formed by generating the linearly independent RS codewords in parallel, replacing the GE process and enabling a low OSD latency. This paper further proposes a segmented variant that facilitates the decoding by reducing the number of test error patterns (TEPs). Complexity of the proposed OSD is also analyzed. Our simulation results show that the proposed decoding can achieve a similar performance as the conventional OSD, but with a lower decoding complexity. The decoding latency can be reduced over the conventional OSD substantially.
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.
