Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
processing
1
Sound modeling
sound
symbols
aims
analysis
synthesis
processing
classification:
signal models
source models
abstract models
2
Digital signals
x(t) x(n) y(n) y(t)
analog 0.05 0.05 0.05 0.05
sampling
processing 0 0 0 0
reconstruction
sampling interval T
sampling frequency fs= 1/T
3
Digital signals: time representations
100 samples
x(n)
0
x(n)
0
-0.5
0 100 200 300 400 500 600 700 800 900 1000
0.05
vertical quantization x(n)
0
integer
e.g. -32768 .. 32767 -0.05
0 10 20 30 40 50 60 70 80 90 100
normalized n
e.g. -1 .. (1-Q)
Q = quantization step
4
Spectrum: analog vs. digital signal
5
Spectrum: analog vs. digital signal
6
Discrete Fourier Transform
Magnitude
Phase
7
Discrete Fourier Transform (example)
0
cosine (16 points)
a)
-1
0 2 4 6 8 10 12 14 16
n
magnitude (16 points) 1
Ma gnitude s pe ctrum |X(k)|
normalization: 0.5
b)
0 dB for sinusoid ±1 0
0 2 4 6 8 10 12 14 16
magnitude 1
k
Ma gnitude s pe ctrum |X(f)|
c)
kfs / N 0
0 0.5 1 1.5 2 2.5 3 3.5
step fs/N f in Hz x 10
4
20
magnitude dB vs. Hz Magnitude s pe ctrum |X(f)| in dB
0
|X(f)| in dB
-20
-40
0 0.5 1 1.5 2 2.5 3 3.5
f in Hz x 10
4
8
Inverse Discrete Fourier Transform (DFT)
if X(k) = X*(N-k)
then IDFT gives N discrete-time real values x(n)
9
Frequency resolution
2
frequency resolution 8
1 6
|X(k)|
x(n)
4
0
2
-1
0
0 2 4 6 0 2 4 6
1 6
|X(k)|
x(n)
4
0
2
-1
0
0 5 10 15 0 5 10 15
n k
10
Window functions
to reduce leakage:
weight audio samples by
a window
Hamming window
wH(n) = 0.54 – 0.46 cos(2 n/N)
Blackman window
wB(n) = 0.42 – 0.5cos(2 n/N) + 0.08(4 n/N)
11
Window
12
Spectrograms
13
Waterfall representation
S ignal x(n)
1
0.5
0
x(n)
-0.5
-1
0 1000 2000 3000 4000 5000 6000 7000 8000
n
Waterfall Repres entation of S hort-time FFTs
0
Magnitude in dB
-50 0
2000
-100 4000
0 6000
5 10 15 20 n
f in Hz
14
Digital systems
15
Definitions
Unit impulse
Discrete convolution:
y(n)=x(n)*h(n)
16
Algorithms and signal graphs
Delay
e.g. y(n) = x(n-2)
Weighting factor
e.g. y(n) = a x(n)
Addition
e.g.
y(n) = a1 x(n) + a2 x(n)
17
Simple digital system
18
Transforms
Z transform
Frequency response:
Discrete time Fourier
transform of h(n)
19
Causal and stable systems
20
IIR systems
Difference equation
Transfer function
21
IIR systems
Difference equation
Transfer function
22
FIR systems
Difference equation
Transfer function
23
Fir example
|H(f)|
0
pole/zero plot 0.2
-0.1
0
phase resp. 0 2 4 0 10 20 30 40
n f in kHz
(c ) P ole/Zero plot (d) P ha s e Res pons e H(f)
0
1
-0.5
Im(z) 4
H(f)/
0 -1
-1.5
-1
-2
-1 0 1 2 0 10 20 30 40
Re (z) f in kHz
24