Related papers: Steerable Discrete Fourier Transform
We have designed and constructed a ``dispersed Fourier Transform Spectrometer'' (dFTS), consisting of a conventional FTS followed by a grating spectrometer. By combining these two devices, we negate a substantial fraction of the sensitivity…
The fractional Fourier transform (FRFT) naturally exists in the strongly nonlocal nonlinear (SNN) media and the propagation of optical beams in SNN media can be simply regarded as a self-induced FRFT. Through FRFT technic the evolution of…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Training diffusion models on limited datasets poses challenges in terms of limited generation capacity and expressiveness, leading to unsatisfactory results in various downstream tasks utilizing pretrained diffusion models, such as domain…
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 graph spectral domain…
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…
Image computation is a fundamental tool for performance assessment of astronomical instrumentation, usually implemented by Fourier transform techniques. We review the numerical implementation, evaluating a direct implementation of the…
In this paper, we propose a differentiable version of the short-time Fourier transform (STFT) that allows for gradient-based optimization of the hop length or the frame temporal position by making these parameters continuous. Our approach…
The 3D Discrete Fourier Transform (DFT) is a technique used to solve problems in disparate fields. Nowadays, the commonly adopted implementation of the 3D-DFT is derived from the Fast Fourier Transform (FFT) algorithm. However, evidence…
Density functional theory (DFT) has become the most popular approach to electronic structure across disciplines, especially in material and chemical sciences. Last year, at least 30,000 papers used DFT to make useful predictions or give…
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…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
Modern applications of Covariant Density Functional Theory (CDFT) are discussed. First we show a systematic investigation of fission barriers in actinide nuclei within constraint relativistic mean field theory allowing for triaxial…
In distributed radar systems, when several transmitters radiate simultaneously, the reflected signals need to be distinguished at the receivers to detect various targets. If the transmit signals are in different frequency bands, they…
The Fractional Fourier Transform (FRFT) has been playing a unique and increasingly important role in signal and image processing. In this letter, we investigate the property of frequency shift in two-dimensional FRFT (2D-FRFT) domain. It is…
Density functional theory (DFT) became a universal approach to compute ground-state and excited configurations of many-electron systems held together by an external one-body potential in condensed-matter, atomic, and molecular physics. At…
We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low,…
This paper introduces a new tool for time-series analysis: the Sliding Window Discrete Fourier Transform (SWDFT). The SWDFT is especially useful for time-series with local- in-time periodic components. We define a 5-parameter model for…
Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and to represent graph signals with strong correlation by different modes of variation…
This paper refers to the study of generalized Struve type function. Using generalized Galue type Struve function (GTSF) by Nisar et al. [13], we derive various integral transform, including Euler transform, Laplace transform, Whittakar…