A bandwidth efficient constant envelope modulation with binary convolutional coding

This paper demonstrates the application of binary convolutional coding applied to the bandwidth efficient, constant envelope modulation developed by Resnikoff and Tigerman. The modulation waveform and phase form are presented with the corresponding bit error performance expression for uncoded M-ary modulation. Probability of information bit error performance analysis is provided for M-ary modulation with binary convolutional coding with hard and soft decision Viterbi decoding. Expected performance bounds and coding gains are determined using the probability of information bit error performance analysis for M = 8 modulation with rate 1/3 binary convolutional codes, and are validated by numerical simulations. Near optimum path metrics are devised for M-ary modulation with binary convolutional codes with soft decision decoding.