Bandwidth-efficient trellis-coded modulation schemes with prescribed decoding delay

A class of trellis-coded modulation schemes whose Viterbi decoder optimally decodes observing a prescribed number of intervals is introduced. For a fixed decoding delay, it is shown that the minimum Euclidean distance of the resulting schemes is upper bounded by that of MSK. Signals that achieve this upper bound and maximize the power within a given bandwidth are found.