Results 21 to 30 of about 10,005 (308)
Calculation of Fourier-Galois transforms in reduced binary number systems [PDF]
Компьютерная оптика, 2018 The paper proposes a new method for calculating Fourier-Galois transforms (number-theoretical transforms), which are a modular analog of the discrete Fourier transform.
Vladimir Chernov
doaj +1 more source
The discrete fractional Fourier transform [PDF]
IEEE Transactions on Signal Processing, 1999 Summary: We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform.
Cagatay Candan +2 more
openaire +5 more sources
Radar matched filtering using the fractional fourier transform [PDF]
, 2010 -A matched filter is the optimal linear filter for maximizing the signal to noise ratio (SNR) in the presence of additive noise. Matched filters are commonly used in radar systems where the transmitted signal is known and may be used as a replica to be ...
Clemente, Carmine +5 more
core +1 more source
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.
openaire +3 more sources
Improved Homomorphic Discrete Fourier Transforms and FHE Bootstrapping
IEEE Access, 2019 Homomorphic encryption (HE), which enables computation on ciphertexts without any leakage, rise as a most promising solution for privacy-preserving data processing, including secure machine learning and secure out-sourcing computation.
Kyoohyung Han +2 more
doaj +1 more source
A Fast Mellin and Scale Transform
EURASIP Journal on Advances in Signal Processing, 2007 A fast algorithm for the discrete-scale (and β-Mellin) transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity.
Davide Rocchesso, Antonio De Sena
doaj +2 more sources
Four Particular Cases of the Fourier Transform
Mathematics, 2018 In previous studies we used Laurent Schwartz’ theory of distributions to rigorously introduce discretizations and periodizations on tempered distributions.
Jens V. Fischer
doaj +1 more source
Comparison of discrete transforms for deep‐neural‐networks‐based speech enhancement
IET Signal Processing, 2022 In recent studies of speech enhancement, a deep‐learning model is trained to predict clean speech spectra from the known noisy spectra of speech. Rather than using the traditional discrete Fourier transform (DFT), this paper considers other well‐known ...
Wissam A. Jassim, Naomi Harte
doaj +1 more source
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
Pseudorandomness via the Discrete Fourier Transform [PDF]
2015 IEEE 56th 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. We give an explicit construction of a pseudorandom generator that fools the discrete Fourier transforms of linear functions with seed-length that is nearly logarithmic (up to polyloglog ...
Gopalan, Parikshit +2 more
openaire +5 more sources