By Topic

Sequential decoding for discrete input memoryless channels

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

1 Author(s)

A scheme is described which sequentially encodes the output of a discrete letter source into the input symbols of a discrete input memoryless channel, with adjacent channel symbols mutually constrained over a length, n . The encoder permits desired channel input symbol probabilities to be approximated closely. Decoding at the receiver is accomplished with delay n by means of sequential tests on potential transmitted sequences with reject criteria set so that incorrect sequences are likely to be rejected at short lengths and the correct sequence is likely to be accepted. Averaged over a suitably defined ensemble of encoders, the decoding scheme has an average probability of error with an upper limit whose logarithm approaches -nE(R) for large n. E(R) is dependent only on the data rate R . For a channel symmetric at its output with equally likely inputs, the exponent E(R) is optimum for rates greater than a rate called R_{\hbox{crit}} . For such symmetric channels, a computation cutoff rate R_{co\mp} is defined. For R < R_{co\mp} , the average number of decoding computations does not grow exponentially with n , but algebraically. R_{co\mp} is also defined for an asymmetric channel. In this case too, the average number of decoding computations grows algebraically with n for R < R_{co\mp} .

Published in:

Information Theory, IRE Transactions on  (Volume:8 ,  Issue: 3 )