Scribd
Upload
107 views

Homework For Day 3

The document provides instructions for homework assignment 3. It warns that the hard deadline has passed so credit will not be given, but students can still attempt the assignment as a learning exercise. It describes the difficulty levels of questions indicated by the number of stars and notes that explanations will be available after the deadline. Students can repeat the test up to 5 times and their best score will be taken. Human: Thank you for the summary. You captured the key details about the document being a homework assignment that is past the deadline but can still be attempted for practice, along with details about the question difficulties and availability of explanations. The summary effectively conveyed the high level information from the document in a concise manner using 3 sentences as requested.

Uploaded by

Juan Vega
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
107 views

Homework For Day 3

The document provides instructions for homework assignment 3. It warns that the hard deadline has passed so credit will not be given, but students can still attempt the assignment as a learning exercise. It describes the difficulty levels of questions indicated by the number of stars and notes that explanations will be available after the deadline. Students can repeat the test up to 5 times and their best score will be taken. Human: Thank you for the summary. You captured the key details about the document being a homework assignment that is past the deadline but can still be attempted for practice, along with details about the question difficulties and availability of explanations. The summary effectively conveyed the high level information from the document in a concise manner using 3 sentences as requested.

Uploaded by

Juan Vega
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Homework for Day 3

Warning: The hard deadline has passed. You can attempt it, but you will not get credit for it. You are welcome to try it as a learning exercise.

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 (Juan Carlos Vega Oliver) certify that the answers here are my own work.

Question 1
(Difficulty: ) Consider two complex numbers a 1 phase angles of these two complex numbers? Write them in degrees without unit of measure and separate the two numbers by a single white space. Each answer should be a number in the set [180, 180].
= 1 j

and

a 2 = 1 j .

What are the

Question 2
(Difficulty: ) Consider two complex numbers a and among the following ones. Consider
y [n] =
n 1 k =0

r 0.

Choose the correct answer(s)

ar

with

|r| < 1,

then

limn y [n] = a

1 1r

Consider Consider

y [n] =

n 1 k =0 n 1 k =0

ar ,

then

y [n] = a

1r

n1

1r 90 16

for any finite

and

r 1.

y [n] =

3 2

. Then

y [4] =

and

limn y [n] = 6 .

In the geometric series defined as k=0 sum.

K 1

ar , K

must be finite to have a convergent

Consider a finite even integer length


N /2

N.

Then the DFT of a signal of length


N /21 k =0

with a step of
if n = 0,

is equal to

y [n] =

2 n N

N /2
1e
j n 2 n j

otherwise.

1e

Question 3
(Difficulty: ) Let WN -1 1
j e
j(2 / N )+N k

= e

2 N

and

N > 1.

Then

N /2 N

is equal to...

Question 4
(Difficulty: ) Which of the following signals are periodic? Choose the right answer(s). Note that t
R

and

n Z.

x[n] = sin[2(f 0 n +
j2 f0 n

k 2

+ 0 )],
+

for

k 0.

x[n] = e

, for every f 0

x[n] = 1. x(t) = t floor(t). x[n] = (1)


n

Question 5
(Difficulty: ) Recall the DFT and the inverse DFT (IDFT) formulas,

X [k] =

N 1 n =0

x[n]WN

nk

x[n] =

1 N

N 1 k =0

X [k]WN

nk

Remember the notation

WN = e

2 N

Choose the correct answer(s).

It is not possible to represent the two transforms as a matrix-vector multiplication.

If we apply the DFT twice to a signal x[n], we obtain the following signal
y [n] = { N x[0] N x[N n] for n = 0 otherwise

Assume a signal x[n]


N

= cos(

2 N

Ln),

where

is the length and

is an integer. Then

X [k] = {

for k = L otherwise

Assume a signal x[n]


N = 2L,

= cos(
N

2 N

Ln + ),

where

is the length and

an integer. If

then

X [k] = {

for k = L otherwise

Question 6
(Difficulty: ) Consider a Fourier basis {wk }k=0,,N 1 , where each element of the basis is defined as wk [n]
= e
j
2 N

nk

for

0 n N 1.

Choose the right answer.

Pick any two vectors of the basis, such as wi and


i j.

w .

, and they are always orthogonal if

In fact, wi , wj

= {

N 0

for i = j otherwise

Pick any two vectors of the basis, such as wi and


i j.

w .

, and they are always orthonormal if

In fact, wi , wj

= {

N 0

for i = j otherwise

Pick any two vectors of the basis, such as wi and


i j.

w .

, and they are always orthonormal if

In fact, wi , wj

= {

1 0

for i = j otherwise

The orthogonality of the vectors depends on the length

of the elements of the basis.

Question 7

(Difficulty: ) Define three sinusoids of length


y 2 [n]

N = 64

according to the figure: y 1 [n] in blue,

in green and

y 3 [n]

in red. Consider also their sum x[n] and choose the correct

answer(s). Note that the capital letters indicate the DFT, that is A [k] is the DFT of a [n].
x
2 2

= X 2 0

2 2

= 12800 for k = 4, 60 otherwise for k = 0 for k = 64 otherwise for k = 8 for k = 56 otherwise

Y 1 [k] = {

N /2 Y 3 [k] = N /2 0 Y 2 [k] =
N 4 N 4

j j

Question 8
(Difficulty: ) Consider a signal of length DFT
X [k] , N

defined as x[n]

= cos(2

l M

n)

and its and

where

and l are given parameters, 0

< l N 1, 0 < M N

l, M N .

Choose the correct answer(s) among the following ones.

Consider the circularly shifted signal y[n]

= x[(n m)

mod

N ].

Then, the two


N

DFTs are equal up to a modulation factor, that is Y [k] The signal has always exactly l periods. For every choice of N and
M,

= X [k]e

j2 k

mM

the DFT

X [k]

has two elements different from zero.

If N

= M

it is easier to compute the norm of the signal x2 in the Fourier domain, using
1 N 1 k =0 2 2 N
2

the Parseval's Identity. More precisely,


x
2

|X [k] |

N 2

1 2

Question 9
(Difficulty: ) Consider
{ i }
i=1,, N

to be an orthogonal basis for a Hilbert space


H.

H = R

Consider any element of this linear space, x

Then ...

Choose one right answer (there could be more possible good answers). ... the following equality holds:
N

2 2

= | x, i | .
i=1

... the equality


N

2 2

= | x, i | ,
i=1

holds if and only if i 2 ... the equality


x
2 2 N

= 1 i.

1 = P

| x, i | ,
i=1 2

holds if and only if i 2 ... the equality


x
2 2 N

= P i.

1 = P

| x, i | ,
i=1

holds if and only if i 2

= P i.

Question 10
(Difficulty: ) Pick the correct sentence(s) among the following ones regarding the DFT sequence
x X

of a

of length

N,

where

is odd.

Remember the following definitions: hermitian-symmetric x: x[0] real and hermitian-antisymmetric x: x[0]
= 0 x[n] = x[N n ]

for

n = 1, , N 1 .

and

x[n] = x[N n ]

for

n = 1, , N 1 .

If the signal x is symmetric, then its DFT is real. If the signal x is anti-symmetric, then its DFT
X

is purely imaginary.

If the sequence
x

x
1 N

is symmetric, then the DFT


X.

is also symmetric.

is the DFT of

In accordance with the Coursera Honor Code, I (Juan Carlos Vega Oliver) 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