A reduced complexity decoding algorithm for NB-LDPC codes

Song, Suwen; Lin, Jun; Tian, Jing; Wang, Zhongfeng

doi:10.1109/icct.2017.8359617

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even though NB-LDPC codes provide good performance at short block lengths, the BP decoding of NB-LDPC codes has very high complexity. The EMS algorithm [13] is introduced as a low complexity decoder for NB-LDPC codes and it is more suitable for short packet communication [14]. The EMS decoder works in the log-domain using only n m most trusted probabilities in each iteration, where n m ≪ q.…”

Section: B Nb-ldpc Codesmentioning

confidence: 99%

Coded Faster-than-Nyquist Signaling for Short Packet Communications

Cerci¹,

Çıçek²,

Cavus³

et al. 2021

Preprint

View full text Add to dashboard Cite

Ultra-reliable low-latency communication (URLLC) requires short packets of data transmission. It is known that when the packet length becomes short, the achievable rate is subject to a penalty when compared to the channel capacity. In this paper, we propose to use faster-than-Nyquist (FTN) signaling to compensate for the achievable rate loss of short packet communications. We investigate the performance of a combination of a low complexity detector of FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that is suitable for low-latency and short block length requirements of URLLC systems. Our investigation shows that such combination of low-complexity FTN signaling detection and NB-LDPC codes outperforms the use of close-to-optimal FTN signaling detectors with LDPC codes in terms of error rate performance and also has a considerably lower computational complexity.

show abstract

Section: B Nb-ldpc Codesmentioning

confidence: 99%

Coded Faster-than-Nyquist Signaling for Short Packet Communications

Cerci¹,

Çıçek²,

Cavus³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…On the other hand, inspired by the idea of the twoextra-column (TEC) scheme for the TMM algorithm [24], we modify the TEC scheme and apply it to the simplified T-EMS algorithm. The new algorithm, called TEC-TEMS, has better decoding performance and lower computational complexity than the T-EMS, which has been preliminarily presented in our conference paper [26]. Combining the TS scheme with the TEC-TEMS algorithm, the proposed TS-TEC-TEMS algorithm further reduces the computational complexity significantly and achieves nearly the same decoding performance as that of the TEC-TEMS.…”

Section: Introductionmentioning

confidence: 95%

Efficient T-EMS Based Decoding Algorithms for High-Order LDPC Codes

et al. 2019

Self Cite

View full text Add to dashboard Cite

Non-binary low-density parity-check (NB-LDPC) codes show larger coding gain and lower error floor than their binary counterparts in many cases. However, the existing soft decoding algorithms of NB-LDPC codes generally suffer from high computational complexity. Recently, the trellis-based extended min-sum (T-EMS) decoding algorithm has attracted much attention since it can achieve good decoding performance with high parallelism and low computational complexity. In this paper, we propose two new methods to further reduce the computational complexity and enhance the decoding performance. Firstly, we introduce, with theoretical justification, a universal scheme called threshold-based shrinking (TS) scheme, which facilitates significant reduction of computational complexity for decoding of NB-LDPC codes. Secondly, we present a modified two-extra-column (TEC) scheme and apply it to the T-EMS. Furthermore, a high-performance low-complexity decoding algorithm, named TEC-TEMS algorithm, is obtained. Combining the TS scheme with the TEC-TEMS, the new algorithm, named TS-TEC-TEMS algorithm, achieves much lower computational complexity and has negligible performance loss compared to the TEC-TEMS. For a 256-ary (256, 203) example code, compared to the T-EMS, the computational complexities of the TEC-TEMS and TS-TEC-TEMS algorithms are reduced by more than 50% and nearly 90%, respectively. Moreover, the TEC-TEMS and TS-TEC-TEMS both outperform the T-EMS by about 0.3dB when the frame error rate (FER) is around 10 −5 . INDEX TERMS Error correction codes, nonbinary low-density parity-check (NB-LDPC) codes, min-sum decoding algorithm, low computational complexity, forward error correction (FEC).

show abstract