A low-complexity time delay estimation algorithm based on spectral factorization in OFDM system

J. Su, Ming Li, Yanli Hou
{"title":"A low-complexity time delay estimation algorithm based on spectral factorization in OFDM system","authors":"J. Su, Ming Li, Yanli Hou","doi":"10.1145/3573428.3573751","DOIUrl":null,"url":null,"abstract":"When the Root-MUSIC algorithm (Root-Multiple Signal Classification) is used to estimate time delay in the Orthogonal Frequency Division Multiplexing (OFDM) system, there exists computational redundancy because of the required roots being conjugating symmetry. Aiming at this problem, a Root-MUSIC algorithm based on spectral factorization—SF-Root-MUSIC algorithm is proposed. Based on the structural characteristics of Laurent polynomials, the proposed algorithm uses spectral factorization to reduce the order for the root polynomial by half thus reducing the computational complexity. The simulation results show that the proposed algorithm has lower computational complexity while maintaining the same precision, and is more suitable for real-time computing.","PeriodicalId":314698,"journal":{"name":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","volume":"6 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3573428.3573751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When the Root-MUSIC algorithm (Root-Multiple Signal Classification) is used to estimate time delay in the Orthogonal Frequency Division Multiplexing (OFDM) system, there exists computational redundancy because of the required roots being conjugating symmetry. Aiming at this problem, a Root-MUSIC algorithm based on spectral factorization—SF-Root-MUSIC algorithm is proposed. Based on the structural characteristics of Laurent polynomials, the proposed algorithm uses spectral factorization to reduce the order for the root polynomial by half thus reducing the computational complexity. The simulation results show that the proposed algorithm has lower computational complexity while maintaining the same precision, and is more suitable for real-time computing.
OFDM系统中一种基于频谱分解的低复杂度时延估计算法
在正交频分复用(OFDM)系统中,使用根多信号分类算法(Root-MUSIC)估计时延时,由于所需根是共轭对称的,存在计算冗余。针对这一问题,提出了一种基于谱分解的Root-MUSIC算法- sf -Root-MUSIC算法。该算法基于洛朗多项式的结构特征,采用谱分解将根多项式的阶数降低一半,从而降低了计算复杂度。仿真结果表明,该算法在保持相同精度的情况下具有较低的计算复杂度,更适合于实时计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信