Despite the performance of 5th Generation Low Density Parity Check (5G-LDPC) codes close to the capacity limit, the near-optimal floating-point BP decoding will lead to excessive use of hardware and high complexity of calculation. Thus, the quantized min-sum decoder with limited-precision is usually used in practical implementations. No matter using high or low precision quantization, some 5G-LDPC codes always suffer from the problem of high error floor, which affects their applications in future ultra-reliable scenarios. Using Reed-Solomon (RS) codes as the outer codes can significantly lower the error floor of 5G-LDPC codes due to their Hamming distance properties and excellent error-correction capability. In order to further improve the overall performance, an efficient iterative decoding algorithm of RS-LDPC concatenated codes is proposed in this paper. The proposed iterative algorithm of RS-LDPC codes can achieve noticeable gains over the 5G-LDPC codes at lower FER.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.