On a reduced complexity soft-input and output iterative decoding algorithm for product codes(HISC2006)

概要

論文の詳細を見る
In this paper, we consider an iterative decoding algorithm for binary product codes. In the decoding algorithm, a soft-input and output iterative decoding algorithm using bounded-distance decoding (BDD) and encodingbased decoding (EBD) is applied to the component codes of the binary product code and the output values are handed over to the next decoding step as the input values. Input sequences of the BDD and EBD are calculated based on a received sequence and given test patterns. We proposed a selection method of the test patterns and showed that the iterative decoding algorithm using test patterns selected by the proposed method provides considerably error performance a conventional iterative decoding algorithm for binary product codes over an AWGN channel using BPSK modulation. We present simulation results of the iterative decoding algorithm with an early termination condition of the decoding process over the AWGN channel using the BPSK modulation. From the results, it has shown that the early termination condition reduces a large number of iterations.
2006-05-18