Constructing Quasi-Cyclic LDPC Codes For Efficient Encoding Based on Fast Gauss Elimination

In this paper, a fast gauss eliminating algorithm for parity-check matrices of Quasi-Cyclic LDPC codes is proposed firstly. Enlightened by the gauss elimination, some Quasi-Cyclic square matrices with full rank are constructed. By proper matrix extension based on the full rank square matrices, we construct a kind of parity-check matrices whose column weights are either two or three. It is suitable for efficient encoding procedures in with a linear complexity. Simulation results show a better performance compared to array based LDPC codes and LDPC codes in 802.11n standard.