Efficient Cyclostationary Spectrum Sensing Using Low Complexity FFT Algorithms


  • May H. Abood Information Engineering
  • Hikmat N. Abdullah




cognitive radio networks, spectrum sensing, cyclostationary detector, computational complexity, fast Fourier transform


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.




How to Cite

Efficient Cyclostationary Spectrum Sensing Using Low Complexity FFT Algorithms. (2024). Iraqi Journal of Information and Communication Technology, 7(1), 35-46. https://doi.org/10.31987/ijict.7.1.245

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>