Digital Signal Processing

List of Transforms
Coursera - February 2013

Discrete Fourier Transform (DFT)

used for:

finite support signals (x [n ] CN )

analysis formula:

X [k ] =

synthesis formula:
symmetries:

x [n ] =

N
1
X

x [n ]WNnk ,

n=0
N
1
X

1
N

k = 0, . . . , N 1

X [k ]WNnk ,

n = 0, . . . , N 1

k =0

DFT

x [n mod N ] X [k mod N ]
DFT

x [n ] X [k mod N ]
shifts:

DFT

x [(n n 0 ) mod N ] WNk n 0 X [k ]

nk 0

WN
Parseval:

DFT

x [n ] X [(k k 0 ) mod N ]

PN 1

|x [n ]|2 =
n=0

N 1
1 X
|X [k ]|2
N k =0

Some DFT pairs for length-N signals:

2
Mk
N

x [n ] = [n M ]

X [k ] = e j

x [n ] = 1

X [k ] = N [k ]

x [n ] = e j

2
L
N

(n , k = 0, 1, . . . , N 1)

X [k ] = N [k L]

Ln + )
x [n ] = cos( 2
N

X [k ] = (N /2)[e j [k L] + e j [k N + L)]]

Ln + )
x [n ] = sin( 2
N

X [k ] = (j N /2)[e j [k L] e j [k N + L]]

x [n ] =

for n M 1

for M n N 1

X [k ] =

sin((/N )M k ) j (M 1)k
e N
sin((/N )k )

Discrete-Time Fourier Transform (DTFT)

used for:
analysis formula:
synthesis formula:
symmetries:

infinite, two sided signals (x [n ] 2 (Z))

X
X (e j ) =
x [n ]e j n
n=
Z
1
x [n ] =
X (e j )e j n d
2
DTFT

x [n ] X (e j )
DTFT

x [n ] X (e j )
shifts:

DTFT

x [n n 0 ] e j n 0 X (e j )
DTFT

Parseval:

e j 0 n x [n ] X (e j (0 ) )
Z
P
1
2
|X (e j )|2 d
n= |x [n ]| =
2

Some DTFT pairs:

x [n ] = [n k ]

X (e j ) = e j k

x [n ] = 1

X (e j ) = ()
1
1
+ ()
1 e j 2
1
X (e j ) =
1 a e j
X (e j ) =

x [n ] = u [n ]
x [n ] = a n u [n ] |a | < 1
x [n ] = e j 0 n

0 )
X (e j ) = (

x [n ] = cos(0 n + )

0 ) + e j (
+ 0 )]
X (e j ) = (1/2)[e j (

x [n ] = sin(0 n + )

0 ) e j (
+ 0 )]
X (e j ) = (j /2)[e j (

x [n ] =

for 0 n N 1

otherwise

X (e j ) =

sin((N /2)) j N 1
2
e
sin(/2)