Convolutional self-doubly orthogonal codes and their iterative threshold decoding

Abstract

An extension of convolutional self-orthogonal codes called convolutional self-doubly orthogonal codes which are decoded using an iterative threshold decoding algorithm with no interleaver is presented. These new codes allow good error performance in addition to providing attractive trade-off between complexity and latency. Some code searching results yielding new codes are provided together with their error performance evaluation. Puncturing techniques for systematic convolutional codes that allows us to obtain high-rate R = b/(b + 1) punctured convolutional self-doubly orthogonal codes in the wide sense are also investigated. Some punctured convolutional self-doubly orthogonal codes are presented and their bit error probabilities are evaluated using computer simulations.