一种基于fft的低复杂度超宽带信道估计算法

Zhixing Wang, Xinghua Ren, Z. Tan
{"title":"一种基于fft的低复杂度超宽带信道估计算法","authors":"Zhixing Wang, Xinghua Ren, Z. Tan","doi":"10.1145/3268866.3268875","DOIUrl":null,"url":null,"abstract":"This paper describes a general windowing method to improve the channel estimation of ultra-wideband communication systems, then proposes a new low-complexity channel estimation algorithm which can effectively resist the inter-symbol interference. The algorithm can resist the inter-symbol interference caused by the channel impulse response. The algorithm only requires a 32-point FFT module. It is verified that the algorithm can effectively reduce the interference caused by multi-path channel and noise.","PeriodicalId":285628,"journal":{"name":"Proceedings of the 2018 International Conference on Artificial Intelligence and Pattern Recognition","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Low Complexity FFT-based Algorithm for Channel Estimation of Ultra-Wideband Communication Systems\",\"authors\":\"Zhixing Wang, Xinghua Ren, Z. Tan\",\"doi\":\"10.1145/3268866.3268875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a general windowing method to improve the channel estimation of ultra-wideband communication systems, then proposes a new low-complexity channel estimation algorithm which can effectively resist the inter-symbol interference. The algorithm can resist the inter-symbol interference caused by the channel impulse response. The algorithm only requires a 32-point FFT module. It is verified that the algorithm can effectively reduce the interference caused by multi-path channel and noise.\",\"PeriodicalId\":285628,\"journal\":{\"name\":\"Proceedings of the 2018 International Conference on Artificial Intelligence and Pattern Recognition\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 International Conference on Artificial Intelligence and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3268866.3268875\",\"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 2018 International Conference on Artificial Intelligence and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3268866.3268875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种改进超宽带通信系统信道估计的通用加窗方法,在此基础上提出了一种新的低复杂度信道估计算法,能有效地抵抗码间干扰。该算法可以抵抗信道脉冲响应引起的码间干扰。该算法只需要一个32点FFT模块。实验证明,该算法能有效地降低多径信道和噪声带来的干扰。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Low Complexity FFT-based Algorithm for Channel Estimation of Ultra-Wideband Communication Systems
This paper describes a general windowing method to improve the channel estimation of ultra-wideband communication systems, then proposes a new low-complexity channel estimation algorithm which can effectively resist the inter-symbol interference. The algorithm can resist the inter-symbol interference caused by the channel impulse response. The algorithm only requires a 32-point FFT module. It is verified that the algorithm can effectively reduce the interference caused by multi-path channel and noise.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信