快速变化移动信道中基于OFDM的宽带通信联合信道估计与均衡

H. Şenol, E. Panayirci, H. Poor
{"title":"快速变化移动信道中基于OFDM的宽带通信联合信道估计与均衡","authors":"H. Şenol, E. Panayirci, H. Poor","doi":"10.1109/GLOCOMW.2010.5700420","DOIUrl":null,"url":null,"abstract":"This paper is concerned with the challenging and timely problem of channel estimation for orthogonal frequency division multiplexing (OFDM) systems in the presence of frequency selective and very rapidly time varying channels. In OFDM systems operating over rapidly time-varying channels, the orthogonality between subcarriers is destroyed leading to inter-carrier interference (ICI) and resulting in an irreducible error floor. The band-limited, discrete cosine serial expansion of low-dimensionality is employed to represent the time-varying channel. In this way, the resulting reduced dimensional channel coefficients are estimated iteratively with tractable complexity and independently of the channel statistics. The algorithm is based on the expectation maximization-maximum a posteriori probability (EM-MAP) technique leading to a receiver structure that also yields the equalized output using the channel estimates. The pilot symbols are employed to estimate the initial coefficients effectively and unknown data symbols are averaged out in the algorithm in a non-data-aided fashion. It is shown that the computational complexity of the proposed algorithm to estimate the channel coefficients and to generate the equalized output as a by-product is ≃ O(N) per detected symbol, N being the number of OFDM subcarriers. Computational complexity as well as computer simulations carried out for the systems described in WiMAX and LTE standards indicate that it has significant performance and complexity advantages over existing suboptimal channel estimation and equalization algorithms proposed earlier in the literature.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Joint channel estimation and equalization for OFDM based broadband communications in rapidly varying mobile channels\",\"authors\":\"H. Şenol, E. Panayirci, H. Poor\",\"doi\":\"10.1109/GLOCOMW.2010.5700420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with the challenging and timely problem of channel estimation for orthogonal frequency division multiplexing (OFDM) systems in the presence of frequency selective and very rapidly time varying channels. In OFDM systems operating over rapidly time-varying channels, the orthogonality between subcarriers is destroyed leading to inter-carrier interference (ICI) and resulting in an irreducible error floor. The band-limited, discrete cosine serial expansion of low-dimensionality is employed to represent the time-varying channel. In this way, the resulting reduced dimensional channel coefficients are estimated iteratively with tractable complexity and independently of the channel statistics. The algorithm is based on the expectation maximization-maximum a posteriori probability (EM-MAP) technique leading to a receiver structure that also yields the equalized output using the channel estimates. The pilot symbols are employed to estimate the initial coefficients effectively and unknown data symbols are averaged out in the algorithm in a non-data-aided fashion. It is shown that the computational complexity of the proposed algorithm to estimate the channel coefficients and to generate the equalized output as a by-product is ≃ O(N) per detected symbol, N being the number of OFDM subcarriers. Computational complexity as well as computer simulations carried out for the systems described in WiMAX and LTE standards indicate that it has significant performance and complexity advantages over existing suboptimal channel estimation and equalization algorithms proposed earlier in the literature.\",\"PeriodicalId\":232205,\"journal\":{\"name\":\"2010 IEEE Globecom Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2010.5700420\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2010.5700420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了正交频分复用(OFDM)系统中存在频率选择性和快速时变信道时的信道估计问题。在快速时变信道上运行的OFDM系统中,子载波之间的正交性被破坏,导致载波间干扰(ICI),并导致不可减小的误差层。采用带限的低维离散余弦级数展开来表示时变信道。通过这种方式,得到的降维信道系数迭代估计具有可处理的复杂性和独立于信道统计。该算法基于期望最大化-最大后验概率(EM-MAP)技术,导致接收器结构也使用信道估计产生均衡输出。该算法利用导频符号有效地估计初始系数,并以非数据辅助的方式对未知数据符号进行平均。结果表明,该算法用于估计信道系数和产生均衡输出副产物的计算复杂度为每个检测符号(N为OFDM子载波数)≃O(N)。对WiMAX和LTE标准中描述的系统进行的计算复杂性和计算机模拟表明,与文献中先前提出的现有次优信道估计和均衡算法相比,它具有显着的性能和复杂性优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint channel estimation and equalization for OFDM based broadband communications in rapidly varying mobile channels
This paper is concerned with the challenging and timely problem of channel estimation for orthogonal frequency division multiplexing (OFDM) systems in the presence of frequency selective and very rapidly time varying channels. In OFDM systems operating over rapidly time-varying channels, the orthogonality between subcarriers is destroyed leading to inter-carrier interference (ICI) and resulting in an irreducible error floor. The band-limited, discrete cosine serial expansion of low-dimensionality is employed to represent the time-varying channel. In this way, the resulting reduced dimensional channel coefficients are estimated iteratively with tractable complexity and independently of the channel statistics. The algorithm is based on the expectation maximization-maximum a posteriori probability (EM-MAP) technique leading to a receiver structure that also yields the equalized output using the channel estimates. The pilot symbols are employed to estimate the initial coefficients effectively and unknown data symbols are averaged out in the algorithm in a non-data-aided fashion. It is shown that the computational complexity of the proposed algorithm to estimate the channel coefficients and to generate the equalized output as a by-product is ≃ O(N) per detected symbol, N being the number of OFDM subcarriers. Computational complexity as well as computer simulations carried out for the systems described in WiMAX and LTE standards indicate that it has significant performance and complexity advantages over existing suboptimal channel estimation and equalization algorithms proposed earlier in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mobile radio channels' estimation for SC-FDMA systems by means of adequate noise and inter-carrier interference filtering in a transformed domain Performance enhancement in limited feedback precoded spatial multiplexing MIMO-OFDM systems by using multi-block channel prediction Techniques for embracing intra-cell unbalanced bit error characteristics in MLC NAND flash memory 4K digital cinema home theater over high throughput wireless transmission system Outage analysis for WCDMA femtocell with uplink attenuation
×
引用
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