datasheets.com EBN.com EDN.com EETimes.com Embedded.com PlanetAnalog.com TechOnline.com  
Events
UBM Tech
UBM Tech

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

Authored on: Mar 14, 2013 by Richard Lyons

Technical Paper

0 4
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.
4 comments
write a comment

No Avatar

ledbg Posted Feb 12, 2014

Why is registration so cumbersome? You already have most of the information that is queried in the registration form of the webinar. Please improve. cree q5 led

reply

No Avatar

sw308495 Posted Mar 31, 2014

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. Samsung fridge not cooling

reply

No Avatar

bookersharrow Posted Apr 7, 2014

signal processing trick that extends the FFT's applicability to data sequences whose lengths are integer multiples low-t lawyer

reply

No Avatar

jack11 Posted Apr 5, 2014

100% Success is ensured 648-238 braindumps as per Money back Guarantee Moreover we have also offer Free demos on request so you can use them and verify the standard, quality and accuracy.648-247 braindumps

reply

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