By Topic

Limiting error propagation in Viterbi decoding of convolutional 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)
Leonard, D.A. ; Dept. of Algebra, Combinatorics, & Anal., Auburn Univ., AL, USA ; Rodger, C.A.

The problem of avoiding infinite error propagation in noncatastrophic convolutional codes when using a truncated Viterbi decoder is considered. A truncation length τ is defined in terms of walks in the state diagram. The truncation length guarantees that, in the presence of a sufficiently long guard space, a truncated Viterbi decoder will always recover from any error event. This value of τ is the theoretically smallest possible truncation length

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 6 )