2014
DOI: 10.1109/lcomm.2013.111113.131881
|View full text |Cite
|
Sign up to set email alerts
|

Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 7 publications
0
10
0
Order By: Relevance
“…Among the researches which do not require the prior information of dominant trapping sets, two-stage decoding schemes have been one of the popular decoding procedures to deal with the error-floor [10][11][12][13][14]. Two-stage decoding schemes usually consist of two decoding steps, the conventional belief propagation (BP) decoding as the first-stage decoding and the re-decodings with manipulated log-likelihood ratios (LLRs) of variable nodes as the second-stage decoding.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Among the researches which do not require the prior information of dominant trapping sets, two-stage decoding schemes have been one of the popular decoding procedures to deal with the error-floor [10][11][12][13][14]. Two-stage decoding schemes usually consist of two decoding steps, the conventional belief propagation (BP) decoding as the first-stage decoding and the re-decodings with manipulated log-likelihood ratios (LLRs) of variable nodes as the second-stage decoding.…”
Section: Introductionmentioning
confidence: 99%
“…However, determining a proper value of N is quite sensitive to decoding performance for the given code parameters. For a fixed-point implementation, multi-step quantisation scheme is proposed to lower the error-floor [14], which is based on successive re-quantisation and re-decoding of the input blocks to avoid harmful trapping sets while keeping the same number of quantisation bits.…”
Section: Introductionmentioning
confidence: 99%
“…Trapping sets are normally classified by a pair (a, b), in which a is the number of variable nodes whose induced subgraph has b check nodes of odd degree [10,16,48,49,[54][55][56][57][58][59]. Trapping sets with smaller values of a and b are generally believed to be more harmful to iterative decoding.…”
Section: Harmfulness Of Trapping Sets Ldpc Codesmentioning
confidence: 99%
“…As a result of the above discussion, it is crucial to improve the error floor performance either in block LDPC codes or SC-LDPC codes. Generally speaking, reducing the error floor is possible by means of two main approaches: (1) modification on the decoding algorithm to improve the error rate performance [51], [96], [93], [85], and (2) new construction of codes with a set of desired properties. In our work, we focus on the second approach to design either quasi-cyclic LDPC block codes or spatially coupled LDPC codes with low error floor.…”
Section: Motivationmentioning
confidence: 99%