Title :
Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels
Author :
Cheng, Ling ; Ferreira, Hendrik C. ; Swart, Theo G.
Author_Institution :
Dept. of Electr. & Electron. Eng. Sci., Johannesburg Univ.
Abstract :
In this paper, we present a bidirectional Viterbi decoding algorithm using the Levenshtein distance metric for a regular convolutional encoding system. For a deletion channel, this decoding algorithm can correct an average of 30 deletion errors within a 6000 bit frame, when using an r = 0.67 regular convolutional code; and it can correct an average of 80 deletion errors within a 4000 bit frame, when using an r = 0.25 regular convolutional code
Keywords :
Viterbi decoding; channel coding; convolutional codes; Levenshtein distance metric; bidirectional Viterbi decoding; convolutional encoding system; deletion channels; Africa; Conferences; Convolutional codes; Decoding; Digital communication; Electronic mail; Error correction; Error correction codes; Information theory; Viterbi algorithm;
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
DOI :
10.1109/ITW2.2006.323798
