Type:

Other

Description:

This Demonstration computes an improved fast Fourier transform that we call XFT to distinguish it from the usual FFT algorithms. The XFT is given by the product ... , where ... is a diagonal matrix with ... diagonal element given by ... , ... , ... is the standard discrete Fourier transform, and ... . Therefore, the XFT is as fast as the FFT algorithm used to compute the discrete Fourier transform. However, 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. This Demonstration approximates the special case of the continuous Fourier transform defined as ... ... evaluated at the points ... , ... .

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:399036,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/XFTAnImprovedFastFourierTransform/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467