Results 1 to 10 of about 790,476 (361)
Uncertainty Relation for the Discrete Fourier Transform [PDF]
Physical Review Letters, 2008 We derive an uncertainty relation for two unitary operators which obey a commutation relation of the form UV=exp[i phi] VU. Its most important application is to constrain how much a quantum state can be localised simultaneously in two mutually unbiased ...
A. Bandilla +2 more
core +6 more sources
Discrete Quadratic-Phase Fourier Transform: Theory and Convolution Structures [PDF]
Entropy, 2022 The discrete Fourier transform is considered as one of the most powerful tools in digital signal processing, which enable us to find the spectrum of finite-duration signals.
Hari M. Srivastava +3 more
doaj +2 more sources
Large-Scale Discrete Fourier Transform on TPUs [PDF]
IEEE Access, 2021 In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The two parallel algorithms are associated with two DFT formulations: one formulation, denoted as KDFT, is ...
Tianjian Lu +4 more
doaj +2 more sources
Steerable Discrete Fourier Transform [PDF]
IEEE Signal Processing Letters, 2017 Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT (SDFT).
Fracastoro, Giulia, Magli, Enrico
core +2 more sources
On computing the Discrete Fourier Transform [PDF]
Proceedings of the National Academy of Sciences, 1976 New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
S. Winograd
openaire +4 more sources
Explicit Hermite-type eigenvectors of the discrete Fourier transform [PDF]
SIAM Journal on Matrix Analysis and Applications, 2015 The search for a canonical set of eigenvectors of the discrete Fourier transform has been ongoing for more than three decades. The goal is to find an orthogonal basis of eigenvectors which would approximate Hermite functions -- the eigenfunctions of the ...
Kuznetsov, Alexey
core +3 more sources
Pseudorandomness via the discrete Fourier transform [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2015 We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs.
Gopalan, Parikshit +2 more
core +2 more sources
Inverse Discrete Fourier Transform-Discrete Fourier Transform Techniques for Generating and Receiving Spectrally Efficient Frequency Division Multiplexing Signals [PDF]
, 2011 Problem statement: Spectrally Efficient Frequency Division Multiplexing (SEFDM) system promises bandwidth savings by multiplexing overlapped non-orthogonal sub-carriers.
Rajit
openalex +2 more sources
, 2018 This chapter deals with the discrete Fourier transform (DFT). In Sect. 3.1, we show that numerical realizations of Fourier methods, such as the computation of Fourier coefficients, Fourier transforms or trigonometric interpolation, lead to the DFT. We also present barycentric formulas for interpolating trigonometric polynomials. In Sect.
Gerlind Plonka +3 more
+5 more sources
Secure Distributed Matrix Computation With Discrete Fourier Transform [PDF]
IEEE Transactions on Information Theory, 2020 We consider the problem of secure distributed matrix computation (SDMC), where a user queries a function of data matrices generated at distributed source nodes.
N. Mital, Cong Ling, Deniz Gündüz
semanticscholar +1 more source