On the girth of (3,L) quasi-cyclic LDPC codes based on complete protographs
Publication type: Proceedings Article
Publication date: 2015-06-01
Abstract
We consider the problem of constructing $(3,L)$ quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with two disjoint vertex sets such that every vertex in the variable-node set is connected to every vertex in the check-node set by a unique edge. This paper analyzes the required lifting factor for achieving girths of six or eight in the resulting quasi-cyclic codes with constraints on lifting. The required lifting factors provide lower bounds on the block-length of such codes.
Found
Found
Top-30
Journals
|
1
2
3
4
|
|
|
IEEE Transactions on Communications
4 publications, 36.36%
|
|
|
IEEE Access
4 publications, 36.36%
|
|
|
Wireless Personal Communications
1 publication, 9.09%
|
|
|
1
2
3
4
|
Publishers
|
1
2
3
4
5
6
7
8
9
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
9 publications, 81.82%
|
|
|
Springer Nature
1 publication, 9.09%
|
|
|
1
2
3
4
5
6
7
8
9
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.