Title :
Graph-theoretic construction of low-density parity-check codes
Author :
Djurdjevic, Ivana ; Lin, Shu ; Abdel-Ghaffar, Khaled
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA
fDate :
4/1/2003 12:00:00 AM
Abstract :
This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.
Keywords :
graph theory; iterative decoding; parity check codes; LDPC codes; code length; connected graphs; graph-theoretic construction; graph-theoretic method; iterative decoding; low-density parity-check codes; trellis-based algorithms; Iterative algorithms; Iterative decoding; Null space; Parity check codes; Sparse matrices;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2003.809990
