To the theory of low-density convolutional codes. I
Selected properties of low-density convolutional (LDC) codes are investigated. The authors analyze a special statistical set of LDC codes described by Markov equations. For such codes the lower bound of free distance and upper bounds for decoding error probability are evaluated. The authors also propose and analyze an iterative decoding algorithm, with hard decisions for homogeneous LDC codes of rate 1/2. Additionally, they compare the complexity characteristics of convolutional turbo- and LDC codes, verifying the analytical results via simulation experiments.
upper bounds for decoding error probability
scientific article; zbMATH DE number 1467814