Computing the Discrete Fourier Transform of signals with spectral frequency support
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$ algorithm to compute the DFT. Our algorithm uses some recent characterizations of spectral sets and is a generalization of the standard radix-2 algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Integral Transforms from Finite Data: An Application of Gaussian Process Regression to Fourier Analysis
Computing accurate estimates of the Fourier transform of analog signals from discrete data points is important in many fields of science and engineering. The conventional approach of performing the discrete Fourier trans…
regressionDiscrete Linear Canonical Transform on Graphs
With the wide application of spectral and algebraic theory in discrete signal processing techniques in the field of graph signal processing, an increasing number of signal processing methods have been proposed, such as t…
Quantum spectral analysis: frequency in time, with applications to signal and image processing
A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it is based on Schrodinger equation, which is a partial differential equation that describes how the q…
DenoisingEdge DetectionA Design of Denser-Graph-Frequency Graph Fourier Frames for Graph Signal Analysis
This paper introduces a design method for densergraph-frequency graph Fourier frames (DGFFs) to enhance graph signal processing and analysis. The graph Fourier transform (GFT) enables us to analyze graph signals in the g…
DenoisingInterval propagation through the discrete Fourier transform
We present an algorithm for the forward propagation of intervals through the discrete Fourier transform. The algorithm yields best-possible bounds when computing the amplitude of the Fourier transform for real and comple…