By Topic

An upper bound on the bit error probability of combined convolutional coding and continuous phase modulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. Lindell ; Telecommun. Theory, Lund. Univ., Sweden ; C. -E. W. Sundberg

The bit error probability properties of signals consisting of convolutional coding combined with partial-response multilevel continuous phase modulation (CPM) are studied. It is assumed that the channel is an additive white Gaussian noise channel and that the receiver performs coherent maximum-likelihood sequence detection by means of the Viterbi algorithm. An upper bound on the bit error probability is derived, using the average generating function technique, and evaluated numerically for a number of coded multilevel full-response CPM schemes. Simulation results are also presented. It is concluded that the free Euclidean distance is the best one-parameter description of the error probability for the considered class of signals for high signal-to-noise ratios. However, the upper bound results show that the free distance alone yields pessimistic bit error probability behavior for some interesting cases

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 5 )