WO2002003377A1

WO2002003377A1 - Method of calculating line spectral frequencies

Info

Publication number: WO2002003377A1
Application number: PCT/EP2001/007250
Authority: WO
Inventors: Adrianus W. M. Van Den Enden; Eric Kathmann
Original assignee: Koninklijke Philips Electronics N.V.
Priority date: 2000-07-05
Filing date: 2001-06-27
Publication date: 2002-01-10
Also published as: KR20020028226A; CN1383544A; JP2004502202A; US6760740B2; EP1303854A1; US20020032562A1

Abstract

The invention provides for a method of calculating Line Spectral Frequencies comprising the steps of determining real zeros in associated polynomials and in and, with each polynomial comprising a series of Chebyshev polynomials, allowing evaluation of a single per function evaluation and including the steps of introducing the mapping and by approximating the cosine function.

Description

Method of calculating line spectral frequencies

The present invention relates to a method of calculating Line Spectral Frequencies (LSFs) including the steps of determining real zeros in associated "(z) and <2"(z) polynomials in cos(nω) and, with the polynomials written as a series of Chebyshev polynomials, evaluating cos(fi>) per function evaluation. The coding of speech signals is used particularly in the field of mobile communications since the coded speech signal can be transmitted in a manner in which the redundancy commonly experienced in human speech is reduced. Linear Predictive Coding (LPC) is a known technique normally used in speech coding and in which the correlation of the speech signal is removed by means of a filter. The filter is best described by way of one of a different set of parameters, and one important set of which comprises LSFs.

An accurate representation of the filter is an important requirement since such information is transmitted with the speech signal for subsequent reconstruction of the speech signal at a signal-receiving unit.

The advantages of representing LPC filter coefficients in the form of LSFs have been well-documented since the inception of this concept in 1975. However, disadvantages are also experienced in that the LSFs cannot be easily computed for higher- order LPC filters and numerical methods are needed to calculate the zeros of the various functions.

As is well known, the representation of an inverse LPC filter A{z) in the form of LSFs is derived from the representation of A(z) by its set of zeros in the z-plane. Insofar as the function A(z) represents an all-zero filter, it can be fully and accurately described by way of reference to its corresponding set of zeros.

Computation of the LSFs commences with the decomposition of the polynomial A_m z) of order m into two inverse polynomial functions P(z) and Q(z) . For confirmation, the polynomial A_m (z) and the two inverse polynomials appear as follows: A_m (z) = 1 + z^~x + a₂z^~2 + ... + a_mz^~"' and P(z) = A_m (z) + z-^A_m(z-¹) Q(z) = A_m (z) - z-^A_m(z-¹)

The polynomials P(z) and Q{z) each have (m + 1) zeros and exhibit various important characteristics. In particular: all zeros of P(z) and Q(z) are found on the unit circle in the z-plane; the zeros of P(z) and Q(z) are interlaced on the unit circle and the zeros do not overlap; and the minimum phase property of A_m (z) is easily preserved when the zeros of P(z) and Q(z) are quantised.

Analysis of the above confirms that z = -1 and z = +1 is always zero with the functions P(z) and Q{z) and since these zeros do not contain any information relating to the

LPC filter, they can simply be removed from P(z) and Q{z) by dividing by (1 + z^~ ) and

Such revised functions can be represented when m is even as follows:

(1 + z-¹) α-*-¹) and when m is odd as :

The advantageous properties of functions P(z) and Q{z) as noted above are also valid for P'(z) and Q z) . Since the coefficients of P' (z) and Q'(z) comprise real numbers, the zeros form complex conjugate pairs such that the search for zeros only has to be conducted on the upper half of the unit circle, i.e. where 0 < ω < π .

It generally proves inconvenient to compute complex zeros, particularly by way of computerized numerical analysis methods, and so the functions P' (z) and Q (z) are transformed to functions P"(z) and Q"(z) with real zeros. Also, the functions (z) and Q (z) always have an even order and, since they are symmetrical, the functions can be re- written with real zeros to the following manner:

^mι

Q"(ω) = 2∑_gi"cos((m_q - i)ω) =0 where p₀ "= l , p_ϊ .._mp._λ" = p ..._mp_s P_mp ⁿ = -p_m, q₀ ⁿ= l , <lx_X._mq-x ' - ? ..._m,-ι ' ,

q_m " = — g_m ' , and where rø_p is equal to the number of zeros of P' (z) on the upper half of

the unit circle and where m_q is equal to the number of zeros of Q'(z) on the upper half of the unit circle. When seeking the zeros of these functions, advantage can be taken from the form of the representations for P"(z) and Q"(z) due to the fact that the number of zeros to be located is already known. One particular method for identifying the zeros is by searching the interval [0, π] by effectively stepping, with relatively small steps, through the aforesaid interval and identifying a small interval within which a change in the sign of the function indicates that an odd number of zeros must be present within that interval. Thus, if the step size is small enough, there is a great probability that there is only one zero in the interval.

Once the LSFs have been identified and employed as required, the recomputation of the LPC filter coefficients from the LSFs can readily be achieved. This stage represents a much less computationally intensive calculation than the computation of -the LSFs from the filter coefficients as discussed above.

Returning to the functions P" (z) and Q" (z) , these can be readily computed if the polynomials are written as a series of Chebyshev polynomials wherein, by using the map = cos(_y) , cos(mω) can be represented as: cos(mω) = T_m x) where T_m (x) is a mth-order Chebyshev polynomial in x. Since the roots of polynomials P"(z) and Q"(z) are interlaced, a logical first step is to merely find the roots of P" (z) after which the roots of Q" (z) are easily found. As noted above, the task of finding all roots of P" (z) employs stepping at very small intervals through the range [0,π] . In view of the above-mentioned mapping of x = cos(») , cos(rø) must be calculated for every function evaluation. The cosine function is a computationally complex and computationally expensive function and to reduce this problem equidistant steps in the x-domain can be considered. However, around the values of ω = 0 and ω = π relatively large steps are made and to compensate for this the step size must be decreased in these areas in order to accurately identify single roots and this disadvantageously means that additional processing is required. Additionally the approach of stepping through the x-domain directly with equidistant steps within the interval [1,-1] leads to a problematic frequency-dependant accuracy of the zeros located. Disadvantageously, problems still arise even though the use of Chebyshev polynomials allows the evaluation of the single cos(α>) per function evaluation. As noted, the above-mentioned use of small steps increases the complexity of the search procedure. The present invention seeks to provide for a method of calculating LSFs which exhibits advantages over the above-mentioned known methods.

According to one aspect of the invention, there is provided a method of calculating LSFs as defined above and characterized by introducing the mapping x = cos(ω) and by the step of providing an approximation for the cosine function. The invention is advantageous in that, by adopting the approximation, the frequency dependent accuracy of the located zeros is improved and the complexity of the method compares favorably with the prior art methods.

The measure as defined in claim 2 has the advantage that the approximation introduces a new variable which leads to at least near equidistant steps in the ω -domain. The measure as defined in claim 3 has the advantage of an initial decrease in the processing requirement.

The measures as defined in claims 4 and 5 further assist in further decreasing the processing requirement of the method.

The measures as defined in claims 6 and 7 have the advantage of decreasing the variation in the polynomial which is particularly advantageous when employing fixed point representation.

As will be appreciated the method of the present invention overcomes problems encountered within the prior art with regard to the calculation of the LSFs and relating to the calculation of the roots of the relevant polynomials. This is a particularly important aspect in the field of LPC since if such calculations are not carried out correctly, numerical problems can readily arise when the calculations are performed using 32 bit floating-point numbers or using integers.

The invention is described further hereinafter, by way of example only, with reference to the accompanying drawings which:

Fig. 1 illustrates the taking of equidistant steps in the x-domain when calculating the roots of the functions P and Q as known in the prior art; Fig. 2 illustrates the taking of equidistant steps in the u-domain in accordance with the employment of the present invention; and

Fig. 3 illustrates an example of the P(z) polynomial.

Turning first to Fig. 1, since the roots of P(ω) and Q( ) are interlaced it is first commonly decided to find all roots of P{ώ) . After this is done the roots of Q (ω) can easily be found as they are located in-between the roots of P(ω) . The roots of P(ω) can be found by taking small steps in the interval of [0, π] to find the sign changes of P(ω) and as noted above, the mapping x = cos(ø) is used and the use of equidistant steps in the x-domain means that around ω = 0 and ω = π the step size in ω is much larger that the step size

JΓ around ω = — as illustrated with reference to Fig. 1.

2

Fig. 1 shows what happens in ω if 20 equidistant steps in x-domain are made.

As can be seen, around ω = 0 and ω = π large steps are made. To compensate for this, the step size must be decreased in these areas to prevent two roots being found within one step.

That is, with two roots, no sign change will occur and so the roots are not found. This means that extra processing and book keeping is needed.

With adoption of the mapping x = cos(β)) _t an advantageous and computationally relatively simple approximation of the cosine function can be made by x = l - w² 0 < w < l x = -l + (2 - ω)² \ < u < 2

As will be appreciated, with this approximation of a new interval, a variable u is introduced and Fig. 2 indicates what happens in the ω -domain if 20 equidistant steps in u between 0 and 2 are taken. As can be seen, while the steps in the ω -domain are not necessarily equidistant, they do however exhibit greater regularity than the steps illustrated in relation to Fig. 1. It is considered that the degree of regularity is sufficient to enable the identification of single roots within one step without requiring extra processing in which the interval of ω in the function is evaluated.

Fig. 3 shows an example of a P' polynomial. The F polynomial is sampled with 4000 points using the cosine approximation described above. This P' polynomial was calculated from a set of parameters from a system which had a single 2000 Hz sine- wave tone as an input signal. In Fig. 3, it can be seen that the roots can be very close together. The distance between the two roots at 2000Hz is only forty-three sample points. To make sure that all zero crossings will be found in the P' polynomial the step size must be smaller than forty-three points. In one example twenty-five sample points are taken and this means that the P' polynomial must be evaluated (4000/25)=160 times to find the 5 zero crossings. After this initial search the roots can be found by subdividing the intervals. Evaluating the P' polynomial 160 times in the initial search is quite computationally expensive.

An advantageous method can be to evaluate the P' polynomial a predetermined number of times and employing a small number of subintervals. The number of zero crossings is identified and if not all zero crossings are located, a second, and higher resolution, search is conducted employing smaller subintervals.

Since the probability of multiple zero crossings is high for those subintervals with small function values at their edges.

A good balance between the first and second stages of the search has been found when 4 * m_p intervals are generated. When not all zero crossings are found, then the candidate intervals are sampled with a 8 times higher resolution. This results in a search which has proved successful in locating all zero crossings.

Claims

CLAIMS:

1. A method of calculating line spectral frequencies comprising the steps of determining real zeros in associated polynomials F z) and Q"(z) in cos(nω) and, with each polynomial comprising a series of Chebyshev polynomials, evaluating cos(ω) per function evaluation and characterized by introducing the mapping x = cos(.ϋ) and by the step of approximating the cosine function.

2. A method as defined in claim 1, wherein the approximation is provided by: x = l - «² 0 < w < l x = -l + (2 - w)² \ < u ≤ 2

3. A method as defined in claim 1 or 2, wherein the search for the roots of the function comprises an initial search stage employing relatively large step intervals.

4. A method as defined in claim 3, wherein the polynomial function is initially evaluated less than 160 times.

5. A method as defined in claim 3 or 4, and including a further step of conducting a higher resolution search if it is first identified that not all zero crossings have been identified in the initial search stage.

6. A method as defined in claim 5, wherein the high resolution search adopts at least twenty-five sample points of reference.

7. A method as defined in any one of the preceding claims, wherein the polynomial function employed comprises P(z) and Q(z) , wherein P(z) and Q(z) is derived from the relationships:

F (z) = ^(z), and Q (z) = ^Q^, for m is even, and (1 + z-¹) - z^"1) F(z) = P(z) and Q'(z) = for m is odd

8. An encoder for encoding a source signal, wherein the encoder is arranged for carrying out the method as defined in any one of the preceding claims.

9. A communication device comprising an encoder as defined in claim 8.