A Fast Decoding Convergence of SISO Repetition - QC-LDPC Codes Concatenated at the Receiver
Low-Density Parity Check (LDPC) is one of the contemporary error-correcting codes that has shown near Shannon capacity performance; it has been implemented into various stan-dards such as the second-generation Digital Video Broadcasting for Satellite (DVB-S2) and eventually made its way toward the 5...
Saved in:
| Published in | 2022 4th Novel Intelligent and Leading Emerging Sciences Conference (NILES) pp. 311 - 316 |
|---|---|
| Main Authors | , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
22.10.2022
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.1109/NILES56402.2022.9942436 |
Cover
| Summary: | Low-Density Parity Check (LDPC) is one of the contemporary error-correcting codes that has shown near Shannon capacity performance; it has been implemented into various stan-dards such as the second-generation Digital Video Broadcasting for Satellite (DVB-S2) and eventually made its way toward the 5G New Radio (NR) for the data channel. In an effort to enhance the LDPC decoding performance without a significant increase in the decoding complexity, in this paper, a receiver-based concatenated decoding approach is proposed, which is composed of the soft-input soft-output (SISO) repetition and offset min-sum (OMS) algorithm representing outer and inner decoders, respectively. At the receiver, the received signal is oversampled with an oversampling rate (OSR) faster than multiple integers of the Nyquist rate to produce repeated symbols. Moreover, the repetition employed at the receiver to handle the repeated symbols will not impact the coding rate. Finally, the simulation results revealed that the proposed scheme could accomplish faster-decoding convergence compared to the conventional LDPC decoders and achieve coding gain up to 2.3 dB with OSR = 2. Additionally, the computational complexity does not increase significantly; on the contrary, the achieved gain can be exploited to reduce the number of iterations. |
|---|---|
| DOI: | 10.1109/NILES56402.2022.9942436 |