Abstract: | An efficient algorithm is presented to compute the Hankel transform. The algorithm yields simultaneously all the required weights for a given order of the Bessel function using the fast Fourier transform. An additional shift is introduced to the filter abscissa besides Koefoed's shift to give a better filter performance. |