Convolutional decoding in the presence of synchronization errors

Authors:
Mohamed F. Mansour;Ahmed H. Tewfik
Affiliations:
DSP Solutions R&D Center, Texas Instruments Inc., Dallas, TX;Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2010

Citing 4
Cited 1

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech Watermarking

IEEE Transactions on Information Forensics and Security
Asymptotically good codes correcting insertions, deletions, and transpositions

IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions

IEEE Transactions on Information Theory

Automata for codes

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.07

Visualization

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.