5 papers · 1 filter
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…
Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Unsatisfied Probabilities
Chenyuan Jia, Dongxu Chang, Ruiyuan Wang +3
This letter revisits update ordering in layered belief propagation (LBP) decoding of low-density parity-check (LDPC) codes. The closest probability-based schedule orders layers by…
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…
The Impact of the Distance Between Cycles on Elementary Trapping Sets
Haoran Xiong, Guanghui Wang, Zhiming Ma +1
Elementary trapping sets (ETSs) are the main culprits of the performance of low-density parity-check (LDPC) codes in the error floor region. Due to their large quantities and compl…