HWIX - ECE 3250 HOMEWORK ASSIGNMENT IX Fall 2009 1. Let x1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 3250 HOMEWORK ASSIGNMENT IX Fall 2009 1. Let x 1 be a 1024-point signal and x 2 be a 1025-point signal. Note that x 1 * x 2 is a 2048-point signal. (a) Show that it takes a worst-case 512 . 5 × 2 11 multiplications to compute x 1 * x 2 directly. (Suggestion: it takes one multiplication to compute x 1 * x 2 (0), two multiplications to compute x 1 * x 2 (1), etc. You may use the fact that P n k =1 k = n ( n + 1) / 2.) (b) Suppose you use N -point DFTs to compute x 1 * x 2 . First of all, what is N ? Second, assuming you use the standard decimation-in-time FFT to compute the DFTs, find how many multiplications it takes to compute x 1 * x 1 . You may assume that it takes the same number of multiplications to compute an inverse DFT as it takes to compute a DFT when you use the FFT. 2. Find the z -transform (formula for X ( z ) along with (ROC) X ), if the transform exists, for each signal x specified below. If the transform fails to exist, explain why. (a)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/26/2010 for the course ECE 3250 at Cornell University (Engineering School).

Page1 / 2

HWIX - ECE 3250 HOMEWORK ASSIGNMENT IX Fall 2009 1. Let x1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online