基于SFFT的GNSS接收机快速采集算法

Dingjie Xu, Sida Chen, F. Shen, Guochen Wang, Yue Zhang
{"title":"基于SFFT的GNSS接收机快速采集算法","authors":"Dingjie Xu, Sida Chen, F. Shen, Guochen Wang, Yue Zhang","doi":"10.1109/CPGPS.2017.8075106","DOIUrl":null,"url":null,"abstract":"Acquisition and reacquisition relate to GNSS receiver performance directly. In many environments we need faster acquisition. So we design a sparse fast Fourier transform algorithm that can be used in satellite signal receiver. This algorithm mainly includes three steps. To begin with, we use window function to filter signal. Moreover, we hash Fourier coefficients to different “frequency bucket”. Perform location and valuation estimating at last. Using this algorithm we can calculate k maximum Fourier coefficients quickly. This algorithm has simple structure and run time is sub-linear compared with signal length. According to the characteristic we designed an acquisition method using SFFT to replace normal FFT. Finally, simulation result shows that the algorithm can substantially reduce complex computation under normal signal noise ratio.","PeriodicalId":340067,"journal":{"name":"2017 Forum on Cooperative Positioning and Service (CPGPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A fast acquisition algorithm of GNSS receiver based on SFFT\",\"authors\":\"Dingjie Xu, Sida Chen, F. Shen, Guochen Wang, Yue Zhang\",\"doi\":\"10.1109/CPGPS.2017.8075106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Acquisition and reacquisition relate to GNSS receiver performance directly. In many environments we need faster acquisition. So we design a sparse fast Fourier transform algorithm that can be used in satellite signal receiver. This algorithm mainly includes three steps. To begin with, we use window function to filter signal. Moreover, we hash Fourier coefficients to different “frequency bucket”. Perform location and valuation estimating at last. Using this algorithm we can calculate k maximum Fourier coefficients quickly. This algorithm has simple structure and run time is sub-linear compared with signal length. According to the characteristic we designed an acquisition method using SFFT to replace normal FFT. Finally, simulation result shows that the algorithm can substantially reduce complex computation under normal signal noise ratio.\",\"PeriodicalId\":340067,\"journal\":{\"name\":\"2017 Forum on Cooperative Positioning and Service (CPGPS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Forum on Cooperative Positioning and Service (CPGPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CPGPS.2017.8075106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Forum on Cooperative Positioning and Service (CPGPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CPGPS.2017.8075106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

采集和再采集直接关系到GNSS接收机的性能。在许多环境中,我们需要更快的获取。为此,我们设计了一种可用于卫星信号接收机的稀疏快速傅里叶变换算法。该算法主要包括三个步骤。首先,我们使用窗函数对信号进行滤波。此外,我们将傅里叶系数散列到不同的“频率桶”。最后进行选址和估价。利用该算法可以快速计算出k个最大傅立叶系数。该算法结构简单,运行时间相对于信号长度是次线性的。根据其特点,设计了一种用SFFT代替普通FFT的采集方法。最后,仿真结果表明,在正常信噪比下,该算法可以大大减少复杂的计算量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast acquisition algorithm of GNSS receiver based on SFFT
Acquisition and reacquisition relate to GNSS receiver performance directly. In many environments we need faster acquisition. So we design a sparse fast Fourier transform algorithm that can be used in satellite signal receiver. This algorithm mainly includes three steps. To begin with, we use window function to filter signal. Moreover, we hash Fourier coefficients to different “frequency bucket”. Perform location and valuation estimating at last. Using this algorithm we can calculate k maximum Fourier coefficients quickly. This algorithm has simple structure and run time is sub-linear compared with signal length. According to the characteristic we designed an acquisition method using SFFT to replace normal FFT. Finally, simulation result shows that the algorithm can substantially reduce complex computation under normal signal noise ratio.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信