Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Non 2^n sample based FFT

  1. Oct 31, 2014 #1
    Back when I studied the FFT (many years ago), it was always described as transforming a sample based on 2^n data points. More recently, I have read that this restriction has been removed. Can anyone point me to a good reference on this newer form, preferably something available free on the 'net since I have very limited library access? Any comments on this will be much appreciated.
  2. jcsd
  3. Nov 1, 2014 #2

    Dr Transport

    User Avatar
    Science Advisor
    Gold Member

  4. Nov 2, 2014 #3
    The 2^n restriction is for a specific algorithm. The fftw and the accelerated libraries like cufft they different algorithms now which allow a wide combination of prime integers. In general I try use only numbers which combinations of powers of only 2,3 and 5.
  5. Nov 3, 2014 #4
    Thank you, Dr Transport & Chris.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook