Back to Search
Start Over
Additive, Structural, and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC Matrices.
- Source :
- IEEE Transactions on Communications; Apr2019, Vol. 67 Issue 4, p2647-2659, 13p
- Publication Year :
- 2019
-
Abstract
- The construction of a quasi-cyclic low density parity-check (QC-LDPC) matrix is usually carried out in two steps. In the first step, a prototype matrix is defined according to certain criteria (size, girth, check and variable node degrees, and so on). The second step involves the expansion of the prototype matrix. During this last phase, an integer value is assigned to each non-null position in the prototype matrix corresponding to the right-rotation of the identity matrix. The problem of determining these integer values is complex. The state-of-the-art solutions use either some mathematical constructions to guarantee a given girth of the final QC-LDPC code, or a random search of values until the target girth is satisfied. In this paper, we propose an alternative/complementary method that reduces the search space by defining large equivalence classes of topologically identical matrices through row and column permutations using additive, structural, and multiplicative transformations. Selecting only a single element per equivalence class can reduce the search space by a few orders of magnitude. Then, we use the formalism of constraint programming to list the exhaustive sets of solutions for a given girth and a given expansion factor. An example is presented in all sections of the paper to illustrate the methodology. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 67
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 135966591
- Full Text :
- https://doi.org/10.1109/TCOMM.2018.2890251