LDPC product codes

摘要

Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length. In this paper, we proposed a type of LDPC product codes, which can significantly lower the encoding complexity at the expense of slight degradation in error-rate performance as well as slight increase in decoding complexity