Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Po-Chunen_US
dc.contributor.authorWang, Chung-Hsuanen_US
dc.contributor.authorChao, Chi-chaoen_US
dc.date.accessioned2019-04-02T06:04:53Z-
dc.date.available2019-04-02T06:04:53Z-
dc.date.issued2018-01-01en_US
dc.identifier.urihttp://hdl.handle.net/11536/150782-
dc.description.abstractQuasi-cyclic low-density parity-check (QC-LDPC) codes are an important class of LDPC codes which can be encoded and decoded with low complexity and suitable for many applications. As the code dimension, which describes the number of protected information bits, is equal to the code length minus the rank of the parity-check matrix and the parity-check matrix for QC-LDPC codes is usually not full-rank, determining the rank of the parity-check matrix is of essential importance. In this paper, we study the rank of the parity-check matrix for QC-LDPC codes based on the associated polynomials for circulant matrices. A formula for the rank of the parity-check matrix with only one row-block is first derived. We then extend the result to matrices with two, three, or more row-blocks. Some bounds are also presented for matrices with arbitrary numbers of row-blocks. Furthermore, the exact rank is determined for a class of algebraically constructed parity-check matrices.en_US
dc.language.isoen_USen_US
dc.titleRank Analysis of Parity-Check Matrices for Quasi-Cyclic LDPC Codesen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)en_US
dc.citation.spage491en_US
dc.citation.epage495en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000448139300099en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper