Related papers: An Integer Approximation Method for Discrete Sinus…
In~\cite{sic-magazine-2025}, the authors show that the square index coefficients (SICs) of the $N$-point discrete Fourier transform (DFT) -- that is, the coefficients $X_{k\sqrt{N}}$ for $k = 0, 1, \ldots, \sqrt{N} - 1$ -- can be losslessly…
We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from…
Discrete transforms, such as the discrete Fourier transform, are widely used in machine learning to improve model performance by extracting meaningful features. However, with numerous transforms available, selecting an appropriate one often…
In this work, we develop a method for rational approximation of the Fourier transform (FT) based on the real and imaginary parts of the complex error function \[ w(z) = e^{-z^2}(1 - {\rm{erf}}(-iz)) = K(x,y) + iL(x,y), \qquad z = x + iy, \]…
S.Block and H.Esnault constructed the local Fourier transform for D-modules. We present a different approach to the local Fourier transform, which makes its properties almost tautological. We apply the local Fourier transform to compute the…
We introduce some new higher dimensional generalizations of the Dedekind sums associated with the Bernoulli functions and of those Hardy sums which are defined by the sawtooth function. We generalize a variant of Parseval's formula for the…
Channel estimation is one of the most important parts in current mobile communication systems. Among the huge contributions in channel estimation studies, the discrete Fourier transform (DFT)-based channel estimation has attracted lots of…
Electronic structure calculation of atoms and molecules, in the past few decades has largely been dominated by density functional methods. This is primarily due to the fact that this can account for electron correlation effects in a…
Several recent randomized linear algebra algorithms rely upon fast dimension reduction methods. A popular choice is the Subsampled Randomized Hadamard Transform (SRHT). In this article, we address the efficacy, in the Frobenius and spectral…
Purpose: Provide a closed-form solution to the sinusoidal coil sensitivity model proposed by Kern et al. Solution allows for the precise computations of varied, simulated bias fields which can be directly applied onto raw intensity…
An algebraic integer (AI) based time-multiplexed row-parallel architecture and two final-reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The architecture…
We propose the use of low bit-depth Sigma-Delta and distributed noise-shaping methods for quantizing the Random Fourier features (RFFs) associated with shift-invariant kernels. We prove that our quantized RFFs -- even in the case of $1$-bit…
We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation…
Nonequispaced discrete Fourier transformation (NDFT) is widely applied in all aspects of computational science and engineering. The computational efficiency and accuracy of NDFT has always been a critical issue in hindering its…
This chapter presents controlled approximations of Kohn-Sham density functional theory (DFT) that enable very large scale simulations. The work is motivated by the study of defects in crystalline solids, though the ideas can be used in…
In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorithms. In addition, simple methods for extending the improved sparse…
In image and video coding applications, distortion has been traditionally measured using mean square error (MSE), which suggests the use of orthogonal transforms, such as the discrete cosine transform (DCT). Perceptual metrics such as…
We prove the Plancherel formula for a four-parameter family of discrete Fourier transforms and their multivariate generalizations stemming from corresponding generalized Schur polynomials. For special choices of the parameters, this…
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…
In this paper, the numerical approximation of isometric deformations of thin elastic shells is discussed. To this end, for a thin shell represented by a parametrized surface, it is shown how to transform the stored elastic energy for an…