Shortening for irregular QC-LDPC codes

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.