Abstract
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 pmin and error performance.
| Original language | English (US) |
|---|---|
| Title of host publication | 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016 |
| Publisher | IEEE Computer Society |
| Pages | 146-150 |
| Number of pages | 5 |
| Volume | 2016-October |
| ISBN (Electronic) | 9781509034017 |
| DOIs | |
| State | Published - Oct 17 2016 |
| Event | 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 - Brest, France Duration: Sep 5 2016 → Sep 9 2016 |
Other
| Other | 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 |
|---|---|
| Country | France |
| City | Brest |
| Period | 9/5/16 → 9/9/16 |
Keywords
- Circulant Permutation Matrix (CPM)
- Girth
- Low Density Parity Check (LDPC) codes
- Progressive Edge-Growth (PEG)
- Quasi-cyclic (QC)
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Information Systems
- Theoretical Computer Science