IEEE Vehicular Technology Conference
Design of QC-LDPC Codes at Finite Lengths
Hyunki Kim, Eugene Ha, Jeongseok Ha
Abstract
This paper proposes a finite-length quasi-cyclic low-density parity-check (QC-LDPC) code design framework based on protograph extrinsic information transfer (PEXIT) analysis, with the objective of minimizing the number of iterations required to meet a target error probability. First, the design$E_{b}/N_{0}$is selected from channel-capacity considerations and is refined for finite-length operation by explicitly accounting for the block length and the target error requirement. Then, at the resulting$E_{b}/N_{0}$, the mutual-information trajectory predicted by the PEXIT chart is exploited to track the evolution of the word error probability. Leveraging this estimate, we introduce a systematic greedy design rule that obviates exhaustive search by progressively removing edges from an initial base matrix subject to structural constraints, thereby markedly reducing the design complexity while improving convergence behavior in terms of the required iteration count.