Effectiveness of modified iterative decoding algorithm for Cubic Product Codes

In this paper a modified iterative decoding algorithm (MIDA) is proposed for decoding the Cubic Product Codes (CPC), also called three dimensional product block codes. It is a hard decision decoder that was initially proposed by the same authors for decoding simple product codes, where the decoding complexity of the basic iterative algorithm was significantly reduced with negligible performance degradation. Two versions of the proposed algorithm are investigated that are with and without complexity reduction. A complexity and performance trade-off is also highlighted. Bit error rate (BER) performance of the proposed algorithm over a Rayleigh flat fading channel, is demonstrated by the simulations.