All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S6-T2.1
Paper Title Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length
Authors Farzane Amirzade, Mohammad-Reza Sadeghi, Amirkabir University of Technology, Iran; Daniel Panario, Carleton University, Canada
Session D1-S6-T2: Quasi-Cyclic LDPC Codes
Chaired Session: Monday, 12 July, 23:40 - 00:00
Engagement Session: Tuesday, 13 July, 00:00 - 00:20
Abstract We consider multiple-edge QC-LDPC codes with a base matrix of large size. We propose a new method, $\emph{the degree reduction method}$, to obtain exponent matrices of these codes which considerably reduces the complexity of the search algorithm. We also provide a necessary and sufficient condition to avoid 4-cycles from occurrence in the Tanner graph of codes obtained using our method. Then, we apply our method to quasi-cyclic protograph-based Raptor-Like LDPC (QC-PBRL-LDPC) codes whose base matrices are multiple-edge. Numerical results show that as a consequence of this study we can obtain the minimum lifting degree of QC-PBRL-LDPC codes with girth at least 6. Thus, the lengths of the obtained codes are much smaller than those of their counterpart short-length codes in the literature.