1977
DOI: 10.1109/proc.1977.10638
|View full text |Cite
|
Sign up to set email alerts
|

Fourier transformation of rotationally invariant two-variable functions: Computer implementation of Hankel transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1983
1983
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…where the z coordinate frequency is written within the paraxial approximation. This Bessel beam expansion from equation (5) is the reason why numerous articles have proposed different methods for evaluating numerically Hankel transforms of arbitrary order [16][17][18][19][20][21][22]. This Hankel transform formalism gives a complete description of radially symmetric wavefields, profiles given by equation (2), and even more importantly can be generalized to profiles that are not radially symmetric.…”
Section: Technical Preliminaries and Problem Definitionmentioning
confidence: 99%
See 2 more Smart Citations
“…where the z coordinate frequency is written within the paraxial approximation. This Bessel beam expansion from equation (5) is the reason why numerous articles have proposed different methods for evaluating numerically Hankel transforms of arbitrary order [16][17][18][19][20][21][22]. This Hankel transform formalism gives a complete description of radially symmetric wavefields, profiles given by equation (2), and even more importantly can be generalized to profiles that are not radially symmetric.…”
Section: Technical Preliminaries and Problem Definitionmentioning
confidence: 99%
“…The typical approach for solving these problems is first to write the input data via the modal decomposition from equation (7), and to subsequently apply a Hankel transform algorithm to each individual discrete u n n , m x y ¯( ) function, where there exist a variety of algorithms for this task [16][17][18][19][20][21][22]. This can be a lengthy process and by no means constitutes an optimal approach, since it involves two-dimensional projections and a thorough modal decomposition, which in turn is base-set dependent.…”
Section: Technical Preliminaries and Problem Definitionmentioning
confidence: 99%
See 1 more Smart Citation