相关论文: A promotion for odd symmetric discrete Fourier tra…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
The short-time Fourier transform (STFT), or the discrete Gabor transform (DGT), has been extensively used in signal analysis and processing. Their properties are characterized by a window function. For signal processing, designing a special…
An orthogonal discrete auditory transform (ODAT) from sound signal to spectrum is constructed by combining the auditory spreading matrix of Schroeder et al and the time one map of a discrete nonlocal Schr\"odinger equation. Thanks to the…
In some of the problems, complicated functions of the Z-transform variable, $z$, appear which either cannot be inverted analytically or the required calculations are quite tedious. In such cases numerical methods should be used to find the…
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…
As an extension of the 2D fractional Fourier transform (FRFT) and a special case of the 2D linear canonical transform (LCT), the gyrator transform was introduced to produce rotations in twisted space/spatial-frequency planes. It is a useful…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
In this paper, a new single-carrier waveform, called chirped discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM), is proposed for the sixth generation of communications. As the initial study on this…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
We review double field theory (DFT) with emphasis on the doubled spacetime and its generalized coordinate transformations, which unify diffeomorphisms and b-field gauge transformations. We illustrate how the composition of generalized…
The nonlinear Fourier transform (NFT) decomposes waveforms propagating through optical fiber into nonlinear degrees of freedom, which are preserved during transmission. By encoding information on the nonlinear spectrum, a transmission…
Subsystem Density-Functional Theory (DFT) is an emerging technique for calculating the electronic structure of complex molecular and condensed phase systems. In this topical review, we focus on some recent advances in this field related to…
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
In this paper, we present an assortment of both standard and advanced Fourier techniques that are useful in the analysis of astrophysical time series of very long duration -- where the observation time is much greater than the time…
Image Representation learning via input reconstruction is a common technique in machine learning for generating representations that can be effectively utilized by arbitrary downstream tasks. A well-established approach is using…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
Two (so-called left and right) variants of N-centered ensemble density-functional theory (DFT) [Senjean and Fromager, Phys. Rev. A 98, 022513 (2018)] are presented. Unlike the original formulation of the theory, these variants allow for the…
Two-Dimensional (2D) Discrete Fourier Transform (DFT) is a basic and computationally intensive algorithm, with a vast variety of applications. 2D images are, in general, non-periodic, but are assumed to be periodic while calculating their…
This letter is the first part of a three-part tutorial on orthogonal time frequency space (OTFS) modulation, which is a promising candidate waveform for future wireless networks. This letter introduces and compares two popular…