1

I have derived the circular convolution property for an affine Fractional Fourier Transform and I need to work on an application for my research. Any idea?

Amir R
  • 13
  • 3
  • I can't think of any. Normally one uses the FFT because it's fast, and just copes with the fact that what you _really_ want to work with is a signal of infinite duration. You just put up with the fact that the FFT works on a set of data that's topologically circular because, well, it's fast. One of the strong **downsides** to using the FFT for filtering is the fact that its convolution is circular -- this limits the filters you can use to FIR filters, and means you have to use the overlap-and-add algorithm, with all its bookkeeping. – TimWescott Nov 10 '21 at 19:48
  • 1
    Welcome to SE.SP! The [Wikipedia page for it has an example application.](https://en.wikipedia.org/wiki/Fractional_Fourier_transform#Application) – Peter K. Nov 10 '21 at 19:56
  • Oh Peter I think I took a class with you years ago. Glad to see you here. – Amir R Nov 10 '21 at 21:45
  • Thank you I will check it out. – Amir R Nov 10 '21 at 21:47

0 Answers0