Analysis of check-node merging decoding for punctured LDPC codes with dual-diagonal parity structure

초록

In this paper, we propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, we analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.

키워드