Results 11 to 20 of about 282,556 (263)
Fractional Fourier Transform [PDF]
Chapter ...
Ozaktas, Haldun M. +2 more
openaire +5 more sources
Frequency chirped Fourier-Transform spectroscopy
Fast and high-resolution Fourier transform spectrometers are indispensable for cutting-edge infrared spectroscopy. In this study, the authors employed a newly-designed fast-rotating retroreflective, broadband delay line demonstrating fast dual-comb ...
Sergej Markmann +8 more
doaj +1 more source
Coefficient-of-Determination Fourier Transform
This algorithm is designed to perform numerical transforms to convert data from the temporal domain into the spectral domain. This algorithm obtains the spectral magnitude and phase by studying the Coefficient of Determination of a series of artificial ...
Matthew David Marko
doaj +1 more source
Fast Fourier transform revisited
Using FFT (fast Fourier transform), it is assumed, that some signal samples in a respective period N are updated by a sensor in real time. It is urgent for every new signal sample to have new frequency samples (f.s.).
Rimantas Pupeikis
doaj +1 more source
A Didactic and Visual Approach to the Fourier Transform
This work provides a comprehensive derivation of the Fourier transform, with less emphasis on the mathematical rigor associated with the theory. Instead, its primary goal is to serve as a didactic resource that fosters an understanding of various ...
Daniel José Kmita +1 more
doaj +1 more source
Low Complexity Keystone Transform and Radon Fourier Transform Utilizing Chirp-Z Transform
Keystone Transform (KT) and Radon Fourier Transform (RFT) are two popular methods proposed to overcome range migration in radars. A major concern in these methods is the computational complexity for real time operations.
Onur Culha, Yalcin Tanik
doaj +1 more source
Fractional Hartley Transform and its Inverse
The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion ...
Vasant Gaikwad
doaj +1 more source
We consider the problem of computing the Fourier transform of high-dimensional vectors, distributedly over a cluster of machines consisting of a master node and multiple worker nodes, where the worker nodes can only store and process a fraction of the inputs.
Qian Yu 0001 +2 more
openaire +2 more sources
For front-end wireless applications in small battery-powered devices, discrete Fourier transform (DFT) is a critical processing method for discrete time signals. Advanced radix structures are created to reduce the impact of transistor malfunction.
Ernest Ravindran Ramaswami Sachidanandan +2 more
doaj +1 more source

