Title :
Fast Nth-order Hankel transform algorithm
Author_Institution :
Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA
fDate :
2/1/1991 12:00:00 AM
Abstract :
An Nth-order Hankel transform (also called Fourier-Bessel transform) algorithm designed for many analytically defined functions is presented. This algorithm is not restricted to order zero. As such, it provides greater generality than many others. The traditional difficulty in the evaluation of Hankel transforms, the presence of Bessel functions in the kernel of the integral transform, is eliminated in this new Hankel transform algorithm. The algorithm presented is composed of a fast (linear time) Nth-order Chebyshev transform followed by a fast Fourier transform
Keywords :
signal processing; transforms; Bessel functions; FFT; Fourier-Bessel transform; Nth-order Chebyshev transform; Nth-order Hankel transform algorithm; analytically defined functions; fast Fourier transform; integral transform; linear time; signal processing; Circuit stability; Filtering algorithms; IIR filters; Least squares approximation; Microwave theory and techniques; Minimization methods; Nonlinear equations; Resonance light scattering; Signal processing algorithms; Stability analysis;
Journal_Title :
Signal Processing, IEEE Transactions on
