Convolutional Decoding in the Presence of Synchronization Errors

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.

[1]  H.C. Ferreira,et al.  Using parallel-interconnected Viterbi decoders to correct insertion/deletion errors , 2004, 2004 IEEE Africon. 7th Africon Conference in Africa (IEEE Cat. No.04CH37590).

[2]  Patrick A. H. Bours,et al.  Construction of fixed-length insertion/deletion correcting runlength-limited codes , 1994, IEEE Trans. Inf. Theory.

[3]  Hendrik C. Ferreira,et al.  Insertion /deletion correcting coding schemes based on convolution coding , 2002 .

[4]  Mohamed F. Mansour,et al.  Convolutional codes for channels with substitutions, insertions, and deletions , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  David J. C. MacKay,et al.  Reliable communication over channels with insertions, deletions, and substitutions , 2001, IEEE Trans. Inf. Theory.

[6]  Frederick F. Sellers,et al.  Bit loss and gain correction code , 1962, IRE Trans. Inf. Theory.

[7]  Hideki Imai,et al.  Viterbi Decoding Considering Synchronization Errors , 1996 .

[8]  David G. Daut,et al.  New short constraint length convolutional code constructions for selected rational rates , 1982, IEEE Trans. Inf. Theory.

[9]  Mohamed F. Mansour,et al.  Convolutional decoding for channels with false alarms , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  Mischa Schwartz,et al.  Two extensions of the Viterbi algorithm , 1991, IEEE Trans. Inf. Theory.

[11]  T. Hatcher.  ON A FAMILY OF ERROR CORRECTING AND SYNCHRONIZABLE CODES. , 1974 .

[12]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[13]  Gaurav Sharma,et al.  Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech Watermarking , 2008, IEEE Transactions on Information Forensics and Security.

[14]  Lorenzo Calabi,et al.  A family of codes for the correction of substitution and synchronization errors , 1969, IEEE Trans. Inf. Theory.

[15]  M. Luby,et al.  Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions , 1999 .

[16]  Hendrik C. Ferreira,et al.  INSERTION/DELETION CORRECTION BY USING PARALLEL- INTERCONNECTED VITERBI DECODERS , 2006 .

[17]  J. Kruskal.  An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules , 1983 .

[18]  T. R. Hatcher.  On a family of error-correcting and synchronizable codes (Corresp.) , 1969, IEEE Trans. Inf. Theory.

[19]  Eiichi Tanaka,et al.  Synchronization and substitution error-correcting codes for the Levenshtein metric , 1976, IEEE Trans. Inf. Theory.

[20]  Mohamed F. Mansour,et al.  Turbo decoding for generalized channels , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[21]  Shu Lin,et al.  Error Control Coding , 2004 .

[22]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[23]  Willem A. Clarke,et al.  Correction of insertions/deletions using standard convolutional codes and the Viterbi decoding algorithm , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[24]  Mohamed F. Mansour,et al.  Efficient decoding of watermarking schemes in the presence of false alarms , 2001, 2001 IEEE Fourth Workshop on Multimedia Signal Processing (Cat. No.01TH8564).