Results 241 to 250 of about 1,372,895 (290)
Broadband Fourier-Transform Optical Photothermal Infrared Spectroscopy and Imaging. [PDF]
Anal ChemRazumtcev A +6 more
europepmc +1 more source
Contribution of Fourier transform infrared spectroscopy for outbreak investigation of carbapenem-resistant <i>Acinetobacter baumannii</i>. [PDF]
Microbiol SpectrKon H +10 more
europepmc +1 more source
Hadamard gate realization based on quantum Fourier transform for the creation of quantum numbers in the integrated optical domain. [PDF]
Sci RepArmaghani S, Rostami A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Fourier transform and the discrete Fourier transform
Inverse Problems, 1989This paper gives an error bound in computing the Fourier transform for a square summable function by means of the discrete Fourier transform. In detail description, the error bound depends on the number of samples, the interval where the samples are taken, the interval where the Fourier transform is being approximated, the local averaging in the time ...
Auslander, Louis, Grünbaum, F. Alberto
openaire +2 more sources
On Fourier Series on the Torus and Fourier Transforms
Mathematical Notes, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Scientific American, 1989
To calculate a transform, just listen. The ear automatically performs the calculation, which the intellect can execute only after years of mathematical education. The ear formulates a transform by converting sound-the waves of pressure traveling through time and the atmosphere-into a spectrum, a description of the sound as a series of volumes at ...
openaire +2 more sources
To calculate a transform, just listen. The ear automatically performs the calculation, which the intellect can execute only after years of mathematical education. The ear formulates a transform by converting sound-the waves of pressure traveling through time and the atmosphere-into a spectrum, a description of the sound as a series of volumes at ...
openaire +2 more sources
On Fourier-Stieltjes Transforms
Canadian Journal of Mathematics, 1955Let be the class of bounded non-decreasing functions defined on the real line which are normalized by the conditions ϕ(− ∞) = 0 , ϕ(t + 0) = ϕ(t).Let be the class of Fourier-Stieltjes transforms of elements of i.e. the elements of and are connected by the relationwhere ϕ ∊ and Φ ∊ .It is well known, and easy to verify that this mapping from to ...
Calderón, Alberto P., Devinatz, A.
openaire +2 more sources
Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
SIAM Journal on Scientific Computing, 1996Accuracy of the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) depends on the accuracy of the twiddle factors entirely. For accurate twiddle factor tables, this paper recommends to compute the sine/cosine functions with high precision arithmetic along the algorithms in terms of faster converging approximations, such as rational ...
openaire +1 more source
ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 2003
A novel approach to the definition of the roots of unity in the RNS (residue number system) is presented. The definition is based on a suitable polar representation of the complex residues. The resulting RNS Fourier transform provides an algorithm for performing circular convolutions characterized by flexibility in terms of length, computational cost ...
Pietro Burrascano +4 more
openaire +2 more sources
A novel approach to the definition of the roots of unity in the RNS (residue number system) is presented. The definition is based on a suitable polar representation of the complex residues. The resulting RNS Fourier transform provides an algorithm for performing circular convolutions characterized by flexibility in terms of length, computational cost ...
Pietro Burrascano +4 more
openaire +2 more sources
IEEE Transactions on Computers, 1983
This paper surveys nine designs for VLSI circuits that compute N-element Fourier transforms. The largest of the designs requires O(N2 log N) units of silicon area; it can start a new Fourier transform every O(log N) time units. The smallest designs have about 1/Nth of this throughput, but they require only 1/Nth as much area.
openaire +2 more sources
This paper surveys nine designs for VLSI circuits that compute N-element Fourier transforms. The largest of the designs requires O(N2 log N) units of silicon area; it can start a new Fourier transform every O(log N) time units. The smallest designs have about 1/Nth of this throughput, but they require only 1/Nth as much area.
openaire +2 more sources