F ORMULA S HEET AVAILABLE IN E XAM

The following formulae will be available in the exam:

Notation All signals and lter coefcients are real-valued unless explicitly noted otherwise. Unless otherwise specied, upper and lower case letters are used for sequences and their z-transforms respectively. The signal at a block diagram node V is v[n] and its z-transform is V (z). x[n] = [a, b, c, d , e, f ] means that x[0] = a, . . . x[5] = f and that x[n] = 0 outside this range. (z), (z), z , |z| and z denote respectively the real part, imaginary part, complex conjugate, magnitude and argument of a complex number z.

Abbreviations BIBO CTFT DCT DFT DTFT LTI MDCT SNR Bounded Input, Bounded Output Continuous-Time Fourier Transform Discrete Cosine Transform Discrete Fourier Transform Discrete-Time Fourier Transform Linear Time-Invariant Modied Discrete Cosine Transform Signal-to-Noise Ratio

Standard Sequences [n] = 1 for n = 0 and 0 otherwise. condition [n] = 1 whenever "condition" is true and 0 otherwise. u[n] = 1 for n 0 and 0 otherwise.

Geometric Progression
n n = r n=0 z 1 r+1 zr1 1 z1 n n = or, more generally, r n=q z q zq r+1 zr1 1 z1

Digital Signal Processing and Digital Filters

c Imperial College London

1/3

Forward and Inverse Transforms z: CTFT: DTFT: DFT: DCT: MDCT:

n X (z) = x[n]z

x[n] = x(t ) = x[n] =

1 2 1 2

1 2 j

X (z)zn1 dz
j t d

X ( j ) =

x(t )e

j t dt

1 N

X ( j )e X (e

j n X (e j ) = x[n]e 1 x[n]e j2 N X [k] = N 0

kn

j )e j n d
kn

x[n] = x[n] = y[n] =

X [0] N

N 1 X [k]e j2 N 0

2 (2n+1)k 1 X [k] = N n=0 x[n] cos 4N 2 (2n+1+N )(2k+1) N 1 X [k] = 2 n=0 x[n] cos 8N

2 (2n+1)k 2 N 1 +N n=1 X [k] cos 4N 2 (2n+1+N )(2k+1) 8N

1 N

1 X [k] cos N 0

Convolution DTFT: v[n] = x[n] y[n] v[n] = x[n]y[n] DFT: v[n] = x[n]
N

r= x[r ]y[n r ] V e j =
1 2 X

e j Y e j =
N Y [k] 1 N 1 2

V e j = X e j Y e j
X

e j Y e j( ) d V [k] = X [k]Y [k]

y[n]

1 N r=0 x[r ]y[(n r )

mod N ] 1 V [k] = N X [k]

v[n] = x[n]y[n]

N 1 r =0 X [r ]Y [(k r )

mod N ]

Group Delay
(e The group delay of a lter, H (z), is H (e j ) = d H d
j )

z dH (z) H (z) dz

F ( ) denotes the DTFT.

z=e j

F (nh[n]) F (h[n])

where

Order Estimation for FIR Filters Three increasingly sophisticated formulae for estimating the minimum order of an FIR lter with unity gain passbands: 1. M 2. M 3. M
a 3.5 a8 2.2 a1.220 log10 b 4.6

where a =stop band attenuation in dB, b = peak-to-peak passband ripple in dB and = width of smallest transition band in normalized rad/s.

Digital Signal Processing and Digital Filters

c Imperial College London

2/3

z-plane Transformations A lowpass lter, H (z), with cutoff frequency 0 may be transformed into the lter H (z ) as follows: Target H (z ) Lowpass < 1 Highpass > 1 Bandpass < 2 1 < Bandstop 1 2 Substitute z1 =
z 1 1 z 1
1

Parameters = =
2

sin sin cos cos

1 0 2 1 0 + 2 1 0 + 2 1 0 2

+ z1 = 1z + z 1 ( 1)2 z +( +1)z z1 = ( +1)2 z 1 +( 1)z 2

1

= =

cos cos cos cos

2 + 1 2 2 1 2 2 + 1 2 2 1 2

, = cot , = tan

2 1 2 2 1 2

tan tan

0 2

z1 =

(1 )2 z 1 +( +1)z 2 ( +1)2 z 1 +(1 )z 2

0 2

Digital Signal Processing and Digital Filters

c Imperial College London

3/3