Abstract
A novel concatenated coding scheme is introduced, where the Reed-Solomon (RS) code is concatenated with the spatially coupled low-density parity-check (SC-LDPC) code, namely the RS-SC-LDPC code. We first propose the locally systematic encoding of the inner code and its termination when considering the concatenated code has a finite length. A decoding scheme is then proposed, in which the belief propagation (BP) based sliding window decoding (SWD) decodes the inner code with the assistance of the outer Berlekamp-Massey (BM) decoding feedback. This research shows the RS-SC-LDPC codes can achieve a high decoding performance without yielding an error floor until the bit error rate (BER) of 10−8. They also significantly outperform the incumbent RS-convolutional concatenated (RS-CC) codes, as well as the BCH-SC-LDPC codes.
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.
