Documente Academic
Documente Profesional
Documente Cultură
figure
Time varying Speech model are assumed to constant for less than 30 msec due to
muscle relaxation time i.e., it will take certain amount of time for muscle to come
back to its position. During this time we can calculate time varying filter parameters
by simple technique called linear prediction .
Linear prediction is heart of all speech (CELP) coding algorithm studying of it is very
important for understanding the working of almost all coder . The main idea is
speech depends on linear combination of past M samples. And the corresponding
filter model
This weighted coefficients ai are called linear predictor coefficients. The ai are
calculated by minimizing the man square error between original speech and
predicted speech. The predictor error is
Figure 1.2 Shows Signal Source Model, Prediction signal and Prediction Error
1.1 Error Minimization
In order to calculate Lpc parameters we need to minimize mean
square error
After simplification,
For k=1,2 ,M
Where
1.2.1Internal Prediction
Most speech coding algorithm uses internal Prediction where LPC are
derived from the frame pertaining to the frame under processing. Frame length
taken usually around 160 to 240 samples. Here in this thesis we have used internal
prediction.
1.2.2External Prediction
Where LPC are derived from past frame are used in current frame
under processing this are used when low delay is prime concern, such as LD-CELP.
Frame length taken around 20 samples because for short frame length prediction
coefficients will not change much from past frame i.e., slowly varying nature of
speech.
1.3.1Prediction gain
It gives the measure of performance of predictor it is defined as
Low order may not able to produce exact spectrum and Excess high order leads to
spectrum outfit producing undesirable errors. So optimal order 10 is taken and one
point to remember even 50 order predictor are also in use coder such as in LD-CELP.
1.4 CONCLUSION:
From above we can say prediction order M=10 is able produce approximately
speech spectrum .so, optimum prediction order for speech coding usually taken
around M=10.
2 Levinson-Durbin algorithm
Where
Algorithm takes advantage of Toeplitz matrix in which all diagonal element are
equal.
It is stated as
The reflection coefficients absolute magnitude is less than 1 then Filter is guarantee
to be stable otherwise we need to take other previous frame because LPC
coefficients can be taken without having much distortion.
This can be realized in direct form, Lattice form and LSF form based on which
parameters.
2.1.1 Direct form
Order reduction
Above equation can be solved using root finding algorithm such as Runga-Kutta
method, Newtons method, above methods does not take into account leading to
high computations.
One can use the interlacing property of LSF in finding roots Po and Qo.
Such algorithm procedure described here, first take
small interval up to 3 decimal, the root obtained above is used as initial guess for
Qo, this continues.
It is given
that