please answer all the parts i got wrong Youre working as an

please answer all the parts i got wrong

You\'re working as an engineer, and are tasked with calculating the output of a FIR filter, h[n]. The length of the filter is L = 200, and the length of the input signal x[n] is N = 10.000. You decide that the most efficient way to compute the output (after some zero padding) is to take the DFT of h[n] take the DFT of x[n] multiply the DFTs together, and take the inverse DFT of the result. In order to have an identical output using the DFT method, and standard convolution, what is the minimum number of zeros you need to append to the end of x[n]? What is the total length of \'zero padded\' version of x[n]? How many zeros do you need to append to h[n]? Assume the following approximate computational counts are exactly true - directly convoluting the signal requires exactly 2LN computations. a length N DFT, or inverse DFT, requires N log N computations (where the log is base 2). multiplying two length N DFTs requires N operations. Calculate the number of operations required by direct convolution and by your DFT method. Is your DFT method faster? Select one: Yes, It\'s way faster. No, Direct convolution is faster. The method is of indeterminable period.

Solution

1) Take the DFT of x[n]

2) 100 zero padded versions

3) 7

4) 2

5) a