Computation of quasi-discrete Hankel transforms of integer order for propagating optical wave fields.

The method originally proposed by Yu et al. [Opt. Lett. 23, 409 (1998)] for evaluating the zero-order Hankel transform is generalized to high-order Hankel transforms. Since the method preserves the discrete form of the Parseval theorem, it is particularly suitable for field propagation. A general algorithm for propagating an input field through axially symmetric systems using the generalized method is given. The advantages and the disadvantages of the method with respect to other typical methods are discussed.

[1]  Bruce W. Suter,et al.  Fast Nth-order Hankel transform algorithm , 1991, IEEE Trans. Signal Process..

[2]  A. Oppenheim,et al.  Computation of the Hankel transform using projections , 1980 .

[3]  William E. Higgins,et al.  An algorithm for computing general integer-order Hankel transforms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[4]  Robert A. Hedges,et al.  Understanding fast Hankel transforms , 2001 .

[5]  D. Mook,et al.  An algorithm for the numerical evaluation of the Hankel and Abel transforms , 1983 .

[6]  Richard Barakat,et al.  Zero-order Hankel transformation algorithms based on Filon quadrature philosophy for diffraction optics and beam propagation , 1998 .

[7]  José A. Ferrari.  Fast Hankel transform of order zero , 1995 .

[8]  Neal C. Gallagher,et al.  Fast algorithm for the computation of zero-order Hankel transform (A) , 1981 .

[9]  S. Candel,et al.  Dual algorithms for fast calculation of the Fourier-Bessel transform , 1981 .

[10]  Nico M. Temme,et al.  An algorithm with ALGOL 60 program for the computation of the zeros of ordinary bessel functions and those of their derivatives , 1979 .

[11]  G. Arfken.  Mathematical Methods for Physicists , 1967 .

[12]  Sandro De Silvestri,et al.  High-accuracy fast Hankel transform for optical beam propagation , 1992 .

[13]  Alejandro L. Garcia.  Numerical methods for physics , 1994 .

[14]  Alfredo Dubra,et al.  Fast Hankel transform of nth order , 1999 .

[15]  Z. Zhu,et al.  Quasi-discrete Hankel transform. , 1998, Optics letters.

[16]  José-Angel Conchello,et al.  Numerical evaluation of Hankel transforms for oscillating functions. , 2003, Journal of the Optical Society of America. A, Optics, image science, and vision.

[17]  A. Siegman.  Quasi fast Hankel transform. , 1977, Optics letters.

[18]  E. Hansen.  Correction to "Fast Hankel transform algorithm" , 1986 .

[19]  Luc Knockaert,et al.  Fast Hankel transform by fast sine and cosine transforms: the Mellin connection , 2000, IEEE Trans. Signal Process..

[20]  Antoniangelo Agnesi,et al.  Numerical evaluation of the Hankel transform: remarks , 1993 .

[21]  Eric W. Hansen,et al.  Fast Hankel transform algorithm , 1985, IEEE Trans. Acoust. Speech Signal Process..

[22]  E. Cavanagh,et al.  Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions , 1979 .

[23]  Julio C. Gutiérrez-Vega,et al.  Focusing evolution of generalized propagation invariant optical fields , 2003 .

[24]  G P Agrawal,et al.  End correction in the quasi-fast Hankel transform for optical propagation problems. , 1981, Optics letters.

[25]  A. Oppenheim,et al.  An algorithm for the numerical evaluation of the Hankel transform , 1978, Proceedings of the IEEE.

[26]  J. Goodman.  Introduction to Fourier optics , 1969 .