Abstract

The Hankel transform may be defined as the two-dimensional Fourier transform of a circularly symmetric function. A new Hankel-transform algorithm based on this definition is described. The proposed algorithm efficiently generates a rectangularly sampled two-dimensional output array by using the circular symmetry properties of the input array and two-dimensional vector radix fast-Fourier transform techniques. It accomplishes this by partitioning the input matrix into smaller and smaller processing blocks while removing redundant blocks from data manipulations. For applications that require the output data to be sampled on a two-dimensional rectangular raster, the convenience and the computational speed of the resulting algorithm offer advantages over the one-dimensional Hankel-transform algorithms currently available.

© 1983 Optical Society of America

Nonuniform fast Hankel transform (NUFHT) algorithm

Qing Huo Liu and Zhong Qing Zhang
Appl. Opt. 38(32) 6705-6708 (1999)

Fast Hankel transform of nth order

José A. Ferrari, Daniel Perciante, and Alfredo Dubra
J. Opt. Soc. Am. A 16(10) 2581-2582 (1999)

Fast Hankel transform of order zero

José A. Ferrari
J. Opt. Soc. Am. A 12(8) 1812-1813 (1995)

Quasi-discrete Hankel transform

Li Yu, Meichun Huang, Mouzhi Chen, Wenzhong Chen, Wenda Huang, and Zhizhong Zhu
Opt. Lett. 23(6) 409-411 (1998)

Zero-order Hankel transformation algorithms based on Filon quadrature philosophy for diffraction optics and beam propagation

Richard Barakat, Elaine Parshall, and Barbara H. Sandler
J. Opt. Soc. Am. A 15(3) 652-659 (1998)