Turbo-like codes based on RSC code decomposition

In this paper, we show that recursive systematic convolutional codes with primitive denominator polynomial can be decomposed. As a consequence, an RSC code can be view as a kind of parallel concatenation of one memory RSC code. This decomposition gives an original relation between RSC codes and turbo codes.