{"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}
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