A class of QC-LDPC codes with low encoding complexity and good error performance

Authors:
Wai M. Tam;Francis C. M. Lau;Chi K. Tse
Affiliations:
Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong;Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong;Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 2

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes for fast encoding

IEEE Transactions on Information Theory

Efficiently encodable irregular QC-LDPC codes constructed from self-reciprocal generator polynomials of MDS codes

IEEE Communications Letters
Efficient decoding of QC-LDPC codes using GPUs

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel approximate lower triangular structure for the parity part of the parity-check matrix of QC-LDPC codes. About half of the non-zero elements in the parity part are set to locate on the upper diagonal while the remaining non-zero elements can be located almost anywhere within the lower triangular area, provided certain rules are observed. Compared with the typical dual-diagonal structure, the proposed structure requires very similar encoding complexity and produces lower error rates over an AWGN channel.