20 October 2003
WASPAA 2003 - New Paltz, NY
13
Uniformly-partitioned
O&S algorithm (3):
Industrial Engineering Dept.
University of Parma – Italy
•
Total
number of FFTs is minimized, in fact each block of input data needs to be FFT
transformed and IFFT antitransformed just once, after frequency-domain
summation.
•Latency
of the whole filtering processing is just L points instead of N. It means that the I/O delay
is kept to a low value, provided that the impulse response is partitioned in a
sensible number of chunks (8 – 32).