Results 11 to 20 of about 10,005 (308)
Implementation of quantum and classical discrete fractional Fourier transforms
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and ...
Christodoulides, Demetrios N. +11 more
core +3 more sources
Steerable Discrete Fourier Transform [PDF]
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). Since the DFT is used in numerous fields, it may be of interest in a wide range of applications.
FRACASTORO, GIULIA, MAGLI, ENRICO
openaire +5 more sources
Discrete Quadratic-Phase Fourier Transform: Theory and Convolution Structures
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
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]
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
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]
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
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
Discrete fourier transform on multicore [PDF]
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
Generalized Orthogonal Discrete W Transform and Its Fast Algorithm
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

