Title: More On Linear Predictive Analysis
1More On Linear Predictive Analysis
2Contents
- Linear Prediction Error
- Computation of the Gain
- Frequency Domain Interpretation of LPC
- Representations of LPC Coefficients
- Direct Representation
- Roots of Predictor Polynomials
- PARCO Coefficients
- Log Area Ratio Coefficients
- Line Spectrum Pair
3More On Linear Predictive Analysis
4LPC Error
5Examples
Could be used for Pitch Detection
Premphasized Speech Signals
6Normalized Mean-Squared Error
General Form
Autocorrelation Method
Covariance Method
7Normalized Mean-Squared Error
8Experimental Evaluation on LPC Parameters
Frame Width
N
Filter Order
p
Conditions
1. Covariance method and autocorrelation method
2. Synthetic vowel and Nature speech
3. Pitch synchronous and pitch asynchronous
analysis
9Pitch Synchronous Analysis
Covariance method is more suitable for pitch
synchronous analysis.
/i/
The frame was beginning at the beginning of a
pitch period.
Why the error increases?
zero the same order as the synthesizer.
10Pitch Asynchronous Analysis
Both covariance and autocorrelation methods
exhibit similar performance.
/i/
Monotonically decreasing
11Frame Width Variation
The errors resulted by covariance and
autocorrelation methods are compatible when N gt
2P.
/i/
Why the errors jump high when the frame size
nears the multiples of pitch period?
12Pitch Synchronous Analysis
Both for synthetic and nature speeches,
covariance method is more suitable for pitch
synchronous analysis.
13Pitch Asynchronous Analysis
Both for synthetic and nature speeches, two
methods are compatible.
14Frame Width Variation
Both for synthetic and nature speeches, the
errors resulted by covariance and autocorrelation
methods are compatible when N gt 2P.
15More On Linear Predictive Analysis
16Speech Production Model (Review)
17Speech Production Model (Review)
18Linear Prediction Model (Review)
Linear Prediction
Error compensation
19Speech Production vs. Linear Prediction
Speech production
Vocal Tract
Excitation
ak ?k
Linear Predictor
Error
Linear Prediction
20Speech Production vs. Linear Prediction
Speech production
Linear Prediction
21The Gain
Generally, it is not possible to solve for G in a
reliable way directly from the error signal
itself.
Instead, we assume
Energy of Error
Energy of Excitation
22Assumptions about u(n)
Voiced Speech
This requires that both glottal pulse shape and
lip radiation are lumped into the vocal tract
model.
1/A(z)
Unvoiced Speech
23Gain Estimation for Voiced Speech
Voiced Speech
This requires that both glottal pulse shape and
lip radiation are lumped into the vocal tract
model.
1/A(z)
This requires that p is sufficiently large.
24Gain Estimation for Voiced Speech
1/A(z)
25Correlation Matching
Define
Assumed causal.
Autocorrelation function of the impulse response.
26Correlation Matching
Autocorrelation function of the speech signal
If H(z) correctly model the speech production
system, we should have
27Correlation Matching
28Correlation Matching
Assumed causal.
29Correlation Matching
The same formulation as autocorrelation
method.
30The Gain for voice speech
En
31More on Autocorrelation
Assumed Stationary
Define
The stationary assumption implies
32Properties of LTI Systems
Define
33Properties of LTI Systems
Define
34Properties of LTI Systems
Independent on n
y(n) is also stationary.
35Properties of LTI Systems
l?lk
36Properties of LTI Systems
Define
Estimated from input
Estimated from output
Filter Design
37The Gain for Unvoiced Speech
38The Gain for Unvoiced Speech
?
39The Gain for Unvoiced Speech
Why?
?
40The Gain for Unvoiced Speech
Estimated using rm
41The Gain for Unvoiced Speech
Once again, we have the same formulation as
autocorrelation method.
Furthermore,
42More On Linear Predictive Analysis
- Frequency Domain Interpretation of LPC
43Spectral Representation of Vocal Tract
44Spectra
45Frequency Domain Interpretation of Mean-Squared
Prediction Error
Parsevals Theorem
46Frequency Domain Interpretation of Mean-Squared
Prediction Error
47Frequency Domain Interpretation of Mean-Squared
Prediction Error
Sn(ej?) gt H(ej?) contributes more to the
total error than Sn(ej?) lt H(ej?).
Hence, the LPC spectral error criterion favors a
good fit near the spectral peak.
48Spectra
49More On Linear Predictive Analysis
- Representations of LPC Coefficients ---
- Direct Representation
50Direct Representation
Coding ais directly.
G/A(z)
51Disadvantages
- The dynamic ranges of ais is relatively large.
- Quantatization possibly causes instability
problems.
52More On Linear Predictive Analysis
- Representations of LPC Coefficients ---
- Roots of Predictor Polynomials
53Roots of the Predictor Polynomial
Coding p/2 zks.
Dynamic range of rks?
Dynamic range of ?ks?
54The Application
Formant Analysis Application.
55Implementation
G/A(z)
Each Stage represents one formant frequency
and its corresponding bandwidth.
56More On Linear Predictive Analysis
- Representations of LPC Coefficients ---
- PARCO Coefficients
57PARCO Coefficients
Step-Up Procedure
58PARCO Coefficients
Dynamic range of kis?
Step-Down Procedure
where n goes from p to p?1, down to 1 and
initially we set
59More On Linear Predictive Analysis
- Representations of LPC Coefficients ---
- Log Area Ratio Coefficients
60Log Area Ratio Coefficients
kis Reflection Coefficients
gis Log Area Ratios
61More On Linear Predictive Analysis
- Representations of LPC Coefficients ---
- Line Spectrum Pair
62LPC Coefficients
where m is the order of the inverse filter.
If the system is stable, all zeros of the inverse
filter are inside the unit circle.
Line Spectrum Pair (LSP) is an alternative LPC
spectral representation.
63Line Spectrum Pair
- LSP contains two polynomials.
- The zeros of the the two polynomials have the
following properties - Lie on unit circle
- Interlaced
- Through quantization, the minimum phase property
of the filter is kept. - Useful for vocoder application.
64Recursive Relation of the inverse filter
where km1 is the reflection coefficient of the
m1th tube.
Special cases
Recall that
Ai1??
ki 1
Ai10
ki ?1
65LSP Polynomials
66Properties of LSP Polynomials
Show that
The zeros of P(z) and Q(z) are on the unit circle
and interlaced.
67Proof
68Proof
69Proof
70Proof
gt0
71Proof
This concludes that the zeros of P(z) and Q(z)
are on the unit circle.
72Proof (interlaced zeros)
Fact
H(z) is an all-pass filter.
One can verify that ?(0) 0
and ?(2?) ?2(m1) ?
Phase
73Proof (interlaced zeros)
zeros of Q(z)
zeros of P(z)
Therefore, z1 is a zero of Q(z).
One can verify that ?(0) 0
and ?(2?) ?2(m1) ?
Phase
74Proof (interlaced zeros)
?(0) 0
?(2?) ?2(m1) ?
Is this possible?
75Proof (interlaced zeros)
?(0) 0
?(2?) ?2(m1) ?
Is this possible?
76Proof (interlaced zeros)
?(0) 0
?(2?) ?2(m1) ?
Group Delay
gt 0
?(?) is monotonically decreasing.
77Proof (interlaced zeros)
?(0) 0
?(2?) ?2(m1) ?
Typical shape of ?(?)
. . .
78Proof (interlaced zeros)
Q(ej?)0
P(ej?)0
Q(ej?)0
P(ej?)0
Q(ej?)0
P(ej?)0
79Proof (interlaced zeros)
There are 2(m1) cross points from 0 ? ? ? ??,
these constitute the 2(m1) interlaced zeros of
P(z) and Q(z).
80Quantization of LSP Zeros
Is such a quantization detrimental?
For effective transmission, we quantize ?is
into several levels, e.g., using 5 bits.
81Minimum Phase Preserving Property
Show that in quantizing the LSP frequencies, the
reconstructed all-pole filter preserves its
minimum phase property as long as the zeros has
the properties shown in the left figure.
82Find the Roots of P(z) and Q(z)
Symmetric
Anti-symmetric
83Find the Roots of P(z) and Q(z)
. . .
. . .
. . .
. . .
84Find the Roots of P(z) and Q(z)
We only need compute the values on 1 ? i ? m/2.
85Find the Roots of P(z) and Q(z)
. . .
. . .
. . .
. . .
86Find the Roots of P(z) and Q(z)
We only need compute the values on 1 ? i ? m/2.
87Find the Roots of P(z) and Q(z)
Both P(z) and Q(z) are symmetric.
P(z)
zero on ?1
Q(z)
zero on 1
88Find the Roots of P(z) and Q(z)
To find its zeros.
89Find the Roots of P(z) and Q(z)
90Find the Roots of P(z) and Q(z)
Define
91Find the Roots of P(z) and Q(z)
. . .
92Find the Roots of P(z) and Q(z)
Consider m10.
93Find the Roots of P(z) and Q(z)
94Find the Roots of P(z) and Q(z)
95Find the Roots of P(z) and Q(z)
96Find the Roots of P(z) and Q(z)
We want to find ?is such that
97Find the Roots of P(z) and Q(z)
Algorithm
We only need to find zeros for this half.
98Find the Roots of P(z) and Q(z)