What is the updated version of FFT that does not require 2^n data points?

  • Thread starter Thread starter Dr.D
  • Start date Start date
  • Tags Tags
    fft sample size
AI Thread Summary
The discussion centers on the Fast Fourier Transform (FFT) and its historical limitation of requiring data points to be in the form of 2^n. Recent advancements have lifted this restriction, allowing for more flexible data sizes. References to FFTW and accelerated libraries like CUFFT highlight that these newer algorithms can handle a broader range of data point combinations, including those based on prime integers. Users are encouraged to utilize numbers that are combinations of powers of 2, 3, and 5 for optimal results. Resources for further reading are sought, particularly free online materials due to limited access to libraries.
Dr.D
Messages
2,411
Reaction score
723
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.
 
Technology news on Phys.org
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.
 
Thank you, Dr Transport & Chris.
 

Thread 'Learning Assembly and computer architecture for x86'

Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
View full post »

Thread 'Learning data structures and algorithms in different programming languages'

I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...
View full post »

Similar threads

Modern Digital Audio: Understanding Dither and Oversampling in Hi-Res Age
Replies
17
Views
4K
Java Android Studio: Accessing SQLite Data In RecyclerView
Replies
1
Views
3K
Solving ODEs with Forward Euler & Sampled Data Systems
Replies
6
Views
1K
Requesting suggestions for languages, libraries, and architectures for parallel (and sometimes non parallel) numerical and scientific computations
Replies
8
Views
4K
DMD is better without Ergodic Theory and Koopman Operators
Replies
2
Views
2K
ABC reference frame synchronous generator modelling in Ltspice
Replies
1
Views
3K
I don't understand kind of program the instructions want
Replies
4
Views
3K
I Two recent tests of loop quantum gravity theory
Replies
15
Views
5K
I Progress In Calculating The HLbL Contribution To Muon g-2
Replies
0
Views
2K
Job Skills [Career] - What kind of life does a career in physics entail?
Replies
2
Views
3K

Hot Threads

Recent Insights

Back
Top