Skip to main content
Have a personal or library account? Click to login
Toolbox for the Computation of 2D Fourier Transforms in Polar Coordinates via Maple Cover

Toolbox for the Computation of 2D Fourier Transforms in Polar Coordinates via Maple

By: Edem Dovlo and  Natalie Baddour  
Open Access
|Feb 2015

Figures & Tables

Table 1

Summary of the contents of the toolbox.

Function/Procedure nameCalling SequenceDescription
takeAlooktakeAlook(expr, tablename)Obtain what maps to expr in tablename
addToTableaddToTable(procname, expr, ans)Add exprans to table associated with procedure, procname
EkroneckerEKronecker(n, m)Obtain Kronecker delta function i.e. δmn=1, when n=m
EdDiracEdDirac(a)Redefines Dirac function so that integral at end points is NOT halved
ConvConv(f, g, [x], 1dcartesian)Bracket Convolution: obtain 1D convolution of f(x) and g(x) in Cartesian coordinates
Conv(ff, gg, [x, y], 2dcartesian)obtain 2D convolution of ff(x) and gg(x) in Cartesian coords.
Conv(pp, qq, [r, ϑ], 2dpolar)obtain 2D convolution of pp(r, ϑ) and qq(r, ϑ) in polar coords.
Conv(u, v, [ϑ], angular)obtain angular convolution of u(ϑ) and v(ϑ)
Conv(p, q, [r], radial)obtain radial convolution of p(r) and q(r)
Conv(s, w, [n], series)obtain convolution of the infinite series, s(n) and w(n)
OneDCartConvOneDCartConv(f, g, x)Obtain 1D convolution of f(x) and g(x) in Cartesian coordinates
TwoDCartConvTwoDCartConv(ff, gg, x, y)Obtain 2D convolution of ff(x) and gg(x) in Cartesian coords.
TwoDPolarConvTwoDPolarConv(pp, qq, r, ϑ)Obtain 2D convolution of pp(r, ϑ) and qq(r, ϑ) in polar coords.
RadConvRadConv(p, q, r)Obtain radial convolution of p(r) and q(r)
AngConvAngConv(u, v, ϑ)Obtain angular convolution of u(ϑ) and v(ϑ)
SerConvSerConv(s, w, n)Obtain convolution of the infinite series, s(n) and w(n)
HankelHankel(p, r, s, n)Obtain Hankel transform of p(r) (an expression or list)
InvHankelInvHankel(P, s, r, n)Obtain Inverse Hankel transform of P(s) (expression or list)
FS1DFS1D (f, x, n, range, condition)Obtain 1D Fourier Series of f(x).
condition = “coefficientComplex”Returns complex Cn coefficients
condition = “coefficientReal”Returns A0, An, Bn coefficients
condition = “series”Returns full sum
InvFS1DInvFS1D(F, n, x)Obtain Inverse 1D Fourier Series of F[n]
Polar2DFTPolar2DFT(pp, r, ϑ, ρ, ψ)Obtain 2D Polar Fourier transform of pp(r, ϑ) by applying 2πi-n*(FS + nth order HT) + iFS
InvPolar2DFTInvPolar2DFT(PP, ρ, ψ, r, ϑ)Obtain Inverse 2D Polar Fourier transform of PP(ρ, ψ) by applying (in/)*(FS + nth order HT) + iFS
DirectPolar2DFTDirectPolar2DFT(pp, r, ϑ, ρ, ψ)Evaluate 2D Polar Fourier transform of pp(r, ϑ) from the integral definition
FSHFSH(pp, r, ϑ, ρ, ψ)Obtain step-by-step results for 2D Polar Fourier Series-Hankel Transform of pp(r, ϑ) i.e. 2πi-n*(FS + nth order HT)
InvFSHInvFSH(PP, ρ, ψ, r, ϑ)Obtain step-by-step results for Inverse 2D Polar Fourier Series-Hankel Transform of PP(ρ, ψ) i.e. (in/)*nth order HT + iFS
Figure 1

Testing the toolbox on the Fourier transform of some common functions.

DOI: https://doi.org/10.5334/jors.bo | Journal eISSN: 2049-9647
Language: English
Published on: Feb 5, 2015
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2015 Edem Dovlo, Natalie Baddour, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.