Timeline for FFT calculation of an N-tap FIR filter
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2021 at 8:31 | comment | added | Marcus Müller | well if you want a cyclic convolution, your block diagram "explains itself": input FFT, filter FFT, multiplication, IFFT. For the acyclic, go and look for "segmented convolution", and especially "overlap-add" methods. | |
| Jan 28, 2021 at 4:08 | comment | added | Schach21 | I was thinking; I am still a little confused, because the problem is asking for the realization. What would that look like? Sorry for coming back, but I was thinking through, and it's not clear to me yet. | |
| Jan 18, 2021 at 23:35 | comment | added | Marcus Müller | (5) and (6): I meant: acyclic and cyclic, respectively, but I think you've got it. | |
| Jan 18, 2021 at 22:15 | vote | accept | Schach21 | ||
| Jan 18, 2021 at 22:15 | comment | added | Schach21 | (1) Convolution, (2) Discrete fourier transform, (3) Multiplication, (4) size/length, (5) finite, (6) infinite. Are my answers correct? Thanks for just not giving me the answer but adding this little puzzle! | |
| Jan 18, 2021 at 11:57 | history | answered | Marcus Müller | CC BY-SA 4.0 |