Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Distance spectra and upper bounds on error probability for trellis codes

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
$31 $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)
Trofimov, A.N. ; St. Petersburg Inst. of Aircraft Instrum., Russia ; Kudryashov, B.D.

The problem of estimating error probability for trellis codes is considered. The set of all squared Euclidean distances between code sequences is presented as a countable set. This representation is used for calculating the generating functions for upper-bounding error probability and bit error probability for trellis codes satisfying some symmetry conditions. The generating functions of squared Euclidean distances (distance spectra) are obtained by inversion of a matrix of order 2ν. It is shown that the generating functions are defined in terms of one formal variable for QAM and uniform AM, and in terms of q/4 formal variables for q-ary PSK, q=2m, where m⩾2 is an integer. For small ν, the generating functions may be found in closed form. For larger ν, a numerical technique for obtaining some initial terms of the power series expansion is proposed. This algorithm is based on the recurrent matrix equations and the Chinese remainder theorem

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 2 )