Punctured 2D turbo product codes and their performance
Tomáš Janvars, Peter Farkaš
Abstract
Tomáš Janvars, Peter Farkaš
Abstract
In this paper we propose an algorithm of iteratively decoded multidimensional product codes composed of linear codes in an additive white Gaussian noise channel and study its performance. The paper introduces the novel idea of using punctured versions of fixed bits and their usage during the decoding process. For a code rate of 0.66 regular 2D as well as punctured 2D codes are compared.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we propose an algorithm of iteratively decoded multidimensional product codes composed of linear codes in an additive white Gaussian noise channel and study its performance. The paper introduces the novel idea of using punctured versions of fixed bits and their usage during the decoding process. For a code rate of 0.66 regular 2D as well as punctured 2D codes are compared.
Key concepts: Turbo code, Computer science, Serial concatenated convolutional codes, Linear code, Decoding methods, Concatenated error correction code, Algorithm, Additive white Gaussian noise