Continuous-Time Fourier Transform Pairs

f (t),
e

at

te

a > 0, > 0

F ()
1

u(t)

a + j
1

at

u(t)
(
1, t < ,
2
2
p (t) =
0, else
(
2|t|

1
,
t <

2
2
(t) =
0,
else
e
e
e

!2

a|t|

a + j

sinc
2

2
sinc
2
4
2a

at

a2 + 2
0

at

sin (0 t) u(t)

a2 + t2
(t)

at2

sinc

x(t)

X()

X(t)

2x()

ax(t) + by(t)

aX() + bY ()

x(t )

2
t
2
sinc
4
1

X()

x(t)

X( 0 )

x(t) cos (0 t)

x(t) sin (0 t)

n
t x(t)

j0 t

dn

() +

j0 t

x() d

cos (o t)

[( + 0 ) + ( 0 )]
j [( + 0 ) ( 0 )]

( t
, t 6= 0,
|t|
sgn(t) =
0,
t = 0

x(t)y(t)

x(t)y(t) dt

Z
2
x (t) dt

cos(0 t)u(t)

sin(0 t)u(t)

j2

[( 0 ) + ( + 0 )] +
[( 0 ) ( + 0 )] +

u[n]

1 ej

[n]

j0 n

pL [n]
Ln

sinc

cos(0 n)
sin(0 n)

, |a| < 1
1 aej

X
2( 0 2k)
k=

sin
L+ 1
2

sin
2

X
p2L ( + 2k)
k=

( + 0 2k) + ( 0 2k)
k=

j ( + 0 2k) ( 0 2k)
k=

Discrete Fourier Transform Properties

aXk + bYk

x[(n n0 ) mod N ]

x[(n) mod N ]

X(k) mod N

x[n] y[n]

Xk Yk

x[n]y[n]

j2kn0 /N

Xk

Xk Yk

N
NX
1

x[n]y[n]

n=0

NX
1
n=0

1
1 NX

Y
X
k k

1
1 NX

|Xk |

N k=0
2
x [n]

N k=0

(generalized Parsevals Theorem)

(Parsevals Theorem)

1
[X() Y ()]
2
1 Z
X()Y () d (generalized Parsevals Theorem)
2
1 Z
2
|X()| d (Parsevals Theorem)
2

aX() + bY ()

x[n n0 ]

x[n]

X()

x[n]

X( 0 )

x[n] cos (0 n)

x[n] sin (0 n)

nx[n]

jn0

ax[n] + by[n]

X() + X(0)()

X()Y ()

Discrete-Time Fourier Transform Properties

( 2k)

n
a u[n]

ax[n] + by[n]

k=

[n n0 ]

n
(j) X()

2 2
0

2( 2k)

k=
1

[X( + 0 ) X( 0 )]
n
n d
j
X()
d n

F ()

[X( + 0 ) + X( 0 )]

2
j

2 2
0
0

Discrete-Time Fourier Transform Pairs

f [n]

x(t) y(t)

2( 0 )

sin (o t)

x(t)

dtn
Z t

X()

x(at)

j
e

1
|a|

2()

u(t)

x(t)

2
(a + j)2 + 0
a + j

cos (0 t) u(t)

2
(a + j)2 + 0
s
2 /4a
e
a
2
p ()

4
()

a||
e
a

Continuous-Time Fourier Transform Properties

j0 n

n
X

jn0

1
2
j
2
j

X()

[X( + 0 ) + X( 0 )]
[X( + 0 ) X( 0 )]
d

X()

x[m]
m=0
x[n] y[n]

x[n]y[n]

1
1 ej

X() +

X()Y ()
1 Z

1 Z

X(2n)( 2n)

n=

X( )Y () d

x[n]y[n]
n=

X
2
x [n]
n=

1 Z

X()Y () d

(generalized Parsevals Theorem)

2
|X()| d

(Parsevals Theorem)