Performance Analysis of Multidimensional Parity Check Product Codes

Different from Turbo codes, product codes have no error floor problem and have better performance at high rate. In the recent year, product codes are widely used. Parity check product codes, which have the simpler decoding algorithm, can adapt to different required data length. Its performance formula is proposed after analyzing the code multiplicity and information multiplicity. Computer simulations show that the performance of the formula is the same as that of maximum likelihood(ML) decoding algorithm and iterative decoding algorithm. Performance analysis, which is based on different parameters such as code rate, dimension, and code length, shows that multidimensional parity check product codes have close performance at same code rate and dimension, and the codes with higher dimension can get better performance at same code rate.