Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels

摘要：

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 convolutionai 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.

作者: Ling Cheng Hendrik C.Ferreira Theo G.Swart

作者单位: Department of Electrical and Electronic Engineering Science University of Johannesburg, P.O.Box 524, Auckland Park, 2006, South Africa

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 254-258

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）