By Topic

Use of the Viterbi algorithm to compute error events of trellis phase coding in order of increasing distance

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)
J. M. Tennant ; Dept. of Eng., Cambridge Univ., UK ; N. Kngsbury

The use of the Viterbi algorithm to evaluate the minimum-distance parameters of trellis phase codes is extended to evaluate distances and paths of error events other than the free-distance event. Distances and paths are found for error events sequentially in order of increasing distance, starting with the free-distance event. Memory requirements increase slowly with the number of error events required. The time taken to find the next error event increases slowly with the number of error events already found. Results of sample calculations and computation times are included

Published in:

IEEE Transactions on Communications  (Volume:36 ,  Issue: 10 )