By Topic

Generalization of Gallager's adaptive error control scheme

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)

One of the simplest, yet most effective schemes thus far devised for the correction of errors on compound channels is the adaptive decoding scheme invented by Gallager. In this paper we present a generalization of this scheme which, at a modest sacrifice in rate, enables the decoder to correct a burst even when the guard space following the burst contains random errors. This is accomplished with the use of two convolutional codes, C and C^ {\ast } , where C^ {\ast } contains C . At the encoder, the information sequence is first encoded with C and then, after a fixed delay, is encoded with a "shortened" version of C^ {\ast } , which is added to the parity sequences of C . At the decoder there are two modes of operation, a random mode and a burst mode. In the random mode errors are corrected with C in a manner similar to that of the Gallager scheme. In the burst mode, the information bits in the bursty blocks are recovered from the later blocks where they have been superimposed on the parity bits. In this mode a decoder for C^ {\ast } , which precedes the decoder for C , removes random errors from these later blocks, thereby greatly increasing the probability of recovery from the burst.

Published in:

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