experiment of the course was based on Fast Fourier Transform. A discrete signal with length of sequence 8 was taken as the input. The FFT was computed using a code written in C, and run through the linux terminal. The output was verified by taking the obtained values as the input to the Inverse FFT program, which on execution gave the original x(n) as output. FFT, as compared to DFT, produces fast results due to parallel calculations.
THE CODE CAN BE FOUND AT
https://drive.google.com/drive/u/0/folders/0B-XPe3yA-mx-UXhJWnFYVFJncU0
THE CODE CAN BE FOUND AT
https://drive.google.com/drive/u/0/folders/0B-XPe3yA-mx-UXhJWnFYVFJncU0
Fft uses decimation in time domain (I.e splitting of original series in to two or more parts)
ReplyDeleteNumber of computations required are less, thus speed increase
ReplyDelete