Scribd
Upload
5K views

Quiz - Digital Signal Processing PDF

This document provides instructions for a homework quiz due on November 2, 2013. It explains that there are 5 questions of varying difficulty, and students can take the quiz up to 5 times with their best score being counted. Answers and explanations will be available after the deadline. The document also contains 5 sample questions about topics like the discrete-time Fourier transform and properties of periodic sequences.

Uploaded by

RbKahn
Copyright
© Attribution Non-Commercial (BY-NC)
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
5K views

Quiz - Digital Signal Processing PDF

This document provides instructions for a homework quiz due on November 2, 2013. It explains that there are 5 questions of varying difficulty, and students can take the quiz up to 5 times with their best score being counted. Answers and explanations will be available after the deadline. The document also contains 5 sample questions about topics like the discrete-time Fourier transform and properties of periodic sequences.

Uploaded by

RbKahn
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 4

Homework for Day 4

The hard deadline for this quiz is Sat 2 Nov 2013 9:00 AM PDT (UTC -0700).

Help

Every question is rated with its difficulty, that is indicated with the number of stars. : Easy questions, there should be enough to get the 40% of the maximum grade. : Medium difficulty. : Hard questions The scores and the explanations for each questions will be available after the hard deadline. You can repeat the test 5 times, your best score will be considered. Questions with multiple possible correct answers may have also zero correct answers due to the randomization.

In accordance with the Coursera Honor Code, I (Arbaaz Khan) certify that the answers here are my own work.

Question 1
(Difficulty: ) Let
x[n] X (e
j

) X

be a DTFT transform-pair. Assume


j
d d

to be differentiable, compute the inverse DTFT of

X(e

).

Hint : use integration by parts

You should write your answer in term of x[n] and elementary functions and constants, for example
2

x[n]

would be written :

p i / 2 * x [ n ]

Question 2
(Difficulty: ) Which property of the DTFT allows you to compute easily the inverse DTFT of
d d

X(e

)/ 2 ?

Remember the result you obtained in the previous question.

Question 3
(Difficulty: ) A discrete sequence
x[n]
j

has for DTFT are:

X (e

).

The real and imaginary parts of X (e

By visual inspection of the plots, tick all the true statements about the sequence
x[n] x[n] x[n]

x[n]

is Hermitian-symmetric x[n] is real valued. is 0-mean, i.e. nZ

= x [n] .

x[n] = 0 .

Question 4
(Difficulty: ) Consider the following signal x[l] and its DFT defined as X [k]
=
L1 l=0

= {
2 L

1 0

0 l M 1 M l L 1

x[l]e

lk

Compute the mathematical expression for

X [k]

You can find here a short guide for answering quizzes requiring an equation as answer. In particular we underline that in the Coursera platform the symbol I (capital i) is used for the imaginary unit instead of j, that is the symbol used in class. Moreover, you can use both the exponential function
exp()

and the exponentiation of the Euler's number

(instead of the

classic e). Pi number is defined as pi. Apart from the usual mathematical constants and functions you should only use the (case-sensitive) variable names
kML

(do not forget to validate your syntax by clicking "Preview")

Preview

Help

Question 5
(Difficulty: ) Consider a finite-length discrete signal x[n] of length and its DFT
X [k] . ~ x[n] = x[n mod N ] N

(n

= 0, . . . , N 1 )

Consider its periodization

and with its DFS X [k].

Which of the following statements are true?


~ X [k + lN ] = X [k],

for all l

and

k = 0, . . . , N 1 .

~ X [2] = X [2]

(assume

N > 2)

~ X [l] = X [l mod N ],

for all l

In accordance with the Coursera Honor Code, I (Arbaaz Khan) certify that the answers here are my own work.

Submit Answers

Save Answers

You cannot submit your work until you agree to the Honor Code. Thanks!

You might also like