利用低复杂度 FFT 算法实现高效的环静止频谱传感

May H. Abood, Hikmat N. Abdullah
{"title":"利用低复杂度 FFT 算法实现高效的环静止频谱传感","authors":"May H. Abood, Hikmat N. Abdullah","doi":"10.31987/ijict.7.1.245","DOIUrl":null,"url":null,"abstract":"\n\n\nOne of the major problems of cyclostationary spectrum sensing (CSS) system in cognitive radios (CR) are the implementation complexity. One possible way to reduce CSS complexity is to use efficient algorithms for performing Fast Fourier Transformation (FFT). Over the years, a lot of different FFT algorithms have been created. This includes the Split-Radix algorithm., the Fast Hartley Transform (FHT), and slide DFT. This paper investigates the suitable FFT algorithm among the aforementioned techniques, cyclostationary feature detection (CFD)-based spectrum sensing stands out. The methods have been thoroughly compared based on computational time, object size, code size, data dependence (real or complex), and the amount of mathematical operations involved in the computations. Simulation results show that slide FFT is the suitable frequency domain transformation algorithm to use in implementing cyclostationary spectrum sensing in cognitive radios as compared to the other considered algorithms where it provides a significant reduction in FFT stage computation complexity reach to 17% in SRFFT , 78% in FHT and 82% in SDFT while keeping the detection probability at satisfactory level. \n\n\n","PeriodicalId":471846,"journal":{"name":"Iraqi journal of information and communication technology","volume":"10 5","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Cyclostationary Spectrum Sensing Using Low Complexity FFT Algorithms\",\"authors\":\"May H. Abood, Hikmat N. Abdullah\",\"doi\":\"10.31987/ijict.7.1.245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n\\n\\nOne of the major problems of cyclostationary spectrum sensing (CSS) system in cognitive radios (CR) are the implementation complexity. One possible way to reduce CSS complexity is to use efficient algorithms for performing Fast Fourier Transformation (FFT). Over the years, a lot of different FFT algorithms have been created. This includes the Split-Radix algorithm., the Fast Hartley Transform (FHT), and slide DFT. This paper investigates the suitable FFT algorithm among the aforementioned techniques, cyclostationary feature detection (CFD)-based spectrum sensing stands out. The methods have been thoroughly compared based on computational time, object size, code size, data dependence (real or complex), and the amount of mathematical operations involved in the computations. Simulation results show that slide FFT is the suitable frequency domain transformation algorithm to use in implementing cyclostationary spectrum sensing in cognitive radios as compared to the other considered algorithms where it provides a significant reduction in FFT stage computation complexity reach to 17% in SRFFT , 78% in FHT and 82% in SDFT while keeping the detection probability at satisfactory level. \\n\\n\\n\",\"PeriodicalId\":471846,\"journal\":{\"name\":\"Iraqi journal of information and communication technology\",\"volume\":\"10 5\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iraqi journal of information and communication technology\",\"FirstCategoryId\":\"0\",\"ListUrlMain\":\"https://doi.org/10.31987/ijict.7.1.245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iraqi journal of information and communication technology","FirstCategoryId":"0","ListUrlMain":"https://doi.org/10.31987/ijict.7.1.245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

认知无线电(CR)中的环静止频谱传感(CSS)系统的主要问题之一是执行复杂性。降低 CSS 复杂性的一个可行方法是使用高效算法进行快速傅立叶变换 (FFT)。多年来,人们创造了许多不同的 FFT 算法。其中包括 Split-Radix 算法、快速哈特里变换 (FHT) 和滑动 DFT。本文研究了上述技术中合适的 FFT 算法,其中基于循环静止特征检测(CFD)的频谱传感技术脱颖而出。根据计算时间、对象大小、代码大小、数据依赖性(实数或复数)以及计算中涉及的数学运算量,对这些方法进行了全面比较。仿真结果表明,与其他考虑过的算法相比,滑动 FFT 是在认知无线电中实现环静止频谱传感的合适频域变换算法,它能显著降低 FFT 阶段的计算复杂度,在 SRFFT 中为 17%,在 FHT 中为 78%,在 SDFT 中为 82%,同时还能保持令人满意的检测概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Cyclostationary Spectrum Sensing Using Low Complexity FFT Algorithms
One of the major problems of cyclostationary spectrum sensing (CSS) system in cognitive radios (CR) are the implementation complexity. One possible way to reduce CSS complexity is to use efficient algorithms for performing Fast Fourier Transformation (FFT). Over the years, a lot of different FFT algorithms have been created. This includes the Split-Radix algorithm., the Fast Hartley Transform (FHT), and slide DFT. This paper investigates the suitable FFT algorithm among the aforementioned techniques, cyclostationary feature detection (CFD)-based spectrum sensing stands out. The methods have been thoroughly compared based on computational time, object size, code size, data dependence (real or complex), and the amount of mathematical operations involved in the computations. Simulation results show that slide FFT is the suitable frequency domain transformation algorithm to use in implementing cyclostationary spectrum sensing in cognitive radios as compared to the other considered algorithms where it provides a significant reduction in FFT stage computation complexity reach to 17% in SRFFT , 78% in FHT and 82% in SDFT while keeping the detection probability at satisfactory level.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信
小红书