Related papers: Circular Convolution and Product Theorem for Affin…
In this work we formulate a generalized theoretical model to describe the nonlinear dynamics observed in combined frequency-amplitude modulators whose characteristic parameters exhibit a nonlinear dependence on the input modulating signal.…
The paper deals with a fractional derivative introduced by means of the Fourier transform. The explicit form of the kernel of general derivative operator acting on the functions analytic on a curve in complex plane is deduced and the…
Graph signal processing (GSP) leverages the inherent signal structure within graphs to extract high-dimensional data without relying on translation invariance. It has emerged as a crucial tool across multiple fields, including learning and…
Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
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…
There is a class of physical filtration processes where the input is adequately modeled by a continuous periodic function f (x) of bounded variation over its period, and the output depends only on certain harmonics of the Fourier expansion…
The quaternion Fourier transform (qFT) is an important tool in multi-dimensional data analysis, in particular for the study of color images. An important problem when applying the qFT is the mismatch between the spatial and frequency…
Most of the known Fourier transforms associated with the equations of mathematical physics have a trivial kernel, and an inversion formula as well as the Parseval equality are fulfilled. In other words, the system of the eigenfunctions…
The composition of the Fourier transform in $\mathbb{R}^n$ with a suitable pseudodifferential operator is called a Fourier operator. It is compact in appropriate function spaces. The paper deals with its spectral theory. This is based on…
The Fuzzy transform is ubiquitous in different research fields and applications, such as image and data compression, data mining, knowledge discovery, and the analysis of linguistic expressions. As a generalisation of the Fuzzy transform,…
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…
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…
The Fubini product of operator spaces provide a powerful tool for analysing properties of tensor products. In this paper we review the the theory of Fubini products and apply it to the problem of computing invariant parts of dynamical…
Orthogonal frequency-division multiplexing (OFDM) has been selected as a baseline waveform for long-term evolution (LTE) and fifth-generation new radio (5G NR). Fast-convolution (FC)-based frequency-domain signal processing has been…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
We prove that a positive-definite measure in $\mathbb{R}^n$ with uniformly discrete support and discrete closed spectrum, is representable as a finite linear combination of Dirac combs, translated and modulated. This extends our recent…
We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the Fourier…
The Fractional Fourier Transform (FRT) corresponds to an arbitrary-angle rotation in the phase space, e.g. the time-frequency (TF) space, and generalizes the fundamentally important Fourier Transform. FRT applications range from classical…
In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…