This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Time FFT Algorithm, what is the corresponding computation load in total? Circular convolution Q3. yL[n] and yC[n] denote the linear convolution and 3‐point‐circular convolution of g[n] and h[n] respectively. (a). Given {g[n]}={3, ‐5, 2} and {h[n]}={‐2, 4, 7} for 0≤n≤2, determine the circular convolution output yc[0]. (b). Determine the linear convolution outputs yL[0] and yL[3]. (c). Develop a method to determine yc[0] in terms of yL[n]. (Hint: see lecture notes, Ch.3.2 P.28). (d). Apply your method stated in (c) and verify it with the result of (a). (e). Develop a method to find yL[n] by use of DFT and IDFT. Put down the steps one by one clearly. If we want to use the Decimation‐by‐Time FFT/IFFT to simply the computation, how many butterflies do we need for each FFT operation? (Hint: see lecture notes, Ch.3.3 P.19). P1/2 z‐transform Q4. Let x[n] be a DT signal sampled from the CT signal x(t) with proper sampling frequency. (a). Let y[n] = x[n] –x[n‐1] be the output of a DT system t...
View
Full
Document
This note was uploaded on 02/13/2013 for the course ELEC 3100 taught by Professor Song during the Spring '13 term at Huazhong University of Science & Tech.
 Spring '13
 SONG

Click to edit the document details