Results 21 to 30 of about 306,865 (270)
Four Particular Cases of the Fourier Transform
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
Coherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform [PDF]
Optical structures to implement the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms for discretely sampled data sets are considered. In particular, the decomposition of the FFT algorithm into the basic Butterfly operations is
Birch, Philip M +2 more
core +2 more sources
FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform
Discrete Fourier transform (DFT) is a widely used method of signal analysis in digital signal processing. The DFT converts a signal from time domain to frequency domain for further processing.
Peter Plesznik +2 more
doaj +1 more source
An optical Fourier transform coprocessor with direct phase determination. [PDF]
The Fourier transform is a ubiquitous mathematical operation which arises naturally in optics. We propose and demonstrate a practical method to optically evaluate a complex-to-complex discrete Fourier transform.
Gordon, George SD +2 more
core +2 more sources
Matlab Code for the Discrete Hankel Transform
Previous definitions of a Discrete Hankel Transform (DHT) have focused on methods to approximate the continuous Hankel integral transform without regard for the properties of the DHT itself.
Natalie Baddour, Ugo Chouinard
doaj +1 more source
Steerable Discrete Fourier Transform
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 +1 more source
Uncertainty Relation for the Discrete Fourier Transform [PDF]
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 +1 more source
Fast complexified quaternion Fourier transform
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex quaternion-valued.
Bihan Stephen +3 more
core +4 more sources
Two-Dimensional Discrete Coupled Fractional Fourier Transform (DCFrFT)
The fractional Fourier transform is critical in signal processing and supports many applications. Signal processing is one notable application. Implementing the fractional Fourier transform requires discrete versions.
Asma Elshamy +2 more
doaj +1 more source
Pseudorandomness via the discrete Fourier transform
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 +1 more source

