By Topic

An upper bound on the back-up depth for maximum likelihood decoding of convolutional codes (Corresp.)

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

1 Author(s)

By using distance properties of convolutional codes, an upper bound on the back-up depth for maximum likelihood decoding is derived. Then several constraints for performing the back-up search are introduced which eliminate the necessity for many of the subsearches. Examples are given in each step to explain the approach.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 3 )