Related papers: Discrete Weierstrass Fourier Transform and Experim…
This paper develops a constructive numerical scheme for Fourier-Bessel approximations on disks compatible with convolutions supported on disks. We address accurate finite Fourier-Bessel transforms (FFBT) and inverse finite Fourier-Bessel…
This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving…
A novel addition to the family of integral transforms, the quadratic phase Fourier transform (QPFT) embodies a variety of signal processing tools, including the Fourier transform (FT), fractional Fourier transform (FRFT), linear canonical…
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
We propose a new method for (global) Hurst exponent determination based on wavelets. Using this method, we analyze synthetic data with predefined Hurst exponents, fracture surfaces and data from economy. The results are compared with those…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
Recent network traffic studies argue that network arrival processes are much more faithfully modeled using statistically self-similar processes instead of traditional Poisson processes [LTWW94,PF95]. One difficulty in dealing with…
We present a new space-efficient approach, (SparseDTW), to compute the Dynamic Time Warping (DTW) distance between two time series that always yields the optimal result. This is in contrast to other known approaches which typically…
The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called…
The discrete Fourier transform has proven to be an essential tool in many geometric and combinatorial problems in vector spaces over finite fields. In general, sets with good uniform bounds for the Fourier transform appear more `random' and…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
We propose a simpler derivation of the probability density function of Feller Diffusion using the Fourier Transform and solving the resulting equation via the Method of Characteristics. We also discuss simulation algorithms and confirm key…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
This paper determines how to define a discretely implemented Fourier transform when analysing an observed spatial point process. To develop this transform we answer four questions; first what is the natural definition of a Fourier…
This contribution features an accelerated computation of the Sinkhorn's algorithm, which approximates the Wasserstein transportation distance, by employing nonequispaced fast Fourier transforms (NFFT). The algorithm proposed allows…
We introduce discrete wave-front sets with respect to Fourier Lebesgue and modulation spaces. We prove that these wave-front sets agree with corresponding wave-front sets of "continuous type".
The double Fourier sphere (DFS) method uses a clever trick to transform a function defined on the unit sphere to the torus and subsequently approximate it by a Fourier series, which can be evaluated efficiently via fast Fourier transforms.…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
The analytical solving dynamic problems of elasticity theory for piecewise homogeneous half-space is found. The explicit construction of direct and inverse Fourier's vector transform with discontinuous coefficients is presented. The…
We propose an improvement of the known DFT-based indexing technique for fast retrieval of similar time sequences. We use the last few Fourier coefficients in the distance computation without storing them in the index since every coefficient…