Low complexity encoding of improved regular LDPC codes
Su-Chang Chae, Yun-Ok Park · 2005
The existing encoding scheme for LDPC codes usually incurs too high complexity and should be changed to a low complexity encoding scheme. However, little consideration has been given to the LDPC encoder VLSI implementation. We consider low complexity encoding of regular LDPC codes, and we propose a pivoting and bit-reverse (PABR) algorithm to rapidly construct the parity-check matrix (PCM). And we consider improved regular LDPC codes in BER performance. We propose that the PCM is constructed with sub-matrixes which are made up of Costas arrays. The codes have sparse PCMs. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding. We show an approach to implementing the LDPC encoder using the PABR algorithm and improving BER performance using a PCM with Costas arrays. This paper then describes an FPGA implementation of regular LDPC encoder on a hardware platform for 4G mobile communication systems.