Fast Fourier Transform


       This was great learning experience the objective of this experiment was to perform Fast Fourier Transform and to develop a program to perform FFT of N-point signal.Then we did programming in C on Linux terminal and compiled a program to find FFT( N=4,8). Then we did the computation of real and complex multiplication and addition.Speed plays a very vital role and hence FFT algorithms are preferred to obtain DFT of a sequence. Fast Fourier Transform reduces the number of computations required considerably. Thus, improving the efficiency by reducing the time and memory requirements of the system.

Comments

Post a Comment

Popular posts from this blog

Filtering of Long Data Sequence

          The Aim of this experiment was to perform filtering of long data sequence using Overlap Add Method and Overlap Save Method.  Time-domain based convolution require the entire input sequence to be present before commutation. This can pose a problem in real time applications where the data input is long and continuous. Overlap-save method and overlap-add method divide the input sequence into smaller blocks. The filtering of individual blocks which are smaller in length is done by DFT and IDFT and then fitted one after the other. The overlapped portion is discarded in OSM whereas it is added in OAM to get the required output sequence.We wrote the program in C and obtained the convolution for different input signals like N=14,17,18.etc. This resultant is the same as that if the input had been processed via time domain convolution
Read more

Discrete Fourier Transform

 This was the great experience of learning Digital Signal Processing Laboratory, the aim was to perform Discrete Fourier Transform .in this lab session I have developed a function in C program on Linux terminal to perform the DFT of N-point signal where N was taken from the user (4/8). Then I performed the DFT of 4 point signal and 8 point signal and plotted the Magnitude spectrum. DFT gives output in a frequency domain, DFT spectrum is also discrete spectrum and it is approximated.DFT coefficients are defined as W=2*pi*k/N, it gives periodic results.          Also,  I have done some more operation, I increased the length of the input signal by zero padding and then obtained the DFT of the signal after result analysis I found that as the length of signal increases by zero padding frequency spacing decreases, approximation error decreases and Resolution of the frequency spectrum increases.Also, expansion of the signal in time domain gives comp...
Read more

Discrete time Convolution and Correlation

          This was the great experience of learning digital signal processing, the aim of this experiment was to study mathematical operations such as linear, circular, convolution linear using circular convolution. I developed a function in C program on Linux terminal to find the LC, CC, LC using CC and verified the output of the program using mathematical time domain method.In linear convolution, if both signals are causal then the resultant output signal is also causal.Convolution gives the output of the system, circular convolution gives aliased output.        Let's come to correlation, it has two types auto -correlation and cross-correlation.An autocorrelated signal is an even signal.Autocorrelation of delayed signal is same as the original signal.The application of correlation is the  measurement degree of similarity between two signals, we used Carl's correlation coefficient formula to find the degree of sim...
Read more