Question

26518299-351873.jpeg

Can someone help me solve 2b. I solved it an got 1,580,032 complex multiples. I want to check if i did it correctly.

Image transcriptions

2. Filtering Long Sequences: (20 Pis) We obtain 6.8 seconds of a real sampled speech signal that was sampled at a sampling rate of 8000 samples per second. We wish to use the overlap-save filtering procedure with an FIR digital filter with 120 real coolllcients. (a) Determine the total number of complex multiplications required to filter the in- put sequence using an FFT algorithm directly without using the overlap-save procedure. The FFT size must be a power of 2 and it should be large enough to accommodate linear convolution of the two sequences. Assume that the FFT is for real data such that the number of complex multiplications for a single FFT and inverse PFT is C= 2 log. (N) (1) where N is the number of samples in the sequence. (b) Determine the total number of complex multiplications required to fillup the se- quence using the overlap-save procedure and a block size of 1024 samples.

This question was created from Exam1_2012.pdf

2. Filtering Long Sequences: (20 Pis) We obtain 6.8 seconds of a real sampled speech signal that was sampled at a sampling rate of 8000 samples per...
Get unstuck

365,837 students got unstuck by Course
Hero in the last week

step by step solutions

Our Expert Tutors provide step by step solutions to help you excel in your courses