Related papers: The Number Theoretic Hilbert Transform
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
Unitary evolutions of a qubit are traditionally represented geometrically as rotations of the Bloch sphere, but the composition of such evolutions is handled algebraically through matrix multiplication [of SU(2) or SO(3) matrices].…
In a recent article the authors showed that the radiative Transfer equations with multiple frequencies and scattering can be formulated as a nonlinear integral system. In the present article, the formulation is extended to handle reflective…
The Fractional Fourier Transform (FrFT) has widespread applications in areas like signal analysis, Fourier optics, diffraction theory, etc. The Holomorphic Fractional Fourier Transform (HFrFT) proposed in the present paper may be used in…
We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of…
In this paper, we focus on Fourier analysis and holographic transforms for signal representation. For instance, in the case of image processing, the holographic representation has the property that an arbitrary portion of the transformed…
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast…
Cryptography protects users by providing functionality for the encryption of data and authentication of other users. This technology lets the receiver of an electronic message verify the sender, ensures that a message can be read only by…
This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming…
This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…
In this article, numerical integration is formulated as evaluation of a matrix function of a matrix that is obtained as a projection of the multiplication operator on a finite-dimensional basis. The idea is to approximate the continuous…
Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
The Hilbert-Huang Transform is a novel, adaptive approach to time series analysis that does not make assumptions about the data form. Its adaptive, local character allows the decomposition of non-stationary signals with hightime-frequency…
Polynomial multiplication is one of the fundamental operations in many applications, such as fully homomorphic encryption (FHE). However, the computational inefficiency stemming from polynomials with many large-bit coefficients poses a…
The practical use of non-Hermitian (i.e., typically, PT-symmetric) phenomenological quantum Hamiltonians is discussed as requiring an explicit reconstruction of the {\em ad hoc} Hilbert-space metrics which would render the time-evolution…
Weighted discrete Hilbert transforms $(a_n)_n \mapsto \sum_n a_n v_n/(z-\gamma_n)$ from $\ell^2_v$ to a weighted $L^2$ space are studied, with $\Gamma=(\gamma_n)$ a sequence of distinct points in the complex plane and $v=(v_n)$ a…
We describe algorithms for computing central values of twists of $L$-functions associated to Hilbert modular forms, carry out such computations for a number of examples, and compare the results of these computations to some heuristics and…
We present a novel algorithm for calculating the discrete fractional Hadamard transform for data vectors whose size N is a power of two. A direct method for calculation of the discrete fractional Hadamard transform requires $N^2$…
For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$,…