Implementing Fractional Fourier Transforms and Linear Canonical Transforms

Presenter:
Hong Wen-Chih

2014/1/4 1
Outline
Introduction
Definition of fractional fourier transform
Linear canonical transform
Implementation of FRFT/LCT
The Direct Computation
DFT-like Method
Chirp Convolution Method
Discrete fractional fourier transform
Conclusion and future work

2014/1/4 2
Introduction
Definition of fourier transform:

Definition of inverse fourier transform:

( ) ( )
1
2
j wt
F e f t dt e
t

=
}
( ) ( )
1
2
j wt
f t e F dt e
t

=
}
2014/1/4 3
Introduction
In time-frequency representation

Fourier transform: rotation /2+2k
Inverse fourier transform: rotation -/2+2k
Parity operator: rotation +2k
Identity operator: rotation 2k

And what if angle is not multiple of /2 ?
2014/1/4 4
Introduction
o
o
t
e
v
u
( , ) u v
( , ) t w
Time-frequency plane and a set of coordinates
rotated by angle relative to the original coordinates
.
2014/1/4 5
Fractional Fourier Transform
Generalization of FT
use to represent FRFT
The properties of FRFT:
Zero rotation:
Consistency with Fourier transform:
Additivity of rotations:
2 rotation:

Note: do four times FT will equal to do nothing

0
F I =
/2
F F
t
=
F F F
o | o | +
=
2
F I
t
=
F
o
2014/1/4 6
Fractional Fourier Transform
Definition:

Note: when is multiple of , FRFTs degenerate
into parity and identity operator

( ) ( ) ( , ) F u x t K t u dt
o o
=
}
2 2
cot cot
csc
2 2
1 cot
( )
2
u t
j j
jut
j
e x t e e dt
o o
o
o
t

=
}
2014/1/4 7
Linear Canonical Transform
Generalization of FRFT
Definition:

when b0

when b=0
a constraint: must be satisfied.

2 2
2 2
( , , , )
1
( ) ( )
2
jd j ja
u ut t
b b b
a b c d
F u e e e f t dt
j b t

=
}
2
2
( ,0, , )
( ) ( )
j
cd u
a c d
F u d e f du
=
1 ad bc =
2014/1/4 8
Additivity property:

where

Reversibility property:

where
( ) ( ) | | ( ) ( ) t f O t f O O
h g f e
F
d c b a
F
d c b a
F
) , , , ( ) , , , ( ) , , , (
1 1 1 1 2 2 2 2
=
2 2 1 1
2 2 1 1
a b a b e f
c d c d g h
| | | | | |
=
| | |
\ . \ . \ .
( ) ( ) ( ) ( ) t f t f O O
d c b a
F
a c b d
F
=
) , , , ( ) , , , (
d b a b
I
c a c d
| | | |
=
| |
\ . \ .
2014/1/4 9
Special cases of LCT:
{a, b, c, d} = {0, 1, 1, 0}:
{a, b, c, d} = {0, 1, 1, 0}:
{a, b, c, d} = {coso, sino, sino, coso}:

{a, b, c, d} = {1, z/2t, 0, 1}: LCT becomes the 1-D Fresnel
transform
{a, b, c, d} = {1, 0, t, 1} : LCT becomes the chirp multiplication
operation
{a, b, c, d} = {o, 0, 0, o
1
}: LCT becomes the scaling operation.

( ) ( ) ) ( ) (
) 0 , 1 , 1 , 0 (
t f FT j t f O
F
=
( ) ( ) ) ( ) (
) 0 , 1 , 1 , 0 (
e e F IFT j F O
F
=
( ) ( ) ( ) ( ) ( ) t f O e t f O
F
j
F
o o o o o o
2 / 1
) cos , sin , sin , (cos
=
2014/1/4 10
Conventional Fourier transform
Clear physical meaning
fast algorithm (FFT)
Complexity : (N/2)log
2
N
LCT and FRFT
DFT-like Method

2014/1/4 11
directly sample input and output

( ) ( )
2 2
2 2
( , , , )
1
2
u d ut t a
j j j
b b b
a b c d
Y u e e e x t dt
j b t

=
}
( ) ( )
2 2 2 2
2
1
2 2
( , , , )
1
2
u u t t
m d mn n a
n
j j j
b b b
a b c d u t t
n n
Y m e e e x n
j b t
A A A A
=
A = A A
t A u A
2014/1/4 12
Easy to design
No constraint expect for
Drawbacks
lose many of the important properties
not be unitary
no additivity
Not be reversible
lack of closed form properties
applications are very limited

1 ad bc =
2014/1/4 13
Sample input and output as and

t
pA
u
qA
2 2
2 2
( , , , )
1
( ) ( )
2
jd j ja
u ut t
b b b
a b c d
F u e e e f t dt
j b t

=
}
2 2 2 2
2 2
( , , , )
1
( ) ( )
2
u u t t
j d j j a
M
q p q p
b b b
a b c d u t
p M
F q e e e f p
j b t
A A A A
=
A = A
( )
( )
( )
( )
=
A
A A A
A = A
M
M p
t
p
b
a j
p q
b
j
q
b
d j
u d c b a
p f
b j
q F
t t u u
e e e
2 2 2 2 2
1
2
1
2
, , ,
2
1
t
2014/1/4 14
implement by
2 chirp multiplications
1 chirp convolution
complexity
2P (required for 2 chirp multiplications) + Plog
2
P (required
for 2 DFTs)
~ Plog
2
P (P = 2M+1 = the number of sampling points)

Note: 1 chirp convolution needs to 2DFTs
2014/1/4 15
DFT-like Method

constraint on the product of A
t
and A
u

(chirp multi.) (FT) (scaling) (chirp multi.)

P
u t
/ 2t = A A
(
=
(
1 /
0 1
0
0 / 1
0 1
1 0
1 /
0 1
b a b
b
b d d c
b a
2014/1/4 16
DFT-like Method
Chirp multiplication:

Scaling:

Fourier transform:

Chirp multiplication:
( ) ( ) ( ) t f b jat t f = 2 / exp
2
1
( ) ( ) ( )
2
2
2 1
ab
j t
f t f b b t e b t b f = =
( ) ( ) dt t f e u F
t u j
j
=
}

2 3
2
1
t
( ) ( ) ( ) u F b jdu u F
3
2
4
2 / exp =
2014/1/4 17
DFT-like Method
For 3
rd
step

Sample the input t and output u as pA
t
and qA
u

P
u t
/ 2t = A A
( ) ( ) dt t f e u F
t u j
j
=
}

2 3
2
1
t
2014/1/4 18
DFT-like Method

Complexity
2 M-points multiplication operations
1 DFT
2P (two multiplication operations) + (P/2)log
2
P (one DFT) ~
(P/2)log
2
P

2014/1/4 19
Compare
Complexity
Chirp convolution method: Plog
2
P (2-DFT)
DFT-like Method: (P/2)log
2
P (1-DFT)
DFT: (P/2)log
2
P (1-DFT)
trade-off:
chirp. Method: sampling interval is FREE to choice

DFT-like method: some constraint for the sampling
intervals

P
u t
/ 2t = A A
2014/1/4 20
Direct form of DFRFT
Improved sampling type DFRFT
Linear combination type DFRFT
Eigenvectors decomposition type DFRFT
Group theory type DFRFT
Impulse train type DFRFT
Closed form DFRFT

2014/1/4 21


Direct form of DFRFT
simplest way
sampling the continuous FRFT and computing it
directly
2014/1/4 22
Improved sampling type DFRFT
By Ozaktas, Arikan
Sample the continuous FRFT properly
Similar to the continuous case
Fast algorithm

Kernel will not be orthogonal and additive
Many constraints
2014/1/4 23
By Santhanam, McClellan
Four bases:
DFT
IDFT
Identity
Time reverse

( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) n F A n f A n F A n f A n F + + + = o o o o
o 3 2 1 0
( )

=
|
.
|
\
|

=
4
1
2
4
1
k
k q j
q
e A
t
o
o
2014/1/4 24
transform matrix is orthogonal
additivity property
reversibility property

very similar to the conventional DFT or the identity
operation
lose the important characteristic of fractionalization

2014/1/4 25
DFRFT of the rectangle window function for various angles :
(top left) = 0:01,
(top right) = 0:05,
(middle left) = 0:2,
(middle right) = 0:4,
(bottom left) =/4,
(bottom right) =/2.

2014/1/4 26
(a) = 0.01
(b) = 0.05
(c) = 0.2
(d) = 0.4
(e) = /4
(f) = /2

2014/1/4 27
DFT : F=Fr j Fi
Search eigenvectors set for N-points DFT

t t
r i
F U U U U = A + A
( )
t
r i
F U U = A + A
( )
t
r i
F U U
o o
= A + A
2014/1/4 28
Good in removing chirp noise
By Pei, Tseng, Yeh, Shyu
cf. : DRHT can be H Fr Fi
o o o
= +
| |
(
(
(
(
(
(
(
(
(
(
(
T
1 N
T
1
0
1 N 1 0
d
d
d
d d d F
) 1 (
0 0
0
0
0 0 1
N j
j
e
e
o
o
o
2014/1/4 29
DFRFT of the rectangle window function for various angles :
(top left) = 0:01,
(top right) = 0:05,
(middle left) = 0:2,
(middle right) = 0:4,
(bottom left) =/4,
(bottom right) =/2

2014/1/4 30
Group theory type DFRFT
By Richman, Parks
Multiplication of DFT and the periodic chirps
Rotation property on the Wigner distribution
Additivity and reversible property

Some specified angles
Number of points N is prime

2014/1/4 31
Impulse train type DFRFT
By Arikan, Kutay, Ozaktas, Akdemir
special case of the continuous FRFT
f(t) is a periodic, equal spaced impulse train
N = A
2
, tan = L/M
many properties of the FRFT exists

many constraints
not be defined for all values of o
0 5 10 15 20 25
-1
-0.8
-0.6
-0.4
-0.2
0
0.2
0.4
0.6
0.8
1
2014/1/4 32
Closed form DFRFT
By Pei, Ding
further improvement of the sampling type of DFRFT
Two types
digital implementing of the continuous FRFT
practical applications about digital signal processing
2014/1/4 33
Type I Closed form DFRFT
Sample input f(t) and output F
a
(u)

Then

Matrix form:

( ) ( ) t n f n y =
( ) ( ) u m F m Y

=
( ) ( )
=

=
N
N n
t n
j
t u m n j
u m
j
n y e e t
j
m Y e
2 2 2 2
cot
2
csc
cot
2

2
cot 1
( ) ( ) ( )
=
=
N
N n
n y n m F m Y ,

( ) ( ) ( ) ( )

= =
-
=
M
M m
N
N k
k y k m F n m F n y , ,

2014/1/4 34

Constraint:

( )
( )
( )

= =

=
M
M m
N
N k
t u k n m j
t n k
j
k y
t
e e
csc
cot
2
2 2 2 2
sin 2

( ) ( ) ( ) ( )

= =
-
=
M
M m
N
N k
k y k m F n m F n y , ,

( ) 1 2 / sin 2 + = M S t u
2014/1/4 35

and

choose S = sgn(sino) = 1

( )
2 2 2 2
cot
2 1 2
2
cot
2

2
cot 1
,
t n
j
M
m n S
j u m
j
e e e t
j
n m F

+

=
( ) ( ) ( )

= =
-

M
M m
N
N k
k y k m F n m F , ,

( ) n y t
M

+
=
2
sin ) sgn(sin 2
1 2
( )
2 2 2 2
cot
2 1 2
2 ) sin ( sgn
cot
2
1 2
cos ) sin ( sgn sin
,
t n
j
M
m n
j u m
j
e e e
M
j
n m F

+

=
2014/1/4 36

when o e 2Dt+(0, t), D is integer (i.e., sino > 0)

when o e 2Dt+(t, 0), D is integer (i.e., sino < 0)
( ) ( )
2 2 2 2
2
cot cot
2 2 1 2
sin cos
2 1
j n m j
N
m u j n t
M
n N
j
F m y n
M
e e e

+
=
=
+

( ) ( )
2 2 2 2
2
cot cot
2 2 1 2
sin cos
2 1
j n m j
N
m u j n t
M
n N
j
F m y n
M
e e e

+
=
+
=
+

2014/1/4 37
Some properties
1
2 and
3 Conjugation property: if y(n) is real
4 No additivity property
5 When is small, and also become very small
6 Complexity
( ) ( ) m n F n m F
u t t u
, ,
, , , ,
-
=
( ) ( )

F m F m
+
= ( ) ( )
2
F m F m
o o t +
=
( ) ( )
F m F m
o o
-
=
o t A u A
2
2 ( / 2) log P P P +
2014/1/4 38
Type II Closed form DFRFT
Derive from transform matrix of the DLCT of type 1
Type I has too many parameters
Simplify the type I
Set p = (d/b)Au
2
, q = (a/b)At
2

( )
2 2
2 1 2
) sgn( 2
2
) , (
1 2
1
,
n q
j
M
m n b
j m p
j
q p
e e e
M
n m F

+

+
=
t
2014/1/4 39
from AtAu = 2t|b|/(2M+1), we find

a, d : any real value
No constraint for p, q, and p, q can be any real value.
3 parameters p, q, b without any constraint,
Free dimension of 3 (in fact near to 2)

( ) ad M q p + =
2
) 1 2 /( 2t
2014/1/4 40

p=0: DLCT becomes a CHIRP multiplication
operation followed by a DFT
q=0: DLCT becomes a DFT followed by a chirp
multiplication
p=q: F
(p,p,s)
(m,n) will be a symmetry matrix (i.e.,
F
(p,p,s)
(m,n) = F
(p,p,s)
(n,m))

2014/1/4 41

2P+(P/2)log
2
P
No additive property
Convertible
2014/1/4 42
The relations between the DLCT of type 2 and its
special cases

DFRFT of type 2 p = q, s = 1
DFRFT of type 1 p = cotoAu
2
, q = cotoAt
2
, s = sgn(sino)
DLCT of type 1 p = d/bAu
2
, q = a/bAt
2
, s = sgn(b)
DFT, IDFT p = q = 0, s = 1 for DFT, s = 1 for DFT
2014/1/4 43
Comparison of Closed Form DFRFT and DLCT
with Other Types of DFRFT
Directly Improved Linear Eigenfxs. Group Impulse Proposed
Reversible *
Closed form
Similarity A
Complexity P
2
Plog
2
P+
2P
P
2
/2 Plog
2
P+
2P
Plog
2
P+
2P

+2P
FFT 2 FFT 1 FFT 2 FFT 2 FFT 1 FFT
Constraints Less Middle Unable Less Much Much Less
All orders
Properties Less Middle Middle Less Many Many Many
Adv./Cvt. No Convt. Additive Additive Additive Additive Convt.
DSP
P
P
2
log
2
P
P
2
log
2
2014/1/4 44
Conclusions and future work

Generalization of the Fourier transform
Applications of the conventional FT can also be the
applications of FRFT and LCT
More flexible
Useful tools for signal processing
2014/1/4 45
References
[1] V. Namias , The fractional order Fourier transform and its
application to quantum mechanics, J. Inst. Maths Applies. vol. 25,
p. 241-265, 1980.
[2] L. B. Almeida, The fractional Fourier transform and time-frequency
representations. IEEE Trans. Signal Processing, vol. 42, no. 11, p.
3084-3091, Nov. 1994.
[3] J. J. Ding, Research of Fractional Fourier Transform and Linear
Canonical Transform, Ph. D thesis, National Taiwan Univ., Taipei,
Taiwan, R.O.C, 1997
[4] H. M. Ozaktas, Z. Zalevsky, and M. A. Kutay, The Fractional Fourier
Transform with Applications in Optics and Signal Processing, 1st
Ed., John Wiley & Sons, New York, 2000.

2014/1/4 46
References
[5] S. C. Pei, C. C. Tseng, M. H. Yeh, and J. J. Shyu, Discrete fractional
Hartley and Fourier transform, IEEE Trans Circ Syst II, vol. 45, no. 6,
p. 665675, Jun. 1998.
[6] H. M. Ozaktas, O. Arikan, Digital computation of the fractional
Fourier transform, IEEE Trans. On Signal Proc., vol. 44, no. 9,
p.2141-2150, Sep. 1996.
[7] B. Santhanam and J. H. McClellan, The DRFTA rotation in time
frequency space, in Proc. ICASSP, May 1995, pp. 921924.
[8] J. H. McClellan and T. W. Parks, Eigenvalue and eigenvector
decomposition of the discrete Fourier transform, IEEE Trans. Audio
Electroacoust., vol. AU-20, pp. 6674, Mar. 1972.

2014/1/4 47

Implementing Fractional Fourier Transforms and Linear Canonical Transforms

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Implementing Fractional Fourier Transforms and Linear Canonical Transforms

Hochgeladen von

Copyright:

Verfügbare Formate

Presenter:

Das könnte Ihnen auch gefallen