datasheets.com EBN.com EDN.com EETimes.com Embedded.com PlanetAnalog.com TechOnline.com  
Events
UBM Tech
UBM Tech
Welcome Guest Log In | Register | Benefits

Expand FFT Capabilities to Non-power of Two Length Data Sequences

Authored on: Mar 14, 2013 by Richard Lyons

Technical Paper

0 0
More InfoLess Info
The fast Fourier transform (FFT) is perhaps the most powerful algorithm in all of digital signal processing. However, the traditional radix-2 FFT algorithm can only be applied to data sequences where the number of samples in the sequence is an integer power of two, i.e., 8, 16, 32, 64, etc. This paper provides a signal processing trick that extends the FFT's applicability to data sequences whose lengths are integer multiples of a power of two, for example, 3x16=48 or perhaps 5x32=160 sample sequences.
0 comments
write a comment

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page