Abstract :
The symbol error probability bounds for maximum likelihood sequence detection (MLSD) of continuous phase modulation (CPM) signals are studied. The calculation of the upper bound is based on the transfer function technique, which has been generalised. A new method for constructing a lower bound for CPM systems is proposed. From numerical comparisons, it can be seen that the proposed algorithm can substantially improve the lower bound compared to previous approaches by considering the entire set of transmitted data sequences and not only the worst case. This generalised algorithm may be applied to any system that can be described as a finite-state machine
Keywords :
AWGN channels <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; Viterbi detection <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; continuous phase modulation <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; error statistics <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; finite state machines <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; maximum likelihood detection <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; transfer functions <sym. error probab. for MLSD of CPM sigs., AWGN channel, lower bounds>; AWGN channel; CPM signals; Viterbi detection; continuous phase modulation; finite-state machine; lower bound; maximum likelihood sequence detection; symbol error probability bounds; transfer function technique; transmitted data sequences; upper bound;
