一种turbo码的距离谱估计方法

T. Sakai, K. Shibata
{"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}
引用次数: 1

摘要

提出了一种新的turbo码距离谱估计算法。提出了连续两个非零输入的间隔小于基本周期的基本误差事件。DS由若干具有基本周期长度和基本误差事件组合的连续零输入递归估计。该方法通过查找码字权值表和状态转移表,而不是遍历栅格图,从而降低了码字权值计算的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信