Related papers: Binary Discrete Fourier Transform and its Inversio…
The reconstruction problem for permutations on $n$ elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any $n \geq 3$ an unknown permutation is uniquely…
We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density…
Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…
In the classical source coding problem, the compressed source is reconstructed at the decoder with respect to some distortion metric. Motivated by settings in which we are interested in more than simply reconstructing the compressed source,…
Computing the convolution $A \star B$ of two vectors of dimension $n$ is one of the most important computational primitives in many fields. For the non-negative convolution scenario, the classical solution is to leverage the Fast Fourier…
Optical two-dimensional Fourier-transformed (2DFT) spectroscopy is used to study the coherent optical response of potassium vapor in a thin transmission cell. Rephasing and non-rephasing spectra of the D1 and D2 transitions are obtained and…
We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a $d$-dimensional Fourier-sparse signal ($\|\hat{x}(t)\|_0 \leq…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transformation (NFT). The theoretical underpinnings of this generalization of the conventional…
Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential…
Humans can often count unfamiliar objects by observing visual repetition and composition, rather than relying only on object categories. However, many exemplar-free counting models struggle in such situations and may overcount when objects…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
In this paper we produce further specification of the geometric and algebraic properties of the earlier introduced superdimensional dual-covariant field theory (SFT) in a N-dimensional manifold [1] as an approach to a unified field theory…
We show that a vector field in $\mathbb{R}^n$ can be reconstructed uniquely from the knowledge of restricted Doppler and first integral moment transforms. The line complex we consider consists of all lines passing through a fixed curve…
An integro-differential Dirac system with an integral term in the form of convolution is considered. We suppose that the convolution kernel is known a priori on a part of the interval, and recover it on the remaining part, using a part of…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
An initial-boundary value problem for a subdiffusion equation with an elliptic operator $A(D)$ in $\mathbb{R}^N$ is considered. The existence and uniqueness theorems for a solution of this problem are proved by the Fourier method.…
In this work, an inverse problem on the determination of multiple coefficients arising from the time-domain diffuse optical tomography with fluorescence (DOT-FDOT) is investigated. We simultaneously recover the distribution of background…
By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…
DFT is the numerical implementation of Fourier transform (FT), and it has many forms. Ordinary DFT (ODFT) and symmetric DFT (SDFT) are the two main forms of DFT. The most widely used DFT is ODFT, and the phase spectrum of this form is…
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…