Escolar Documentos
Profissional Documentos
Cultura Documentos
F 0 = Id,
F 1 = F,
F 2 = P,
F 4 = Id
F 3 = F 1 = P F = F P.
The FrFT provides a family of linear transforms that further extends this denition to handle non-integer powers
n = 2/ of the FT.
However, it was not widely recognized in signal processing until it was independently reintroduced around 1993
by several groups.[4] Since then, there has been a surge of 2 Denition
interest in extending Shannons sampling theorem[5][6] for
signals which are band-limited in the Fractional Fourier For any real , the -angle fractional Fourier transform
domain.
of a function is denoted by F (u) and dened by
A completely dierent meaning for fractional Fourier
transform was introduced by Bailey and Swartztrauber[7]
as essentially another name for a z-transform, and in particular for the case that corresponds to a discrete Fourier
transform shifted by a fractional amount in frequency
space (multiplying the input by a linear chirp) and evaluating at a fractional set of frequency points (e.g. considering only a small portion of the spectrum). (Such transforms can be evaluated eciently by Bluesteins FFT algorithm.) This terminology has fallen out of use in most
of the technical literature, however, in preference to the
FRFT. The remainder of this article describes the FRFT.
Introduction
The FrFT argument u is neither a spatial one x nor a frequency . We will see why it can be interpreted as linear
The continuous Fourier transform F of a function : R
combination of both coordinates (x,). When we want to
C is a unitary operator of L2 that maps the function
distinguish the -angular fractional domain, we will let
to its frequential version :
xa denote the argument of F .
2ix
Remark: with the angular frequency convention inf() = f (x) e
dx , for every real
stead of the frequency one, the FrFT formula is the
number .
Mehler kernel,
And is determined by via the inverse transform F 1
2.1
Properties
DEFINITION
Time Reversal.
F [f (u)] = f (u)
Transform of a shifted function
F+ = F F = F F .
Linearity.
[
k
]
bk fk (u) =
bk F [fk (u)]
k
F = F k = F k = (F)k
2
= (F)
F4 = F0 = I
Fi = Fj
ij
mod 4
Inverse.
Then,
(
(
))
(
)
1 cos2
sin
F M (M ) = Q cot
M
F
cos2
M sin
(
(
)
]
[
2
(
)
1
1 j cot ju2 cot 1cos
Mu
2
u
2
cos
F |M | f M =
e
fa
1 jM 2 cot
sin
(F )1 = F
Commutativity.
F1 F2 = F2 F1
Associativity
(F1 F2 ) F3 = F1 (F2 F3 )
Parseval.
f (u)g(u)du =
f (u)g (u)du
F f (u) =
(
)
Fourier
transform
2
2
(u + x)
if + is a multiple of 2,
The usual interpretation of the Fourier transform is as a
(the square root is dened such that the argument of result
lies in the interval [/2, /2] ).
Here again the special cases are consistent with the limit
behavior when approaches a multiple of .
The FrFT has the same properties as its kernels :
symmetry: K (u, u ) = K (u , u)
inverse: K1 (u, u ) = K (u, u ) = K (u , u)
additivity:
K+ (u, u )
K (u, u )K (u , u ) du .
2.3
Related transforms
There also exist related fractional generalizations of similar transforms such as the discrete Fourier transform.
The discrete fractional Fourier transform is dened
by Zeev Zalevsky in (Candan, Kutay & Ozaktas 2000)
and (Ozaktas, Zalevsky & Kutay 2001, Chapter 6).
Fractional wavelet transform (FRWT):[8] A generalization of the classical wavelet transform (WT) in the fractional Fourier transform (FRFT) domains. The FRWT
is proposed in order to rectify the limitations of the WT
and the FRFT. This transform not only inherits the advantages of multiresolution analysis of the WT, but also has
the capability of signal representations in the fractional
domain which is similar to the FRFT. Compared with the
existing FRWT, the FRWT (dened by Shi, Zhang, and
Liu 2012) can oer signal representations in the timefractional-frequency plane.
A rect function turns into a sinc function as the order of the Fractional Fourier Transform becomes 1.
2.4
Generalization
The Fourier transform is essentially bosonic; it works because it is consistent with the superposition principle and
related interference patterns. There is also a fermionic
Fourier transform.[9] These have been generalized into
a supersymmetric FRFT, and a supersymmetric Radon
transform.[9] There is also a fractional Radon transform, a
symplectic FRFT, and a symplectic wavelet transform.[10]
Because quantum circuits are based on unitary operations, they are useful for computing integral transforms
as the latter are unitary operators on a function space. A Fractional Fourier transform
quantum circuit has been designed which implements the
Actually, fractional Fourier transform is a rotation operaFRFT.[11]
tion on the time frequency distribution. From the denition above, for = 0, there will be no change after applying fractional Fourier transform, and for = /2, fractional Fourier transform becomes a Fourier transform,
which rotates the time frequency distribution with /2.
For other value of , fractional Fourier transform rotates
the time frequency distribution according to . The following gure shows the results of the fractional Fourier
transform with dierent values of .
REFERENCES
5 See also
Mehler kernel
Other time-frequency transforms:
Linear canonical transformation
short-time Fourier transform
wavelet transform
chirplet transform
Application
Fractional Fourier transform can be used in time frequency analysis and DSP.[12] It is useful to lter noise, but
with the condition that it does not overlap with the desired
signal in the time frequency domain. Consider the following example. We cannot apply a lter directly to eliminate
the noise, but with the help of the fractional Fourier transform, we can rotate the signal (including the desired signal and noise) rst. We then apply a specic lter which
will allow only the desired signal to pass. Thus the noise
will be removed completely. Then we use the fractional
Fourier transform again to rotate the signal back and we
can get the desired signal.
Fractional Fourier transforms are also used to design optical systems and optimize holographic storage
eciency.[13]
6 References
[1] E. U. Condon, Immersion of the Fourier transform in
a continuous group of functional transformations, Proc.
Nat. Acad. Sci. USA 23, (1937) 158164. online
[2] V. Namias, The fractional order Fourier transform and its
application to quantum mechanics, J. Inst. Appl. Math.
25, 241265 (1980).
[3] N. Wiener, Hermitian Polynomials and Fourier Analysis, J. Mathematics and Physics 8 (1929) 70-73.
[4] Lus B. Almeida, The fractional Fourier transform and
time-frequency representations, IEEE Trans. Sig. Processing 42 (11), 30843091 (1994).
[5] Ran Tao, Bing Deng, Wei-Qiang Zhang and Yue Wang,
Sampling and sampling rate conversion of band limited signals in the fractional Fourier transform domain,
IEEE Transactions on Signal Processing, 56 (1), 158171
(2008).
[6] A. Bhandari and P. Marziliano, Sampling and reconstruction of sparse signals in fractional Fourier domain,
IEEE Signal Processing Letters, 17 (3), 221224 (2010).
[7] D. H. Bailey and P. N. Swarztrauber, The fractional
Fourier transform and applications, SIAM Review 33,
389-404 (1991). (Note that this article refers to the chirpz transform variant, not the FRFT.)
[8] J. Shi, N.-T. Zhang, and X.-P. Liu, A novel fractional wavelet transform and its applications, Sci. China
Inf.
Sci.
vol.
55, no.
6, pp.
1270-1279,
June 2012. URL: http://www.springerlink.com/content/
q01np2848m388647/
External links
DiscreteTFDs -- software for computing the fractional Fourier transform and time-frequency distributions
"Fractional Fourier Transform" by Enrique Zeleny,
The Wolfram Demonstrations Project.
Dr YangQuan Chens FRFT (Fractional Fourier
Transform) Webpages
LTFAT - A free (GPL) Matlab / Octave toolbox
Contains several version of the fractional Fourier
transform.
Bibliography
Ozaktas, Haldun M.; Zalevsky, Zeev; Kutay, M.
Alper (2001), The Fractional Fourier Transform
with Applications in Optics and Signal Processing,
Series in Pure and Applied Optics, John Wiley &
Sons, ISBN 0-471-96346-1
Candan, C.; Kutay, M.A.; Ozaktas, H.M. (May
2000), The discrete fractional Fourier transform,
IEEE Transactions on Signal Processing 48 (5):
13291337, doi:10.1109/78.839980
A. W. Lohmann, Image rotation, Wigner rotation
and the fractional Fourier transform, J. Opt. Soc.
Am. A 10, 21812186 (1993).
Soo-Chang Pei and Jian-Jiun Ding, Relations between fractional operations and time-frequency distributions, and their applications, IEEE Trans. Sig.
Processing 49 (8), 16381655 (2001).
9.1
Text
9.2
Images
9.3
Content license