TYPE-II APM-LDPC CODES WITH GIRTH 6

Mohammad Gholami, Zahra Gholami

DOI Number
https://doi.org/10.22190/FUMI230814045G
First page
689
Last page
693

Abstract


In this paper, for the first time, Type-II APM-LDPC codes are presented as a class of APM-LDPC codes whose parity-check matrices (PCMs) include blocks comprising by combining two non-overlapping APMs. Then, some conditions are provided to give Type-II APM-LDPC codes with girth at least 6 and a table containing of the 4-cycle free constructed codes with will be given.


Keywords

LDPC codes, girth, affine permutation matrix.

Full Text:

PDF

References


M. P. Fossorier: Quasi-cyclic low density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory, 50(8) (2004), 1788–1793.

R. Gallager: Low-density parity-check codes. IRE Transactions on information theory, 8(1) (1962), 21–28.

M. Gholami and M. Alinia: Explicit APM-LDPC codes with girths 6, 8, and 10. IEEE Signal Processing Letters, 24(6) (2017), 741–745.

M. Gholami and M. Alinia: High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices. IET Communications, 9(17) (2015), 2114–2123.

S. Myung, K. Yang and D.S. Park: A combining method of structured LDPC codes from affine permutation matrices. In 2006 IEEE International Symposium on Information Theory, (2006), 674–678.

M. E. O’Sullivan: Algebraic construction of sparse matrices with large girth. IEEE Transactions on Information Theory, 52(2) (2006), 718–727.




DOI: https://doi.org/10.22190/FUMI230814045G

Refbacks

  • There are currently no refbacks.




© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)