Related papers: On Multiangle Discrete Fractional Periodic Transfo…
Non-uniform fast Fourier Transform (NUFFT) and inverse NUFFT (INUFFT) algorithms, based on the Fast Multipole Method (FMM) are developed and tested. Our algorithms are based on a novel factorization of the FFT kernel, and are implemented…
Multi-frame algorithms for single-channel speech enhancement are able to take advantage from short-time correlations within the speech signal. Deep filtering (DF) recently demonstrated its capabilities for low-latency scenarios like hearing…
The common methods of spectral analysis for multivariate ($n$-dimensional) time series, like discrete Frourier transform (FT) or Wavelet transform, are based on Fourier series to decompose discrete data into a set of trigonometric model…
This paper introduces a couple of new time-frequency transforms, designed to adapt their scale to specific features of the analyzed function. Such an adaptation is implemented via so-called focus functions, which control the window scale as…
Modern radio interferometers enable high-resolution polarization imaging, offering insights into cosmic magnetism through Rotation Measure (RM) synthesis. Traditional 2+1D RM synthesis treats the 2D spatial and 1D spectral transforms…
A simple least-squares optimisation enables the determination of the spectrum for irregularly sampled data that is readily reconstructed using an adjoint transformation of the Non-Uniform Fast Fourier Transform (NFFT). This is an…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
There is a class of physical filtration processes where the input is adequately modeled by a continuous periodic function f (x) of bounded variation over its period, and the output depends only on certain harmonics of the Fourier expansion…
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…
Fractional programming (FP) is a branch of mathematical optimization that deals with the optimization of ratios. It is an invaluable tool for signal processing and machine learning, because many key metrics in these fields are fractionally…
Many models and real complex systems possess critical thresholds at which the systems shift from one sate to another. The discovery of the early warnings of the systems in the vicinity of critical point are of great importance to estimate…
In deep time series forecasting, the Fourier Transform (FT) is extensively employed for frequency representation learning. However, it often struggles in capturing multi-scale, time-sensitive patterns. Although the Wavelet Transform (WT)…
Edge devices are being deployed at increasing volumes to sense and act on information from the physical world. The discrete Fourier transform (DFT) is often necessary to make this sensed data suitable for further processing -- such as by…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…
In this paper, a new fast and low complexity transform is introduced for orthogonal frequency division multiplexing (OFDM) wireless systems. The new transform combines the effects of fast complex-Walsh-Hadamard transform (CHT) and the fast…
Classical dynamical density functional theory (DDFT) is one of the cornerstones of modern statistical mechanics. It is an extension of the highly successful method of classical density functional theory (DFT) to nonequilibrium systems.…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
This paper details the purpose, difficulties, theory, implementation, and results of developing a Fast Fourier Transform (FFT) using the prime factor algorithm on an embedded system. Many applications analyze the frequency content of…
We make the comparative study of scaling range properties for detrended fluctuation analysis (DFA), detrended moving average analysis (DMA) and recently proposed new technique called modified detrended moving average analysis (MDMA). Basic…
In this paper we consider the problem of constructing graph Fourier transforms (GFTs) for directed graphs (digraphs), with a focus on developing multiple GFT designs that can capture different types of variation over the digraph…