Improved PEG construction of large girth QC-LDPC codes
M Diouf, D Declercq, M Fossorier… - 2016 9th International …, 2016 - ieeexplore.ieee.org
M Diouf, D Declercq, M Fossorier, S Ouya, B Vasić
2016 9th International Symposium on Turbo Codes and Iterative …, 2016•ieeexplore.ieee.orgIn this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic
low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of
PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes
and give a predictive method to avoid these undetected cycles. The aim is to select only the
candidates that ensure the maximization of local girth for a code of girth g≥ 10 and thus
avoid a posteriori verification after the creation of a new edge ie keep the predictive …
low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of
PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes
and give a predictive method to avoid these undetected cycles. The aim is to select only the
candidates that ensure the maximization of local girth for a code of girth g≥ 10 and thus
avoid a posteriori verification after the creation of a new edge ie keep the predictive …
In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix p min and error performance.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果