Iterative Decoding Algorithm For Turbo Product Codes

Transcript

Turbo product codes (TPC) are very suitable for applications requiring a large code length, a high code-rate, and good error performance. This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration. This soft-input/soft-output decoder is a Chase decoder which delivers soft outputs instead of binary decisions. The soft output of the decoder is an estimation of the log-likelihood ratio (LLR) of the binary decisions given by the Chase decoder. The iterative decoding of product codes is also known as block turbo code (BTC) because the concept is quite similar to turbo codes based on iterative decoding of concatenated recursive convolutional codes. The performance of product code over Gaussian channel using BPSK signaling is shown for different code words.