Sparse fast Fourier transform for exactly sparse signals and signals with additive Gaussian noise

被引:0
|
作者
Esra Sengun Ermeydan
Ilyas Cankaya
机构
[1] Ankara Yildirim Beyazit University,
来源
关键词
Sparse fast Fourier transform; Sublinear; Big data; Compressed sensing;
D O I
暂无
中图分类号
学科分类号
摘要
In recent years, the Fourier domain representation of sparse signals has been very attractive. Sparse fast Fourier transform (or sparse FFT) is a new technique which computes the Fourier transform in a compressed way, using only a subset of the input data. Sparse FFT computes the desired transform in sublinear time, which means in an amount of time that is smaller than the size of data. In big data problems and medical imaging to reduce the time that patient spends in MRI machine, FFT algorithm is not ‘fast’ enough anymore; therefore, the concept of sparse FFT is very important. Similar to compressed sensing, sparse FFT algorithm computes just the important components in the frequency domain in sublinear time. In this work, sparse FFT algorithm is studied and implemented on MATLAB and its performance is compared with Ann Arbor FFT. A filter is used to hash the frequencies in the n dimensional frequency-sparse signal into B bins, where B=n/16\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B=n/16$$\end{document}. The filter is used for analyzing an important fraction of the whole signal, and therefore, instead of computing n point FFT, B point FFT is computed, and this results in a faster Fourier transform. The probability of success of the implemented algorithm is investigated for noiseless and noisy signals. It is deduced that as the sparsity increases, the probability of perfect transform also increases. If the performances of the algorithm in both cases are compared, it is clearly seen that the performances degrade when there is noise. Therefore, it can be concluded that the algorithm should be improved especially for noisy considerations. The solvability boundary for a constant probability of error is deducted and added to give insight for future studies.
引用
收藏
页码:445 / 452
页数:7
相关论文
共 50 条
  • [41] Sparse Random Signals for Fast Convergence on Invertible Logic
    Onizawa, Naoya
    Kato, Makoto
    Yamagata, Hitoshi
    Yano, Koji
    Shin, Seiichi
    Fujita, Hiroyuki
    Hanyu, Takahiro
    IEEE ACCESS, 2021, 9 : 62890 - 62898
  • [42] RECONSTRUCTION OF SPARSE SIGNALS USING LIKELIHOOD MAXIMIZATION FROM COMPRESSIVE MEASUREMENTS WITH GAUSSIAN AND SATURATION NOISE
    Banerjee, Shuvayan
    Srivastava, Radhendushka
    Rajwade, Ajit
    29TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2021), 2021, : 1955 - 1959
  • [43] Reconstruction of sparse multiband wavelet signals from Fourier measurements
    Chen, Yang
    Cheng, Cheng
    Sun, Qiyu
    2015 INTERNATIONAL CONFERENCE ON SAMPLING THEORY AND APPLICATIONS (SAMPTA), 2015, : 78 - 81
  • [44] Reconstruction of Sparse Wavelet Signals From Partial Fourier Measurements
    Chen, Yang
    Cheng, Cheng
    Sun, Qiyu
    IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (12) : 2299 - 2303
  • [45] Sampling and Super Resolution of Sparse Signals Beyond the Fourier Domain
    Bhandari, Ayush
    Eldar, Yonina C.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (06) : 1508 - 1521
  • [46] Sparse representation and reproduction of speech signals in complex Fourier basis
    Lee-Chung Kwek
    Alan Wee-Chiat Tan
    Heng-Siong Lim
    Cheah-Heng Tan
    Khaled A. Alaghbari
    International Journal of Speech Technology, 2022, 25 : 211 - 217
  • [47] Sparse representation and reproduction of speech signals in complex Fourier basis
    Kwek, Lee-Chung
    Tan, Alan Wee-Chiat
    Lim, Heng-Siong
    Tan, Cheah-Heng
    Alaghbari, Khaled A.
    INTERNATIONAL JOURNAL OF SPEECH TECHNOLOGY, 2022, 25 (01) : 211 - 217
  • [48] Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms
    Jiang, Zhikang
    Chen, Jie
    Li, Bin
    IEEE ACCESS, 2021, 9 : 97100 - 97119
  • [49] Fast ISAR Imaging Based on Sparse Fourier Transform Algorithm
    Lin, Jiaqi
    Feng, Yuan
    Liu, Shengheng
    2017 9TH INTERNATIONAL CONFERENCE ON ADVANCED INFOCOMM TECHNOLOGY (ICAIT 2017), 2017, : 334 - 339
  • [50] The Analysis of Missing Samples in Signals Sparse in the Hermite Transform Domain
    Brajovic, Milos
    Orovic, Irena
    Dakovic, Milos
    Stankovic, Srdan
    2015 23RD TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2015, : 384 - 387