Revision as of 10:02, 16 October 2013 by Mboutin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


Homework 8, ECE438, Fall 2013, Prof. Boutin

Harcopy of your solution due in class, Friday October 25, 2013


Presentation Guidelines

  • Write only on one side of the paper.
  • Use a "clean" sheet of paper (e.g., not torn out of a spiral book).
  • Staple the pages together.
  • Include a cover page.
  • Do not let your dog play with your homework.

Questions 1

Draw the complete flow diagram for the "decimation by two" FFT algorithm to compute an 8 point DFT. How many complex operations does your algorithm take? How many operations would this DFT computation take if you were using the summation formula (i.e., the definition of the DFT) instead?

Questions 2



Discussion

Please discuss the homework below.

  • Comment/question here
    • answer here


Back to ECE438, Fall 2013, Prof. Boutin

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood