100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
CS 370 Winter : Assignment 3 with correct answers £3.64   Add to cart

Exam (elaborations)

CS 370 Winter : Assignment 3 with correct answers

 15 views  0 purchase

CS 370 Winter 2018: Assignment 3 Due March 15, 5 pm. Instructor: G. Labahn Office: DC3629 e-mail: Lectures: MWF 8:30, 11:30 Office Hours: Tues 11:00-12:00 Instructor: Y. Li Office: DC3623 e-mail: Lectures: MWF 1:30 Office Hours: Thurs 2:00-3:00 Web Site: cs370 piazza Your assignment should...

[Show more]

Preview 1 out of 4  pages

  • January 16, 2023
  • 4
  • 2022/2023
  • Exam (elaborations)
  • Questions & answers
All documents for this subject (1)
avatar-seller
Abbyy01
CS 370 Winter 2018: Assignment 3
Due March 15, 5 pm.
Instructor: G. Labahn Office: DC3629 e-mail: glabahn@uwaterloo.ca
Lectures: MWF 8:30, 11:30 Office Hours: Tues 11:00-12:00

Instructor: Y. Li Office: DC3623 e-mail: yuying@uwaterloo.ca
Lectures: MWF 1:30 Office Hours: Thurs 2:00-3:00


Web Site: cs370 piazza

Your assignment should be handed in electronically on UW Learn. The submission
should include one pdf file containing the assignment answers and the cover sheet and
all the m-files required to run the code, with no folder structure (not zipped).


Analytic Questions

1. (10 marks)

(a) Calculate by hand the discrete Fourier transform of f = (1, 2, 3, 2).
(b) Calculate by hand the inverse discrete Fourier transform of F = (4, −1, 0, −1).

2. (15 marks)
Let {F0 , . . . , FN −1 } be the DFT of a sequence {f0 , . . . , fN −1 } defined by
−1
1 NX
Fk = fn W −nk
N n=0
2πi
with W = e N the N th root of unity. Show your work and simplify where possible.

(a) Give a formula for Fk for all k when fn = (−1)n for n = 0, ..., N − 1.

(b) Suppose (f0 , . . . , fN −1 ) = (−1, . . . , −1, 1, . . . , 1) having the first half negative one and
remaining half one (with N even). Show that F2k = 0, k = 0, 1, . . . , N2 −1.

3. ( 20 marks)
Consider the sequence of eight numbers f = ( 1, 0, 2, 0, −1, 0, −2, 0 ).

(a) What are the two arrays (g and h, each of length 4) that are used in computing the
DFT of f by the FFT method?

(b) Compute G and H, the two DFTs for {gi } and {hi }, respectively, using the definition
of DFT of 4 values. Simplify if possible.

(c) Using G and H from part b), write out the DFT of the array f .

(d) Using the FFT butterfly algorithm, compute by hand the DFT of f .

1

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Abbyy01. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £3.64. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

62890 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£3.64
  • (0)
  Add to cart