摘要
This paper presents a low-complexity redecodingbased error-floor lowering technique for quasi-cyclic (QC) lowdensity parity-check (LDPC) codes, where a predetermined set of variable nodes are attenuated before the redecoding. Using a twostage offline search, the attenuation set is determined based on the error patterns collected from the standard decoding simulation. It is shown that the error floor can be effectively lowered and only a negligible amount of complexity is introduced.