Answers are grounded in this paper and cite their sources.
Algorithm computes Hankel transform using fast Fourier transform, enhancing filter performance.
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.
No takes yet. Share an insight, caveat, or question.
Mohsen et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: