Related papers: The windowed quadratic phase Fourier transform: st…
In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…
The two-sided quaternionic Fourier transformation (QFT) was introduced in \cite{Ell:1993} for the analysis of 2D linear time-invariant partial-differential systems. In further theoretical investigations \cite{10.1007/s00006-007-0037-8,…
The convolution quadrature theory is a systematic approach to analyse the approximation of the Riemann-Liouville fractional operator $I^{\alpha}$ at node $x_{n}$. In this paper, we develop the shifted convolution quadrature ($SCQ$) theory…
The linear canonical transform (LCT) serves as a powerful generalization of the Fourier transform (FT), encapsulating various integral transforms within a unified framework. This versatility has made it a cornerstone in fields such as…
In non-stationary signal processing, prior work has incorporated the quadratic-phase Fourier transform (QPFT) into the ambiguity function (AF) and Wigner distribution (WD) to enhance their performance. This paper introduces an advanced…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
Warped convolutions of operators were recently introduced in the algebraic framework of quantum physics as a new constructive tool. It is shown here that these convolutions provide isometric representations of Rieffel's strict deformations…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
Background: Windowed Fourier decompositions (WFD) are widely used in measuring stationary and non-stationary spectral phenomena and in describing pairwise relationships among multiple signals. Although a variety of WFDs see frequent…
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 generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…
The goal of this paper is to introduce the notion of polyconvolution for Fourier-cosine, Laplace integral operators, and its applications. The structure of this polyconvolution operator and associated integral transforms are investigated in…
In this paper, we prove both of the Titchmarsh theorems associated with Two-Sided Quaternionic Fourier Transform and we conclude about Short-Time Two-Sided Quaternionic Fourier Transform.
This study proposes a Quantum Fourier Transform (QFT)-enhanced quantum kernel for short-term time-series forecasting. Each signal is windowed, amplitude-encoded, transformed by a QFT, then passed through a protective rotation layer to avoid…
The $\alpha$-modulation transform is a time-frequency transform generated by square-integrable representations of the affine Weyl-Heisenberg group modulo suitable subgroups. In this paper we prove new conditions that guarantee the…
The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…
We study Fourier theory on quantum Euclidean space. A modified version of the general definition of the Fourier transform on a quantum space is used and its inverse is constructed. The Fourier transforms can be defined by their Bochner's…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
We consider isospectral deformations of quantum field theories by using the novel construction tool of warped convolutions. The deformation enables us to obtain a variety of models that are wedge-local and have nontrivial scattering…