Title :
Shortening for irregular QC-LDPC codes
Author :
Liu, Xiaojian ; Wu, Xiaofu ; Zhao, Chunming
Author_Institution :
Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China
fDate :
8/1/2009 12:00:00 AM
Abstract :
Shortening is a technique to obtain codes of shorter length and lower rate from a given LDPC code by putting infinite reliability on some variable nodes, whose positions are assumed to be available to both encoder and decoder. In this paper, we propose a shortening algorithm suitable for irregular QC-LDPC codes. The efficiency of the proposed algorithm is verified by both theoretical analysis and simulation.
Keywords :
cyclic codes; decoding; parity check codes; decoder; encoder; irregular QC-LDPC codes; low density parity check codes; quasi cyclic code; shortening algorithm; Algorithm design and analysis; Analytical models; Automatic repeat request; Decoding; Encoding; Linear code; Mobile communication; Parity check codes; Product codes; Quantum cascade lasers; LDPC code, shortening, girth.;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2009.091026
