Convolutional coding of binary CPM schemes with no increase in receiver complexity

In this paper, we deal with convolutionally encoded MSK, DMSK and TFM signals. The matched convolutional encoding technique is used which was shown earlier to lead in some eases to the optimum Viterbi demodulation/decoder which is not more complex than the optimum receiver for the uncoded signal. Results of a systematic search for such cases are presented and discussed.<>