基于传输图的编码辅助信道估计的收敛性分析

S. Godtmann, A. Ispas, G. Ascheid
{"title":"基于传输图的编码辅助信道估计的收敛性分析","authors":"S. Godtmann, A. Ispas, G. Ascheid","doi":"10.1109/TURBOCODING.2008.4658719","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the convergence behavior of code-aided channel estimation, also denoted as joint iterative channel estimation and decoding. A mutual information transfer chart is introduced in order to trace the information exchange between channel estimator and decoder throughout the iterative process. Furthermore, a heuristic concept to improve code-aided channel estimation is introduced that outperforms the classical concepts and has the major advantage that it allows for accurate convergence analysis.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Convergence analysis of code-aided channel estimation by means of transfer charts\",\"authors\":\"S. Godtmann, A. Ispas, G. Ascheid\",\"doi\":\"10.1109/TURBOCODING.2008.4658719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the convergence behavior of code-aided channel estimation, also denoted as joint iterative channel estimation and decoding. A mutual information transfer chart is introduced in order to trace the information exchange between channel estimator and decoder throughout the iterative process. Furthermore, a heuristic concept to improve code-aided channel estimation is introduced that outperforms the classical concepts and has the major advantage that it allows for accurate convergence analysis.\",\"PeriodicalId\":284046,\"journal\":{\"name\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TURBOCODING.2008.4658719\",\"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 5th International Symposium on Turbo Codes and Related Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TURBOCODING.2008.4658719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了编码辅助信道估计的收敛性,也称为联合迭代信道估计和译码。为了在整个迭代过程中跟踪信道估计器和解码器之间的信息交换,引入了互信息传递图。此外,引入了一种启发式概念来改进编码辅助信道估计,该概念优于经典概念,并且具有允许精确收敛分析的主要优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Convergence analysis of code-aided channel estimation by means of transfer charts
In this paper, we investigate the convergence behavior of code-aided channel estimation, also denoted as joint iterative channel estimation and decoding. A mutual information transfer chart is introduced in order to trace the information exchange between channel estimator and decoder throughout the iterative process. Furthermore, a heuristic concept to improve code-aided channel estimation is introduced that outperforms the classical concepts and has the major advantage that it allows for accurate convergence analysis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信