Apparatus and method for analyzing speech signals to determine parameters expressive of characteristics of the speech signals

Abstract: An apparatus and method for locating a plurality of roots of a line spectrum pair expression on a unit circle. The method comprises the steps of: (1) receiving an initial value for locating a first site on the unit circle; (2) receiving a step value for defining an arc-distance on the unit circle; (3) generating intervals on the unit circle, each having a lower limit and an upper limit; the lower limit of the initial interval is the initial value and the upper limit of the initial interval is displaced on the unit circle from the initial value by the arc-distance; each succeeding interval has its lower limit coincident with the upper limit of the next preceding interval and has its upper limit displaced on the unit circle from its lower limit by the arc-distance; (4) evaluating the expression for at least the upper limit and the lower limit of each respective interval; (5) recognizing a root of the expression when the expression changes sign within an interval; (6) designating each such interval as a solution interval; and (7) generating the lower and upper limits of each solution interval to identify where the root is located. The apparatus comprises a waveform generator which receives the initial value and the step value and defines the arc-distance, and generates the intervals; a zero detector for recognizing roots of the expression when the expression changes sign.

Description: Numerous methods have been developed for speech analysis and speech synthesis. The most successful methods thus far are concerned with speech spectrum conservation rather than speech waveform, such speech spectrum conservation is sufficient to ensure adequate speech quality and intelligibility for many purposes. Generally, in a speech analysis and synthesis method, certain predetermined parameters corresponding to particular speech spectra are extracted at an analyzer end and, at the receiver end, the speech waveform is synthesized from those predetermined parameters. The difference among the various methods is the difference in the predetermined parameters. Most research has been concentrated on finding predetermined parameters which express speech characteristics efficiently. One method, linear predictive coding (LPC), has been successful but has been found not as efficient as desired because of quantization characteristics associated with linear predictive coding. Another idea for speech synthesis and analysis is based on an assumption that a speech signal can be approximately represented as an output signal from an all-pole filter. The PARCOR (PARtial autoCORrelation) lattice filter is employed to implement this assumption. The PARCOR speech analysis and synthesis method has been found to be efficient for narrow band speech coding. However, the PARCOR method has limitations with regard to data compression. In particular, PARCOR-synthesized speech quality rapidly deteriorates at bit rates lower than 4.8 kilobytes per second. There are two main reasons for this: (1) in parameter quantization, between 4 and 8 bits are required for the PARCOR coefficients, and (2) the spectral distortion due to parameter interpolation increases rapidly as the parameter refreshing period is lengthened. Another approach to speech synthesis and analysis is the line spectrum pair (LSP) method. The line spectrum pair method also employs an all-pole model of speech, and employs line spectrum pair parameters which are interpreted as one of the linear predictive coding parameters in the frequency domain. Line spectrum pairs (LSP's) are a transformed representation of the canonical linear predictive coding (LPC) filter coefficients, which possess some useful characteristics. The LSP representation gives an accurate approximation to the short term spectrum using relatively few bits. The LSP representation also has the useful property of error localization. For example, an error in a particular coefficient will only introduce distortion in the frequency spectrum in frequencies close to the frequency represented by the coefficient. These parameters are also useful for vector quantization where good results can be obtained using a simple mean squared error measure on the coefficient vectors. A low-bit-rate speech coder is disclosed in US-A-4975956 using LPC data reduction processing. In detail, a technique is provided for computing the roots for the LSP expressions which are located on a unit circle; the entire range is divided into a plurality of intervals and the roots are found by searching through the intervals with a sign change of the evaluated LSP expressions followed by a linear interpolation scheme. Any of the above-described methods (LPC, PARCOR, LSP) have heretofore been implemented in inefficient, cumbersome, memory-expensive ways. For example, LSP requires either a cosine computation algorithm or a large look-up table in which to store cosine values. The cosine computation is complex, and a look-up table requires a large amount of memory, especially if highly accurate results are required. There is, therefore, a need for a method and apparatus for solving line spectrum pair expressions which is efficient in its storage requirements and efficient in effecting root determination. The present invention as claimed in claims 1-19 is an apparatus and method for analyzing speech signals to determine parameters expressive of characteristics of the speech signals. We will describe an apparatus and method which is efficient in its use of memory storage space and addressal of that memory storage space in determining the roots of a line spectrum pair expression on a unit circle. We will describe an apparatus and method which may provide increased accuracy of location of a root of a line spectrum pair expression on the unit circle by successively bisecting an interval within which a root is determined to be located. Further objects and features of the present invention will be apparent from the following specification and claims when considered in connection with the accompanying drawings illustrating the preferred embodiment of the invention. Fig. 1a is a schematic drawing of the angles and values employed in "stepping around" the unit circle to locate roots of a line spectrum pair expression. Fig. 1b is a schematic drawing of angles and values employed in approximating the cosine of a bisecting angle of a sector given the cosines of boundary angles of the sector. Fig. 2 is a schematic drawing of the preferred embodiment of a waveform generating unit for use in the present invention. Fig. 3 is a schematic drawing of the preferred embodiment of a polynomial zero crossing detector unit for use in the present invention. Fig. 4 is a schematic drawing of the preferred embodiment of a half-angle generating unit for use in the present invention. Fig. 5 is a schematic drawing of the preferred embodiment of an angle bisecting unit for use in the present invention. Fig. 6 is a schematic drawing of the preferred embodiment of the apparatus of the present invention. Fig. 7 is a schematic diagram of an alternate embodiment of a waveform generating unit for use in the present invention. Fig. 8 is a flow diagram illustrating the preferred embodiment of the method of the present invention. Before referring to the figures, a brief theoretical background discussion will be provided. It is desirable in modeling vocal tract action to amplify and suppress certain spectral ranges (modifications of spectrum of "signals" from vocal cords). A basic known canonical feedback digital filter transfer function appropriate for modeling a vocal tract may be expressed as: In models of vocal tract action, there is a need to transmit values of a i to a decoder from an encoder, so one must be able to quantize the values of a i . The most preferable quantization technique is the technique that uses the fewest bits in order to most efficiently employ the apparatus used for such transmission. Generally, the coefficient values a i have some undesirable qualities, such as: some coefficients a i are more sensitive than others; sometimes an error in one coefficient a i affects the entire spectrum sought to be represented. It has been found that it is better to transform the coefficients a i to a quantized transformation value which is, necessarily, capable of inversion to recover the original value from which the quantized value is transformed. There are many transformations; line spectrum pair (LSP) is one transformation. The apparatus and method of the present invention are appropriate for determining roots of the expressions which result from the LSP transformation. As is well known in the art of speech analysis and speech synthesis, a linear predictive coding (LPC) analysis results in an all-pole filter described by a transfer function involving parameters a i known as LPC coefficients. It is also well known that LPC coefficients are inappropriate for quantization primarily because of their wide dynamic range and variation of different LPC coefficients in their sensitivity to errors. Line spectrum pair parameters may be derived from a consideration of two extreme artificial boundary conditions applied to LPC coefficients. The resulting LSP parameters can be interpreted as the resonant frequencies of the vocal tract under the two extreme artificial boundary conditions at the glottis. The two polynomials which involve the line spectrum pair parameters possess some interesting properties summarized as follows: (1) all roots of the two polynomials lie on the unit circle in the complex plane; and (2) the roots of the two polynomials alternate each other on the unit circle so that the following relationship is always satisfied: 0 = ω 0 < ω 1 < ω 2 < ... ω p -1 < ω p < ω p +1 Even ω's are derived from one polynomial, and odd ω's are derived from the other polynomial. This is referred to as the ordering property of LSP parameters. Further, all roots of each of the polynomials (each of the polynomials is a fifth order polynomial) lie on the unit circle in the Z-plane (the complex plane) so that when the model (or the system represented by the model) is in equilibrium, the roots lie on the unit circle. Outside the unit circle the signal amplitude increases, and inside the unit circle the signal damps. Preferably, each polynomial is expressed in terms of cos ω. The inventors have found that intervals of π / 64 (i.e., ω= π / 64) will not miss any roots. Further, bisecting the π / 64 angle twice to make ω= π / 256 gives sufficient accuracy for purposes of decoding voice data. A useful method for more accurately determining the roots, at least approximately, of the LSP polynomials is by approximating the cosine of a bisecting angle within an interval given the cosine of the boundary angles, and determining in which half-angle interval the root lies. Thus, one can double the precision by which one determines where on the unit circle a root lies simply by halving an interval and determining within which newly-defined half-interval the root lies. It is known that cos (A + B) = 2cos A cos B - cos ( A - B ) If we let B = π / 64 (the incremental value), we can be assured that the intervals are established appropriately that no roots will be missed on the unit circle. As a practical matter, however, since the value B = π / 64is close to zero, the value of cos π / 64 is too close to 1 to be efficiently handled by digitally configured logical elements. That is, the value of cos π / 64 involves too many leading nines which must be carried and stored and manipulated throughout the various calculations required. Such inefficiency may be avoided by using the value (1-cos π / 64) to ease storage and processing requirements. Thus, Equation (3) may be rewritten as: cos ( A + B ) =2cos A - 2cos A (1- cos B) -cos (A - B ) Equation (4) is the equation used in the preferred embodiment of the present invention to "step around" the unit circle to locate the five roots of an LSP polynomial expression. However, for ease in understanding the invention, the remaining discussions explaining the invention will be based upon the expression in Equation (3). Fig. 1a is a schematic drawing of the angles and values employed in "stepping around" the unit circle to locate roots of a line spectrum pair expression. In Fig. 1a, ω or the step angle used to "step around" a unit circle 11 to determine location of roots of a line spectrum pair expression is illustrated as being equal to B, so that the radii 16, 18 delineate a sector 15 of unit circle 11, and radii 18, 19 delineate a sector 17 of unit circle 11. We know that: cos ( A + B ) = 2 cos B cos A -cos ( A - B ) Thus, sector 15 has an upper limit equal to the value cos A and has a lower limit equal to the value cos(A - B). Further, sector 17 has an upper limit equal to the value cos (A + B) and has a lower limit equal to the value cos A. If we let and let then: Therefore: Solving for Given stored values of predetermined values of the expression the bisection of step angle B can be easily performed using a computer apparatus. Typically, in the preferred embodiment of the present invention, only a very small number of stored values of the expression will be required. By such successive bisection, the technique for determining a root of an LSP expression may be very efficiently performed to a desired accuracy. For the purposes of a coarse search for roots, the value of cos B is a constant stored in a computer memory. Recalling Equation (5): cos ( A + B ) = 2 cos B cos A - cos ( A - B ) if one lets A = B / 2 and B = B / 2, Equation (5) may be written as: which reduces to: cos B = 2 cos B 2 cos B 2 - 1 Solving for cos B / 2: cos B 2 = cos B + 1 2 More generally stated for values of n other than n = 1: cos B 2 n = cos B 2 n -1 +1 2 Hence, the cosines of the successively bisected step angles B, B / 2, B / 2 2 , ... B / 2 n may be calculated in sequence and stored as required. One problem which has arisen is that the difference equation expressed as Equation (5) is difficult to calculate accurately for step angles B when using finite precision arithmetic, a common problem with computers. This difficulty arises from the loss of precision induced by leading nines in the value of cos B. For example, cos 1° equals 0.999847. It is often necessary to work with such small angle or phase increments in determining roots of line spectrum pair expressions to a sufficiently accurate certainty. One solution is to use the expression (1 - cos B) in the computation instead of the value of cos B. Thus, if one substitutes cos B = 1 - (1 - cos B) in Equation (5): cos ( A + B ) = 2cos A (1 - (1 - cos B )) - cos ( A - B ) which expands to: cos ( A + B ) = 2 cos A -2 cos A (1 -cos B ) - cos ( A - B ) An advantage of this representation is that (1-cos B) can be scaled so that all of the digits are significant. In terms of finite precision arithmetic implementation, the product (cos A (1 - cos B)) can be determined accurately and scaled before summing with the other components. Further, this formulation is ideal for application at locations in which the precision of the ALU (arithmetic logic unit) employed in a computer is greater than that of the multiplier. As a result, the values can be determined with minimal loss of precision. By similar logic, Equation (8) requires the use of values of and further bisection will require use of the values It is useful to rewrite Equation (8) as: If we let A = A + B, Equation (15) becomes: Recall the relationship (Taylor series): (1- x ) -1 = 1 + x + x 2 + x 3 + ...; | x | < 1 Therefore, if we let (1 - x) equal Equation (17) may be used to approximate (1 - x) -1 = 1 + x. Thus, if: then: and note: Therefore: Thus, an approximation to and, thence, to is provided by the stored values of 1-cos B / 2 n . Since x in this situation is very small by definition of its requirement for this process, then the approximation by the Taylor series is accurate, especially when finite precision arithmetic is being used. Thus, substituting Equation (21) into Equation (16) yields: As previously mentioned, for sufficiently small angles (10° is sufficiently small), the inventors have determined that the expression of Equation (21) is sufficiently accurate. Thus, given (1 - cos B), one can perform all of the operations required to determine the cosines of the angles of a line spectrum pair calculation using linear search bisection. Such an approach should be compatible with finite precision arithmetic generally used in computers. Thus, given Equation (5): cos ( A + B ) = 2 cos B cos A - cos ( A - B ) let cos X = 1-(1 - cos X); so that Equation (5) may be rewritten as: 1-(1-cos( A + B )) = 2[(1-(1-cos A )) (1-(1-cos B ))] - [1-(1-cos( A - B ))] Thus: 1-(1-cos ( A + B )) = 2 [1-(1-cos B )-(1-cos A ) + (1-cos A ) (1-cos B )] -1+(1-cos ( A + B )) Further reducing: 1-(1-cos ( A + B )) = 2+2[-(1-cos B )-(1-cos A ) + (1-cos A ) (1-cos B )] -1+(1-cos ( A - B )) Thus: - (1-cos ( A + B )) = 2 [-(1-cos B ) - (1-cos A ) + (1 -cos A ) (1-cos B )] +1(1-cos (A - B )) Thus: Thus: (1-cos ( A + B )) = -2[-1(1-cos B ) -(1-cos A ) + (1-cos A ) (1-cos B )] -1(1-cos( A - B )) (1-cos( A + B )) = 2[(1-cos A ) - (1-cos A ) (1-cos B ) + (1-cos B )] -(1-cos( A - B )) Equation (28) enables one to configure a waveform generator accurately for small angle increments for implementation of the present invention. Fig. 1b is a schematic drawing of angles and values employed in approximating the cosine of a bisecting angle of a sector given the cosines of boundary angles of the sector. In Fig. 1b, a unit circle 10 is illustrated as centered on a center point 12. A sector 14 of unit circle 10 is delineated by a lower limit at a radius 16 and an upper limit at a radius 18. Radii 16, 18 are separated by a step angle B. Step angle B is bisected to two half-step angles B / 2. Thus, a central point in sector 14 is defined as the value cos A at a point where a radius 20 intersects unit circle 10. Radius 20 is defined as a radius displaced from radius 16 by half-step angle B / 2. Consequently, the lower limit of sector 14 as defined by the intersection of radius 16 with unit circle 10 is a point having a value the upper limit of sector 14 defined by the intersection of radius 18 with unit circle 10 has a value of Equation (3) may be rewritten to fit the scheme of Fig. 1 as follows: Solving for cos A: In Fig. 1b, are end points of sector 14. Thus, if one knows one can solve for cos A. Clearly, one can more finely segment sector 14 by successively bisecting each half-step angle. Thus, the interval between successive radii in defining successively finer sectors may be expressed as Increasing the value of n will increase accuracy of the model for determining that a root of an equation lies in a subdivided sector defined by a step angle of For simplicity of explaining the present invention, the relationships below will be discussed using n = 1. If we let x=1-cos B / 2 n , then Taylor series (Equation (16)) provides (1-x) -1 ≈1+ x , for small x, so that: The inventors have found, by experimentation, that: Thus, one can closely approximate cos A (the cosine of the angle bisecting sector 14 in Fig. 1) by using Equation (32), and one can approximate a sub-sector to any desired accuracy by further halving the sub-sector. Fig. 2 is a schematic drawing of the preferred embodiment of a waveform generating unit for use in the present invention. In Fig. 2, a waveform generating unit 20 is illustrated which implements the expression of Equation (4). An input 22 provides an initial value for step angle B to a function generator 24 which provides an output (1 - cos B) on a line 26. Function generator 24 may be any known manner of device which takes an input such as a known step angle B and generates the value (1 - cos B) therefrom. That is, it may include a read only memory (ROM) or a random access memory (RAM), or a sinusoidal generating unit, or any other units known to those skilled in the art which can generate appropriate sinusoidal values. Line 26 provides the output from function generator 24 to a leading zero detect unit 28 via a line 27, and to a shift unit 30. The embodiment illustrated in Fig. 2 detects leading zeroes, contemplating storage and treatment of numbers within waveform generating unit 20 in decimal representation. Of course, other representation, storage and treatment formats will require somewhat different scaling techniques, such as detecting a sign bit and leading 1's or leading zeroes according to the value of the sign bit. Any scaling technique appropriate to a value representation approach is contemplated as applicable to and usable in the present invention. Leading zero detection is illustrated here in an exemplary role. Leading zero detect unit 28 provides an output at line 32 indicating the number m of leading zeros detected in the output provided via line 26, 27 from function generator 24 to leading zero detect unit 28. The number of leading zeros m is provided via a line 34 to shift unit 30 and shift unit 30 shifts m places to the left to effect a binary multiplication of 2 m in order to scale the output received via line 26 from function generator 24. Thus, a scaled value 2 m (1 - cos B) of the output value (1 - cos B) on line 26 is provided on line 36 to a multiplier 38. Considering Fig. 1a and Fig. 2 together, one may note that as the phasor, represented by radii 16, 18, 19 rotates counter-clockwise in Fig. 1a, the radius is represented by radius 18 occurs later than radius 16, and the next-occurring phasor in stepping along unit circle 11 in Fig. 1a is represented by radius 19. Radius 19 intersects unit circle 11 at a point represented by the value cos (A + B). Thus, when considering the output 40 of waveform generating unit 20 in Fig. 2, that output representing the value cos (A + B), a delay unit 42 receiving via line 41 the value cos (A + B) will generate on a line 43 the value cos A, since cos A is the once-earlier value of the intersection of the phasor with unit circle 11 as the phasor steps around unit circle 11 by increments measured by step angle B. The signal on line 43 representing the value cos A is provided as an input to delay unit 44, as an input to multiplier 38, and to a scaling unit 46. Scaling unit 46 shifts digits in the signal carried on line 43 to the left one space to effect a binary multiplication by two. Thus, the signal on a line 47 is equal to two times the signal present on input line 45. That is, line 47 carries the value 2 cos A. Line 47 provides that value (2 cos A) as an input to adder 48. The signal carried on line 36 represents the value 2 m (1 - cos B) and is provided as a second input to multiplier 38. Multiplier 38 generates a signal on an output line 50 representing a value 2 m (cos A (1 - cos B)); the signal on line 50 is provided as an input to shift unit 52. Shift unit 52 shifts to the right m places (m being the number of leading zeroes detected by leading zero detect unit 28) to rescale the signal received from multiplier 38 via line 50. Shift unit 52 generates on an output line 54 a signal representing the value cos A (1 - cos B), which value is provided as an input to scaling unit 56. A multiplier 58 multiplies the output received from scaling unit 56 by the quantity - 1 and provides a signal to adder 60 which represents the value - 2 cos A (1 - cos B) Delay unit 44 generates a signal on a line 61 representing the value cos (A - B), which is the next-preceding phasor intersect on the unit circle 11 (see Fig. 1a). The value cos (A - B) is provided to a multiplier 62 which multiplies that value by - 1. Multiplier 62 provides a signal on a line 63 representing the value - cos (A - B) as a second input to adder 60. Of course, for proper operation of waveform generating unit 20, delay unit 42 must be initialized to cos (-B) and delay unit 44 must be initialized to zero to properly initiate operations. Adder 60 provides a signal on a line 64 representing the value - 2 cos A (1 - cos B) - cos (A - B) to adder 48. Adder 48 provides a signal on line 65 representing the sum of inputs received via lines 47, 64 [2 cos A - 2 cos A (1 - cos B) - cos (A - B)], which (by Equation (4)) equals the value cos A + B. The signal representing the value cos A is generated via a line 66 from line 43 to an output 68. In order to facilitate understanding the present invention, like elements will be identified by like reference numerals in the various drawings. Fig. 3 is a schematic drawing of the preferred embodiment of a polynomial zero crossing detector unit for use in the present invention. In Fig. 3, a polynomial zero crossing detector 69 is illustrated and includes a waveform generating unit 20 of the sort described in connection with Fig. 2. Waveform generating unit 20 receives an input 26 bearing a signal representing the value (1 - cos B). Waveform generating unit 20 generates the value cos (A + B) at an output 40, and generates a value cos A at an output 68. A line 70 delivers the value cos (A + B) from line 40 to a polynomial treating unit 72. Polynomial treating unit 72 receives the value cos (A + B) via line 70. Polynomial treating unit 72 evaluates the polynomial (preferably, in the present embodiment of the invention, a line spectrum pair polynomial) for the value received on line 70 and generates an evaluation value of that particular polynomial treated by polynomial treating unit 72 on an output line 74. The evaluation value of the particular polynomial treated by polynomial treating unit 72 for the value provided via line 70 is provided at an input 76 of a sign change detecting unit 78. A delay unit 80 also receives the output from polynomial treating unit 72 via a line 82 and generates an evaluation value for evaluation of the polynomial treated by polynomial treating unit 72 during a once-previous time. That is, the output of delay unit 80 on line 84 is an evaluation value for the polynomial treated by the polynomial treating unit 72 at the value cos A. This evaluation value for the polynomial at value cos A is provided to an input 86 of sign change detecting unit 78. Sign change detecting unit sends a sign change detected signal via a line 88 to a buffer 90. Buffer 90 also receives via line 40 the value cos (A + B), and via line 68 the value cos A. The sign change detected signal provided via line 88 to buffer 90 switches buffer 90 on when there is a sign change detected by sign change detecting unit 78. Output 92 of buffer 90 generates an output representing the value cos (A + B), and output 94 of buffer 90 generates an output representing the value cos A. Outputs 92, 94 are updated when a sign change is detected by sign change detector 78 and a sign change detected signal is provided via line 88 to buffer 90. Stated another way, the values of cos A + B (on line 40) and cos A (on line 68) are gated through buffer 90 to outputs 92, 94 when sign change detecting unit 78 detects a sign change between its signals received at inputs 76 and 86 and sends a sign change detected signal via line 88 to turn on buffer 90. As a result, the signals provided at outputs 92, 94 from buffer 90 are such that a zero (i.e., a root) of the polynomial treated by polynomial treating unit 72 lies between the angles A and (A + B), which are represented by the values cos A and cos (A + B) Fig. 4 is a schematic drawing of the preferred embodiment of a half-angle generating unit for use in the present invention. In Fig. 4, a half-angle generating unit 96 implements the expression of Equation (32). Thus, the output 102 of half-angle generating unit 96 carries a signal representing the value 1-cos B / 2 n +1 · This signal is also applied via a line 104 to a delay unit 100. Delay unit 100 presents at its output line 106 a signal representing the value 1-cos B / 2 n . Reset values are occasionally provided to delay unit 100 via a line 98 representing the value (1-cos B). The output carried on line 106 is applied to a scaling unit 108 which shifts digits to the right two places to effect a division of the signal received via line 106 by four. Thus, the output of scaling unit 108 carried on line 110 is a signal which represents the value 1-cos B 2 n 4 . That signal is applied via a line 112 to a leading zero detect unit 114, is applied via a line 116 to a shift unit 118, and is applied via a line 120 to a summing unit 122. Leading zero detect unit 114 generates at an output line 124 a signal representing m, the number of leading zeros detected in the value received via line 112. As described before in discussing leading zero detection, any scaling apparatus appropriate for scaling numbers represented in a given format may be employed in place of leading zero detect unit 114. The value m is applied via a line 126 to shift unit 118, and via a line 128 to a scaling unit 130. Shift unit 118 shifts digits contained in the signal received via line 116 to the left m places to effect a multiplication by the quantity 2 m so that the output generated on line 132 from shift unit 118 represents the value Scaling unit 130 effects a shift to the left by one place to effect a multiplication by 2 to generate on a line 134 a signal representing the value 2m. The value 2m is applied via line 134 to a shift unit 136. The signal carried on line 132 is applied to a squaring unit 138. Squaring unit 138 generates an output signal line 140 representing the value The signal is applied via line 140 to shift unit 136; shift unit 136 generates an output signal on line 142 representing the value received via line 140 divided by A scaling unit 144 shifts digits in signals received via line 142 to the right one place to effect a division by 2 so that signals carried on an output line 146 from scaling unit 144 to summing unit 122 represent the value Summing unit 122 generates on an output line 148 the value As we know from Equation (31), that approximately equals 1-cos B / 2 n +1 . Fig. 5 is a schematic drawing of the preferred embodiment of an angle bisecting unit for use in the present invention. In Fig. 5, an angle bisecting unit 150 implements the expression of Equation (22). Angle bisecting unit 150 receives two inputs 152, 154 which are appropriate for connection with outputs 92, 94 of the polynomial zero crossing detector unit 69 illustrated in Fig. 3. Preferably, input 152 receives a signal representing the value cos (A + B), and input 154 receives a signal representing the value cos A. Both inputs 152, 154 are applied to a summing unit 156. Summing unit 156 generates a signal on a line 158 which represents the value cos (A + B) + cos A. The signal is applied to a scaling unit 160. Scaling unit 160 shifts digits contained in the signal provided on line 158 to the right one space, thereby effecting a binary division by two so that scaling unit 160 generates on a line 162 a signal representing the value cos( A + B ) + cos A 2 . Line 162 is connected to a multiplier 164. A second input to multiplier 164 is provided via a line 166. Line 166 carries a signal representing the value Thus, the output line 168 from multiplier 164 carries a signal representing the value According to Equation (22), that value equals Fig. 6 is a schematic drawing of the preferred embodiment of the apparatus of the present invention. In Fig. 6 a root determining apparatus 170 is illustrated which includes a polynomial zero crossing detector 69 (Fig. 3), which includes a waveform generating unit 20 (Fig. 2); a half-angle generating unit 96 (Fig. 4); a delay unit 172; and switches 174, 176, 178. Also included in root determining apparatus 170 are an angle bisecting unit 150 (Fig. 5); polynomial treating units 180, 182, 184; zero crossing detectors 186, 188; a select logic unit 190; and a selector unit 192. An input is provided to root determining apparatus 170 via a line 194 in the form of a signal representing the value 1 - cos B. This input signal is provided via a line 26 to waveform generator 20 in polynomial zero crossing detector 69, and is also provided via a line 98 and a pole 198 of switch 178 to half-angle generating unit 96. Half-angle generating unit 96 generates a signal on a line 102 representing the value 1-cos B / 2 n +1 and provides that signal to delay unit 172 as well as to an input 214 of angle bisecting unit 150. Delay unit 172 generates a signal on a line 200 representing the value 1-cos B / 2 n and applies that value to a pole 202 of switch 178. Polynomial zero crossing detector 69 provides at its output 92 a signal representing the value cos (A + B), and applies that value to a pole 204 of switch 174. Polynomial zero crossing detector 69 also generates a signal on its output 94 representing the value cos A, and applies that signal to a pole 206 of switch 176. Of course, recalling the explanation of polynomial zero crossing detector 69 in connection with Fig. 3, polynomial crossing detector 69 ensures that the values represented by the signals generated on outputs 92, 94 bracket a zero solution of the line spectrum pair polynomial treated by the polynomial treating unit 72 (Fig. 3) in polynomial zero crossing detector 69. Switches 174, 176, 178 are arranged for accommodating initial setup of root determining apparatus 170 in a first orientation and for accommodating segmenting operations of root determining apparatus 170 in a second orientation. Thus, when switch 174 connects pole 203 with pole 204, and when switch 176 connects pole 205 with pole 206, and when switch 178 connects pole 201 with pole 198, then root determining apparatus 170 is configured for initial/reset operation. In the initial/reset operation configuration, the signal on output 92 is provided to a selector unit 192 at a selector unit input 210, and the signal on output 94 is applied to a selector unit input 212 of selector unit 192. Similarly, in the initial/reset operation configuration, the input carried on line 98 representing the value 1-cos B is applied to half-angle generating unit 96. The signal generated by half-angle generating unit 96 on line 102 is provided via a line 103 to an input 214 of angle bisecting unit 150. Angle bisecting unit 150 provides at its output 168 (Fig. 5) a signal representing the value which is applied to a selector unit input 213 of selector unit 192. In the initial/setup operation configuration wherein output 92 is connected via poles 203, 204 with selector unit input 210, and wherein output 94 is connected via poles 205, 206 with selector unit input 212, selector unit 192 selects input signals representing the quantity cos ( A + B ) for application to its output 216 as the upper limit U p of a sector (such as sector 15 of Fig. 1a) and selector unit 192 selects signals representing the quantity cos A from selector unit input 212 for application to its output 218 to represent the lower limit L p of a sector such as sector 15 of Fig. 1a. In such an initial/setup operation configuration, selector unit 192 does not consider signals appearing at its input 213 for application to its outputs 216, 218. So long as the initial, or coarse, solution of the location of roots is sufficient without further bisection of a sector (such as sector 15 of Fig. 1a) root determining apparatus 170 does not involve angle bisecting unit 150 in determining upper limit U p and lower limit L p outputs for its outputs 216, 218. Following the initial determination of the first-sector 15 established by upper limit U p and lower limit L p by root determining apparatus 170, the next iteration of parameters is generated and dealt with, and root determining apparatus 170 remains in its initial/reset operation configuration as root determining apparatus 170 "steps around" unit circle 11 in increments established as sectors 15, 17 (Fig. 1a). This is so in the case where the coarse (or first cut) estimation of location of roots on the unit circle suffices and there is no need to further segment sector 15 (Fig. 1a) to more finely determine location of roots on unit circle 11. If a finer segmentation of sector 15 is required to more accurately locate roots on unit circle 11, then switch 174 is reoriented to connect pole 203 with pole 220, switch 176 is reoriented to connect pole 205 with pole 222, and switch 178 is reoriented to connect pole 201 with pole 202. In such a segmenting operations configuration, angle bisecting unit 150 is operationally included in root determining apparatus 170 so that upper limit U p is provided via a feedback line 224 and a line 226 to an input 228 of angle bisecting unit 150. Similarly, lower limit L p is provided via a feedback line 230 and a line 232 to an input 234 of angle bisecting unit 150. Still further, input from delay unit 172 is provided via line 200 and via switch 178 to the input of half-angle generating unit 96. Still further, line 226 provides upper limit U p to a polynomial treating unit 180, line 232 provides lower limit L p to polynomial treating unit 184, and output 168 from bisecting unit 150 is provided via a line 236 to a polynomial treating unit 182. Polynomial treating units 180, 182, 184 preferably are similar to polynomial treating unit 72 (Fig. 3) in that they each provide an evaluation value to the polynomial for which roots are sought by root determining apparatus 170 for the values provided via their respective input lines 226, 236, 232. Thus, an evaluation value for the polynomial for which roots are sought by root determining apparatus 170 is provided for the value received via line 226 by polynomial treating unit 180 on an output line 240 to a zero crossing detector 186. An evaluation value for the polynomial for which roots are sought is provided for the value received via input 236 by polynomial treating unit 182 on an output 242 to zero crossing detector 186 and to a zero crossing detector 188. Similarly, an evaluation value for the polynomial for which roots are sought is provided for the value provided via input 232 on an output line 244 to zero crossing detector 188. Zero crossing detector 186 provides an output via a line 246 to a select logic unit 190, and zero crossing detector 188 provides an output via a line 248 to select logic unit 190. Thus, select logic unit 190 receives an indication via lines 246, 248 whether a zero crossing occurs between the values cos ( A + B ) and (via line 246) or whether a zero crossing occurs between the values cos A and (via line 248). That is, select logic unit 190 selects values to define the interval containing the zero crossing: an upper half-sector between lower limit and upper limit cos (A + B), or a lower half-sector between lower limit cos A and upper limit A signal is provided by select logic unit 190 via a line 250 to an input 252 to selector unit 192 indicating which half-sector contains the zero crossing. Selector unit 192 contains logic which (1) defines a sector having an upper limit U p (on output 216) set to the value received via input and having a lower limit L p (on output 218) set to the value received via input 212 [cos A] when the input from select logic unit 192 via line 250 indicates that the zero crossing occurred in the lower half-sector bounded by cos A and or (2) defines a sector having an upper limit U p set to the value received via input 210 [cos A + B], and having a lower limit L p set to the value received via input when select logic unit 190 outputs a signal to selector unit 192 via line 250 that indicates the zero crossing occurred in the upper half-sector bounded by values and cos (A + B). If further refinement of accuracy in determining the location of a root on unit circle 11 is required, delay unit 172 delivers via line 200 and switch 178 to the input of half-angle generating unit 96 a signal representing 1-cos B / 2 n . Half-angle generating unit 96 provides a signal representing 1-cos B / 2 n +1 to input 214 of angle bisecting unit 150 via lines 102, 103. Angle bisecting unit 150 uses inputs received at input 214 to further bisect sector 15 whereby each half-sector is now reestablished as a newly-defined sector having an upper limit U p and a lower limit L p which is then bisected. Zero crossing is determined to be either in the lower half-sector (line 248 to select logic 190) or in the upper half-sector (line 246 to select logic unit 190) of one of the newly-defined sectors. Selector unit 192 proceeds with the half-sector containing a zero crossing as a next-newly-defined sector for the next bisecting iteration. Fig. 7 is a schematic diagram of an alternate embodiment of a waveform generating unit for use in the present invention. In particular, Fig. 7 illustrates a waveform generating unit for use in the present invention when angles A and B are small enough that leading nines in the quantities cos A or cos B indicate it is useful to use quantities (1 - cos A) or (1 - cos B) in their place to ensure that all digits used to represent the required values in root determination operations are significant digits. Thus, Fig. 7 implements Equation (28) to enable one to configure a waveform generator accurately for small angle increments for implementation of the present invention. In Fig. 7, a waveform generating unit 260 receives an input on a line 262 representing the quantity (1 - cos B). The input received via line 262 is provided via a line 264 to a leading zero detect unit 266 and, via a line 268, to a summing unit 270. Leading zero detect unit 266 generates an output on a line 272 representing the number m of leading zeroes detected in the input received via line 264. As described before regarding leading zero detection, leading zero detect unit 266 may be replaced by any scaling apparatus appropriate to the number format used. The signal representing m is applied via a line 274 to a scaling unit 276, and is provided via a line 278 to a scaling unit 280. The input signal applied at input line 262 is applied to scaling unit 276 so that scaling unit 276 provides a signal on line 282 representing the signal received via line 262 multiplied times 2 m . The output signal provided at output 284 of waveform generating unit 260 is a signal representing the quantity 1 - cos (A + B), and the output signal provided at output 286 is a signal representing the quantity 1 - cos A. Delay unit 288 receives the signal provided at output 284 via a feedback line 290 so that the output provided on line 292 from delay unit 288 is a signal representing the quantity 1 - cos A. That signal is provided to a delay unit 294, to a multiplier 296, and to output 286 via a line 311. Of course, delay units 288, 294 must be appropriately initialized to ensure proper operation of waveform generating unit 260. Delay unit 294 generates a signal on an output line 298 representing the quantity 1 - cos (A - B), which signal is applied to a multiplier 300. Multiplier 300 effects a multiplication by the quantity - 1. Multiplier 296 multiplies the value received via line 282 (i.e., 2 m (1 - cos B)) times the value received via line 292 (i.e., 1 - cos A) and generates a signal on a line 302 representing the quantity 2 m (1 - cos A) (1 - cos B). Multiplier 303 multiplies the value received via line 302 by the quantity -1, and produces on line 305 a signal representing the quantity -2 m (1 - cos A) (1 - cos B) Multiplier 300 generates a signal on a line 304 representing the quantity - (1 - cos (A - B)). The signal carried on line 304 is applied to a summing unit 306. The signal carried on line 305 is applied to scaling unit 280. Scaling unit 280 provides a signal on line 308 representing the signal received via line 302 divided by 2 m , so that scaling unit 280 generates on line 308 a signal representing the value - (1 - cos A) (1 - cos B), which signal is applied to summing unit 270. The signal carried on line 292 representing 1 - cos A is also applied via a line 309 to summing unit 270. Summing unit 270 generates a signal on a line 310 representing the value - (1 - cos A) (1 - cos B) + (1 - cos A) + (1 - cos B) The signal carried on line 310 is applied to a scaling unit 312 to multiply the signal received via line 310 times 2. Scaling unit 312 generates a signal on a line 314 representing the value 2 ((1 - cos A) - (1 - cos A) (1 - cos B) + (1 - cos B)). The signal carried on line 314 is applied to summing unit 306 so that summing unit 306 generates on output line 284 a signal representing the quantity 2 ((1 - cos A) - (1 - cos A) (1 - cos B) + (1 - cos B)) - (1 - cos (A - B)). We know from Equation (28) that the quantity represented by the signal on line 284 equals the value 1 - cos (A + B). Figure 8 is a flow diagram illustrating the preferred embodiment of the method of the present invention. In Fig. 8, the method begins with "Start" at block 320 and a counter n is set to 0 at block 322. The values cos A and cos (A + B) are calculated (or retrieved from storage, or otherwise determined) in block 324 and are employed in block 326 to determine a solution for the polynomial G(X) for each of the two values (cos A = X n-1 , and cos (A + B) = X n ). By block 328 an inquiry is made whether a sign change occurred in the values of the polynomial G(X) in the interval between X n-1 and X n . If no sign change has occurred, then no root is present in the interval then being investigated and the "No" branch 330 is taken to decision block 332 where a check is made whether all intervals on unit circle 11 (Fig. 1a) have been checked. If all intervals have been checked, the "Yes" branch 334 is taken to "END" 336. If not all intervals have been checked, then "No" branch 338 is taken from decision block 332, counter n is incremented by block 340 and fed back via branch 342 to block 324 for recalculation of a new interval X n-1 , X n . If the response in decision block 328 regarding presence of a sign change in the interval being considered is affirmative, the method proceeds via "Yes" branch 344 to decision block 346 where inquiry is made whether greater accuracy is required in determining location of the root found in decision block 328. If no further accuracy is required, the "No" branch 348 is taken to a function block 350 which effects outputting the interval containing the root (X n-1 , X n ) and then proceeds via branch 352 to decision block 332 for determination whether all intervals on unit circle 11 have been checked. Subsequent decisions and operations occur as described above in connection with answers to the query posed by decision block 332. If it is decided at decision block 346 that more accuracy is required, then "Yes" branch 354 is taken. A counter p is set at block 356 and provided via branch 358 to block 360. In block 360, an upper limit U p is set equal to X n , a lower limit L p is set equal to X n-1 , and a half-angle increment HA p is set equal to initially p = 1. These values are provided via a branch 362 to a block 364. Block 364 implements Equation (22), where the value of upper limit U p is equal to the value cos (A + B) and the value of lower limit L p is equal to the value cos A. The value M p indicated in block 364 is the midpoint of the particular segment being addressed by block 364 and equals the value Using the values computed in blocks 360, 364, block 366 evaluates the polynomial G(X) for those values and provides evaluation values to decision block 368. Decision block 368 determines whether there is a sign change in the interval between lower limit L p and midpoint M p . If there is such a sign change, then the root of the polynomial G(X) is in the lower half-sector in the interval L p , M p of the sector determined in block 324 and bounded by X n-1 , X n . "Yes" branch 370 is taken so that the next iterative sector limits for possible subsequent bisecting of the sector are established in block 372 for a newly-defined sector: a newly-defined lower limit L p+1 being set at the original lower limit L p , and a newly-defined upper limit U p+1 being set at the midpoint M p . Those newly-defined limit values L p+1 , U p+1 are provided to decision block 374 and inquiry is made whether further accuracy is required. If no further accuracy is required, "No" branch 376 is taken to block 350 where the interval containing the root (now defined by newly-defined lower limit L p+1 and newly-defined upper limit U p+1 ) is output and the method proceeds via branch 352 to query whether all intervals are checked (decision block 332). Subsequent decisions and operations occur as previously described in connection with answers to the query posed by decision block 332. If further accuracy is required, "Yes" branch 378 is taken to block 380 in which the half-angle increment HA p+1 for the next iteration of accuracy (i.e., next bisection of the newly-defined sector established in block 372) is calculated implementing Equation (32). The newly calculated half-angle increment HA p+1 is provided via branch 382 to block 364 for calculating of a new midpoint M p . Determination of evaluation values of the polynomial G(X) is effected in block 366 for a new lower limit L p (as determined in block 372), a new midpoint M p (as determined in block 364), and a new upper limit U p (as determined in block 372). The method may continue in this loop (from decision block 368, to block 372, to decision block 374, to block 380, to block 364, and to block 366) until the response to the query posed by decision block 374 is negative, indicating that sufficient accuracy had been achieved in root location determination, whence the method proceeds via "No" branch 376 from decision block 374 as previously described. If decision block 368 determines that no sign change has occurred in the interval L p , M p , then "No" branch 384 is taken from decision block 368 to block 386. In block 386 a newly-defined lower limit L p+1 is set at midpoint M p and a newly-defined upper limit U p+1 is set at upper limit U p . Those newly-defined limits L p+1 , U p+1 delimit a newly-defined sector established by block 386 which is the upper half-sector of the sector defined in block 360. Block 386 provides these newly-defined limit values via a branch 388 to decision block 374 and the method proceeds thereafter as previously described. It is to be understood that, while the detailed drawings and specific examples given describe preferred embodiments of the invention, they are for the purpose of illustration, that the apparatus and method of the invention are not limited to the precise details and conditions disclosed and that various changes may be made therein without departing from the spirit of the invention which is defined by the following claims.

Claims: An apparatus for analyzing speech signals to determine parameters expressive of characteristics of the speech signals, comprising: a linear predictive coding (LPC) analysis unit configured to convert speech signals to LPC parameters; a transformation unit configured to transform said LPC parameters to a corresponding line spectrum pair (LSP) expression ; characterized by a waveform generating unit (20), said waveform generating unit (20) having a first input (22) for receiving a representation of an initial value for locating a first site on said unit circle (10), and having a second input for receiving a representation of a step value for defining an arc-distance on said unit circle (10); said waveform generating unit (20) generating a plurality of intervals (15, 17) on said unit circle (10), each interval (15, 17) of said plurality of intervals (15, 17) having a lower limit and an upper limit, said plurality of intervals (15, 17) including an initial interval (15) and a plurality of succeeding intervals (17); said lower limit of said initial interval (15) being said initial value, said upper limit of said initial interval (15) being displaced on said unit circle (10) from said initial value by said arc-distance; each respective succeeding interval (17) of said plurality of succeeding intervals (17) having its respective lower limit coincident with said upper limit of the next-preceding interval of said plurality of intervals (15, 17), each said respective succeeding interval having its respective upper limit displaced on said unit circle (10) from its respective lower limit by said arc-distance; and a polynomial zero detecting unit (69) coupled with said waveform generating unit (20), said polynomial zero detecting unit (69) receiving said plurality of intervals (15, 17) and evaluating said line spectrum pair expression (408) for at least said upper limit and said lower limit for each said respective interval of said plurality of intervals (15, 17); said polynomial zero detecting unit (69) recognizing presence of a respective root of said plurality of roots when said line spectrum pair expression (408) changes sign within a particular interval of said plurality of intervals (15, 17), said polynomial zero detecting unit (69) designating each said particular interval as a solution interval; said polynomial zero detecting unit (69) generating said lower limit and said upper limit of each said solution interval; wherein the plurality of roots present in said solution intervals express the characteristics of the speech signals ; an angle bisecting unit (150) coupled with said polynomial zero detecting unit (69), said angle bisecting unit (150) receiving said solution interval and performing a bisecting operation defining a lower refined solution interval and an upper refined solution interval; and a selection unit (190) coupled with said angle bisecting unit (150) and with said polynomial zero detecting unit (69); said selection unit (190) generating a lower limit output and an upper limit output appropriately to indicate whether said respective root is located in said lower refined solution interval or in said upper refined solution interval. An apparatus for analyzing speech signals as recited in Claim 1 wherein the apparatus further comprises: a half distance generating unit (96) coupled with said second input of said waveform generating unit (20), said half distance generating unit (96) generating a half-arc-distance, said half-arc-distance being one-half said arc-distance; the angle bisecting unit (150) coupled with said half distance generating unit (96), said angle bisecting unit (150) receiving said half-arc-distance; said lower refined solution interval having a lower refined lower limit at said lower limit of said solution interval and having a lower refined upper limit displaced on said unit circle (10) from said lower refined lower limit said half-arc-distance; said upper refined solution interval having an upper refined upper limit at said upper limit of said solution interval and having an upper refined lower limit displaced on said unit circle (10) from said upper refined upper limit said half-arc-distance. An apparatus for analyzing speech signals as recited in Claim 2 wherein said half distance generating unit (96) and said angle bisecting unit (150) cooperate to successively perform said bisecting operation to iteratively bisect each solution interval into a successive upper refined solution interval and a successive lower refined solution interval, said respective root being located within one of said successive upper refined solution interval and said successive lower refined solution interval, said successive bisecting operation being iteratively effected until a predetermined desired accuracy of said arc-length is included in a successive refined solution interval. An apparatus for analyzing speech signals as recited in Claim 1 wherein said initial value is expressed as a sinusoidal value of an angular displacement on said unit circle (10) and wherein said step value is expressed as a sinusoidal value of a step-angular displacement on said unit circle (10). An apparatus for analyzing speech signals as recited in Claim 2 wherein said initial value is expressed as a sinusoidal value of an angular displacement on said unit circle (10) and wherein said step value is expressed as a sinusoidal value of a step-angular displacement on said unit circle (10). A method for analyzing speech signals to determine parameters expressive of characteristics of the speech signals (400), comprising steps of: converting speech signals to linear predictive coding (LPC) parameters ; transforming said LPC parameters to a corresponding line spectrum pair (LSP) expression; characterized by locating a plurality of roots of said LSP expression, said roots being the parameters expressive of the speech characteristics, including steps of: receiving a representation of an initial value for locating a first site on a unit circle (10); receiving a representation of a step value for defining an arc-distance on said unit circle (10); generating a plurality of intervals (15, 17) on said unit circle (10), each interval of said plurality of intervals (15, 17) having a lower limit and an upper limit, said plurality of intervals including an initial interval (15) and a plurality of succeeding intervals (17); said lower limit of said initial interval (15) being said initial value, said upper limit of said initial interval (15) being displaced on said unit circle (10) from said initial value by said arc-distance; each respective succeeding interval of said plurality of succeeding intervals (17) having its respective lower limit coincident with said upper limit of the next-preceding interval of said plurality of intervals (15, 17), each said respective succeeding interval having its respective upper limit displaced on said unit circle (10) from its respective lower limit by said arc-distance; evaluating said line spectrum pair expression for at least said upper limit and said lower limit of each said respective interval of said plurality of intervals (15, 17); recognizing presence of a respective root of said plurality of roots when said line spectrum pair expression changes sign within a particular interval of said plurality of intervals (15, 17); designating each said particular interval as a solution interval; generating said lower limit and said upper limit of each said solution interval, wherein the plurality of roots present in said solution intervals express the characteristics of the speech signals ; performing a bisecting operation defining a lower refined solution interval and an upper refined solution interval; and generating a lower limit output and an upper limit output appropriately to indicate whether said respective root is located in said lower refined solution interval or in said upper refined solution interval. A method for analyzing speech signals as recited in Claim 6 wherein the method comprises the further steps of: generating a half-arc-distance, said half-arc-distance being one-half said arc-distance; said lower refined solution interval having a lower refined lower limit at said lower limit of said solution interval and having a lower refined upper limit displaced on said unit circle (10) from said lower refined lower limit said half-arc-distance; said upper refined solution interval having an upper refined upper limit at said upper limit of said solution interval and having an upper refined lower limit displaced on said unit circle (10) from said upper refined upper limit said half-arc-distance. A method for analyzing speech signals as recited in Claim 7 wherein the method comprises the further steps of: successively performing said bisecting operation to iteratively bisect each solution interval into a successive upper refined solution interval and a successive lower refined solution interval, said respective root being located within one of said successive upper refined solution interval and said successive lower refined solution interval, said successive bisecting operation being iteratively effected until a predetermined desired accuracy of said arc-length is included in a successive refined solution interval. A method for analyzing speech signals as recited in Claim 6 wherein said initial value is expressed as a sinusoidal value of an angular displacement on said unit circle (10) and wherein said step value is expressed as a sinusoidal value of a step-angular displacement on said unit circle (10). A method for analyzing speech signals as recited in Claim 7 wherein said initial value is expressed as a sinusoidal value of an angular displacement on said unit circle (10) and wherein said step value is expressed as a sinusoidal value of a step-angular displacement on said unit circle (10). A computer apparatus for analyzing speech signals to determine parameters expressive of characteristics of the speech signals , comprising: a linear predictive coding (LPC) analysis means for converting speech signals to LPC parameters ; a transforming means for transforming said LPC parameters to a corresponding line spectrum pair (LSP) expression ; characterized by a waveform generating means (20) for generating a lower limit value and an upper limit value for each respective interval of a plurality of intervals (15, 17) on said unit circle (10); said plurality of intervals (15, 17) being adjacent, each said respective interval subtending a predetermined arc-distance; a root detecting means (170) coupled with said waveform generating means (20) for detecting said roots; said root detecting means (170) receiving said lower limit values and said upper limit values and determining an evaluation value for said line spectrum pair expression for at least said lower limit value and said upper limit value for each said respective interval (15, 17); said root detecting means (170) designating a particular said respective interval (15, 17) a solution interval when said evaluation value changes sign within said particular respective interval; said root detecting means (170) generating said lower limit value and said upper limit value of each said solution interval; wherein the plurality of roots present in said solution intervals express the characteristics of the speech signals ; an angle bisecting means (150) coupled with said root detecting means (170) for receiving said solution interval and performing a bisecting operation defining a lower refined solution interval and an upper refined solution interval; and a selection means (190) coupled with said angle bisecting means (150) and with said root detecting means (170) for generating a lower limit output and an upper limit output appropriately to indicate whether said respective root is located in said lower refined solution interval or in said upper refined solution interval. An apparatus for analyzing speech signals as recited in Claim 11 wherein the apparatus further comprises: a half distance generating means (96) coupled with said waveform generating means (20) for generating a half-arc-distance, said half-arc-distance being one-half said arc-distance; the angle bisecting means (150) coupled with said half distance generating means (96) for receiving said solution interval, said lower refined solution interval having a lower refined lower limit at said lower limit of said solution interval and having a lower refined upper limit displaced on said unit circle (10) from said lower refined lower limit said half-arc-distance; said upper refined solution interval having an upper refined upper limit at said upper limit of said solution interval and having an upper refined lower limit displaced on said unit circle (10) from said upper refined upper limit said half-arc-distance. An apparatus for analyzing speech signals as recited in Claim 12 wherein said half distance generating means (96) and said angle bisecting means (150) cooperate to successively perform said bisecting operation to iteratively bisect each solution interval into a successive upper refined solution interval and a successive lower refined solution interval, said respective root being located within one of said successive upper refined solution interval and said successive lower refined solution interval, said successive bisecting operation being iteratively effected until a predetermined desired accuracy of said arc-length is included in a successive refined solution interval. An apparatus for analyzing speech signals to determine parameters expressive of characteristics of the speech signals , comprising: a linear predictive coding (LPC) analysis unit configured to convert speech signals to LPC parameters ; a transformation unit configured to transform said LPC parameters to a corresponding line spectrum pair (LSP) expression ; characterized by a digital waveform generating unit (20) including a first waveform input (22) for receiving an initial value for locating a waveform site on the unit circle (10), a second waveform input for receiving a representation of a step value for defining an arc-distance on the unit circle (10), and a waveform output (92, 94) for providing a plurality of intervals (15, 17), the waveform generating unit (20) generating the plurality of intervals (15, 17) on the unit circle (10), each interval of the plurality of intervals (15, 17) having a lower limit and an upper limit, wherein a difference between the upper limit and the lower limit is the step value; and a digital polynomial zero detecting unit (69) including a line spectrum pair polynomial unit (72), a delay unit (80), a sign change detecting unit (78), and a buffer (90), the line spectrum pair polynomial unit (72) having a unit input (70) coupled to the waveform output (40) of the waveform generating unit (20) and a unit output (74), the polynomial unit (72) providing a polynomial output signal at the unit output (74), the delay unit (80) having a delay input (82) coupled to the unit output (74) and a delay output (84), the delay unit (80) providing a delayed output signal at the delay output (84), the sign change detecting unit (78) having a first detecting input (76) coupled to the unit output (74), a second detecting input (86) coupled to the delay output (84) , a detecting output (88) coupled to the buffer (90), wherein the buffer unit (90) stores an interval of said intervals (15, 17) provided at the waveform output (40) when the sign change detecting unit (78) determines a sign change between the polynomial output signal received at the first detecting input (76) and the delay output signal at the second detecting input (86), wherein the interval stored in the buffer (90) represents one of the plurality of roots of the line spectrum pair expression (408); wherein the plurality of roots present in said intervals (15, 17) express the characteristics of the speech signals ; and a digital half distance generating unit (96) coupled to the digital waveform generating unit (20) for reducing the difference of the upper and lower limits provided by the digital waveform generating unit (20). An apparatus for analyzing speech signals as recited in claim 14 wherein the upper limit and lower limit are represented as a sinusoidal value. An apparatus for analyzing speech signals as recited in claim 14 wherein the digital waveform generating unit (20) includes a random access memory. An apparatus for analyzing speech signals as recited in claim 14 wherein the waveform generating unit (20) includes a plurality of adders and delay units. An apparatus for analyzing speech signals as recited in claim 14 wherein the waveform generating unit (20) further includes a function generator which generates a value of 1-cos of a selected angle. An apparatus for analyzing speech signals as recited in claim 14 wherein the waveform generating unit (20) further includes a zero detect unit (28).

Inventors: ASGHAR SAFDAR M, IRETON MARK A, ASGHAR, SAFDAR M., IRETON, MARK A.
Applicants: ADVANCED MICRO DEVICES INC, ADVANCED MICRO DEVICES INC.
Application year: 1995
Main classification: G10L19
IPC codes: G10L19, G06F17, G10L11