Semi-random LDPC codes with efficient encoding

Xueqin Jiang, M.H. Lee · Electronics Letters · 2009

An approach to construct semi-random low-density parity-check (SR-LDPC) codes is introduced. These codes are designed with the progressive edge-growth algorithm and can be encoded with only multiple parity-check encoders and interleavers. Therefore, the proposed codes have large girth and efficient encoding. Simulation results show that the codes perform very well over the AWGN channel with iterative decoding.

Read the paper · More papers on PaperTik