Abstract

We describe the operation of common convolutional decoding algorithms in the presence of insertions, deletions, as well as substitutions in the received message. We first propose a trellis description that can handle the existence of insertions and deletions. Then, we use this trellis diagram to develop the Viterbi algorithm and the Log-MAP algorithm in the presence of synchronization errors. The proposed techniques are presented in the most general form where standard convolutional codes are used and no change to the encoder is required. We establish the effectiveness of the proposed algorithms using standard convolutional codes at different rates.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call