Some remarks concerning the Fourier transform in the space L 2(ℝ n )

For the Fourier transform in the space L ₂(?²) of square integrable multivariable functions, two practically useful estimates are proved in certain classes of functions characterized by a generalized continuity modulus.     

The quadratic-phase Fourier wavelet transform

In this paper, we define the quadratic-phase Fourier wavelet transform (QPFWT) and discuss its basic properties including convolution for QPFWT. Further, inversion formula and the Parseval relation of QPFWT are also discussed. Continuity of QPFWT on some function spaces are studied. Moreover, some applications of quadratic-phase Fourier transform (QPFT) to solve the boundary value problems of generalized partial differential equations.     

Invariant subspaces of the maximal domain of the Fourier transform

Translation invariant subspaces of the maximal domain of the Fourier transform (the amalgam of with ) are characterised: it turns out that in this case all measurable subsets of the dual space are sets of spectral synthesis.

     

A hybrid Fourier transform

A Fourier transform akin to Sneddon's R-transform is introduced. It is shown that the Hilbert transform links the two in much the same way as it connects the classical Fourier sine and cosine transforms.     

Quantum Fourier transform revisited

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 particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.     

Convergence Properties of Generalized Fourier Series on a Parallel Hexagon Domain

A new Rogosinski-type kernel function is constructed using kernel function of partial sums Sn（f; t） of generalized Fourier series on a parallel hexagon domain Ω associating with threedirection partition. We prove that an operator Wn（f; t） with the new kernel function converges uniformly to any continuous function f（t） ∈ Cn（Ω） （the space of all continuous functions with period Ω） on Ω. Moreover, the convergence order of the operator is presented for the smooth approached function.     

Maximal theorems for the directional Hilbert transform on the plane

For a Schwartz function on the plane and a non-zero define the Hilbert transform of in the direction to be

p.v.

Let be a Schwartz function with frequency support in the annulus , and . We prove that the maximal operator maps into weak , and into for . The estimate is sharp. The method of proof is based upon techniques related to the pointwise convergence of Fourier series. Indeed, our main theorem implies this result on Fourier series.

     

Fourier transform and related integral transforms in superspace

In this paper extensions of the classical Fourier, fractional Fourier and Radon transforms to superspace are studied. Previously, a Fourier transform in superspace was already studied, but with a different kernel. In this work, the fermionic part of the Fourier kernel has a natural symplectic structure, derived using a Clifford analysis approach. Several basic properties of these three transforms are studied. Using suitable generalizations of the Hermite polynomials to superspace (see [H. De Bie, F. Sommen, Hermite and Gegenbauer polynomials in superspace using Clifford analysis, J. Phys. A 40 (2007) 10441-10456]) an eigenfunction basis for the Fourier transform is constructed.     

Fractional Fourier transform on R2 and an application

We focus on the L^p(R²) theory of the fractional Fourier transform (FRFT) for 1 ≤ p ≤ 2. In L¹(R²), we mainly study the properties of the FRFT via introducing the two-parameter chirp operator. In order to get the point-wise convergence for the inverse FRFT, we introduce the fractional convolution and establish the corresponding approximate identities. Then the well-defined inverse FRFT is given via approximation by suitable means, such as fractional Gauss means and Able means. Furthermore, if the signal F_α,βf is received, we give the process of recovering the original signal f with MATLAB. In L²(R²), the general Plancherel theorem, direct sum decomposition, and the general Heisenberg inequality for the FRFT are obtained.     

Windowed Fourier transform of two-dimensional quaternionic signals

In this paper, we generalize the classical windowed Fourier transform (WFT) to quaternion-valued signals, called the quaternionic windowed Fourier transform (QWFT). Using the spectral representation of the quaternionic Fourier transform (QFT), we derive several important properties such as reconstruction formula, reproducing kernel, isometry, and orthogonality relation. Taking the Gaussian function as window function we obtain quaternionic Gabor filters which play the role of coefficient functions when decomposing the signal in the quaternionic Gabor basis. We apply the QWFT properties and the (right-sided) QFT to establish a Heisenberg type uncertainty principle for the QWFT. Finally, we briefly introduce an application of the QWFT to a linear time-varying system.