A Design of Parity Check Matrix for Short Irregular Ldpc Codes via Magic Square Based Algorithm
This paper presents a new design of irregular LDPC codes that supports arbitrary block length. We propose the efficient construction method when nonprime size sub-matrices are used. The problem where GCD (L<inf>1</inf>,L<inf>2</inf>) ≠ 1 that left unsolved has been tackled. We also consider the case GCD (L<inf>1</inf>,L<inf>2</inf>) = 1 but L<inf>1</inf> or L<inf>2</inf> is a nonprime number. The results show that our designed codes have superior performance compared to MAC. The resulted codes still hold the attractive properties of LDPC codes. The performances of interleaved codes are higher than noninterleaved codes and it goes higher as SNR is increased.