选择性映射降低复杂性涡轮信道估计操作在高时间和频率选择性信道

Sihem Châabouni, M. Siala, N. Sellami
{"title":"选择性映射降低复杂性涡轮信道估计操作在高时间和频率选择性信道","authors":"Sihem Châabouni, M. Siala, N. Sellami","doi":"10.1002/ett.1397","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a time division multiple access (TDMA) transmission of coded symbols over a time and frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equaliser and a MAP decoder is used. We give the expression of the MAP iterative burst-by-burst channel estimation algorithm using the Expectation-Maximisation (EM) algorithm. Since the obtained algorithm is complex, we propose to simplify it by neglecting the inter-symbol interference (ISI) term. In order to reduce the error caused by this simplification, we propose to use a candidate precoder at the transmitter chosen among a given set of precoders such that the selected precoded sequence leads to the minimum mean square value of the ISI neglected term. Simulations show that the performance of the approximate algorithm with precoding are almost similar to the performance of the exact algorithm. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"83 1","pages":"519-525"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Selective mapping for reduced complexity turbo channel estimation operating on highly time and frequency selective channels\",\"authors\":\"Sihem Châabouni, M. Siala, N. Sellami\",\"doi\":\"10.1002/ett.1397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a time division multiple access (TDMA) transmission of coded symbols over a time and frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equaliser and a MAP decoder is used. We give the expression of the MAP iterative burst-by-burst channel estimation algorithm using the Expectation-Maximisation (EM) algorithm. Since the obtained algorithm is complex, we propose to simplify it by neglecting the inter-symbol interference (ISI) term. In order to reduce the error caused by this simplification, we propose to use a candidate precoder at the transmitter chosen among a given set of precoders such that the selected precoded sequence leads to the minimum mean square value of the ISI neglected term. Simulations show that the performance of the approximate algorithm with precoding are almost similar to the performance of the exact algorithm. Copyright © 2010 John Wiley & Sons, Ltd.\",\"PeriodicalId\":50473,\"journal\":{\"name\":\"European Transactions on Telecommunications\",\"volume\":\"83 1\",\"pages\":\"519-525\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Transactions on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ett.1397\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Transactions on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ett.1397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们考虑了一个时分多址(TDMA)的传输编码符号在一个时间和频率选择信道。接收机采用由最大后验均衡器(MAP)和MAP解码器组成的涡轮检波器。我们用期望最大化(EM)算法给出了MAP迭代逐突发信道估计算法的表达式。由于所得到的算法比较复杂,我们建议通过忽略符号间干扰(ISI)项来简化算法。为了减少这种简化引起的误差,我们建议在一组给定的预编码器中选择一个候选预编码器,使所选的预编码序列导致ISI被忽略项的均方值最小。仿真结果表明,带预编码的近似算法的性能与精确算法的性能几乎相当。版权所有©2010 John Wiley & Sons, Ltd
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Selective mapping for reduced complexity turbo channel estimation operating on highly time and frequency selective channels
In this paper, we consider a time division multiple access (TDMA) transmission of coded symbols over a time and frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equaliser and a MAP decoder is used. We give the expression of the MAP iterative burst-by-burst channel estimation algorithm using the Expectation-Maximisation (EM) algorithm. Since the obtained algorithm is complex, we propose to simplify it by neglecting the inter-symbol interference (ISI) term. In order to reduce the error caused by this simplification, we propose to use a candidate precoder at the transmitter chosen among a given set of precoders such that the selected precoded sequence leads to the minimum mean square value of the ISI neglected term. Simulations show that the performance of the approximate algorithm with precoding are almost similar to the performance of the exact algorithm. Copyright © 2010 John Wiley & Sons, Ltd.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
9 months
期刊最新文献
Session and media signalling for communication components‐based open multimedia conferencing Web service over IP networks On cost-sharing mechanisms in cognitive radio networks Round-robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links Cross-layer design for double-string cooperative communications in wireless ad-hoc networks A passive location system for single frequency networks using digital terrestrial TV signals
×
引用
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