XFT2D: A 2D Fast Fourier Transform

This Demonstration computes the real part of a two-dimensional fast Fourier transform that we call XFT2D to distinguish it from the usual FFT algorithms. It displays the transformed data points joined without any interpolation. XFT2D consists of a Kronecker product of two one-dimensional XFTs, one in each of the , directions. It approximates the two-dimensional Fourier transform defined as evaluated at the points , , , with and . The XFT is an improvement of the standard FFT (see the Details section).

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

The XFT is a discrete fractional Fourier transform that was obtained in closed form in [1] by using finite-dimensional vectors representing Hermite functions and some asymptotic properties of the Hermite polynomials. The XFT is given by the product , where is a diagonal matrix with diagonal element given by , , is the standard discrete Fourier transform, and . The XFT2D can be defined by the Kronecker product . The XFT is computed with and points in the and directions, respectively. The XFT is as fast as the FFT algorithm used to compute the discrete Fourier transform, but the output of the XFT is more accurate than the output of the FFT because it comes from an algorithm to compute the fast fractional Fourier transform based on a convergent quadrature formula.
[1] R. G. Campos, J. Rico–Melgoza, and E. Chavez, "XFT: Extending the Digital Application of the Fourier Transform," arXiv, 2009.
[2] R. G. Campos, J. Rico–Melgoza, and E. Chavez, "RFT: A Fast Discrete Fractional Fourier Transform," submitted.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.