Title :
Irregular LDPC codes as concatenation regular LDPC codes
Author :
Fossorier, Marc ; Miladinovic, Nenad
Author_Institution :
Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA
fDate :
7/1/2005 12:00:00 AM
Abstract :
In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained counterparts for the BSC. On the other hand, they can offer advantages in term of convergence and error performance for lengths of practical interest and long enough to validate the degree distribution selection.
Keywords :
concatenated codes; convergence; error correction codes; iterative decoding; parity check codes; probability; telecommunication channels; BSC; LDPC code construction; binary symmetric channel; concatenation code; convergence; error performance; iterative decoding; low density parity check code; Bipartite graph; Concatenated codes; Convergence; Error correction; Error correction codes; Iterative decoding; Parity check codes; Performance analysis; Protection; Symmetric matrices;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2005.1461686
