Fractional Fourier Transform
Get Fractional Fourier Transform essential facts below. View Videos or join the Fractional Fourier Transform discussion. Add Fractional Fourier Transform to your PopFlock.com topic list for future reference or share this resource on social media.
Fractional Fourier Transform

In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to the n-th power, where n need not be an integer — thus, it can transform a function to any intermediate domain between time and frequency. Its applications range from filter design and signal analysis to phase retrieval and pattern recognition.

The FRFT can be used to define fractional convolution, correlation, and other operations, and can also be further generalized into the linear canonical transformation (LCT). An early definition of the FRFT was introduced by Condon,[1] by solving for the Green's function for phase-space rotations, and also by Namias,[2] generalizing work of Wiener[3] on Hermite polynomials.

However, it was not widely recognized in signal processing until it was independently reintroduced around 1993 by several groups.[4] Since then, there has been a surge of interest in extending Shannon's sampling theorem[5][6] for signals which are band-limited in the Fractional Fourier domain.

A completely different meaning for "fractional Fourier transform" was introduced by Bailey and Swartztrauber[7] as essentially another name for a z-transform, and in particular for the case that corresponds to a discrete Fourier transform shifted by a fractional amount in frequency space (multiplying the input by a linear chirp) and evaluating at a fractional set of frequency points (e.g. considering only a small portion of the spectrum). (Such transforms can be evaluated efficiently by Bluestein's FFT algorithm.) This terminology has fallen out of use in most of the technical literature, however, in preference to the FRFT. The remainder of this article describes the FRFT.

## Introduction

The continuous Fourier transform ${\displaystyle {\mathcal {F}}}$ of a function is a unitary operator of L2 that maps the function ? to its frequential version (all expressions are taken in the L2 sense, rather than pointwise):

${\displaystyle {\hat {f}}(\xi )=\int _{-\infty }^{\infty }f(x)\ e^{-2\pi ix\xi }\,\mathrm {d} x}$

and ? is determined by via the inverse transform ${\displaystyle {\mathcal {F}}^{-1}}$

${\displaystyle f(x)=\int _{-\infty }^{\infty }{\hat {f}}(\xi )\ e^{2\pi i\xi x}\,\mathrm {d} \xi ,}$

Let us study its n-th iterated ${\displaystyle {\mathcal {F}}^{n}}$ defined by ${\displaystyle {\mathcal {F}}^{n}[f]={\mathcal {F}}[{\mathcal {F}}^{n-1}[f]]}$ and ${\displaystyle {\mathcal {F}}^{-n}=({\mathcal {F}}^{-1})^{n}}$ when n is a non-negative integer, and ${\displaystyle {\mathcal {F}}^{0}[f]=f}$. Their sequence is finite since ${\displaystyle {\mathcal {F}}}$ is a 4-periodic automorphism: for every function ?, ${\displaystyle {\mathcal {F}}^{4}[f]=f}$.

More precisely, let us introduce the parity operator ${\displaystyle {\mathcal {P}}}$ that inverts ${\displaystyle x}$, ${\displaystyle {\mathcal {P}}[f]\colon x\mapsto f(-x)}$. Then the following properties hold:

${\displaystyle {\mathcal {F}}^{0}=\mathrm {Id} ,\qquad {\mathcal {F}}^{1}={\mathcal {F}},\qquad {\mathcal {F}}^{2}={\mathcal {P}},\qquad {\mathcal {F}}^{4}=\mathrm {Id} }$
${\displaystyle {\mathcal {F}}^{3}={\mathcal {F}}^{-1}={\mathcal {P}}\circ {\mathcal {F}}={\mathcal {F}}\circ {\mathcal {P}}.}$

The FRFT provides a family of linear transforms that further extends this definition to handle non-integer powers n = 2?/? of the FT.

## Definition

Note: some authors write the transform in terms of the "order a" instead of the "angle ?", in which case the ? is usually a times ?/2. Although these two forms are equivalent, one must be careful about which definition the author uses.

For any real ?, the ?-angle fractional Fourier transform of a function ? is denoted by ${\displaystyle {\mathcal {F}}_{\alpha }(u)}$ and defined by

${\displaystyle {\mathcal {F}}_{\alpha }[f](u)={\sqrt {1-i\cot(\alpha )}}e^{i\pi \cot(\alpha )u^{2}}\int _{-\infty }^{\infty }e^{-i2\pi \left(\csc(\alpha )ux-{\frac {\cot(\alpha )}{2}}x^{2}\right)}f(x)\,\mathrm {d} x}$

Formally, this formula is only valid when the input function is in a sufficiently nice space (such as L1 or Schwartz space), and is defined via a density argument, in a way similar to that of the ordinary Fourier transform (see article), in the general case.[8]

If ? is an integer multiple of ?, then the cotangent and cosecant functions above diverge. However, this can be handled by taking the limit, and leads to a Dirac delta function in the integrand. More directly, since ${\displaystyle {\mathcal {F}}^{2}(f)=f(-t)~,~~{\mathcal {F}}_{\alpha }~(f)}$ must be simply f(t) or f(-t) for ? an even or odd multiple of ? respectively.

For ? = ?/2, this becomes precisely the definition of the continuous Fourier transform, and for ? = -?/2 it is the definition of the inverse continuous Fourier transform.

The FrFT argument u is neither a spatial one x nor a frequency ?. We will see why it can be interpreted as linear combination of both coordinates (x,?). When we want to distinguish the ?-angular fractional domain, we will let ${\displaystyle x_{a}}$ denote the argument of ${\displaystyle {\mathcal {F}}_{\alpha }}$.

Remark: with the angular frequency ? convention instead of the frequency one, the FrFT formula is the Mehler kernel,

${\displaystyle {\mathcal {F}}_{\alpha }(f)(\omega )={\sqrt {\frac {1-i\cot(\alpha )}{2\pi }}}e^{i\cot(\alpha )\omega ^{2}/2}\int _{-\infty }^{\infty }e^{-i\csc(\alpha )\omega t+i\cot(\alpha )t^{2}/2}f(t)\,dt~.}$

### Properties

The ?-th order fractional Fourier transform operator, ${\displaystyle {\mathcal {F}}_{\alpha }}$, has the properties:

• Additivity. For any real angles ?, ?,
${\displaystyle {\mathcal {F}}_{\alpha +\beta }={\mathcal {F}}_{\alpha }\circ {\mathcal {F}}_{\beta }={\mathcal {F}}_{\beta }\circ {\mathcal {F}}_{\alpha }.}$
• Linearity.
${\displaystyle {\mathcal {F}}_{\alpha }\left[\sum \nolimits _{k}b_{k}f_{k}(u)\right]=\sum \nolimits _{k}b_{k}{\mathcal {F}}_{\alpha }\left[f_{k}(u)\right]}$
• Integer Orders. If ? is an integer multiple of ${\displaystyle \pi /2}$, then:
${\displaystyle {\mathcal {F}}_{\alpha }={\mathcal {F}}_{\frac {k\pi }{2}}={\mathcal {F}}^{k}=({\mathcal {F}})^{k}}$
Moreover, it has following relation
{\displaystyle {\begin{aligned}{\mathcal {F}}^{2}&={\mathcal {P}}&&{\mathcal {P}}[f(u)]=f(-u)\\{\mathcal {F}}^{3}&={\mathcal {F}}^{-1}=({\mathcal {F}})^{-1}\\{\mathcal {F}}^{4}&={\mathcal {F}}^{0}={\mathcal {I}}\\{\mathcal {F}}^{i}&={\mathcal {F}}^{j}&&i\equiv j\mod 4\end{aligned}}}
• Inverse.
${\displaystyle ({\mathcal {F}}_{\alpha })^{-1}={\mathcal {F}}_{-\alpha }}$
• Commutativity.
${\displaystyle {\mathcal {F}}_{\alpha _{1}}{\mathcal {F}}_{\alpha _{2}}={\mathcal {F}}_{\alpha _{2}}{\mathcal {F}}_{\alpha _{1}}}$
• Associativity
${\displaystyle \left({\mathcal {F}}_{\alpha _{1}}{\mathcal {F}}_{\alpha _{2}}\right){\mathcal {F}}_{\alpha _{3}}={\mathcal {F}}_{\alpha _{1}}\left({\mathcal {F}}_{\alpha _{2}}{\mathcal {F}}_{\alpha _{3}}\right)}$
• Unitarity
${\displaystyle \int f^{*}(u)g(u)du=\int f_{\alpha }^{*}(u)g_{\alpha }(u)du}$
• Time Reversal.
${\displaystyle {\mathcal {F}}_{\alpha }{\mathcal {P}}={\mathcal {P}}{\mathcal {F}}_{\alpha }}$
${\displaystyle {\mathcal {F}}_{\alpha }[f(-u)]=f_{\alpha }(-u)}$
• Transform of a shifted function
Define the shift and the phase shift operators as follows:
${\displaystyle {\mathcal {SH}}(u_{0})[f(u)]=f(u+u_{0})}$
${\displaystyle {\mathcal {PH}}(v_{0})[f(u)]=e^{j2\pi v_{0}u}f(u)}$
Then
{\displaystyle {\begin{aligned}{\mathcal {F}}_{\alpha }{\mathcal {SH}}(u_{0})&=e^{j\pi u_{0}^{2}\sin \alpha \cos \alpha }{\mathcal {PH}}(u_{0}\sin \alpha ){\mathcal {SH}}(u_{0}\cos \alpha )F_{\alpha }\\{\mathcal {F}}_{\alpha }[f(u+u_{0})]&=e^{j\pi u_{0}^{2}\sin \alpha \cos \alpha }e^{j2\pi uu_{0}\sin \alpha }f_{\alpha }(u+u_{0}\cos \alpha )\end{aligned}}}
• Transform of a scaled function
Define the scaling and chirp multiplication operators as follows:
${\displaystyle M(M)[f(u)]=|M|^{-{\frac {1}{2}}}f\left({\tfrac {u}{M}}\right)}$
${\displaystyle Q(q)[f(u)]=e^{-j\pi qu^{2}}f(u)}$
Then,
{\displaystyle {\begin{aligned}{\mathcal {F}}_{\alpha }M(M)&=Q\left(-\cot \left({\frac {1-\cos ^{2}\alpha '}{\cos ^{2}\alpha }}\alpha \right)\right)\times M\left({\frac {\sin \alpha }{M\sin \alpha '}}\right){\mathcal {F}}_{\alpha '}\\[6pt]{\mathcal {F}}_{\alpha }\left[|M|^{-{\frac {1}{2}}}f\left({\tfrac {u}{M}}\right)\right]&={\sqrt {\frac {1-j\cot \alpha }{1-jM^{2}\cot \alpha }}}e^{j\pi u^{2}\cot \left({\frac {1-\cos ^{2}\alpha '}{\cos ^{2}\alpha }}\alpha \right)}\times f_{a}\left({\frac {Mu\sin \alpha '}{\sin \alpha }}\right)\end{aligned}}}
Notice that the fractional Fourier transform of ${\displaystyle f(u/M)}$ cannot be expressed as a scaled version of ${\displaystyle f_{\alpha }(u)}$. Rather, the fractional Fourier transform of ${\displaystyle f(u/M)}$ turns out to be a scaled and chirp modulated version of ${\displaystyle f_{\alpha '}(u)}$ where ${\displaystyle \alpha \neq \alpha '}$ is a different order.

### Fractional kernel

The FrFT is an integral transform

${\displaystyle {\mathcal {F}}_{\alpha }f(u)=\int K_{\alpha }(u,x)f(x)\,\mathrm {d} x}$

where the ?-angle kernel is

${\displaystyle K_{\alpha }(u,x)={\begin{cases}{\sqrt {1-i\cot(\alpha )}}\exp \left(i\pi (\cot(\alpha )(x^{2}+u^{2})-2\csc(\alpha )ux)\right)&{\mbox{if }}\alpha {\mbox{ is not a multiple of }}\pi ,\\\delta (u-x)&{\mbox{if }}\alpha {\mbox{ is a multiple of }}2\pi ,\\\delta (u+x)&{\mbox{if }}\alpha +\pi {\mbox{ is a multiple of }}2\pi ,\\\end{cases}}}$

Here again the special cases are consistent with the limit behavior when ? approaches a multiple of ?.

The FrFT has the same properties as its kernels :

• symmetry: ${\displaystyle K_{\alpha }~(u,u')=K_{\alpha }~(u',u)}$
• inverse: ${\displaystyle K_{\alpha }^{-1}(u,u')=K_{\alpha }^{*}(u,u')=K_{-\alpha }(u',u)}$
• additivity: ${\displaystyle K_{\alpha +\beta }(u,u')=\int K_{\alpha }(u,u'')K_{\beta }(u'',u')\,\mathrm {d} u''.}$

### Related transforms

There also exist related fractional generalizations of similar transforms such as the discrete Fourier transform. The discrete fractional Fourier transform is defined by Zeev Zalevsky in ([[#CITEREFCandanKutayOzaktas2000|Candan, Kutay & Ozaktas 2000]]) and (Ozaktas, Zalevsky & Kutay 2001, Chapter 6). A quantum algorithm to implement a version of the discrete fractional Fourier transform in subpolynomial time is described by Somma.[9]

Fractional wavelet transform (FRWT):[10] A generalization of the classical wavelet transform (WT) in the fractional Fourier transform (FRFT) domains. The FRWT is proposed in order to rectify the limitations of the WT and the FRFT. This transform not only inherits the advantages of multiresolution analysis of the WT, but also has the capability of signal representations in the fractional domain which is similar to the FRFT. Compared with the existing FRWT, the FRWT (defined by Shi, Zhang, and Liu 2012) can offer signal representations in the time-fractional-frequency plane.

See also the chirplet transform for a related generalization of the Fourier transform.

### Generalizations

The Fourier transform is essentially bosonic; it works because it is consistent with the superposition principle and related interference patterns. There is also a fermionic Fourier transform.[11] These have been generalized into a supersymmetric FRFT, and a supersymmetric Radon transform.[11] There is also a fractional Radon transform, a symplectic FRFT, and a symplectic wavelet transform.[12] Because quantum circuits are based on unitary operations, they are useful for computing integral transforms as the latter are unitary operators on a function space. A quantum circuit has been designed which implements the FRFT.[13]

## Interpretation

A rect function turns into a sinc function as the order of the fractional Fourier transform becomes 1

The usual interpretation of the Fourier transform is as a transformation of a time domain signal into a frequency domain signal. On the other hand, the interpretation of the inverse Fourier transform is as a transformation of a frequency domain signal into a time domain signal. Apparently, fractional Fourier transforms can transform a signal (either in the time domain or frequency domain) into the domain between time and frequency: it is a rotation in the time-frequency domain. This perspective is generalized by the linear canonical transformation, which generalizes the fractional Fourier transform and allows linear transforms of the time-frequency domain other than rotation.

Take the below figure as an example. If the signal in the time domain is rectangular (as below), it will become a sinc function in the frequency domain. But if we apply the fractional Fourier transform to the rectangular signal, the transformation output will be in the domain between time and frequency.

Fractional Fourier transform

Actually, fractional Fourier transform is a rotation operation on the time frequency distribution. From the definition above, for ? = 0, there will be no change after applying fractional Fourier transform, and for ? = ?/2, fractional Fourier transform becomes a Fourier transform, which rotates the time frequency distribution with ?/2. For other value of ?, fractional Fourier transform rotates the time frequency distribution according to ?. The following figure shows the results of the fractional Fourier transform with different values of ?.

Time/frequency distribution of fractional Fourier transform

## Application

Fractional Fourier transform can be used in time frequency analysis and DSP.[14] It is useful to filter noise, but with the condition that it does not overlap with the desired signal in the time-frequency domain. Consider the following example. We cannot apply a filter directly to eliminate the noise, but with the help of the fractional Fourier transform, we can rotate the signal (including the desired signal and noise) first. We then apply a specific filter, which will allow only the desired signal to pass. Thus the noise will be removed completely. Then we use the fractional Fourier transform again to rotate the signal back and we can get the desired signal.

Fractional Fourier transform in DSP

Thus, using just truncation in the time domain, or equivalently low-pass filters in the frequency domain, one can cut out any convex set in time-frequency space; just using time domain or frequency domain methods without fractional Fourier transforms only allow cutting out rectangles parallel to the axes.

Fractional Fourier transforms also have applications in quantum physics. For example, they are used to formulate entropic uncertainty relations.[15]

They are also useful in the design of optical systems and for optimizing holographic storage efficiency.[16]

Other time-frequency transforms:

## References

1. ^ E. U. Condon, "Immersion of the Fourier transform in a continuous group of functional transformations", Proc. Natl. Acad. Sci. USA 23, (1937) 158-164. online
2. ^ V. Namias, "The fractional order Fourier transform and its application to quantum mechanics," J. Inst. Appl. Math. 25, 241–265 (1980).
3. ^ N. Wiener, "Hermitian Polynomials and Fourier Analysis", J. Mathematics and Physics 8 (1929) 70-73.
4. ^ Luís B. Almeida, "The fractional Fourier transform and time-frequency representations," IEEE Trans. Signal Process. 42 (11), 3084–3091 (1994).
5. ^ Ran Tao, Bing Deng, Wei-Qiang Zhang and Yue Wang, "Sampling and sampling rate conversion of band limited signals in the fractional Fourier transform domain," IEEE Transactions on Signal Processing, 56 (1), 158–171 (2008).
6. ^ A. Bhandari and P. Marziliano, "Sampling and reconstruction of sparse signals in fractional Fourier domain," IEEE Signal Processing Letters, 17 (3), 221–224 (2010).
7. ^ D. H. Bailey and P. N. Swarztrauber, "The fractional Fourier transform and applications," SIAM Review 33, 389-404 (1991). (Note that this article refers to the chirp-z transform variant, not the FRFT.)
8. ^ "Archived copy" (PDF). Archived from the original (PDF) on 2018-11-03. Retrieved .CS1 maint: archived copy as title (link)
9. ^ Rolando D. Somma, "Quantum simulations of one dimensional quantum systems," Quantum Information and Computation, Vol. 16, No. 13&14, pp. 1125-1168, 2016. URL: http://www.rintonpress.com/xxqic16/qic-16-1314/1125-1168.pdf
10. ^ J. Shi, N.-T. Zhang, and X.-P. Liu, "A novel fractional wavelet transform and its applications," Sci. China Inf. Sci. vol. 55, no. 6, pp. 1270-1279, June 2012. URL: https://doi.org/10.1007%2Fs11432-011-4320-x
11. ^ a b Hendrik De Bie, Fourier transform and related integral transforms in superspace (2008), http://www.arxiv.org/abs/0805.1918
12. ^ Hong-yi Fan and Li-yun Hu, Optical transformation from chirplet to fractional Fourier transformation kernel (2009), http://www.arxiv.org/abs/0902.1800
13. ^ Andreas Klappenecker and Martin Roetteler, Engineering Functional Quantum Algorithms (2002), http://www.arxiv.org/abs/quant-ph/0208130
14. ^ E. Sejdi?, I. Djurovi?, LJ. Stankovi?, "Fractional Fourier transform as a signal processing tool: An overview of recent developments", Signal Processing, vol. 91, no. 6, pp. 1351-1369, June 2011. doi:10.1016/j.sigpro.2010.10.008.
15. ^ Huang, Yichen (24 May 2011). "Entropic uncertainty relations in multidimensional position and momentum spaces". Physical Review A. 83 (5): 052124. arXiv:1101.2944. doi:10.1103/PhysRevA.83.052124.
16. ^ N. C. Pégard and J. W. Fleischer, "Optimizing holographic data storage using a fractional Fourier transform", Opt. Lett. 36, 2551-2553 (2011) [1].