Turbo decoding for generalized channels

We propose a turbo decoding framework in the presence of insertions and deletions as well as substitutions in the received sequence. The decoding algorithm is based on the Viterbi algorithm for this special channel. The synchronization information is exchanged between decoders in the proposed structure and extrinsic information is used, as is commonly done in turbo decoders. Simulation results indicate that the proposed turbo structure does indeed improve the performance of the Viterbi algorithm, particularly at high code rates.

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

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

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

[4]  David J. C. MacKay,et al.  Codes for Channels with Insertions, Deletions and Substitutions , 2000 .

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

[6]  Jun Tan,et al.  A MAP equivalent SOVA for non-binary turbo codes , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.