Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code. The girth of the QC protograph LDPC code is determined by the girth of the base...

Full description

Bibliographic Details
Main Authors: Xue-Qin Jiang, Han Hai, Hui-Ming Wang, Moon Ho Lee
Format: Article
Language:English
Published: IEEE 2017-01-01
Series:IEEE Access
Subjects:
Progressive edge-growth (PEG) algorithm
QC protograph LDPC code
permutation shifts
girth
Online Access:https://ieeexplore.ieee.org/document/7893750/

Internet

https://ieeexplore.ieee.org/document/7893750/

Similar Items