By Topic

Decision-directed decoder for a binary symmetric channel with unknown crossover probability

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)

We consider a suboptimum decision-directed block decoder for a binary symmetric channel that makes use of past decoding decisions to update its estimate of the channel's initially unknown crossover probability. The decoder has a threshold list decoding rule that uses the current estimated crossover probability. The estimate is updated by means of a stochastic approximation algorithm. It is shown to converge toward the true crossover probability with a bias that decreases exponentially with the code's block length, provided it never "runs away" toward zero after dropping below a certain critical value. The probability that this runaway phenomenon ever occurs is bounded by an expression that is exponentially decreasing in the code's block length and in the weight assigned to the initial estimate.

Published in:

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