摘要：Iterative decoding is quite useful for decoding Hamming product codes. The idea behind the method is to divide the entire decoding process into sequence steps, such that later phases can use the output of previous stages to produce their results. Hard-decision iterative decoding is easy to implement, has low complexity and can correct many error patterns with quantities of error bits greater than half the minimum distance of the code. However, the existing hard-decision iterative decoding methods fail to correct the errors up to half the minimum distance of the code due to the existence of stall patterns. In this paper, a new hard-decision iterative decoding method is proposed to overcome this limitation. The proposed method is implemented and assessed based on error bit experiments and channel experiments (including the Gaussian channel and binary symmetric channel). The results show that the proposed method outperforms other methods.
