Results 1 to 10 of about 10,061 (308)
Discrete Quadratic-Phase Fourier Transform: Theory and Convolution Structures
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 +1 more source
On the Fractional Derivative Duality in Some Transforms
Mathematics, 2023 Duality is one of the most interesting properties of the Laplace and Fourier transforms associated with the integer-order derivative. Here, we will generalize it for fractional derivatives and extend the results to the Mellin, Z and discrete-time Fourier
Manuel Duarte Ortigueira +1 more
doaj +1 more source
Novel Fourier quadrature transforms and analytic signal representations for nonlinear and non-stationary time-series analysis [PDF]
Royal Society Open Science, 2018 The Hilbert transform (HT) and associated Gabor analytic signal (GAS) representation are well known and widely used mathematical formulations for modelling and analysis of signals in various applications.
Pushpendra Singh
doaj +1 more source
The Discrete Fourier Transform Over the Binary Finite Field
IEEE Access, 2023 The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT.
Sergei Valentinovich Fedorenko
doaj +1 more source
Alternatives to the discrete fourier transform [PDF]
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008 It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform (DTFT) of the same signal at equidistant points on the unit circle. Hence, as the signal length goes to infinity, the DFT approaches the DTFT.
Doru-Cristian Balcan +3 more
openaire +1 more source
Integrated representation for discrete Fourier and wavelet transforms using vector notation
Mehran University Research Journal of Engineering and Technology, 2022 Many mathematical operations are implemented easily through transform domain operations. Multiple transform domain operations are used independently in large and complex applications.
Tariq Javid +3 more
doaj +1 more source
Generalized Orthogonal Discrete W Transform and Its Fast Algorithm
Discrete Dynamics in Nature and Society, 2021 Based on the generalized discrete Fourier transform, the generalized orthogonal discrete W transform and its fast algorithm are proposed and derived in this paper. The orthogonal discrete W transform proposed by Zhongde Wang has only four types. However,
Jichao Sun, Zhengping Zhang
doaj +1 more source
Discrete fourier transform on multicore [PDF]
IEEE Signal Processing Magazine, 2009 This article gives an overview on the techniques needed to implement the discrete Fourier transform (DFT) efficiently on current multicore systems. The focus is on Intel-compatible multicores, but we also discuss the IBM Cell and, briefly, graphics processing units (GPUs).
Franz Franchetti +4 more
openaire +1 more source
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
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