By Topic

Correcting dependent errors in sequences generated by finite-state processes

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)
Hart, G.W. ; Dept. of Electr. Eng., Columbia Univ., New York, NY, USA ; Bouloutas, A.T.

A new channel model and channel inversion algorithm are presented for correcting symbol sequences that have been corrupted by an unknown combination of known fault mechanisms. The algorithm is similar to the Viterbi algorithm in that it is suitable for situations in which the uncorrupted data string is generated by a known finite-state process, but it is more versatile in that it can correct a much broader class of errors. Of particular importance is the fact that the algorithm corrects common context-sensitive errors, such as symbol changes, transpositions, mergers, splits, insertions, and deletions, which may be assigned different probabilities depending on the context of preceeding and subsequent symbols. As many communication channels can be modeled in this way, this algorithm is a significant extension over the Viterbi algorithm and previous decoding techniques. The notion of channel rules is introduced to provide a framework for the user to specify the channel operation. The algorithm is given in both an off-line form and a recursive form suitable for sequentially presented data streams. In most applications, the recursive form has computational complexity only a constant times that of the Viterbi algorithm

Published in:

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