Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
40 views2 pages

Ps 7

This document is a problem set for the Signals and Systems course (EC244AI) taught by Subrahmanya K N. It includes various tasks related to the Discrete Fourier Transform (DFT) such as computing DFTs for given sequences, finding inverse DFTs, and analyzing specific properties of sequences. The problems cover a range of topics including magnitude and phase representation, point DFT calculations, and transformations of sequences.

Uploaded by

Subrahmanya K N
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
0% found this document useful (0 votes)
40 views2 pages

Ps 7

This document is a problem set for the Signals and Systems course (EC244AI) taught by Subrahmanya K N. It includes various tasks related to the Discrete Fourier Transform (DFT) such as computing DFTs for given sequences, finding inverse DFTs, and analyzing specific properties of sequences. The problems cover a range of topics including magnitude and phase representation, point DFT calculations, and transformations of sequences.

Uploaded by

Subrahmanya K N
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
You are on page 1/ 2

Problem set - 7

Course: Signals and Systems (EC244AI)


Course Instructor: Subrahmanya K N

1. Find DFT of the sequence x[n] = {1, 2, 3, 1}. Plot its magnitude and phase representation.

2. Compute 8-point DFT for the following sequences:

(a) x1 [n] = {1, 2, 3, 4, 5, 6}


(b) x2 [n] = {1, 1, 1, 1, 1, 1, 0, 0}

3. For a sequence x[n] = u[n] − u[n − 5], find (i) 5-point DFT (ii) 10-point DFT.

4. Find the N-point DFT of the following sequences x[n]:

(a) x[n] = δ[n] (b) x[n] = δ[n − n0 ]


(c) x[n] = an u[n] (d) x[n] = an u[n − 5]
(e) x[n] = u[n] − u[n − N ] (f) x[n] = ej2(π/N )k0 n , 0 ≤ n ≤ N − 1

(g) x[n] = 1, for n even & 0 otherwise (h) x[n] = cos[Ω0 n], Ω0 = k0 , 0 ≤ n ≤ N − 1
N
2π 2πn
(i) x[n] = sin[Ω0 n], Ω0 = k0 , 0 ≤ n ≤ N − 1 (j) x[n] = 4 + cos2
N N

5. For N = 5, compute the DFT of x1 [n] = {1, 1, 1, 0, 0} and compare the result with the DFT of
x2 [n] = {1, 1, 1} for N = 3.

6. Compute the inverse DFT of the sequences:

(a) X[k] = δ[k]



(b) X[k] = cos k, 8 point IDFT
8
1 4π 6π
(c) X[k] = + cos k + cos k, 8 point IDFT
2 8 8
(d) X[k] = {2, 1 + j, 0, 1 − j}
(e) X[k] = {5, 4 + j, 1, 4 − j}
1
7. Show that x[n] = IDFT{X[k]} = [DFT{X ∗ [k]}]∗ , where ’*’ denotes the complex conjugate.
N
(a) Find the DFT X[k] of x[n] = {0, 1, 2, 3}.
(b) Find the IDFT x[n] from X[k] otained in part (a).

8. If a sequence is defined as x[n] = 4, 5, 6, 2, then determine:

(a) x((−n))6 (b) x((n − 2))6 (c) x((n + 2))6 (d) x((−n + 2))6

9. The first five points of the eight-point DFT of a real-valued sequence are {0.25, 0.125−j0.3018, 0, 0.125−
j0.0518, 0}. Determine the remaining three points.

1
10. Given the eight-point DFf of the sequence
(
1, 0 ≤ n ≤ 3
x[n] =
0, 4 ≤ n ≤ 7

Compute the DFT of the sequences

(a) 
1, n = 0

x1 [n] = 0, 1 ≤ n ≤ 4

1, 5 ≤ n ≤ 7

(b) 
0, n = 0

x2 [n] = 1, 2 ≤ n ≤ 5

0, 6 ≤ n ≤ 7

11. Compute DFT of following sequences:

(a) δ((n − 5))8


(b) δ((n + 2))4
(c) e−j2πn/8
(d) ej2πn/4
(e) 8-point DFT of e−j2πn/4

You might also like