The present invention relates, in general, to communication systems and, more particularly, to coding information signals in such communication systems.
Digital speech compression systems typically require estimation of the fundamental frequency of an input signal. The fundamental frequency ƒ0 is usually estimated in terms of the pitch delay τ0 (otherwise known as “lag”). The two are related by the expression
where the sampling frequency ƒs, is commonly 8000 Hz for telephone grade applications.
Since a speech signal is generally non-stationary, it is partitioned into finite length vectors called frames, each of which is presumed to be quasi-stationary. The length of such frames is normally on the order of 10 to 40 milliseconds. The parameters describing the speech signal are then updated at the associated frame length intervals. The original Code Excited Linear Prediction (CELP) algorithms further updates the pitch period (using what is called Long Term Prediction, or LTP) information on shorter sub-frame intervals, thus allowing smoother transitions from frame to frame. It was also noted that although τ0 could be estimated using open-loop methods, far better performance was achieved using the closed-loop approach. Closed-loop methods involve a trial-and-error search of different possible values of τ0 (typically integer values from 20 to 147) on a sub-frame basis, and choosing the value that satisfies some minimum error criterion.
An enhancement to this method involves allowing τ0 to take on integer plus fractional values, as given in U.S. Pat. No. 5,359,696. An example of a practical implementation of this method can be found in the GSM half rate speech coder, and is shown in FIG. 1 and described in U.S. Pat. No. 5,253,269. Here, lags within the range of 21 to 22⅔ are allowed ⅓ sample resolution, lags within the range of 23 to 34⅚ are allowed ⅙ sample resolution, and so on. In order to keep the search complexity low, a combination of open-loop and closed loop methods is used. The open-loop method involves generating an integer lag candidate list using an autocorrelation peak picking algorithm. The closed-loop method then searches the allowable lags in the neighborhood of the integer lag candidates for the optimal fractional lag value. Furthermore, the lags for sub-frames 2, 3, and 4 are coded based on the difference from the previous sub-frame. This allows the lag information to be coded using fewer bits since there is a high intra-frame correlation of the lag parameter. Even so, the GSM HR codec uses a total of 8+(3×4)=20 bits every 20 ms (1.0 kbps) to convey the pitch period information.
In an effort to reduce the bit rate of the pitch period information, an interpolation strategy was developed that allows the pitch information to be coded only once per frame (using only 7 bits=>350 bps), rather than with the usual sub-frame resolution. This technique is known as relaxed CELP (or RCELP), and is the basis for the Enhanced Variable Rate Codec (EVRC) standard for Code Division Multiple Access (CDMA) wireless telephone systems. The basic principle is as follows.
The pitch period is estimated for the analysis window centered at the end of the current frame. The lag (pitch delay) contour is then generated, which consists of a linear interpolation of the past frame's lag to the current frame's lag. The linear prediction (LP) residual signal is then modified by means of sophisticated polyphase filtering and shifting techniques, which is designed to match the residual waveform to the estimated pitch delay contour. The primary reason for this residual modification process is to account for accuracy limitations of the open-loop integer lag estimation process. For example, if the integer lag is estimated to be 32 samples, when in fact the true lag is 32.5 samples, the residual waveform can be in conflict with the estimated lag by as many as 2.5 samples in a single 160 sample frame. This can severely degrade the performance of the LTP. The RCELP algorithm accounts for this by shifting the residual waveform during perceptually insignificant instances in the residual waveform (i.e., low energy) to match the estimated pitch delay contour. By modifying the residual waveform to match the estimated pitch delay contour, the effectiveness of the LTP is preserved, and the coding gain is maintained. In addition, the associated perceptual degradations due to the residual modification are claimed to be insignificant.
A further improvement to processing of the pitch delay contour information has been proposed in U.S. Pat. No. 6,113,653, in which a method of adjusting the pitch delay contour at intervals of less than of equal to one block in length is disclosed. In this method, a small number of bits are used to code an adjustment of the pitch delay contour according to some error minimization criteria. The method describes techniques for pitch delay contour adjustment by minimization of an accumulated shift parameter, or maximization of the cross correlation between the perceptually weighted input speech and the adaptive codebook (ACB) contribution passed through a perceptually weighted synthesis filter. Another well known pitch delay adjustment criterion may also include the minimization of the perceptually weighted error energy between the target speech and the filtered ACB contribution.
While this method utilizes a very efficient technique for estimating and coding pitch delay contour adjustment information, the low bit rate has the consequence of constraining the resolution and/or dynamic range of the pitch delay adjustment parameters being coded. Therefore a need exists for improving performance of low bit rate long-term predictors by adaptively modifying the dynamic range and resolution of the predictor step-size, such that higher long-term prediction gain is achieved for a given bit-rate, or alternatively, a similar long-term prediction is achieved at a lower bit-rate when compared to the prior art.
Stated generally, an open-loop pitch delay contour estimator generates pitch delay information during coding of an information signal. The pitch delay contour (i.e., a linear interpolation of the past frame's lag to the current frame's lag) is adjusted on a sub-frame basis which allows a more precise estimate of the true pitch delay contour. A pitch delay contour reconstruction block uses the pitch delay information in a decoder in reconstructing the information signal between frames. In the preferred embodiment of the present invention adjustment of the pitch delay contour is based on a standard deviation and/or a variance in pitch delay (τ0).
Stated more specifically, a method for coding an information signal comprises the steps of dividing the information signal into blocks, estimating the pitch delay of the current and previous blocks of information and forming an adjustment in pitch delay based on a past changes (e.g., standard deviation and/or variance) in τ0. The method further includes the steps of adjusting the shape of the pitch delay contour at intervals of less than or equal to one block in length and coding the shape of the adjusted pitch delay contour to produce codes suitable for transmission to a destination.
The step of adjusting the shape of the pitch delay contour at intervals of less than or equal to one block in length further comprises the steps of determining the adjusted pitch delay at a point at or between the current and previous pitch delays and forming a linear interpolation between the previous pitch delay point and the adjusted pitch delay point. When determining the adjusted pitch delay point, a change in accumulated shift is minimized. The step of determining the adjusted pitch delay further comprises the step of maximizing the correlation between a target residual signal and the original residual signal. The previous pitch delay point further comprises a previously adjusted pitch delay point. Alternatively, the step of adjusting the shape of the pitch delay contour further comprises the steps of determining a plurality of adjusted pitch delay points at or between the current and previous pitch delays and forming a linear interpolation between the adjusted pitch delay points.
A system for coding an information signal is also disclosed. The system includes an coder which comprises means for dividing the information signal into blocks and means for estimating the pitch delay of the current and previous blocks of information and for adjusting a pitch delay based on a past changes (e.g., standard deviation and/or variance) in τ0.
Within the system, the information signal further comprises either a speech or an audio signal and the blocks of information signals further comprise frames of information signals. The pitch delay information further comprises a pitch delay adjustment index. The system also includes a decoder for receiving the pitch delay information and for producing an adjusted pitch delay contour τc(n) for use in reconstructing the information signal.
where τ(m) is the estimated open-loop pitch delay for the current frame m, which is centered at the end current frame, τ(m−1) is the estimated open-loop pitch delay for the previous frame m−1, and ƒ(n) is a set of pitch delay interpolation coefficients, which may be defined as:
f={0.0,0.3313,0.6625,1.0} (3)
These coefficients are given for the example of when the number of sub-frames is three (e.g, 0<m′<3), although a suitable set of coefficients can be derived for a value of sub-frames other than three.
Also using the open-loop pitch delay τ(m) as input is the pitch delay variability estimator 214. In accordance with the current invention, the sample standard deviation of the open-loop pitch delay estimate is defined as:
where the sample mean
When the number of observations is two (N=2), it can be shown that the above expressions can be simplified to the following:
The variability estimate στ, and the open-loop pitch delay τ(m) are then used as inputs to the adaptive step size generator 215, where the adaptive step size δ(m) is calculated as a function of στ, as:
where α(στ) is some function of the variability estimate of pitch delay. For the preferred embodiment of the present invention, this function is given as:
α(στ)=min(Åστ+B,αmax) (8)
where A and B may be constants, στ, represents the standard deviation in τ, and αmax may be some maximum allowable value of α(στ). The adaptive step-size δ(m) is input to the delay adjust coefficient generator 216, where the pitch delay adjust value Δadj(i) may be calculated as a function of the pitch delay adjust index i as:
Δadj(i)=(i−M/2)·δ(m),iε{0,1, . . . ,M−1} (9)
where M is the number of candidate pitch delay adjustment indices. From the equations above, it can be seen that the pitch delay adjust value Δadj(i) may take on integral multiples of the step-size δ(m), where δ(m) is a function of not only the average (mean) value of the pitch delay (as in the prior at), but also the variability estimate στ of the pitch delay value τ(m). The various pitch delay adjust values may then be evaluated according to some distortion metric, and as a result, the optimal value of the pitch delay adjust value may be used throughout the remainder of the coding process. In the preferred embodiment, the distortion metric is the perceptually weighted mean squared error between the i-th filtered adaptive codebook contribution λ(i,n), and the weighted target signal sw(n). This process is given in pitch delay adjust index search 218 and can be expressed as:
where i* is the optimal pitch delay adjust index corresponding to the maximum value obtained from the bracketed expression.
In order to obtain the signals used in Eq. 10, the pitch delay contour endpoint modifier 208 is employed to shift the endpoints of the pitch delay interpolation curve up or down according to the expression:
d′(m′,j)=d(m′,j)+Δadj(i) (11)
From this expression, a candidate pitch delay contour τc(n) is computed 210, and an adaptive codebook contribution E(n) is obtained 212 and filtered 220 to obtain the filtered adaptive codebook contribution λ(n) as in the prior art.
During operation standard variables such as the fixed codebook indices, the FCB and ACB gain index, etc. are transmitted by transmitter 200. Along with these values, a delay adjust index (i) for each subframe is transmitted along with a code for the pitch delay value for the current frame τ(m). The pitch delay from the previously transmitted frame τ(m−1) is also used. The decoder will utilize i, τ(m), and τ(m−1) to produce an interpolation curve between successive pitch delay values. More particularly, the receiver will compute Δadj(i) as a function of the pitch delay adjust index i as discussed above, and apply Δadj(i) to shift the endpoints of the pitch delay interpolation curve up or down according to equation 11.
As with transmitter 200, pitch delay τ(m) is output to delay interpolation block 307 and used to produce a subframe delay interpolation endpoint matrix d(m′,j) according to equation 2. Delay contour endpoint modification circuitry 308 takes the endpoint matrix and shifts the endpoints of the pitch delay interpolation curve up or down according to d′(m′,j)=d(m′, j)+Δadj(i). The shifted endpoints are then used by computation circuitry 310 to produce the adjusted delay contour τc(n), which is subsequently used to fetch samples from the ACB 312 (as in the prior art). The ACB contribution is then scaled and combined with the scaled fixed codebook contribution to produce a combined excitation signal, which is used as input to synthesis filter 302 to produce an output speech signal. The combined excitation signal is also used a feedback in order to update the ACB for the next subframe (as in the prior art).
From the input signal, the open-loop pitch delay Δ(m) 404 is estimated. As can be seen, the open-loop pitch delay estimate is fairly smooth for highly periodic speech (samples 0-2000 and 4000-6500), and in contrast is fairly erratic during non-voiced speech and transitions (samples 2000-4000 and 6500-7000). In accordance with the present invention, the step-size δ(m) 406 is shown. As can be seen, the step-size is relatively small when the variability of the pitch delay estimate is small, and conversely, the step-size is relatively large when the variability of the pitch delay estimate is large. The effects of the adaptive step-size can be seen further in the optimal pitch delay adjust value Δadj(i) 408. Here, the optimal pitch delay adjustment value is based on only four candidates (2 bits per sub-frame). During the highly periodic regions, the variation is small and resolution is emphasized to allow fine tuning of the pitch delay estimate. During non-voiced and transition regions, pitch delay variation is large and subsequently a wide dynamic range is emphasized to account for a high uncertainty in the pitch delay estimate. Finally, the pitch delay adjusted endpoint d′(m′,1) 410 is shown to demonstrate the final composite estimate of the pitch delay contour in accordance with the present invention. When compared to the open-loop pitch delay 404, it is easy to see the overall effect of the invention.
The value for Δadj is then used by modification circuitry 208 to generate a second pitch delay parameter, an in particular an encoded pitch parameter (step 507). In the preferred embodiment of the present invention the encoded pitch parameter comprise the endpoints of the pitch delay interpolation curve which are shifted up or down based on the adjustment value, and in particular according to the expression d′(m′, j)=d(m′, j)+Δadj (i), where i* is the optimal pitch delay adjust index corresponding to the maximum value obtained from equation 10.
While the invention has been particularly shown and described with reference to a particular embodiment, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention. For example, while in the preferred embodiment of the present invention endpoints of a pitch delay interpolation curve are shifted based on the adaptive step size, one of ordinary skill in the art will recognize that any encoded pitch parameter may be generated based on the adaptive step size. More specifically, the present invention may be applied toward traditional closed loop pitch delay and pitch search methods (e.g., U.S. Pat. No. 5,253,269) by allowing the search range and/or resolution (i.e., the step size) to be based on a function of the pitch delay variability. Such methods are currently limited to predetermined resolutions based solely on absolute range of the current pitch value being searched.
Use of the present invention in prior art decoding processes is also viewed to be obvious by one skilled in the art. For example, while in the preferred embodiment of the present invention endpoints of a pitch delay interpolation curve are shifted up or down based on the adaptive step size, one of ordinary skill in the art will recognize that any pitch delay parameter may be generated based on the adaptive step size. As in the previous discussion, a speech decoder such as the GSM HR may use an adaptive step size, based on the variation in pitch delay obtained from any first pitch delay parameter, to determine a range and resolution of the delta coded lag information (i.e., a second pitch delay parameter). Therefore, the second pitch delay parameter may be based on the adaptive step size.
In addition, an alternate distortion metric may be used, such as the minimization of an accumulated shift parameter or the maximization of a normalized cross correlation parameter (as described in U.S. Pat. No. 6,113,653) to achieve pitch delay contour adjustment in accordance with the present invention. It is obvious to one skilled in the art that the present invention is independent of the distortion metric being applied, and that any method may be used without departing from the spirit and scope of the present invention.
Number | Name | Date | Kind |
---|---|---|---|
4201958 | Ahamed | May 1980 | A |
4821324 | Ozawa et al. | Apr 1989 | A |
4890325 | Taniguchi et al. | Dec 1989 | A |
5097508 | Valenzuela Steude et al. | Mar 1992 | A |
5253269 | Gerson et al. | Oct 1993 | A |
5359696 | Gerson et al. | Oct 1994 | A |
5495555 | Swaminathan | Feb 1996 | A |
5553191 | Minde | Sep 1996 | A |
5699478 | Nahumi | Dec 1997 | A |
5699485 | Shoham | Dec 1997 | A |
5704003 | Kleijn et al. | Dec 1997 | A |
5774837 | Yeldener et al. | Jun 1998 | A |
5778334 | Ozawa et al. | Jul 1998 | A |
5809459 | Bergstrom et al. | Sep 1998 | A |
5819213 | Oshikiri et al. | Oct 1998 | A |
5924063 | Funaki et al. | Jul 1999 | A |
6009395 | Lai et al. | Dec 1999 | A |
6113653 | Ashley et al. | Sep 2000 | A |
6199035 | Lakaniemi et al. | Mar 2001 | B1 |
6212496 | Campbell et al. | Apr 2001 | B1 |
6345248 | Su et al. | Feb 2002 | B1 |
6470312 | Suzuki et al. | Oct 2002 | B1 |
6507814 | Gao | Jan 2003 | B1 |
6581031 | Ito et al. | Jun 2003 | B1 |
6584438 | Manjunath et al. | Jun 2003 | B1 |
6604070 | Gao et al. | Aug 2003 | B1 |
6636829 | Benyassine et al. | Oct 2003 | B1 |
6760698 | Gao | Jul 2004 | B2 |
6782360 | Gao et al. | Aug 2004 | B1 |
6804203 | Benyassine et al. | Oct 2004 | B1 |
7072832 | Su et al. | Jul 2006 | B1 |
20020016161 | Dellien et al. | Feb 2002 | A1 |
20020116182 | Gao et al. | Aug 2002 | A1 |
20020147583 | Gao | Oct 2002 | A1 |
20040002855 | Jabri et al. | Jan 2004 | A1 |
20040002856 | Bhaskar et al. | Jan 2004 | A1 |
20040024594 | Lee et al. | Feb 2004 | A1 |
20040102966 | Sung et al. | May 2004 | A1 |
20040109471 | Minde et al. | Jun 2004 | A1 |
20050053130 | Jabri et al. | Mar 2005 | A1 |
20050091044 | Ramo et al. | Apr 2005 | A1 |
20050137863 | Jasiuk et al. | Jun 2005 | A1 |
20050137864 | Valve et al. | Jun 2005 | A1 |
20070027680 | Ashley et al. | Feb 2007 | A1 |
Number | Date | Country |
---|---|---|
833305 | Apr 1998 | EP |
1093116 | Jan 2001 | EP |
Entry |
---|
Gerson et al., “Techniques for Improving the Performance of CELP-type Speech Coders”, IEEE Journal on Selected Areas in Communications, Jun. 1992, 858-865 vol. 10 Issue 5. |
Deyuan, Cheng; “An 8 kb/s Low Complexity ACELP Speech Codec”, 3rd International Conference on Signal processing, Oct. 14-18, 1996, 671-674 vol. 1. |
Number | Date | Country | |
---|---|---|---|
20070027680 A1 | Feb 2007 | US |