Fast algorithm for FIR filtering in the transform domain
A more efficient algorithm than the overlap-and-add (or overlap-and-save) method is developed for quickly computing the convolution involving very long impulse response. By dividing the input and the impulse response into segments of proper length, the algorithm requires fewer multiplications than the existing methods and therefore reduces the complexity of the filtering process.