Computational Speed Comparison between FFT Convolution and Recursive Filtering

  • Lee, Hyeong-Ho (Department of Electrical Science Korea Advanced Institute of Science)
  • 발행 : 1979.08.03

초록

Performances of three computational algorithms for one-dimensional frequency filtering are compared and tradeoffs are studied. If the size of the filter impulse response is small, it is well-known that the conventional convolution is superior than the FFT convolution. If the size of the impulse response is large, it was suggested that the recursive filter might be competitive in terms of speed to the FFT convolution. We, therefore, have developed an computational, algorithm for the recursive filter to compare the speed advantages over the FFT convolution and the results are presented.

키워드