METHOD OF CONVERTING LINE SPECTRAL FREQUENCIES BACK TO LINEAR PREDICTION COEFFICIENTS

Abstract: A method for the conversion of LSF to LPC coefficients (Line Spectral Frequencies to Linear Prediction Coefficients) to avoid excessive growth of intermediate coefficients during calculation of polynomial products. The symmetric and antisymmetric polynomials P(z) and Q(z) are ordered in series which are reduced two by two until obtaining two polynomials which are multiplied.

Description: METHOD OF CONVERTING LINE SPECTRAL FREQUENCIES BACK TO LINEAR PREDICTION COEFFICIENTS The present invention relates to a method of determining filter coefficients from Line Spectral Frequencies comprising recomputing P(z) and Q(z) polynomials and comprising calculating the ω t coefficients. 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. 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 + a z ~ + a 2 z ~2 + ... + a m z ~m and P(z) = A m (z) + z-^A m (z- 1 ) Q(z) = A m (z) - z m ^A m (z- ) The polynomials P(z) and Q(z) each have (m A- 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) axe quantised. Analysis of the above confirms that z = -1 and z = +l 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 ~x ) and Such revised functions can be represented when m is even as follows: (1 + -- 1 ) (1 - z- 1 ) and when m is odd as: F(z) = P(z) and Q'(z) -- β(*) (l - z-'Xl + iT 1 ) 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 computerised numerical analysis methods, and so the functions P'(z) and Q'(z) axe transformed to functions P" (z) and Q" (z) with real zeros. Also, the functions P' (z) and Q (z) always have an even order and, since they are symmetrical, the functions can be rewritten with real zeros to the following manner: P"(ω) = 2∑ Pl "∞s((m p - ϊ)ω) 1=0 m q Q"(ω) = 2∑ qi "cos((m q ~ i)ω) (=0 where p 0 " = ... m ,-. " ' = ?u._,,-ι ' » q m " = — q m ' , and where m is equal to the number of zeros of P' (z) on the upper half of the unit circle and where πι 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. Importantly, and of particular relevance to the present invention, once the LSFs have been identified and employed as required, the recomputation of the LPC filter coefficients from the LSFs is required. While this stage represents a much less computationally intensive calculation than the computation of the LSFs from the filter coefficients as discussed above, problems and disadvantageous limitations are experienced. In particular, the values of intermediate coefficients can be disadvantageously high and this can lead to numerical problems even when employing floating point representations. Recomputing LPC filter coefficients a, from LSFs is much less computationally intensive than computing the LSFs from the filter coefficients. Each LSF ω, , i ~ Q,\,...,m -\ contributes to a quadratic factor of the form, 1 - 2cos(ω,)z _1 + z ~2 . The polynomials P' (z) and Q (z) are formed by multiplying these factors using the LSFs that come from the corresponding polynomial: , (z) = f[(l - 2cos(G> 2 ,)z- 1 + z- 2 ) ;=0 Q'(z) = γ[(l - 2cos(ω 2l+l )z- χ + z- 2 ) (=1 The polynomials P(z) and Q(z) are computed by multiplying F (z) and Q' (z) with the extra zeros at z = -1 and z = +1. Finally, the filter coefficients are computed by using the following equation: which defines the relationship between the polynomial A m (z) and the two inverse polynomials discussed earlier. Thus, when recomputing the P(z) and Q(z) polynomials one can use the above equations for F (z) and Q (z) and add the extra zeros. Thus, for m is even: m p -\ P(z) = (l A- z- χ )Y[(l ~ 2cos(ω 2i )z- χ + z '2 ) ;=0 m„-l Q(z) = (1 - z ~ >π (1 " 2 cos( 2 , +1 )z ~x + z "2 ) 1=0 and for m is odd: m p -\ P(z) = l (1 - 2 cos(ω 2; )z _1 + z ~2 ) (=0 m,-l β(z) = (1 - z ~ )(1 + z ~x )] (1 - 2 cos(<y 2;+1 1 + ~2 ) 1=0 Since ω, coefficients are ordered in increasing frequency the contributions of the first cos(ώ>, ) coefficients are positive and the last coefficients are negative. This introduces an undesirable growth of the intermediate coefficient values while conducting the polynomial multiplications (1 — 2 cos(α) 2/+1 )z ~x + z ~2 ) . With an increasing order of m, such problems are amplified. To illustrate this, an example polynomial Q(z) = 1 - z ~2N has been taken; it being noted that that m = 2N . Such a polynomial provides for a system with 2N equidistant zeros on the unit circle. Since this is only a very simple example, it should of course be appreciated that in reality the growth of the intermediate coefficients can be much larger. Therefore a different strategy must be used. It has been found that for high order polynomials m=60 (or N=30) a double precision floating point representation will not be sufficient. A different method might involve searching for the best possible combination of ω t and which exhibits the least amount of intermediate coefficient growth. However, due to the large number of possible combinations, this is most unlikely to be feasible and it also means that the optimal combination will never be found. The invention seeks to provide for a method of determining filter coefficients having advantages over known such methods. In accordance with the present invention there is provided a method of determining filter coefficients from Line Spectral Frequencies as noted above and characterised by the steps of addressing the polynomials in a series and reducing the number of polynomials in ω t in the said series by combining the polynomials in ω l two by two in a manner so as to arrive at two polynomials in ω t and determining the product of the said two polynomials. The invention serves to combine ω, in such a way that hardly any signal growth occurs and proves particularly advantageous since the use of an increasing index i would not seem to offer a good solution. Using the method of the present invention with the example polynomial noted above, i.e. Q(z) = 1 - z ~2N , the intermediate coefficients are never larger than 2. In practice only a limited amount of intermediate coefficient growth occurs. Advantageously, the invention need not comprise a particularly complex method. In general it requires only a different indexing and can advantageously deliver almost optimal results. For P(z) the same procedure could be used only if m is even then P(z) has a root at z = -1. If m is odd P(z) does not have any additional roots, so no additional roots need to be added. Finally the relationship noted above is employed to compute the coefficients of A(z) from P(z) and Q(z) . The invention is described further hereinafter, by way of example only, with reference to the accompanying drawing which is a graphical representation of the intermediate coefficient growth experienced in the prior art and in an example polynomial Q(z) = l -z ~2N . It is assumed that the original polynomial is reconstructed by combining the zeros with increasing ω t . The maximum value of the largest coefficient during the recomputation procedure is plotted in the accompanying drawing. Note that the Y axis is logarithmic. For large order Nthe intermediate values of some of the coefficients become very high. However, such problems are not encountered in a method according to the present invention. As an example, and for Q(z) with m is even, the following ordering of the polynomials is used: v 0 [0] = l - z "1 v 0 [l] = l ~ 2cosω 1 z ~1 + z ~2 v 0 [2] = l - 2cos6) 3 z _1 A- z "2 v 0 [m = l - 2cose> 2 l z -1 + z If is odd then the terms for Q(z) axe: v 0 [0] = l-z- 1 v 0 [l] = l-2cosfi> j Z _1 +z ~2 v 0 [m ll ] = l-2cosω 2 ^_ i z- χ +z ~2 The next step is to combine the polynomials v 0 [i] . The strategy will be demonstrated with an example with m=12 and m q ~6. The original seven polynomials are: vo[0], voflj, v 0 [2J, voβj, v 0 [4J, v 0 [5], and v 0 [6J. In the first step the polynomials are combined two by two. Polynomial i is combined with polynomial [m q -i], this gives four intermediate polynomials v//: v 1 [0] = v 0 [0]-v 0 [6] v 1 [l] = v 0 [l]-v 0 [5] v I [2] = v 0 [2]-v 0 [4] Vι[3] = v 3] These four polynomials are combined in the same way, leading to two new polynomials v∑fij: v 2 [0] = v 1 [0]-v 1 [3] v 2 [l] = v 1 [l]-v 1 [2] The product V2[0].V 2 [1] gives the final result: v 3 [0] = v 2 [0]-v 2 [l] The procedure can formally be described by the following pseudo program: if m is even begin m q =m/2 m c =m q +l end else begin m q =(m-l)/2 m c =m q +2 end n p =m c i=mc> > 1 /^arithmetic shift right */ k=0 while (i>0) begin n=0 while (n<i) begin n-n+1 end if n p is odd then begin n=n+l n p =n k=k+l i-n»l. ^arithmetic shift right */ end Using this method with the example polynomial Q(z) = 1 - z ~2N the intermediate coefficients are never larger than 2. In practice only a limited amount of intermediate coefficient growth occurs. This is not a very complex method (actually it only uses a different indexing) and delivers almost optimal results. For P(z) the same procedure will be used only if m is even then P(z) has a root at z = -1 . If m is odd P(z) does not have any additional roots, so no additional roots need to be added. The last step consists of using the equation AM ._m± to compute the coefficients of A(z) from P(z) and Q(z) .

Claims: CLAIMS: 1. A method of determining filter coefficients from Line Spectral Frequencies comprising recomputing P(z) and Q(z) polynomials and comprising calculating the ω, coefficients, characterised by the steps of ordering the polynomials in a series and reducing the number of polynomials in ω t in the said series by combining the polynomials in ω t two by two in a manner so as to arrive at two polynomials in ω, and determining the product of the said two polynomials. 2. A method as defined in claim 1, wherein at least one series of intermediate polynomials is formed by combining the original polynomials two by two; the polynomials of the at least one intermediate series also being combined two by two so as to arrive at a yet further reduced number of polynomials. 3. A method as defined in claim 1 or 2, wherein the following ordering of polynomials is used for m is even: v 0 [0] = l - z _1 v 0 [l] = l - 2cosω l z ~x + z ~2 v 0 [2] = 1 - 2 cos ω 3 z ~x + z ~~2 v„[ = l - 2cosω 2* "ι j z "1 + z ~2 4. A method as defined in claim 1 or 2, wherein the following ordering of polynomials is used for m is odd: v 0 [0] = l - z- 1 v 0 [1] = 1 — 2 cos ω λ z ~x + z ~2 v 0 [m (I ] = l - 2cosω 2tm ^_ l z ~x A- z ~2 5. 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. 6. A communication device comprising an encoder as defined in claim 5.

Inventors: KATHMANN ERIC, VAN DEN ENDEN ADRIANUS W M, KATHMANN, ERIC, VAN DEN ENDEN, ADRIANUS, W., M.
Applicants: KONINKL PHILIPS ELECTRONICS NV, KONINKLIJKE PHILIPS ELECTRONICS N.V.
Application year: 2001
Main classification: G10L19
IPC codes: G10L19, H03H17