DSPP

Overlap Add and Overlap Save Methods are used to process real time signals. Both OAM and OSM breakdown the signal into segments , process each segment and then combine the segments into one final output signal. OAM and OSM methods use FFT because high computational speed is required. In the experiment OAM and OSM were applied on a 13 point sequence. Because of their speed OAM and OSM are preferred for real time processing.

Fast Fourier Transform is an algorithm used to compute Discrete Fourier Transform of a sequence. An FFT rapidly computes transformations by factorising the DFT matrix into a product of a sparse factors. As a result the complexity of the computation is reduced. In this experiment the FFT algorithm was applied to a 4 point and an 8 point sequence. The code was modified to calculate the number of real multiplications and real additions.

Discrete Fourier Transform is used to transform signal in time domain to frequemcy domain. In this experiment, we ran a C program to find the DFT of a 4 -ponit and an 8-point sequemce. Also, we plotted their magnitude spectrum. From the magnitude spectrum it was observed that expansion of input signal in time domain gives compressed spectrum in frequency domain.

In the previous semester we had studied convolution and correlation. In this semester we applied the codes for convolution and correlation and verified the results with theoretical reaults. Linear convolution, Circular Convolution and Linear Convolution using Circular Convolution were calculated. It was observed that Circular Convolurion gives aliased output. Correlation is used to find the degree of similarity between two signals. We calculated autocorrelation and cross correlation.