Related papers: On the diagonalization of the discrete Fourier tra…

Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…

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…

The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…

Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…

I discuss the nature of a Fractional Discrete Fourier Transform (FrDFT) described algorithmically by a combination of chirp transforms and ordinary DFTs. The transform is shown to be consistent with a continuous two-dimensional rotation…

We present a new number theoretic definition of discrete fractional Fourier transform (DFrFT) . In this approach the DFrFT is defined as the $N \times N$ dimensional unitary representation of the generator of the arithmetic rotational group…

In some of the problems, complicated functions of the Z-transform variable, $z$, appear which either cannot be inverted analytically or the required calculations are quite tedious. In such cases numerical methods should be used to find the…

This paper is devoted to the efficient numerical solution of the Helmholtz equation in a two- or three-dimensional rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and…

Photonic computing has emerged as a promising platform for accelerating computational tasks with high degrees of parallelism, such as image processing and neural network. We present meta-DFT (discrete Fourier transform), a single layer…

A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…

Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential.…

This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being…

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…

A systematic analytic approach to the evaluation of the eigenvalues and eigenvectors of the 5D discrete number operator is formulated. This approach is essentially based on the use of the symmetricity of 5D discrete Fourier transform…

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…

In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…

A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…

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…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

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…