EXPERIMENT NO.

Spectral Analysis using DFT

AIM: To study the spectral analysis using DFT SOFTWARE: MATLAB THEORY: Discrete Fourier Transform: It is a finite duration sequence which is obtained by sampling one period of Fourier transform. Sampling is done at N equally spaced points. Mathematical Equation: The DFT of discrete sequence x(n) is denoted by X(k).It is given by

Where k= 0,1,2,...N-1 Since this summation is taken for N points, it is called N point DFT. One of the most important properties for DFT is convolution of two sequences .The multiplication of two DFTs is equivalent to the convolution of their sequences in time domain. MATLAB functions: MATLAB defines the following functions: a. fft : Fast Fourier transform Syntax Y = fft(x) Y = fft(X,n) Y = fft(x) returns the discrete Fourier transform (DFT) of vector x, computed with a fast Fourier transform (FFT) algorithm. If the input X is a matrix, Y =fft(X) returns the Fourier transform of each column of the matrix. If the input X is a multidimensional array, fft operates on the first nonsingleton dimension. Y = fft (X,n) returns the n-point DFT. fft(X) is equivalent to fft(X, n) where n is the size of X in the first nonsingleton dimension. If the length of X is less than n, X is padded with trailing zeros to length n. If the length of X is greater than n, the sequence X is truncated. When X is a matrix, the length of the columns are adjusted in the same manner. b. ifft: Inverse fast Fourier transform
DTSP Practical VIT SMK

Syntax y =ifft(X) y = ifft(X,n) Description y = ifft(X) returns the inverse discrete Fourier transform (DFT) of vector X, computed with a fast Fourier transform (FFT) algorithm. If X is a matrix, ifft returns the inverse DFT of each column of the matrix. y = ifft(X,n) returns the n-point inverse DFT of vector X. c. conv : Convolution and polynomial multiplication Syntax w = conv(u,v) Description w = conv(u,v) convolves vectors u and v. Algebraically, convolution is the same operation as multiplying the polynomials whose coefficients are the elements of u and v. Let m = length(u) and n = length(v) . Then w is the vector of length m+n-1

The sampling theorem and convolution of sequences can be observed for the following example:

Frequency analysis of the amplitude modulated discrete-time signal x(n)=cos (2f1n)+ cos (2f2n) where f1=1/128 and f1=5/128 modulates the signal xc(n)=cos (2fc n) where fc=50/128. The resulting amplitude-modulated signal is xam(n)=x(n)* cos (2 fc n). Using MATLAB program, (a) sketch the signals x(n), xc(n) and xam(n), 0 < n< 255 (b) compute and sketch the 128-point DFT of the signal xam(n), 0 <n < 127 (c) compute and sketch the 128-point DFT of the signal xam(n), 0 <n < 99. (d) Obtain convolution of x(n) and xc(n) using the method of DFT-IDFT. CONCLUSION: (Write 4-5 lines on observations based on sampling theorem, DFT (two types) Also on convolution of two signals using function and DFT)

DTSP Practical

VIT

SMK