---
title: Fractional Fourier Transform (FrFT)
url: https://www.emergentmind.com/topics/fractional-fourier-transform-frft
type: topic
---

# Fractional Fourier Transform (FrFT)

The fractional Fourier transform (FrFT) is a unitary linear integral transform that generalizes the conventional Fourier transform by introducing a continuous order parameter, corresponding to an arbitrary-angle rotation in the time–frequency (phase) space. The FrFT has become a foundational tool across physics, signal processing, optics, quantum information, and applied mathematics, enabling analysis and synthesis techniques that interpolate smoothly between time and frequency representations.

## 1. Mathematical Definition and Core Properties

Let $f(t) \in L^2(\mathbb{R})$. The one-dimensional FrFT of real order (or rotation angle) $\alpha$ is given by:
\[
F_\alpha[f](u) = \int_{-\infty}^{\infty} K_\alpha(t,u) f(t) \, dt
\]
where the kernel is:
\[
K_\alpha(t,u) = \sqrt{\frac{1-i\cot\alpha}{2\pi}} \exp\left\{ i \frac{(t^2+u^2)\cot\alpha - 2 t u \csc\alpha}{2} \right\}
\]
for $\alpha \notin \pi\mathbb{Z}$. The FrFT of order $\alpha$ is the unitary operator $F_\alpha = \exp(i\alpha \hat{H})$, where $\hat{H} = (\hat{p}^2/2 + \hat{q}^2/2 - 1/2)$ is the dimensionless harmonic-oscillator Hamiltonian and $(\hat{q}, \hat{p})$ are suitably scaled conjugate operators [2303.13305, 2506.09189].

**Special cases:**
- $\alpha = 0$: $F_0[f](u) = f(u)$ (identity transformation)
- $\alpha = \pi/2$: $F_{\pi/2}[f](u)$ coincides with the conventional Fourier transform
- For integer multiples: $F_{n\pi/2} = \mathcal{F}^n$, where $\mathcal{F}$ is the standard Fourier transform
- The inverse: $F_{-\alpha} = F_\alpha^{-1}$
- **Linearity** and **unitarity**: $F_\alpha$ is linear and preserves $L^2$ norm

**Group structure:** The FrFTs obey $F_{\alpha+\beta} = F_\alpha \circ F_\beta$ for all real $\alpha, \beta$, endowing them with a continuous group structure [2506.09189, 2507.21511].

**Geometric interpretation:** FrFT implements a rotation by angle $\alpha$ in the time–frequency plane, which is most rigorously described using the Wigner distribution. For Wigner distribution $W_f(t,\omega)$,
\[
W_{F_\alpha[f]}(t, f) = W_f(t\cos\alpha - f\sin\alpha,\ t\sin\alpha + f\cos\alpha)
\]
i.e., a rigid rotation in the joint phase space [2506.09189, 2303.13305, 2311.10950].

## 2. Operational and Algorithmic Realizations

**Chirp–Fourier Decomposition:** The FrFT can be constructed by three steps: (1) input chirp pre-multiplication, (2) ordinary Fourier transform, (3) output chirp post-multiplication. For a function $f(t)$:
\[
F_\alpha[f](u)=A_\alpha\,e^{i\frac{u^2}{2}\cot\alpha} \cdot \mathcal{F}[e^{i\frac{t^2}{2}\cot\alpha} f(t)](u \csc \alpha)
\]
where $A_\alpha$ is a normalization constant, $\mathcal{F}$ is the classical Fourier transform [2007.00964, 2506.09189].

**Discrete/fast algorithms:** FrFT of a discrete signal $x[n]$ can be computed via chirp multiplication–FFT–chirp multiplication sequence, achieving $O(N\log N)$ complexity. Enhanced schemes incorporate Newton–Cotes quadrature weighting for improved accuracy [2311.16379], as well as closed-form matrix kernels for exact discrete versions (e.g., affine DFrFT) with properties paralleling those of the DFT, such as circular convolution [2010.09882].

## 3. Phase Space and Quantum-Mechanical Perspective

**Quantum origins:** The FrFT emerges naturally as a change-of-basis operation in quantum mechanics: applying a fractional power of the harmonic oscillator’s time-evolution operator rotates between the position and momentum representations. Specifically, the generator is the number operator $\hat{n}=a^\dagger a$, so $F_\alpha = \exp(-i\alpha\hat{n})$, and the eigenfunctions are the Hermite-Gaussian modes, with $F_\alpha[\psi_n] = e^{-in\alpha}\psi_n$ [1307.6271].

**Generalized fractional transforms:** This structure can be generalized: given a family of mutually commuting Hermitian operators, one defines a multi-parameter group of generalized fractional transforms, each with corresponding kernel and eigenfunction decomposition [1307.6271].

## 4. Extensions: Multidimensional and Variant FrFTs

**Higher-dimensional generalizations:**
- **Separable and nonseparable 2D FrFTs:** For $f(x,y)$, the nonseparable 2D FrFT is parameterized by four degrees of freedom—parameters $(a, b, c, d, \theta)$ satisfying $a^2 + b^2 + c^2 + d^2 = 1$, with a kernel that unifies the separable 2D FRFT, gyrator transform, and coupled FRFT as special cases [2507.21511]. This NSFRFT preserves a full $\mathrm{SO}(4)$ phase-space rotation, enabling advanced joint time-frequency processing in two dimensions.
- **Holomorphic FrFT (HFrFT):** In this variant, the output is an entire function of a complexified time-frequency variable, intertwining the standard FrFT with a complex-domain heat kernel, and the transform is unitary between $L^2$ and a weighted holomorphic function space [1905.04116].

**Simplified and reduced-order variants:** The SmFrFT and ROFrFT offer alternative kernels and convolution structures designed to simplify analytical manipulation or to restore "elegance" to algebraic properties such as the convolution theorem, enabling direct pointwise multiplication in the FrFT domain or tractable analytical expressions [1803.07381, 1804.06131].

## 5. Applications Across Disciplines

**Signal processing:**
- **Time–frequency analysis:** FrFT enables continuous interpolation between time and frequency domains, yielding optimal representations for chirp-like and nonstationary signals. It has found use in denoising, time–frequency filtering, cepstral analysis (fractional cepstrum), and sound synthesis ("alpha-domain") [2506.09189, 1206.0729].
- **Digital communications:** Affine discrete FrFTs generalize OFDM modulation, allowing circular convolution and efficient fractional/bandwidth equalization for chirped or time-varying channels [2010.09882].

**Optics and quantum information:**
- **Optical systems:** FrFT generalizes lens and free-space propagation concepts to arbitrary phase-space rotations, with direct physical implementations via interleaved dispersive (spectral phase) and time-lens (temporal quadratic phase) elements. Both atomic quantum memories and electro-optic modulators realize time-frequency FrFTs for quantum and classical photonic signals [2303.13305, 2307.01141].
- **Quantum information:** The phase-space rotation interpretation enables temporal mode sorting, high-dimensional quantum communication, and tomographic phase-space measurements. In atomic quantum memory, programmable FrFT operations are achieved by synthesizing sequences of quadratic spectral and temporal phase modulations [2303.13305].

**Numerical inversion and probability:** FrFT is a fast and accurate method for inverting characteristic functions to PDFs and their derivatives, used in maximum likelihood estimation of financial models (variance-gamma, generalized tempered stable, etc.), outperforming classical FFT-based schemes in accuracy and flexibility, particularly when tail behavior or flexible output grids are essential [2205.02415, 2205.00586].

**Image and diffraction processing:** In coherent diffraction imaging, FrFT-based measurement models unify near-field and far-field propagation, enabling single-shot phase retrieval with untrained neural networks and breaking ambiguities present in pure Fourier measurements [2311.10950].

**Wavelet theory:** FrFT supports the construction of fractional MRAs and (bi)orthogonal wavelet families, where dilation and translation parameters are accompanied by order-dependent phase factors. Riesz-basis and biorthogonality properties are characterized by the periodized FrFT energy and associated filters [2008.08964].

## 6. Analytical and Computational Features

| Variant / Property         | Domain/Kernel                                   | Notable Feature / Use                                 |
|---------------------------|-------------------------------------------------|-------------------------------------------------------|
| Standard FrFT             | $K_\alpha(t,u)$, rotation angle $\alpha$        | General interpolation time$\leftrightarrow$freq.      |
| Affine DFrFT              | Matrix kernel, closed-form                      | Circular convolution, OFDM, eigenstructure            |
| NSFRFT (2D nonseparable)  | 4-param. $K_P(x,y;u,v)$, $\mathrm{SO}(4)$ rot.  | Unified multi-DOF for 2D signal/image analysis        |
| HFrFT                     | Holomorphic extension, heat kernel smoothing    | Analysis in holomorphic function spaces               |
| SmFrFT, ROFrFT            | Reduced/simpler kernels                         | Simplified analytical/algorithmic properties          |

- **Numerical implementation**: The FrFT admits $O(N\log N)$ numerical schemes via decomposition into chirps and FFTs, with high-order quadrature (e.g., Newton–Cotes) further improving accuracy for inverse integral calculations [2311.16379, 2205.02415].
- **Analytic tractability**: Variant definitions (ROFrFT, SmFrFT) provide explicitly closed-form transforms for prototypical signals (Gaussians, chirps, delta functions) and convolution theorems that reduce to pointwise multiplication in the FrFT domain [1803.07381, 1804.06131].

## 7. Limitations, Open Problems, and Outlook

**Error sources in experiments:** Implementations are affected by device-limited coherence, finite memory efficiency (atomic FrFT), magnetic field stability, inhomogeneous broadening, and spurious phase contributions [2303.13305, 2307.01141].

**Algorithmic trade-offs:** While fast algorithms exist, optimizing performance for windowed, adaptive, or multidimensional scenarios and quantifying discretization/aliasing errors in practical applications remains an active area [2311.16379, 2507.21511].

**Open implications in phase retrieval:** The use of FrFT domains for support-free and single-shot phase retrieval is promising, but failure modes persist at certain orders (e.g., $p=1$ for classical phase retrieval), and further research is needed to generalize uniqueness guarantees and robustness [2311.10950].

**Broader significance:** The FrFT unifies continuous phase-space rotation, optimal time–frequency representation, and physically implementable optical/quantum transformations, offering a mathematically rich and practically versatile generalization of Fourier analysis that continues to drive innovation in signal analysis, computing, and photonic information processing.

Source: https://www.emergentmind.com/topics/fractional-fourier-transform-frft