HW_11(483)S09

HW_11(483)S09 - X [ k ] any of the N DFT samples is N ....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
1 EE 483 – Digital Signal Processing Spring 2009 Homework #11 – Due Wednesday, April 8, 2009 by 4:30 p.m. 11.1 Problem 11.3 of Text, Page 654. Show all steps. 11.2 Problem 11.11 of Text, Page 656. Show all steps. 11.3 Consider a length- N sequence x [ n ] satisfying x [ n ] ± 1 for all 0 ± n ± N ² 1, with X [ k ] denoting its N -point DFT. Show that the largest possible value of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: X [ k ] any of the N DFT samples is N . Find all sequences x[n] for which X [ k ] = N for some k . 11.4 . Problem 11.21 of Text, Page 657. Show all steps. 11.5 Problem 11.22 of Text, Page 657. Show all steps. 11.6 Problem 11.27 of Text, Page 657. Write a MATLAB program implementing the IDFT algorithm 11.7 Problem M11.4 of Text, Page 663....
View Full Document

This note was uploaded on 02/02/2010 for the course EE 483 taught by Professor Mitra during the Fall '08 term at USC.

Ask a homework question - tutors are online