{"title":"速率k/n卷积码的蝴蝶结构","authors":"Chau-Yun Hsu, T. Kuo","doi":"10.1093/ietfec/e89-a.2.630","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A butterfly structure for rate k/n convolutional codes\",\"authors\":\"Chau-Yun Hsu, T. Kuo\",\"doi\":\"10.1093/ietfec/e89-a.2.630\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4\",\"PeriodicalId\":421826,\"journal\":{\"name\":\"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/ietfec/e89-a.2.630\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/ietfec/e89-a.2.630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们提出了一种适用于所有速率R = k/n的卷积码的Viterbi解码器的蝴蝶结构。它提供了一种有效的方法来发现网格分支的内在对称性。利用这种对称性,只需要计算分支度规的一部分,其他的分支度规可以由计算出来的分支导出。因此,维特比解码器的计算复杂度可以显著降低,且没有错误性能损失。在最好的情况下,蝶形结构可以将分支度量计算减少4倍
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A butterfly structure for rate k/n convolutional codes
In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A butterfly structure for rate k/n convolutional codes Mode decision optimization issues in H.264 video coding Implementation procedure of wireless signal map matching for location-based services Speech synthesis from surface electromyogram signal A text summarizer based on meta-search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1