Professional Documents
Culture Documents
A method for the calculation of the fractional Fourier transform ~FRT! by means of the fast Fourier
transform ~FFT! algorithm is presented. The process involves mainly two FFTs in cascade; thus the
process has the same complexity as this algorithm. The method is valid for fractional orders varying
from 21 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are
discussed. 1996 Optical Society of America
Key words: Fractional Fourier transform, fast Fourier transform, Fresnel integral.
1. Introduction
7013
exp~ jkf !
jlf
1`
u~x! exp 2j
2`
2p
xx dx,
lf
(1)
um 5
um exp 2j
m52Ny2
2p
mm
,
N
(2)
LxLx 5 lfN,
(3)
proximate condition
z $ z1 ;
The Fresnel pattern u9~x9! at a distance z of a distribution u~x!, illuminated by a plane wave, is given by
convolution between the input signal and the freespace propagation kernel:
u9~x9! 5
exp~ jkz!
p 2
u~x9! p exp j
x9
jlz
lz
DG
(4)
S D
* F S DG S
exp~ jkz!
p
exp j x92
jlz
lz
3
1`
u~x! exp j
2`
p 2
x
lz
exp 2j
2p
xx9 dx.
lz
(5)
exp~ jkz!
lz
exp jp 2 m92
jlz
Lx
HF S
S
DJ
Ny221
p Lx
m2
lz N 2
um exp j
3 exp 2j
2p
mm9 .
N
m52Ny2
(6)
(7)
DG
Lx2
.
lN
exp~ jkz!
u~n!exp~2jplzn2!.
jlz
(8)
F SD G
S
D
2
2# 5 exp 2jplz
exp@2jplz~Dn!2m
5 exp 2jp
Dx
m
2
lz
lz 2
m
.
Lx2
(9)
7015
DFT, i.e.,
separately:
u0~a9! 5
exp@ j~2pyl!z#
u9m9 5
jlz
Ny221
m
52Ny2
HF (
Ny221
m52Ny2
um exp 2j
D S
DJ
DG
.
u62~a9! 5
Lx2
.
lN
(10)
(11)
up~a9! 5 Cp exp j
3
1`
2`
p
a92
tan@ p~py2!#
u~a! exp 2j
3 exp 2j
p
a2
tan@ p~py2!#
2p
aa9 da,
sin@ p~py2!#
(12)
(13)
1`
2`
2`
2p
mm
lz 2
2p
3 exp 2jp 2 m
exp j
m
m9
Lx
N
*
*
1`
(14)
respectively.
Two important properties can be deduced from expressions ~14!3:
* *
1`
2`
1`
u~a!exp~2j2pa9a!dx.
2`
(15)
*F
DG F
G S D
p
p
u~x!exp 2j x2 exp j
lf
lz
p 2
x9 dx.
lf
exp 2j
exp 2j
(16)
S DG
p
p 2
,
sin p m
N
2
S DG
p
p
tan p m2 .
N
4
S D G
p
p
tan p m92 .
N
4
U S DU
U S DU
sin p
p
2
, 1,
(17a)
tan p
p
4
, 1.
(17b)
F S DGY
p
2
4 1 ip
p
1 py4 ,
4
(18)
7017
Fig. 2. ~a! Input vector for the calculation of the FRT. ~b! Modulus of the FRT of the order 0.5 of the vector in ~a!, calculated
through direct integration. ~c! Same as ~b! but calculated through
HermiteGaussian functions. ~d! Same as ~b! but calculated
through the algorithm introduced in this paper.
The FFT has been used to obtain a numerical calculation of the FRT. The algorithm is based on the
performance of the FRT by the application of a lens,
free-space propagation, and a second lens. Freespace propagation is accomplished in the Fourier domain to avoid undesirable scaling. Two FFTs and
multiplication by three quadratic phase factors are
7018