{"title":"一种turbo码的距离谱估计方法","authors":"T. Sakai, K. Shibata","doi":"10.1109/ISITA.2008.4895620","DOIUrl":null,"url":null,"abstract":"This study shows a new algorithm for distance spectrum (DS) estimation of turbo codes. We propose fundamental error event whose intervals of the consecutive two non zero inputs are less than the fundamental period. The DS is recursively estimated by some consecutive zero inputs with length of the fundamental period and the combination of fundamental error events. The proposed method also reduces the complexity of the calculation of codeword weight by looking up the tables of the number of weights and state transition instead of traversing over the trellis diagram.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A distance spectrum estimation method of turbo codes\",\"authors\":\"T. Sakai, K. Shibata\",\"doi\":\"10.1109/ISITA.2008.4895620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study shows a new algorithm for distance spectrum (DS) estimation of turbo codes. We propose fundamental error event whose intervals of the consecutive two non zero inputs are less than the fundamental period. The DS is recursively estimated by some consecutive zero inputs with length of the fundamental period and the combination of fundamental error events. The proposed method also reduces the complexity of the calculation of codeword weight by looking up the tables of the number of weights and state transition instead of traversing over the trellis diagram.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A distance spectrum estimation method of turbo codes
This study shows a new algorithm for distance spectrum (DS) estimation of turbo codes. We propose fundamental error event whose intervals of the consecutive two non zero inputs are less than the fundamental period. The DS is recursively estimated by some consecutive zero inputs with length of the fundamental period and the combination of fundamental error events. The proposed method also reduces the complexity of the calculation of codeword weight by looking up the tables of the number of weights and state transition instead of traversing over the trellis diagram.