Related papers: The Discrete Cosine Transform over Prime Finite Fi…

In the paper, we introduce and calculate difference Fourier transforms on representations of the double affine Hecke algebras in polynomilas, polynomials multiplied by the Gaussian, and various spaces of delta-functions including…

Fast Fourier Transform (FFT)-based solvers for the Poisson equation are highly efficient, exhibiting $O(N\log N)$ computational complexity and excellent parallelism. However, their application is typically restricted to simple, regular…

This paper presents the performance of different blockbased discrete cosine transform (DCT) algorithms for compressing color image. In this RGB component of color image are converted to YCbCr before DCT transform is applied. Y is luminance…

We propose a novel transformer model, capable of segmenting medical images of varying modalities. Challenges posed by the fine grained nature of medical image analysis mean that the adaptation of the transformer for their analysis is still…

We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number…

This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.

How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In…

Filtering of digital signals is accomplished on an Excel spreadsheet using fast Fourier transform (FFT) convolution in which the kernel is either a Gaussian or a cosine modulated Gaussian. Pedagogical examples of low-pass and band-pass…

Let $k$ be an algebraically closed field of characteristic $p>0$, let $R$ be a commutative ring, and let $\mathbb{F}$ be an algebraically closed field of characteristic 0. We consider the $R$-linear category $\mathcal{F}^\Delta_{Rpp_k}$ of…

Based on the algebraic theory of signal processing, we recursively decompose the discrete sine transform of first kind (DST-I) into small orthogonal block operations. Using a diagrammatic language, we then second-quantize this decomposition…

We develop a transfer matrix formalism to visualize the framing of discrete piecewise linear curves in three dimensional space. Our approach is based on the concept of an intrinsically discrete curve, which enables us to more effectively…

A novel representation of a quasi-periodic modified von Mangoldt function L(n) on prime numbers and its decomposition into Fourier series has been investigated. We focus on some particular quantities characterizing the modified von Mangoldt…

Depthwise separable convolutions and frequency-domain convolutions are two recent ideas for building efficient convolutional neural networks. They are seemingly incompatible: the vast majority of operations in depthwise separable CNNs are…

We present an algorithm for computing the structure of any submodule of the module of points of a Drinfeld $A$-module over a finite field, where $A$ is a function ring over $\mathbb F_q$. When the function ring is $A = \mathbb F_q[T]$, we…

Finite field transforms are offered as a new tool of spreading sequence design. This approach exploits orthogonality properties of synchronous non-binary sequences defined over a complex finite field. It is promising for channels supporting…

In this pedagogical paper we review the discrete symmetries of the Dirac equation using elementary tools, but in a comparative order: the usual 3 + 1 dimensional case and the 2 + 1 dimensional case. Motivated by new applications of the 2d…

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…

Zernike moments can be used to generate invariant features that are applied in various machine vision applications. They, however, suffer from slow implementation and numerical stability problems. We propose a novel method for computing…

Depth completion, which aims to generate high-quality dense depth maps from sparse depth maps, has attracted increasing attention in recent years. Previous work usually employs RGB images as guidance, and introduces iterative spatial…

Estimation of the Discrete-Time Fourier Transform (DTFT) at points of a finite domain arises in many imaging applications. A new approach to this task, the Golden Angle Linogram Fourier Domain (GALFD), is presented, together with a…