2019
DOI: 10.1049/iet-com.2018.6099
|View full text |Cite
|
Sign up to set email alerts
|

Efficient decoding approach for NB‐LDPC codes with short blocklength

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…Otherwise, we calculate γ EXIs and the q − 1 flipping metrics of each symbol by (1) and the objection function. Then, we get the flipping function values {E N } of N symbols by (7) and (8), respectively. Next, we flip multiple symbols with the DM scheme elaborated in Algorithm 1.…”
Section: The Proposed Dm Schemementioning
confidence: 99%
See 1 more Smart Citation
“…Otherwise, we calculate γ EXIs and the q − 1 flipping metrics of each symbol by (1) and the objection function. Then, we get the flipping function values {E N } of N symbols by (7) and (8), respectively. Next, we flip multiple symbols with the DM scheme elaborated in Algorithm 1.…”
Section: The Proposed Dm Schemementioning
confidence: 99%
“…Non-binary coding schemes have attracted considerable attention of many researchers because of a larger coding gain [7], [8]. Regular non-binary LDPC (NB-LDPC) codes show superior performance in the deeper error floor region and outperform irregular binary LDPC codes with short-tomoderate blocklength.…”
Section: Introductionmentioning
confidence: 99%
“…In order to apply these channel coding techniques in terahertz communications, research workers have made a lot of studies, and the literature [8] proposed a modified and optimized Turbo decoding scheme that can be well used in 100 Gbps wireless terahertz communications using BCH(2047,2014,t=3) codes with a modified code word format, and the code word is successfully decoded in only 2-3 iterations In the literature [9], the authors propose an LDPC code that can perform cyclic redundancy checks, and its parallel implementation and shorter code length reduce the decoding latency compared to the traditional LDPC code; the parallel cascaded decoding scheme in the literature [10] greatly reduces the algorithm complexity, simplifies the lattice expansion, and shows good performance for short non-binary lowcomplexity even check digit code shows good error correction performance, and the coding gain is improved by 0.5dB compared with other high-speed short codes; literature [11]- [12] construct LDPC codes under ieee 802.16e standard using base check matrix, and adopt iterative coding method with linear time complexity for coding, which effectively improves the code rate performance and increases the data transmission rate, but its data transmission literature [13] studied a high-speed link error correction code, which is highly utilized and flexible, but is redundant and has high computational complexity; literature [14] studied a polarization coding-based link adaptive transmission framework, which has the advantages of reliable low latency and high spectral efficiency, and the disadvantage is that it requires higher modulation requirements; ultra-reliable low latency communication (URLLC) is one of the main classes of 5G One of the main service classes of 5G [15]- [16] poses special challenges to coding techniques, and to meet the strict latency requirements, a parallel cascaded decoding (PCD) scheme for short non-binary low-density parity-check (NB-LDPC) codes was proposed in the literature [17], which has a relatively low decoding latency and low complexity, but has poor performance in error correction The Successive Cancellation (SC) decoding algorithm for Polar codes was proposed in [8], but it is not effective in decoding codes with short and medium code lengths. Therefore, based on the SC decoding algorithm, a list decoding algorithm was proposed in the literature [18] and [19], which has a great performance improvement for the SC decoding algorithm.…”
Section: Introductionmentioning
confidence: 99%