使用Levenshtein距离度量的删除信道双向Viterbi解码

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323798

Ling Cheng, H. C. Ferreira, T. Swart

{"title":"使用Levenshtein距离度量的删除信道双向Viterbi解码","authors":"Ling Cheng, H. C. Ferreira, T. Swart","doi":"10.1109/ITW2.2006.323798","DOIUrl":null,"url":null,"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","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels\",\"authors\":\"Ling Cheng, H. C. Ferreira, T. Swart\",\"doi\":\"10.1109/ITW2.2006.323798\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323798\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文提出了一种基于Levenshtein距离度量的正则卷积编码系统双向Viterbi解码算法。对于删除信道，当使用r = 0.67的正则卷积码时，该解码算法可以在6000比特帧内平均纠正30个删除错误;当使用r = 0.25的正则卷积码时，它可以在4000比特帧内平均纠正80个删除错误

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量