Skip to main content

Fast Fourier Transform (FFT)


As the input signal values increases the DFT computational time also increases. Thus to decrease this time, we have implemented DITFFT radix-2 algorithm for N=4 and N=8.
This algorithm decimates the input sample values into smaller pieces until the prime factor 2 is obtained.

Comments

Post a Comment

Popular posts from this blog

Basic Operations on DSP processor

After knowing the concepts of Digital signal processing, now it was time to apply those concepts on the dsp kit. In this experiment, we were given a general overview of programming on a dsp kit in assembly level language. The DSP kit used was TMS320f28375. Basic arithmetical​,logical and shifting Operations were performed on the kit. The instructions for above operations were implemented and register values before and after the execution were observed and noted down.