Low Complexity 2D Off-Grid OTFS Channel Estimation in Fractional Delay-Doppler Scenarios

Xiangjun Li, Xiaolin He, Y. Liang, Qianli Wang
{"title":"Low Complexity 2D Off-Grid OTFS Channel Estimation in Fractional Delay-Doppler Scenarios","authors":"Xiangjun Li, Xiaolin He, Y. Liang, Qianli Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233767","DOIUrl":null,"url":null,"abstract":"In high-mobility wireless communication scenarios, orthogonal time-frequency space (OTFS) is a promising two-dimensional (2D) modulation scheme that can efficiently represent the delay-Doppler (DD) domain channel using only a few parameters. However, fractional delay and/or fractional Doppler reduce the channel’s sparsity, thus increasing the difficulty in channel estimation. Off-grid methods are previously utilized to estimate the fractional delay-Doppler channels, based on the expectation-maximization sparse Bayesian learning (EMSBL). However, these methods require matrix inversion in each iteration which results in significant computational complexity. To reduce the complexity, this paper proposes a low-complexity off-grid channel estimation scheme by employing a recently introduced efficient sparse Bayesian learning (ESBL). Additionally, a strategy for updating the off-grid parameters is adopted, further reducing the complexity of off-grid channel estimation. Simulation results demonstrate the effectiveness of the proposed method in comparison to existing channel estimation schemes in the doubly fractional scenarios, at a slight tolerable loss in channel estimation performance.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In high-mobility wireless communication scenarios, orthogonal time-frequency space (OTFS) is a promising two-dimensional (2D) modulation scheme that can efficiently represent the delay-Doppler (DD) domain channel using only a few parameters. However, fractional delay and/or fractional Doppler reduce the channel’s sparsity, thus increasing the difficulty in channel estimation. Off-grid methods are previously utilized to estimate the fractional delay-Doppler channels, based on the expectation-maximization sparse Bayesian learning (EMSBL). However, these methods require matrix inversion in each iteration which results in significant computational complexity. To reduce the complexity, this paper proposes a low-complexity off-grid channel estimation scheme by employing a recently introduced efficient sparse Bayesian learning (ESBL). Additionally, a strategy for updating the off-grid parameters is adopted, further reducing the complexity of off-grid channel estimation. Simulation results demonstrate the effectiveness of the proposed method in comparison to existing channel estimation schemes in the doubly fractional scenarios, at a slight tolerable loss in channel estimation performance.
分数延迟-多普勒场景下低复杂度2D离网OTFS信道估计
在高移动性无线通信场景中,正交时频空间(OTFS)是一种很有前途的二维(2D)调制方案,它可以利用很少的参数有效地表示延迟多普勒(DD)域信道。然而,分数延迟和/或分数多普勒降低了信道的稀疏性,从而增加了信道估计的难度。以前,基于期望最大化稀疏贝叶斯学习(EMSBL)的离网方法被用于估计分数延迟多普勒信道。然而,这些方法需要在每次迭代中进行矩阵反演,这导致了极大的计算复杂度。为了降低复杂度,本文提出了一种低复杂度的离网信道估计方案,该方案采用了最近引入的高效稀疏贝叶斯学习(ESBL)。此外,采用了离网参数更新策略,进一步降低了离网信道估计的复杂度。仿真结果表明,与现有的双分数阶信道估计方案相比,该方法在信道估计性能有轻微的可容忍损失的情况下是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信