4 papers · 1 filter
Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
Qingqing Peng, Dongxu Chang, Guiying Yan +1
In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered mes…
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
Qingqing Peng, Ke Liu, Guiying Yan +1
It is well known that, given \(b\ge 0\), finding an -trapping set with the minimum \(a\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem…
On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
Qingqing Peng, Dongxu Chang, Guanghui Wang +1
It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show th…
High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
Dongxu Chang, Qingqing Peng, Guanghui Wang +1
In this study, a scheduling policy of layered decoding for quasi-cycle (QC) low-density parity-check (LDPC) codes with high throughput and good performance is designed. The influen…