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

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 lo...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2010-02, Vol.14 (2), p.169-171
Main Authors: Tam, W.M., Lau, F.C.M., Tse, C.K.
Format: Article
Language:English
Subjects:
Applied sciences
Approximate lower triangular structure
Approximation
AWGN channels
Channels
Coding, codes
Complexity
Decoding
Encoding
encoding complexity
Error analysis
Errors
Exact sciences and technology
Information, signal and communications theory
Parity
Parity check codes
QC low-density-parity-check (LDPC) codes
Senior members
Shift registers
Signal and communications theory
Telecommunications and information theory
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2010.02.091930