Documente Academic
Documente Profesional
Documente Cultură
1/8
ideal sampling
y[n]
Q()
Q()
Q()
Q()
Q()
ideal reconstruction
y(t)
z 1
2/8
y[n]
ideal sampling
ideal reconstruction
y(t)
0
h
z 1
Q()
h0
1
h
z 1
Q()
h1
2
h
Q()
h2
n = hn + en .
with h
D. Richard Brown III
3/8
q = 1 ( = 12 )
q = 2 ( = 14 )
q = 3 ( = 81 )
hn
n
h
en
n
h
en
n
h
en
n
h
en
0.13
-0.13
-0.13
0.25
-0.12
0.125
-0.005
-0.8
-1
-0.2
-1
-0.2
-0.75
0.05
-0.75
0.05
1.3
-0.3
1.5
-0.2
1.25
-0.05
0.875
-0.425
Remarks:
1. In most implementations, we use the same number of fractional bits
for all of the coefficients.
2. The idea is to minimize the quantization errors by maximizing the
number of fractional bits while avoiding overflow.
3. Problems can occur when you have both very large coefficients and
very small coefficients (large coefficient dynamic range).
D. Richard Brown III
4/8
H(z)
=
N
1
X
n=0
N
1
X
n z n =
h
hn z n +
n=0
N
1
X
n=0
N
1
X
(hn + en )z n
en z n = H(z) + E(z)
n=0
y[n]
y[n] = y[n] + w[n]
x[n]
E(z)
w[n]
5/8
en e
=
|E(ej )| =
en ejn
2
2
n=0
n=0
n=0
6/8
20
40
60
80
100
unquantized coefficients
quantized coefficients
upper bound
lower bound
120
140
0.1
0.2
0.3
0.4
0.5
0.6
normalized frequency (times )
0.7
0.8
0.9
7/8
8/8