对长周期脉冲星微弱群的有效搜索

Shubham Singh, J. Roy, Ujjwal Panda, B. Bhattacharyya
{"title":"对长周期脉冲星微弱群的有效搜索","authors":"Shubham Singh, J. Roy, Ujjwal Panda, B. Bhattacharyya","doi":"10.23919/URSI-RCRS56822.2022.10118534","DOIUrl":null,"url":null,"abstract":"The conventional periodicity search, based on the fast Fourier transform (FFT) of the time series, has two major drawbacks while searching for long period pulsars. Long period pulsars often have short duty cycles and the FFT based search with harmonic summing over a limited harmonic space is less sensitive for short duty cycles. The FFT search is also highly vulnerable to rednoise in the radio telescope data, reducing its sensitivity for longer periods. Since the current population of radio pulsars is mostly discovered by the FFT based search, there is a strong possibility of a missing population of long period and short duty cycle pulsars. An alternative search method for non-accelerated periodic signals is the fast folding algorithm (FFA), which has a uniform response for all periods and duty cycles. The FFA search provides an unbiased way to search for periodic signals with superior sensitivity. Though sufficiently bright population of long period pulsars can be discovered in single pulse searches, a suitable periodicity search along with an increase in integration time per pointing is required in major pulsar surveys to discover the fainter population of long period pulsars.","PeriodicalId":229743,"journal":{"name":"2022 URSI Regional Conference on Radio Science (USRI-RCRS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Search for the Faint Population of Long Period Pulsars\",\"authors\":\"Shubham Singh, J. Roy, Ujjwal Panda, B. Bhattacharyya\",\"doi\":\"10.23919/URSI-RCRS56822.2022.10118534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The conventional periodicity search, based on the fast Fourier transform (FFT) of the time series, has two major drawbacks while searching for long period pulsars. Long period pulsars often have short duty cycles and the FFT based search with harmonic summing over a limited harmonic space is less sensitive for short duty cycles. The FFT search is also highly vulnerable to rednoise in the radio telescope data, reducing its sensitivity for longer periods. Since the current population of radio pulsars is mostly discovered by the FFT based search, there is a strong possibility of a missing population of long period and short duty cycle pulsars. An alternative search method for non-accelerated periodic signals is the fast folding algorithm (FFA), which has a uniform response for all periods and duty cycles. The FFA search provides an unbiased way to search for periodic signals with superior sensitivity. Though sufficiently bright population of long period pulsars can be discovered in single pulse searches, a suitable periodicity search along with an increase in integration time per pointing is required in major pulsar surveys to discover the fainter population of long period pulsars.\",\"PeriodicalId\":229743,\"journal\":{\"name\":\"2022 URSI Regional Conference on Radio Science (USRI-RCRS)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 URSI Regional Conference on Radio Science (USRI-RCRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/URSI-RCRS56822.2022.10118534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 URSI Regional Conference on Radio Science (USRI-RCRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/URSI-RCRS56822.2022.10118534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的基于时间序列快速傅里叶变换(FFT)的周期性搜索在搜索长周期脉冲星时存在两个主要缺陷。长周期脉冲星通常具有较短的占空比,基于FFT的在有限谐波空间上进行谐波求和的搜索对短占空比的灵敏度较低。FFT搜索也极易受到射电望远镜数据中的红噪声的影响,从而降低了它在较长时间内的灵敏度。由于目前的射电脉冲星群大多是通过基于FFT的搜索发现的,因此很有可能会有长周期和短占空比的脉冲星群丢失。对于非加速周期信号的另一种搜索方法是快速折叠算法(FFA),该算法在所有周期和占空比下具有一致的响应。FFA搜索提供了一种无偏的方法来搜索具有优越灵敏度的周期信号。虽然单脉冲搜索可以发现足够亮的长周期脉冲星群,但在大型脉冲星调查中,要发现较暗的长周期脉冲星群,需要进行适当的周期性搜索,并增加每次指向的积分时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Search for the Faint Population of Long Period Pulsars
The conventional periodicity search, based on the fast Fourier transform (FFT) of the time series, has two major drawbacks while searching for long period pulsars. Long period pulsars often have short duty cycles and the FFT based search with harmonic summing over a limited harmonic space is less sensitive for short duty cycles. The FFT search is also highly vulnerable to rednoise in the radio telescope data, reducing its sensitivity for longer periods. Since the current population of radio pulsars is mostly discovered by the FFT based search, there is a strong possibility of a missing population of long period and short duty cycle pulsars. An alternative search method for non-accelerated periodic signals is the fast folding algorithm (FFA), which has a uniform response for all periods and duty cycles. The FFA search provides an unbiased way to search for periodic signals with superior sensitivity. Though sufficiently bright population of long period pulsars can be discovered in single pulse searches, a suitable periodicity search along with an increase in integration time per pointing is required in major pulsar surveys to discover the fainter population of long period pulsars.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信