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
 Fall '08
 MITRA
 Digital Signal Processing, Signal Processing, largest possible value, IDFT

Click to edit the document details