Related papers: The discrete fractional random cosine and sine tra…
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…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing…
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…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In…
The efficient multiangle centered discrete fractional Fourier transform (MA-CDFRFT) [1] has proven to be a useful tool for time-frequency analysis; in this paper, we generalize the MA-CDFRFT to general M -periodic transforms, which, among…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
We give a detailed study of the discrete Fourier transform (DFT) of $r$-even arithmetic functions, which form a subspace of the space of $r$-periodic arithmetic functions. We consider the DFT of sequences of $r$-even functions, their mean…
We discuss some of the mathematical properties of the fractional derivative defined by means of Fourier transforms. We first consider its action on the set of test functions $\Sc(\mathbb R)$, and then we extend it to its dual set,…
Partial differential equation (PDE) models and their associated variational energy formulations are often rotationally invariant by design. This ensures that a rotation of the input results in a corresponding rotation of the output, which…
We study a compound Poisson random field on plane and examine its various fractional variants. We derive the distributions of these random fields and in some particular cases, obtain their associated system of governing differential…
This report investigates the main definitions and fundamental properties of the fractional two-sided quaternionic Dunkl transform in two dimensions. We present key results concerning its structure and emphasize its connections to classical…
In this paper, we introduce two new non-singular kernel fractional derivatives and present a class of other fractional derivatives derived from the new formulations. We present some important results of uniformly convergent sequences of…
A new definition of a fractional derivative has recently been developed, making use of a fractional Dirac delta function as its integral kernel. This derivative allows for the definition of a distributional fractional derivative, and as…
In this paper we construct directionally sensitive functions that can be viewed as directional time-frequency representations. We call such a sequence a rotational uniform covering frame and by studying rotations of the frame, we derive the…
Broadband hyperspectral digital holography and Fourier transform spectroscopy are important instruments in various science and application fields. In the digital hyperspectral holography and spectroscopy the variable of interest are…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…