Digital Signal Processing List of Transforms

Coursera - February 2013

Discrete Fourier Transform (DFT)

used for: analysis formula: synthesis formula: symmetries: nite support signals (x [n ]
N 1 N)

X [k ] = x [n ] = 1 N

nk x [n ]WN , n =0 N 1

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

nk X [k ]WN , k =0 DFT

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

DFT

shifts:

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

DFT

WN Parseval:

nk 0

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

DFT

N 1 |x [n ]|2 n =0

|X [k ]|2
k =0

Some DFT pairs for length-N signals:

x [n ] = [n M ] x [n ] = 1 x [n ] = e j
2 L N

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

X [k ] = e j

2 Mk N

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

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

x [n ] =

1 0

for n M 1 for M n N 1

Discrete-Time Fourier Transform (DTFT)

used for: analysis formula: synthesis formula: symmetries: innite, two sided signals (x [n ] 2 ( ))

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

x [ n ] e j n X ( e j ) e j n d

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

DTFT

shifts:

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

DTFT

Parseval:

2 n = |x [n ]|

1 2

| X ( e j )| 2 d

Some DTFT pairs:

x [n ] = [n k ] x [n ] = 1 x [n ] = u [n ] x [ n ] = a n u [ n ] |a | < 1 x [ n ] = e j 0 n x [n ] = cos(0 n + ) x [n ] = sin(0 n + ) x [n ] =
1 0 for 0 n N 1 otherwise

X ( e j ) = e j k () X (e j ) = 1 1 + () 1 e j 2 1 X (e j ) = 1 a e j X (e j ) = ( 0 ) X (e j ) = ( 0 ) + e j ( + 0 )] X (e j ) = (1/2)[e j ( 0 ) e j ( + 0 )] X (e j ) = ( j /2)[e j X (e j ) = sin((N /2)) j N 1 2 e sin(/2)