Scribd
Upload
156 views

DSP Assignment DFT

This document outlines 10 questions related to digital signal processing (DSP) concepts like the discrete Fourier transform (DFT), linear convolution, and circular convolution. The questions cover topics such as calculating DFT values, finding linear and circular convolutions using the DFT method, properties of DFTs of real and periodic signals, and comparing convolution results using the DFT method versus direct computation.

Uploaded by

Aman Mathur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
156 views

DSP Assignment DFT

This document outlines 10 questions related to digital signal processing (DSP) concepts like the discrete Fourier transform (DFT), linear convolution, and circular convolution. The questions cover topics such as calculating DFT values, finding linear and circular convolutions using the DFT method, properties of DFTs of real and periodic signals, and comparing convolution results using the DFT method versus direct computation.

Uploaded by

Aman Mathur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DSP Assignment

1. Let X ( ) denote the Fourier transform of the signal x[n] shown in the figure below. What is the value

of |X ( ) | at =0?

2. Find the N- point DFT for the sequence :

x[n] = {24; 8; 12; 16; 24; 8; 12; 18; 24; 8; 12; 16..}.
3. Find the linear convolution of the sequences x [n]and h [n] using DFT.

x[n] ={1,0,2} and h[n]={1,1}


4. The DFT of a real signal is X (k) = {1, A, -1, B, -7, -j2, C,-1+j}. Compute the signal energy.
5. Let g[n] and h[n] be two finite length sequences of length 7 each. If YL[n] and YC[n] denote the linear

and 7-point circular convolutions of g[n] and h[n], respectively, then express YC[n] in terms of YL[n].
6. Let g[n] be a finite-length sequence defined for 3 4, and let h[n] be a finite-length sequence

defined by 2 6. Define y[n] =g[n] h[n].


a) What is the length of y[n]?
b) What is the range of the index n for which y[n] is defined?

7. A bandlimited analog signal is sampled (with no aliasing) at 500 Hz and 980 samples are collected. The

DFT of these 980 samples is computed. We wish to compute the value of the spectrum of the sampled
signal at 120 Hz.
(a) Which DFT index k is nearest to 120 Hz, and what is its physical frequency in hertz?
(b) What is the minimum number of zeros we must pad onto the 980 samples to obtain a DFT value at
120 Hz exactly? What is the DFT index k then corresponding to 120 Hz?
8. Let x[n], 0 1, be a length N- sequence with an N-point DFT X[k], 0 1.

a) Show that if N is even and if [] = [< + 2 > ] for all n, the X[k] =0 for k even.

b) Show that if N is an integer multiple of 4 and if [] = [< + 4 > ] for all n, then X[k]=0 for

= 4,
0 1
4

9. Let x[n] be length N sequence with an N-point DFT given by X [k]. Assume N is divisible by 3. Define

a sequence y[n] =x [3n], 0

1. Express the 3 - point DFT Y[k] of y[n] in terms of X[k].

10. Two N-point sequences are created in Matlab using the commands:

n = 0: N-1;
w = 0.5 - 0.5 * cos (2*pi*n/N);
f = 0.5 - 0.5 * cos (2*pi*(n+0.5)/N);
Use N 4 and find the circular convolution yc [n] = w[n] *f[n] and compare the result with the N-point
DFT method using MATLAB.

You might also like