Related papers: The Two-Modular Fourier Transform of Binary Functi…
Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential.…
Consider the Fourier transform on the group $GL(2,R)$ of real $2\times 2$-matrices. We show that Fourier-images of polynomial differential operators on $GL(2,R)$ are differential-difference operators with coefficients meromorphic in…
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…
To an RCFT corresponds two combinatorial structures: the amplitude of a torus (the 1-loop partition function of a closed string, sometimes called a modular invariant), and a representation of the fusion ring (called a NIM-rep or…
A class of integral transforms, on the planar Gaussian Hilbert space with range in the weighted Bergman space on the bi-disk, is defined as the dual transforms of the 2d fractional Fourier transform associated with the Mehler function for…
This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…
In this paper, we present a construction toward a new type of TQFTs at the crossroads of low-dimensional topology, algebraic geometry, physics, and homotopy theory. It assigns TMF-modules to closed 3-manifolds and maps of TMF-modules to…
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
In this paper, we define a new transform called the Gabor quaternionic Fourier transform (GQFT), which generalizes the classical windowed Fourier transform to quaternion valued-signals, we give several important properties such as the…
The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
The prevalence of convolution in applications within signal processing, deep neural networks, and numerical solvers has motivated the development of numerous fast convolution algorithms. In many of these problems, convolution is performed…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
Vertex-frequency analysis, particularly the windowed graph Fourier transform (WGFT), is a significant challenge in graph signal processing. Tight frame theories is known for its low computational complexity in signal reconstruction, while…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
We investigate and review how Fourier transform is involved in the analysis of a twisted group algebra $L^1(G, \sigma)$ for $G=\widehat{\Gamma}\times \Gamma$ and $\sigma:G\times G \to \mathbb{T}$ 2- cocycle where $\Gamma$ is a locally…
We construct the Cartier duality equivalence for affine commutative group schemes $G$ whose coordinate ring is a flat Mittag-Leffler module over an arbitrary base ring $R$. The dual $G^\vee$ of $G$ turns out to be an ind-finite ind-scheme…