English
Related papers

Related papers: A promotion for odd symmetric discrete Fourier tra…

200 papers

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…

Quantum Physics · Physics 2009-06-08 Srinivas V. Parasa , K. Eswaran

Frequency Estimation of a complex exponential is a problem relevant to a large number of fields. In this paper a computationally efficient and accurate frequency estimator is presented using the guaranteed stable Sliding DFT which gives…

Systems and Control · Computer Science 2012-02-21 Anit Kumar Sahu , Mrityunjoy Chakraborty

The Fractional Fourier Transform (FRT) corresponds to an arbitrary-angle rotation in the phase space, e.g. the time-frequency (TF) space, and generalizes the fundamentally important Fourier Transform. FRT applications range from classical…

Optics · Physics 2024-03-06 Michał Lipka , Michał Parniak

Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…

Information Theory · Computer Science 2011-08-23 Xuebin Wu , Zhiyuan Yan

The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…

Information Theory · Computer Science 2014-10-09 Mansoor I. Yousefi , Frank R. Kschischang

Symmetry is a powerful tool for studying dynamics in QFT: it provides selection rules, constrains RG flows, and often simplifies analysis. Currently, our understanding is that the most general form of symmetry is described by categorical…

High Energy Physics - Theory · Physics 2024-11-06 T. Daniel Brennan , Zhengdi Sun

In this paper, we study the impact of computational complexity on the throughput limits of the {\color{black}fast Fourier transform (FFT)} algorithm for {\color{black}orthogonal frequency division multiplexing(OFDM)} waveforms. Based on the…

Signal Processing · Electrical Eng. & Systems 2022-09-30 Saulo Queiroz , João P. Vilela , Edmundo Monteiro

Orbital-free density functional theory (OF-DFT) is a promising method for large-scale quantum mechanics simulation as it provides a good balance of accuracy and computational cost. Its applicability to large-scale simulations has been aided…

The nonlinear Fourier transform has the potential to overcome limits on performance and achievable data rates which arise in modern optical fiber communication systems when nonlinear interference is treated as noise. The periodic nonlinear…

Signal Processing · Electrical Eng. & Systems 2020-12-24 Jan-Willem Goossens , Hartmut Hafermann , Yves Jaouën

In this article, we study the properties of the nonlinear Fourier spectrum in order to gain better control of the temporal support of the signals synthesized using the inverse nonlinear Fourier transform (NFT). In particular, we provide…

Computational Physics · Physics 2018-09-17 Vishal Vaibhav

The nonlinear Schr\"odinger equation (NSE) is well-known to model an ideal fiber-optic communication channel. Even though the NSE is a nonlinear evolution equation, it can be solved analytically using a nonlinear Fourier transform (NFT).…

Information Theory · Computer Science 2017-08-29 Sander Wahls , Vishal Vaibhav

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…

Chemical Physics · Physics 2017-01-05 Justin C. Smith , Francisca Sagredo , Kieron Burke

Density functional theory (DFT), one of the most widely utilized methods available to computational chemistry, fails to describe systems with statically correlated electrons. To address this shortcoming, in previous work we transformed DFT…

Chemical Physics · Physics 2023-01-02 Daniel Gibney , Jan-Niklas Boyn , David A. Mazziotti

We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density…

Statistics Theory · Mathematics 2013-05-10 Victor M. Panaretos , Shahin Tavakoli

For DFT-spread-OFDM or OFDM, if the delay spread varies in a wide range and the symbol duration is relatively short, adapting the cyclic prefix (CP) duration rather than using a fixed one may significantly improve the spectral efficiency…

Networking and Internet Architecture · Computer Science 2020-08-10 Liangping Ma , Tao Deng , Alpaslan Demir

Unlike covalent two-dimensional (2D) materials like graphene, 2D metals have non-layered structures due to their non-directional, metallic bonding. While experiments on 2D metals are still scarce and challenging, density-functional theory…

Materials Science · Physics 2023-01-06 Kameyab Raza Abidi , Pekka Koskinen

Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem…

Numerical Analysis · Mathematics 2018-10-26 Antonio Cicone , Haomin Zhou

Time-dependent density functional theory (TDDFT) is presently enjoying enormous popularity in quantum chemistry, as a useful tool for extracting electronic excited state energies. This article explains what TDDFT is, and how it differs from…

Materials Science · Physics 2007-05-23 Peter Elliott , Kieron Burke , Filipp Furche

The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these…

Data Structures and Algorithms · Computer Science 2010-02-01 David Harvey , Daniel S. Roche

Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in…

Symbolic Computation · Computer Science 2013-01-30 Andrew Arnold