Clifford algebras,Fourier transforms,and quantum mechanics

In this review, we give an overview of several recent generalizations of the Fourier transform, related to either the Lie algebra or the Lie superalgebra . In the former case, one obtains scalar generalizations of the Fourier transform, including the fractional Fourier transform, the Dunkl transform, the radially deformed Fourier transform, and the super Fourier transform. In the latter case, one has to use the framework of Clifford analysis and arrives at the Clifford–Fourier transform and the radially deformed hypercomplex Fourier transform. A detailed exposition of all these transforms is given, with emphasis on aspects such as eigenfunctions and spectrum of the transform, characterization of the integral kernel, and connection with various special functions. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

傅立叶变换与小波变换的比较教学

本文针对小波变换教学中小流变换概念理解困难的问题，提出了一种比较教学方法，通过分析小波变换与傅立叶变换之间的联系，并从四个方面进行对比，清楚地描述了小波变换的本质，从而对加深对小波变换的理解。     

Paley–Wiener–Schwartz type theorem for the wavelet transform

In the present paper, we discuss about extension of the wavelet transform on distribution space of compact support and develop the Paley–Wiener–Schwartz type theorem for the wavelet transform on the same. Furthermore, Paley–Wiener–Schwartz type theorem for the wavelet transform is also established using the relation between the wavelet transform and double Fourier transform.     

Orthogonal polynomials on the unit circle associated with the Laguerre polynomials

Using the well-known fact that the Fourier transform is unitary, we obtain a class of orthogonal polynomials on the unit circle from the Fourier transform of the Laguerre polynomials (with suitable weights attached). Some related extremal problems which arise naturally in this setting are investigated.

     

Computation of the fractional Fourier transform

In this paper we make a critical comparison of some programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that filters the best out of the existing ones. Two types of transforms are considered: first, the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in [H.M. Ozaktas, M.A. Kutay, G. Bozda i, IEEE Trans. Signal Process. 44 (1996) 2141–2150]. There are two implementations: one is written by A.M. Kutay, the other is part of package written by J. O'Neill. Second, the discrete fractional Fourier transform algorithm described in the master thesis by Ç. Candan [Bilkent University, 1998] and an algorithm described by S.C. Pei, M.H. Yeh, and C.C. Tseng [IEEE Trans. Signal Process. 47 (1999) 1335–1348].     

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.     

Fourier Transform Over Local Fields

The Fourier transform in the space of distributions on finite-dimensional vector spaces over local fields is defined, and a strong similarity between the case of archimedian and non-archimedian fields is discussed. Furthermore, the definition of the Fourier transform for the case of “functions” on finite-dimensional vector spaces over 2-dimensional local fields is introduced. Leonardo da Vinci lecture held on June 29, 2005 Received: October 2005     

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.     

HOLOMORPHIC HARMONIC ANALYSIS ON COMPLEX REDUCTIVE GROUPS

The authors define the holomorphic Fourier transform of holomorphic functions on complex reductive groups, prove some properties such as the Fourier inversion formula, and give some applications. The definition of the holomorphic Fourier transform makes use of the notion of K-admissible measures. The authors prove that K-admissible measures are abundant, and the definition of holomorphic Fourier transform is independent of the choice of K-admissible measures.     

On an αth-order fractional Radon transform and a wave type of equation

The Fourier slice theorem holds for the classical Radon transform. In this paper, we consider a fractional Radon transform for which a sort of Fourier slice theorem also holds, and then present an inversion formula. The fractional Radon transform is shown to be characterized by the multi-dimensional case of a wave type of equation in analogy to the classical Radon transform.     

A DISTRIBUTION SPACE FOR FOURIER TRANSFORM

A space Df is constructed and some characterizations of space Df are given. It is shown that the classical Fourier transform is extended to the distribution space Df, which can be embedded into the Schwartz distribution space D＇ continuously. It is also shown that D＇f is the biggest embedded subspace of D on which the extended Fourier transform, f, is a homeomorphism of D＇f onto itself.     

Wavelet transforms for integrable Boehmians

By the application of continuous wavelet transforms (or windowed Fourier transform) and employing Burzyk's conjecture, the wavelet transform for integrable Boehmians is obtained. Inversion formula is also established.     

Real inversion formulas with rates of convergence

Some classical real inversion formulas, such as those concerning Fourier, Laplace and Stieltjes transforms, are unified in a way which allows us to give rates of convergence. As illustration, the case of the Fourier transform is considered. This revised version was published online in June 2006 with corrections to the Cover Date.     

Paley‐Wiener‐Type theorems for the Clifford‐Fourier transform

In the framework of Clifford analysis, we consider the Paley‐Wiener type theorems for a generalized Clifford‐Fourier transform. This Clifford‐Fourier transform is given by a similar operator exponential as the classical Fourier transform but containing generators of Lie superalgebra.     

Fourier restriction for affine arclength measures in the plane

We obtain an analog, uniform for a large class of curves in the plane, of the Fefferman-Zygmund theorem on restriction of the Fourier transform.

     

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.     

Uncertainty principle for the two-sided quaternion windowed Fourier transform

In this paper, we study the quaternion windowed Fourier transform (QWFT) and prove the Local uncertainty principle, the Logarithmic uncertainty principle and Amrein Berthier for the QWFT, the radar quaternion ambiguity function and the quaternion Wigner transform.     

p-adic数域Q_p上的窗口Fourier变换

提出了 p-adic数域 Qp上的窗口 Fourier变换和逆变换 ,详细地讨论了 p-adic模函数和阶梯函数的窗口 Fourier变换和逆变换 ,最后给出了 p-adic模函数和阶梯函数的窗口 Fourier变换定理 .