Fast convolution for recursive digital filters

A physically motivated procedure is presented for evaluating the response of recursive digital filters via the fast Fourier transform (FFT). The key idea of the method is to employ a short string of artificial impulses as an alternative representation of the initial conditions implicit in processing a long excitation in segments. The method is computationally more efficient or of wider applicability than existing FFT techniques.