Title :
A family of irregular LDPC codes with low encoding complexity
Author :
Johnson, Sarah J. ; Weller, Steven R.
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia
Abstract :
We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.
Keywords :
computational complexity; cyclic codes; iterative decoding; parity check codes; difference families; irregular LDPC codes; iterative decoding; low encoding complexity; quasi-cyclic low-density parity-check codes; sum-product algorithm; sum-product decoding; Algebra; Australia; Communication industry; Computational complexity; Encoding; Equations; Iterative decoding; Parity check codes; Sparse matrices; Sum product algorithm;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2002.808375
