<< Chapter < Page | Chapter >> Page > |
Let , where , .
We wish to compute
samples,
of
Note that , So
Thus, can be compared by
1. and
3. require
and
operations respectively.
2. can be performed efficiently
using fast convolution.
is required only for , so this linear convolution can be implemented with FFTs.
Also useful for "zoom-FFTs".
Notification Switch
Would you like to follow the 'Digital signal processing: a user's guide' conversation and receive update notifications?