Efficient decoding of partial unit memory codes of arbitrary rate

(Partial) Unit Memory ((P)UM) codes are a special class of convolutional codes, which can be constructed based on block codes and hence, the decoder may take advantage of existing efficient decoders for the block code. Known constructions and a so-called Bounded Minimum Distance decoding algorithm for (P)UM codes consider only low code rates. In this paper, a generalization of the construction and the decoding to (P)UM codes of arbitrary rate is shown. The parameters of the arbitrary rate construction are analyzed and the Dettmar–Sorger decoding algorithm is generalized, its correctness is proven and it is shown that the complexity of decoding one block is cubic in its length.     «

(Partial) Unit Memory ((P)UM) codes are a special class of convolutional codes, which can be constructed based on block codes and hence, the decoder may take advantage of existing efficient decoders for the block code. Known constructions and a so-called Bounded Minimum Distance decoding algorithm for (P)UM codes consider only low code rates. In this paper, a generalization of the construction and the decoding to (P)UM codes of arbitrary rate is shown. The parameters of the arbitrary rate constr...     »