By Topic

Analysis of decoders for convolutional codes by stochastic sequential machine methods

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)

In this paper, the decoder of a convolutional code is modeled as an autonomous stochastic sequential machine and finite Markov chain theory applied to obtain a precise expression forP_{FD} (u), the probability of error associated with the feedback decoding of theuth subblock of information digits. The analysis technique developed extends directly to any convolutional decoder for a linear convolutional code, used for transmission over a finite state channel. The limit ofP_{FD} (u)asutends to infinity, when the limit exists, is termedP_{FD}, the steady-state probability of error of feedback decoding. Sufficient conditions on decoders are given in order forP_{FD}to exist, and two classes of minimum-distance decoders exhibited that meet these sufficient conditions.P_{FD}is calculated for an example using the binary-symmetric channel and found to satisfyP_{FD} le P_{DD}whereP_{DD}is the probability of error associated with feedback-free decoding of the same code.

Published in:

Information Theory, IEEE Transactions on  (Volume:16 ,  Issue: 4 )