Results 251 to 260 of about 2,215,680 (291)
Some of the next articles are maybe not open access.
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
Representation of the Fourier Transform by Fourier Series
Journal of Mathematical Imaging and Vision, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Rheologica Acta, 1998
Oscillatory shear of polymeric liquids in the non-linear regime generates higher harmonic contributions in the shear stress response. These non-linear contributions are analyzed in Fourier space with respect to the different frequencies and intensities. Simulated and experimental Fourier rheology spectra for atactic poly(propylene) melts are shown.
Wilhelm, M., Maring, D., Spiess, H.
openaire +2 more sources
Oscillatory shear of polymeric liquids in the non-linear regime generates higher harmonic contributions in the shear stress response. These non-linear contributions are analyzed in Fourier space with respect to the different frequencies and intensities. Simulated and experimental Fourier rheology spectra for atactic poly(propylene) melts are shown.
Wilhelm, M., Maring, D., Spiess, H.
openaire +2 more sources
Randomization of the Fourier transform
Optics Letters, 2007We have investigated the multiplicity and complexity in eigenvalues of the fractional Fourier transform and found that the ambiguity of the eigenvalues may indicate randomness. We have therefore proposed a method to randomize the Fourier transform. Such a random Fourier transform can be applied in the field of image encryption and decryption.
Zhengjun, Liu, Shutian, Liu
openaire +2 more sources
On Eigenfunctions of the Fourier Transform
Journal of Mathematical Sciences, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flavia Lanzara, Vladimir Maz'ya
openaire +3 more sources
2018
In the previous chapter, we observed a peculiar relation between the smoothness and the rapidity of vanishing at infinity of a function f, as well as its Fourier transform \(\hat {f}\). Based upon this observation, we introduce an important function space \(\mathfrak {S}\), which is invariant under the Fourier transforms. We then proceed to \(\mathfrak
openaire +1 more source
In the previous chapter, we observed a peculiar relation between the smoothness and the rapidity of vanishing at infinity of a function f, as well as its Fourier transform \(\hat {f}\). Based upon this observation, we introduce an important function space \(\mathfrak {S}\), which is invariant under the Fourier transforms. We then proceed to \(\mathfrak
openaire +1 more source
The Discrete Fourier Transform and the Fast Fourier Transform
1998The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm ...
T. M. Peters, J. H. T. Bates
openaire +1 more source
Fourier Transforms and Fourier Transforms N.M.R.
2023Gwenola Burgot, Jean-Louis Burgot
openaire +1 more source