Implementation of burst-correcting convolutional codes

Abstract

A general procedure is formulated for decoding any convolutional code with decoding delayNblocks that corrects all bursts confined toror fewer consecutive blocks followed by a guard space of at leastN-1consecutive error-free blocks. It is shown that all such codes can be converted to a form called "doubly systematic" which simplifies the decoding circuitry. The decoding procedure can then be implemented with a circuit of the same order of complexity as a parity-checking circuit for a block-linear code. A block diagram of a complete decoder is given for an optimal burst-correcting code. It is further shown that error propagation after a decoding mistake is always terminated by the occurrence of a double guard space of error-free blocks.