Scribd
Upload
4 views2 pages

Tutorial 2

This document contains a series of tutorial questions related to Digital Signal Processing, focusing on Discrete Fourier Transforms (DFT) and circular convolution. It includes calculations for DFTs of various sequences, relationships between DFTs, and the determination of sequences based on their Fourier transforms. The questions also cover practical applications such as sketching magnitude and phase, and deriving sequences from DFT properties.

Uploaded by

bajpaisahib
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Tutorial 2

This document contains a series of tutorial questions related to Digital Signal Processing, focusing on Discrete Fourier Transforms (DFT) and circular convolution. It includes calculations for DFTs of various sequences, relationships between DFTs, and the determination of sequences based on their Fourier transforms. The questions also cover practical applications such as sketching magnitude and phase, and deriving sequences from DFT properties.

Uploaded by

bajpaisahib
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tutorial 2: Digital Signal Processing

Q1. Suppose we have two four-point sequences x[n] and h[n] as follows:
π𝑛
x[n] = cos( 2
), n = 0,1,2,3
h[n] = 2n , n = 0,1,2,3
a.​ Calculate the four-point DFT X[k]
b.​ Calculate the four-point DFT H[k]
c.​ Calculate y[n] = x[n] ⊙ h[n], where ⊙ is the circular convolution

Q2. The two eight-point sequences, x1[n] and x2[n], shown in the figure
have DFTs, X1[n] and X2[n], respectively. Determine the relationship
between X1[K] and X2[K].

Q3. Calculate the DFT of the following sequence:


x[n] = | an, 0 ≤ 𝑛 ≤ 𝑁 − 1
| 0, otherwise

Q4. Determine the eight-point DFT of the signal


x[n] = {1,1,1,1,1,1,0,0}
and sketch its magnitude and phase.
Q5. Let X(ejw) denote the Fourier transform of the sequence
x[n] = (0.5)n u[n]. Let y[n] denote a finite duration sequence of length 10;
i.e., y[n] = 0, n < 0, and y[n] = 0, n ≥ 10. The 10-point DFT of y[n] is
denoted by Y[k] and corresponds to 10 equally spaced samples of X(ejw);
i.e., Y[k] = X(ej2πk/10). Determine y[n].

Q6. (a) First five points of eight-point DFT X[k] are 5, 1 - j3, 0, 3 - j4, 3 + j4.
What are the last three points? ​
(b) Suppose an 8-point IDFT x[n] is known to be purely imaginary. The
first five points are same as part (a). What are the last three points?

Q7. The sequence x[n] is given by


x[n] = 2n, 0 ≤ 𝑛 ≤ 7
Determine the DFT of g[n], where g[n] is defined by
g[n] = x[n-2] + x[-n]

Q8. Let X[k] be the 8-point DFT of a real-valued sequence x[n] of length
N=8. A new sequence V[k] is formed by taking only the even-indexed
samples of X[k], such that:
V[k] = X[2k], k = 0, 1, 2, 3
Determine the 4-point IDFT v[n] in terms of the original sequence x[n].

You might also like