Related papers: The Number Theoretic Hilbert Transform
This note investigates the size of the guard band for non-periodic discrete Hilbert transform, which has recently been proposed for data hiding and security applications. It is shown that a guard band equal to the duration of the message is…
The truncated Hilbert transform with overlap $H_T$ is an operator that arises in tomographic reconstruction from limited data, more precisely in the method of Differentiated Back-Projection (DBP). Recent work [1] has shown that the singular…
The one-sided and full Hilbert transforms are evaluated exactly by means of the method of finite-part integration [E.A. Galapon, \textit{Proc. Roy. Soc. A} \textbf{473}, 20160567 (2017)]. In general, the result consists of two terms -- the…
In this paper, firstly, some applications of Hilbert matrix in image processing and cryptology are mentioned and an algorithm related to the Hilbert view of a digital image is given. In section 2, the new matrix domains are constructed and…
The paper deals with the numerical approximation of the Hilbert transform on the unit circle using Szeg\"o and anti-Szeg\"o quadrature formulas. These schemes exhibit maximum precision with oppositely signed errors and allow for improved…
Recently, Steinbach et al. introduced a novel operator $\mathcal{H}_T: L^2(0,T) \to L^2(0,T)$, known as the modified Hilbert transform. This operator has shown its significance in space-time formulations related to the heat and wave…
Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms…
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…
The HRT (Heil-Ramanathan-Topiwala) posits the linear independence of any set of nonzero square-integrable vectors obtained from a single nonzero vector $f$ by applying a finite set of time-frequency shift operators. In this short note, we…
We show that the centered discrete Hilbert transform on integers applied to a function can be written as the conditional expectation of a transform of stochastic integrals, where the stochastic processes considered have jump components. The…
The inversion of cosh-Hilbert transform (CHT) is one of the most crucial steps for single-photon emission computed tomography with uniform attenuation from truncated projection data. Although the uniqueness of the CHT inversion had been…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
Number Theoretic Transform (NTT) is an essential mathematical tool for computing polynomial multiplication in promising lattice-based cryptography. However, costly division operations and complex data dependencies make efficient and…
Non-point invertible transformations are completely described for difference equations on the quad-graph and for their differential-difference analogues. As an illustration, these transformations are used to construct new examples of…
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior…
We propose a novel algorithm for large-scale regression problems named histogram transform ensembles (HTE), composed of random rotations, stretchings, and translations. First of all, we investigate the theoretical properties of HTE when the…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the…
An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.
The discrete Hartley transform (DHT) is a useful tool for medical image coding. The three-dimensional DHT (3D DHT) can be employed to compress medical image data, such as magnetic resonance and X-ray angiography. However, the computation of…