Related papers: Adaptive algorithm for microsensor in sustainable …
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of…
In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified `base' frequencies $\{u_i\}_{i=1}^M$, where $M$ is the number of…
In many processes, the variations in underlying characteristics can be approximated by noisy multi-periodic patterns. If large-scale patterns are superimposed by a noise with long-range correlations, the detection of multi-periodic patterns…
Modern power systems are at risk of largely reducing the inertia of generation assets and prone to experience extreme dynamics. The consequence is that, during electromechanical transients triggered by large contingencies, transmission of…
This paper proposes a method for estimating and detecting optical signals in practical photon-counting receivers. There are two important aspects of non-perfect photon-counting receivers, namely, (i) dead time which results in blocking…
Optoacoustic imaging technologies require fast and accurate signal pre-processing algorithms to enable widespread deployment in clinical and home-care settings. However, they still rely on the Discrete Fourier Transform (DFT) as the default…
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving…
The presence of interharmonics in power systems can lead to asynchronous sampling, a phenomenon further aggravated by shifts in the fundamental frequency, which significantly degrades the accuracy of power measurements. Under such…
In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…
The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency…
Fast Fourier Transform (FFT) relies on the HRV frequency-domain analysis techniques. It requires re-sampling of the inherently unevenly sampled heartbeat time-series (RR tachogram) to produce an evenly sampled time series of the heartbeat.…
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)$…
An integrated photonic circuit architecture to perform a modified-convolution operation based on the Discrete Fractional Fourier Transform (DFrFT) is introduced. This is accomplished by utilizing two nonuniformly-coupled waveguide lattices…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
Digital signal processing is a valuable practical skill for the contemporary physicist, yet in physics curricula its central concepts are often introduced either in method courses in a highly abstract and mathematics-oriented manner or in…
In this paper we present an interference detection toolbox consisting of a high dynamic range Digital Fast-Fourier-Transform spectrometer (DFFT, based on FPGA-technology) and data analysis software for automated radio frequency interference…
The quality of energy produced in renewable energy systems has to be at the high level specified by respective standards and directives. The estimation accuracy of grid signal parameters is one of the most important factors affecting this…
In this paper a novel data embedding technique in frequency domain has been proposed using Discrete Fourier Transform (DFT) for image authentication and secured message transmission based on hiding a large volume of data into gray images.…
The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption,…
The FFT algorithm that implements the discrete Fourier transform is considered one of the top ten algorithms of the $20$th century. Its main strengths are the low computational cost of $\mathcal{O}(n \log n$) and its stability. It is one of…