# Patent

## Title
Adaptive postfiltering methods and systems for decoding speech

## Abstract

A filter controller processes a decoded speech (DS) signal. The DS signal has a spectral envelope including a first plurality of formant peaks having different respective amplitudes. The controller produces, from the DS signal, a spectrally-flattened DS signal that is a time-domain signal. The spectrally-flattened time-domain DS signal has a spectral envelope including a second plurality of formant peaks. Each of the second plurality of formant peaks approximately coincides in frequency with a respective one of the first plurality of formant peaks. Also, the second plurality of formant peaks have approximately equal respective amplitudes. Next, the controller derives, from the spectrally-flattened time-domain DS signal, a set of filter coefficients representative of a filter response that is to be used to filter the DS signal.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority to U.S. Provisional Application No. 60/326,449, filed Oct. 3, 2001, entitled “Adaptive Postfiltering Methods and Systems for Decoded Speech,” incorporated herein by reference in its entirety.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to techniques for filtering signals, and more particularly, to techniques for filtering speech and/or audio signals.
2. Related Art
In digital speech communication involving encoding and decoding operations, it is known that a properly designed adaptive filter applied at the output of the speech decoder is capable of reducing the perceived coding noise, thus improving the quality of the decoded speech. Such an adaptive filter is often called an adaptive postfilter, and the adaptive postfilter is said to perform adaptive postfiltering.
Adaptive postfiltering can be performed using frequency-domain approaches, that is, using a frequency-domain postfilter. Conventional frequency-domain approaches disadvantageously require relatively high computational complexity, and introduce undesirable buffering delay for overlap-add operations used to avoid waveform discontinuities at block boundaries. Therefore, there is a need for an adaptive postfilter that can improve the quality of decoded speech, while reducing computational complexity and buffering delay relative to conventional frequency-domain postfilters.
Adaptive postfiltering can also be performed using time-domain approaches, that is, using a time-domain adaptive postfilter. A known time-domain adaptive postfilter includes a long-term postfilter and a short-term postfilter. The long-term postfilter is used when the speech spectrum has a harmonic structure, for example, during voiced speech when the speech waveform is almost periodic. The long-term postfilter is typically used to perform long-term filtering to attenuate spectral valleys between harmonics in the speech spectrum. The short-term postfilter performs short-term filtering to attenuate the valleys in the spectral envelope, i.e., the valleys between formant peaks. A disadvantage of some of the older time-domain adaptive postfilters is that they tend to make the postfiltered speech sound muffled, because they tend to have a lowpass spectral tilt during voiced speech. More recently proposed conventional time-domain postfilters greatly reduce such spectral tilt, but at the expense of using much more complicated filter structures to achieve this goal. Therefore, there is a need for an adaptive postfilter that reduces such spectral tilt with a simple filter structure.
It is desirable to scale a gain of an adaptive postfilter so that the postfiltered speech has roughly the same magnitude as the unfiltered speech. In other words, it is desirable that an adaptive postfilter include adaptive gain control (AGC). However, AGC can disadvantageously increase the computational complexity of the adaptive postfilter. Therefore, there is a need for an adaptive postfilter including AGC, where the computational complexity associated with the AGC is minimized.
SUMMARY OF THE INVENTION
The present invention is a time-domain adaptive postfiltering approach. That is, the present invention uses a time-domain adaptive postfilter for improving decoded speech quality, while reducing computational complexity and buffering delay relative to conventional frequency-domain postfiltering approaches. When compared with conventional time-domain adaptive postfilters, the present invention uses a simpler filter structure.
The time-domain adaptive postfilter of the present invention includes a short-term filter and a long-term filter. The short-term filter is an all-pole filter. Advantageously, the all-pole short-term filter has minimal spectral tilt, and thus, reduces muffling in the decoded speech. On average, the simple all-pole short-term filter of the present invention achieves a lower degree of spectral tilt than other known short-term postfilters that use more complicated filter structures.
Unlike conventional time-domain postfilters, the postfilter of the present invention does not require the use of individual scaling factors for the long-term postfilter and the short-term postfilter. Advantageously, the present invention only needs to apply a single AGC scaling factor at the end of the filtering operations, without adversely affecting decoded speech quality. Furthermore, the AGC scaling factor is calculated only once a sub-frame, thereby reducing computational complexity in the present invention. Also, the present invention does not require a sample-by-sample lowpass smoothing of the AGC scaling factor, further reducing computational complexity.
The postfilter advantageously avoids waveform discontinuity at sub-frame boundaries, because it employs a novel overlap-add operation that smoothes out possible waveform discontinuity. This novel overlap-add operation does not increase the buffering delay of the filter in the present invention.
An embodiment of the present invention is a method of processing a decoded speech (DS) signal. The DS signal has a spectral envelope including a first plurality of formant peaks. The method comprises producing, from the DS signal, a spectrally-flattened DS signal that is a time-domain signal. The spectrally-flattened time-domain DS signal has a spectral envelope including a second plurality of formant peaks corresponding to the first plurality of formant peaks. One or more amplitude differences between respective ones of the second plurality of formant peaks are less than one or more corresponding amplitude differences between respective ones of the first plurality of formant peaks. The method further comprises deriving a set of filter coefficients from the spectrally-flattened time-domain DS signal. The set of filter coefficients are representative of a spectral response for postfiltering the DS signal.
Other embodiments of the present invention described below include further methods of deriving coefficients (that is, filter responses) for filtering signals, computer program products for causing a computer to perform such processes, and apparatuses for performing such processes.



BRIEF DESCRIPTION OF THE FIGURES
The present invention is described with reference to the accompanying drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. The terms “past” and “current” used herein indicate a relative timing relationship and may be interchanged with the terms “current” and “next”/“future,” respectively, to indicate the same timing relationship. Also, each of the above-mentioned terms may be interchanged with terms such as “first” or “second,” etc., for convenience.
FIG. 1A is block diagram of an example postfilter system for processing speech and/or audio related signals, according to an embodiment of the present invention.
FIG. 1B is block diagram of a Prior Art adaptive postfilter in the ITU-T Recommendation G.729 speech coding standard.
FIGS. 2A is a block diagram of an example filter controller of FIG. 1A for deriving short-term filter coefficients.
FIGS. 2B is a block diagram of another example filter controller of FIG. 1A for deriving short-term filter coefficients.
FIGS. 2C, 2D and 2E each include illustrations of a decoded speech spectrum and filter responses related to the filter controller of FIG. 1A.
FIG. 3 is a block diagram of an example adaptive postfilter of the postfilter system of FIG. 1A.
FIG. 4 is a block diagram of an alternative adaptive postfilter of the postfilter system of FIG. 1A.
FIG. 5 is a flow chart of an example method of adaptively filtering a decoded speech signal to smooth signal discontinuities that may arise from a filter update at a speech frame boundary.
FIG. 6 is a high-level block diagram of an example adaptive filter.
FIG. 7 is a timing diagram for example portions of various signals discussed in connection with the filter of FIG. 7.
FIG. 8 is a flow chart of an example generalized method of adaptively filtering a generalized signal to smooth filtered signal discontinuities that may arise from a filter update.
FIG. 9 is a block diagram of a computer system on which the present invention may operate.



DETAILED DESCRIPTION OF THE INVENTION
In speech coding, the speech signal is typically encoded and decoded frame by frame, where each frame has a fixed length somewhere between 5 ms to 40 ms. In predictive coding of speech, each frame is often further divided into equal-length sub-frames, with each sub-frame typically lasting somewhere between 1 and 10 ms. Most adaptive postfilters are adapted sub-frame by sub-frame. That is, the coefficients and parameters of the postfilter are updated only once a sub-frame, and are held constant within each sub-frame. This is true for the conventional adaptive postfilter and the present invention described below.
1. Postfilter System Overview
FIG. 1A is block diagram of an example postfilter system for processing speech and/or audio related signals, according to an embodiment of the present invention. The system includes a speech decoder 101 (which forms no part of the present invention), a filter controller 102, and an adaptive postfilter 103 (also referred to as a filter 103) controlled by controller 102. Filter 103 includes a short-term postfilter 104 and a long-term postfilter 105 (also referred to as filters 104 and 105, respectively).
Speech decoder 101 receives a bit stream representative of an encoded speech and/or audio signal. Decoder 101 decodes the bit stream to produce a decoded speech (DS) signal {tilde over (s)}(n). Filter controller 102 processes DS signal {tilde over (s)}(n) to derive/produce filter control signals 106 for controlling filter 103, and provides the control signals to the filter. Filter control signals 106 control the properties of filter 103, and include, for example, short-term filter coefficients di for short-term filter 104, long-term filter coefficients for long-term filter 105, AGC gains, and so on. Filter controller 102 re-derives or updates filter control signals 106 on a periodic basis, for example, on a frame-by-frame, or a subframe-by-subframe, basis when DS signal {tilde over (s)}(n) includes successive DS frames, or subframes.
Filter 103 receives periodically updated filter control signals 106, and is responsive to the filter control signals. For example, short-term filter coefficients di, included in control signals 106, control a transfer function (for example, a frequency response) of short-term filter 104. Since control signals 106 are updated periodically, filter 103 operates as an adaptive or time-varying filter in response to the control signals.
Filter 103 filters DS signal {tilde over (s)}(n) in accordance with control signals 106. More specifically, short-term and long-term filters 104 and 105 filter DS signal {tilde over (s)}(n) in accordance with control signals 106. This filtering process is also referred to as “postfiltering” since it occurs in the environment of a postfilter. For example, short-term filter coefficients di cause short-term filter 104 to have the above-mentioned filter response, and the short-term filter filters DS signal {tilde over (s)}(n) using this response. Long-term filter 105 may precede short-term filter 104, or vice-versa.
2. Short-Term Postfilter
2.1 Conventional Postfilter—Short-Term Postfilter
A conventional adaptive postfilter, used in the ITU-T Recommendation G.729 speech coding standard, is depicted in FIG. 1B. Let




  1
  
    
      A
      ^
    
    ⁡
    
      (
      z
      )
    
  




be the transfer function of the short-term synthesis filter of the G.729 speech decoder. The short-term postfilter in FIG. 1B consists of a pole-zero filter with a transfer function of





  
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          β
        
        )
      
    
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          α
        
        )
      
    
  
  ,




where 0<β<α<1, followed by a first-order all-zero filter 1−μz−1. Basically, the all-pole portion of the pole-zero filter,





  
    1
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          α
        
        )
      
    
  
  ,




gives a smoothed version of the frequency response of short-term synthesis filter





  
    1
    
      
        A
        ^
      
      ⁡
      
        (
        z
        )
      
    
  
  ,




which itself approximates the spectral envelope of the input speech. The all-zero portion of the pole-zero filter, or Â(z/β), is used to cancel out most of the spectral tilt in





  
    1
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          α
        
        )
      
    
  
  .




However, it cannot completely cancel out the spectral tilt. The first-order filter 1−μz−1 attempts to cancel out the remaining spectral tilt in the frequency response of the pole-zero filter





  
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          β
        
        )
      
    
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          α
        
        )
      
    
  
  .




2.2 Filter Controller and Method of Deriving Short-Term Filter Coefficients
In a postfilter embodiment of the present invention, the short-term filter (for example, short-term filter 104) is a simple all-pole filter having a transfer function




  
    1
    
      D
      ⁡
      
        (
        z
        )
      
    
  
  .




FIGS. 2A and 2B are block diagrams of two different example filter controllers, corresponding to filter controller 102, for deriving the coefficients di of the polynomial D(z), where i=1, 2, . . . , L and L is the order of the short-term postfilter. It is to be understood that FIGS. 2A and 2B also represent respective methods of deriving the coefficients of the polynomial D(z), performed by filter controller 102. For example, each of the functional blocks, or groups of functional blocks, depicted in FIGS. 2A and 2B perform one or more method steps of an overall method for processing decoded speech.

Assume that the speech codec is a predictive codec employing a conventional LPC predictor, with a short-term synthesis filter transfer function of




  
    
      H
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        
          1
          
            
              A
              ^
            
            ⁡
            
              (
              z
              )
            
          
        
        ⁢
        
          
        
        ⁢
        where
        ⁢
        
          
        
        ⁢
        
          
            A
            ^
          
          ⁡
          
            (
            z
            )
          
        
      
      =
      
        
          ∑
          
            i
            =
            0
          
          M
        
        ⁢
        
          
            
              a
              ^
            
            i
          
          ⁢
          
            z
            
              -
              1
            
          
        
      
    
  
  ,




and M is the LPC predictor order, which is usually 10 for 8 kHz sampled speech. Many known predictive speech codecs fit this description, including codecs using Adaptive Predictive Coding (APC), Multi-Pulse Linear Predictive Coding (MPLPC), Code-Excited Linear Prediction (CELP), and Noise Feedback Coding (NFC).

The example arrangement of filter controller 102 depicted in FIG. 2A includes blocks 220–290. Speech decoder 101 can be considered external to the filter controller. As mentioned above, speech decoder 101 decodes the incoming bit stream into DS signal {tilde over (s)}(n). Assume the decoder 101 has the decoded LPC predictor coefficients âi, i=1, 2, . . . , M available (note that â0=1 as always). In the frequency-domain, the DS signal {tilde over (s)}(n) has a spectral envelope including a first plurality of formant peaks. Typically, the formant peaks have different respective amplitudes spread over a wide dynamic range.
A bandwidth expansion block 220 scales these âi coefficients to produce coefficients 222 of a shaping filter block 230 that has a transfer function of




  
    
      A
      ^
    
    ⁡
    
      (
      
        z
        /
        α
      
      )
    
  
  =
  
    
      ∑
      
        i
        =
        0
      
      M
    
    ⁢
    
      
        (
        
          
            
              a
              ^
            
            i
          
          ⁢
          
            α
            ′
          
        
        )
      
      ⁢
      
        
          z
          
            -
            1
          
        
        .
      
    
  




A suitable value for α is 0.90.

Alternatively, one can use the example arrangement of filter controller 102 depicted in FIG. 2B to derive the coefficients of the shaping filter (block 230). The filter controller of FIG. 2B includes blocks or modules 215–290. Rather than performing bandwidth expansion of the decoded LPC predictor coefficients â, i=1, 2, . . . , M, the controller of FIG. 2B includes block 215 to perform an LPC analysis to derive the LPC predictor coefficients from the decoded speech signal, and then uses a bandwidth expansion block 220 to perform bandwidth expansion on the resulting set of LPC predictor coefficients. This alternative method (that is, the method depicted in FIG. 2B) is useful if the speech decoder 101 does not provide decoded LPC predictor coefficients, or if such decoded LPC predictor coefficients are deemed unreliable. Note that except for the addition of block 215, the controller of FIG. 2B is otherwise identical to the controller of FIG. 2A. In other words, each of the functional blocks in FIG. 2A is identical to the corresponding functional block in FIG. 2B having the same block number.
An all-zero shaping filter 230, having transfer function Â(z/α), then filters the decoded speech signal {tilde over (s)}(n) to get an output signal f(n), where signal f(n) is a time-domain signal. This shaping filter Â(z/α) (230) will remove most of the spectral tilt in the spectral envelope of the decoded speech signal {tilde over (s)}(n), while preserving the formant structure in the spectral envelope of the filtered signal f(n). However, there is still some remaining spectral tilt.
More generally, in the frequency-domain, signal f(n) has a spectral envelope including a plurality of formant peaks corresponding to the plurality of formant peaks of the spectral envelope of DS signal {tilde over (s)}(n). One or more amplitude differences between the formant peaks of the spectral envelope of signal f(n) are reduced relative to one or more amplitude differences between corresponding formant peaks of the spectral envelope of DS signal {tilde over (s)}(n). Thus, signal f(n) is “spectrally-flattened” relative to decoded speech {tilde over (s)}(n).
A low-order spectral tilt compensation filter 260 is then used to further remove the remaining spectral tilt. Let the order of this filter be K. To derive the coefficients of this filter, a block 240 performs a Kth-order LPC analysis on the signal f(n), resulting in a Kth-order LPC prediction error filter defined by




  
    
      B
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        ∑
        
          i
          =
          0
        
        K
      
      ⁢
      
        
          b
          i
        
        ⁢
        
          z
          
            -
            1
          
        
      
    
  
  ,




A suitable filter order is K=1 or 2. Good result is obtained by using a simple autocorrelation LPC analysis with a rectangular window over the current sub-frame of f(n).

A block 250, following block 240, then performs a well-known bandwidth expansion procedure on the coefficients of B(z) to obtain the spectral tilt compensation filter (block 260) that has a transfer function of




  
    B
    ⁡
    
      (
      
        z
        /
        δ
      
      )
    
  
  =
  
    
      ∑
      
        i
        =
        0
      
      K
    
    ⁢
    
      
        (
        
          
            b
            i
          
          ⁢
          
            δ
            1
          
        
        )
      
      ⁢
      
        
          z
          
            -
            1
          
        
        .
      
    
  




For the parameter values chosen above, a suitable value for δ is 0.96.

The signal f(n) is passed through the all-zero spectral tilt compensation filter B(z/δ) (260). Filter 260 filters spectrally-flattened signal f(n) to reduce amplitude differences between formant peaks in the spectral envelope of signal f(n). The resulting filtered output of block 260 is denoted as signal t(n). Signal t(n) is a time-domain signal, that is, signal t(n) includes a series of temporally related signal samples. Signal t(n) has a spectral envelope including a plurality of formant peaks corresponding to the formant peaks in the spectral envelopes of signals f(n) and DS signal {tilde over (s)}(n). The formant peaks of signal t(n) approximately coincide in frequency with the formant peaks of DS signal {tilde over (s)}(n). Amplitude differences between the formant peaks of the spectral envelope of signal t(n) are substantially reduced relative to the amplitude differences between corresponding formant peaks of the spectral envelope of DS signal {tilde over (s)}(n). Thus, signal t(n) is “spectrally-flattened” with respect to DS signal {tilde over (s)}(n) (and also relative to signal f(n)). The formant peaks of spectrally-flattened time-domain signal t(n) have respective amplitudes (referred to as formant amplitudes) that are approximately equal to each other (for example, within 3 dB of each other), while the formant amplitudes of DS signal {tilde over (s)}(n) may differ substantially from each other (for example, by as much as 30 dB).
For these reasons, the spectral envelope of signal t(n) has very little spectral tilt left, but the formant peaks in the decoded speech are still mostly preserved. Thus, a primary purpose of blocks 230 and 260 is to make the formant peaks in the spectrum of {tilde over (s)}(n) become approximately equal-magnitude spectral peaks in the spectrum of t(n) so that a desirable short-term postfilter can be derived from the signal t(n). In the process of making the spectral peaks of t(n) roughly equal magnitude, the spectral tilt of t(n) is advantageously reduced or minimized.
An analysis block 270 then performs a higher order LPC analysis on the spectrally-flattened time-domain signal t(n), to produce coefficients ai. In an embodiment, the coefficients ai are produced without performing a time-domain to frequency-domain conversion. An alternative embodiment may include such a conversion. The resulting LPC synthesis filter has a transfer function of




  
    1
    
      A
      ⁡
      
        (
        z
        )
      
    
  
  =
  
    
      1
      
        
          ∑
          
            i
            =
            0
          
          L
        
        ⁢
        
          
            a
            i
          
          ⁢
          
            z
            
              -
              1
            
          
        
      
    
    .
  




Here the filter order L can be, but does not have to be, the same as M, the order of the LPC synthesis filter in the speech decoder. The typical value of L is 10 or 8 for 8 kHz sampled speech.

This all-pole filter has a frequency response with spectral peaks located approximately at the frequencies of formant peaks of the decoded speech. The spectral peaks have respective levels on approximately the same level, that is, the spectral peaks have approximately equal respective amplitudes (unlike the formant peaks of speech, which have amplitudes that typically span a large dynamic range). This is because the spectral tilt in the decoded speech signal {tilde over (s)}(n) has been largely removed by the shaping filter Â(z/α) (230) and the spectral tilt compensation filter B(z/δ) (260). The coefficients ai may be used directly to establish a filter for filtering the decoded speech signal {tilde over (s)}(n). However, subsequent processing steps, performed by blocks 280 and 290, modify the coefficients, and in doing so, impart desired properties to the coefficients ai, as will become apparent from the ensuing description.
Next, a bandwidth expansion block 280 performs bandwidth expansion on the coefficients of the all-pole filter




  1
  
    A
    ⁡
    
      (
      z
      )
    
  




to control the amount of short-term postfiltering. After the bandwidth expansion, the resulting filter has a transfer function of





  
    1
    
      A
      ⁡
      
        (
        
          z
          /
          θ
        
        )
      
    
  
  =
  
    
      1
      
        
          ∑
          
            i
            =
            0
          
          L
        
        ⁢
        
          
            (
            
              
                a
                i
              
              ⁢
              
                θ
                ′
              
            
            )
          
          ⁢
          
            z
            
              -
              1
            
          
        
      
    
    .
  




A suitable value of θ may be in the range of 0.60 to 0.75, depending on how noisy the decoded speech is and how much noise reduction is desired. A higher value of θ provides more noise reduction at the risk of introducing more noticeable postfiltering distortion, and vice versa.

To ensure that such a short-term postfilter evolves from sub-frame to sub-frame in a smooth manner, it is useful to smooth the filter coefficients ãi=aiθi, i=1, 2, . . . , L using a first-order all-pole lowpass filter. Let ãi(k) denote the i-th coefficient ãi=aiθi in the k-th sub-frame, and let di(k) denote its smoothed version. A coefficient smoothing block 290 performs the following lowpass smoothing operation

di(k)=ρdi(k−1)+(1−ρ)ãi(k), for i=1,2, . . . , L.

A suitable value of ρ is 0.75.

Suppressing the sub-frame index k, for convenience, yields the resulting all-pole filter with a transfer function of




  
    1
    
      D
      ⁡
      
        (
        z
        )
      
    
  
  =
  
    1
    
      
        ∑
        
          i
          =
          0
        
        L
      
      ⁢
      
        
          d
          i
        
        ⁢
        
          z
          
            -
            1
          
        
      
    
  




as the final short-term postfilter used in an embodiment of the present invention. It is found that with θ between 0.60 and 0.75 and with ρ=0.75, this single all-pole short-term postfilter gives lower average spectral tilt than a conventional short-term postfilter.

The smoothing operation, performed in block 290, to obtain the set of coefficients di for i=1, 2, . . . , L is basically a weighted average of two sets of coefficients for two all-pole filters. Even if these two all-pole filters are individually stable, theoretically the weighted averages of these two sets of coefficients are not guaranteed to give a stable all-pole filter. To guarantee stability, theoretically one has to calculate the impulse responses of the two all-pole filters, calculate the weighted average of the two impulse responses, and then implement the desired short-term postfilter as an all-zero filter using a truncated version of the weighted average of impulse responses. However, this will increase computational complexity significantly, as the order of the resulting all-zero filter is usually much higher than the all-pole filter order L.
In practice, it is found that because the poles of the filter




  1
  
    A
    ⁡
    
      (
      
        z
        /
        θ
      
      )
    
  




are already scaled to be well within the unit circle (that is, far away from the unit circle boundary), there is a large “safety margin”, and the smoothed all-pole filter





  1
  
    D
    ⁡
    
      (
      z
      )
    
  




is always stable in our observations. Therefore, for practical purposes, directly smoothing the all-pole filter coefficients ãi=aiθi, i=1, 2, . . . L does not cause instability problems, and thus is used in an embodiment of the present invention due to its simplicity and lower complexity.

To be even more sure that the short-term postfilter will not become unstable, then the approach of weighted average of impulse responses mentioned above can be used instead. With the parameter choices mentioned above, it has been found that the impulse responses almost always decay to a negligible level after the 16th sample. Therefore, satisfactory results can be achieved by truncating the impulse response to 16 samples and use a 15th-order FIR (all-zero) short-term postfilter.
Another way to address potential instability is to approximate the all-pole filter




  
    1
    
      A
      ⁡
      
        (
        
          z
          /
          θ
        
        )
      
    
  
  ⁢
  
    
  
  ⁢
  or
  ⁢
  
    
  
  ⁢
  
    1
    
      D
      ⁡
      
        (
        z
        )
      
    
  




by an all-zero filter through the use of Durbin's recursion. More specifically, the autocorrelation coefficients of the all-pole filter coefficient array ãi or di for i=0, 1, 2, . . . , L can be calculated, and Durbin's recursion can be performed based on such autocorrelation coefficients. The output array of such Durbin's recursion is a set of coefficients for an FIR (all-zero) filter, which can be used directly in place of the all-pole filter





  
    1
    
      A
      ⁡
      
        (
        
          z
          /
          θ
        
        )
      
    
  
  ⁢
  
    
  
  ⁢
  or
  ⁢
  
    
  
  ⁢
  
    
      1
      
        D
        ⁡
        
          (
          z
          )
        
      
    
    .
  




Since it is an FIR filter, there will be no instability. If such an FIR filter is derived from the coefficients of





  
    1
    
      A
      ⁡
      
        (
        
          z
          /
          θ
        
        )
      
    
  
  ,




further smoothing may be needed, but if it is derived from the coefficients of





  
    1
    
      D
      ⁡
      
        (
        z
        )
      
    
  
  ,




then additional smoothing is not necessary.

Note that in certain applications, the coefficients of the short-term synthesis filter




  
    H
    ⁡
    
      (
      z
      )
    
  
  =
  
    1
    
      
        A
        ^
      
      ⁡
      
        (
        z
        )
      
    
  




may not have sufficient quantization resolution, or may not be available at all at the decoder (e.g. in a non-predictive codec). In this case, a separate LPC analysis can be performed on the decoded speech {tilde over (s)}(n)to get the coefficients of Â(z). The rest of the procedures outlined above will remain the same.

It should be noted that in the conventional short-term postfilter of G.729 shown in FIG. 1B, there are two adaptive scaling factors Gs and Gi for the pole-zero filter and the first-order spectral tilt compensation filter, respectively. The calculation of these scaling factors is complicated. For example, the calculation of Gi involves calculating the impulse response of the pole-zero filter




  
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          β
        
        )
      
    
    
      
        A
        ^
      
      ⁡
      
        (
        
          z
          /
          α
        
        )
      
    
  
  ,




taking absolute values, summing up the absolute values, and taking the reciprocal. The calculation of Gi also involves absolute value, subtraction, and reciprocal. In contrast, no such adaptive scaling factor is necessary for the short-term postfilter of the present invention, due to the use of a novel overlap-add procedure later in the postfilter structure.

Example Spectral Plots for the Filter Controller
FIG. 2C is a first set of three example spectral plots C related to filter controller 102, resulting from a first example DS signal {tilde over (s)}(n) corresponding to the “oe” portion of the word “canoe” spoken by a male. Response set C includes a frequency spectrum, that is, a spectral plot, 291C (depicted in short-dotted line) of DS signal {tilde over (s)}(n), corresponding to the “oe” portion of the word “canoe” spoken by a male. Spectrum 291C has a formant structure including a plurality of spectral peaks 291C(1)–(n). The most prominent spectral peaks 291C(1), 291C(2), 291C(3) and 291C(4), have different respective formant amplitudes. Overall, the formant amplitudes are monotonically decreasing. Thus, spectrum 291C has/exhibits a low-pass spectral tilt.
Response set C also includes a spectral envelope 292C (depicted in solid line) of DS signal {tilde over (s)}(n), corresponding to frequency spectrum 291C. Spectral envelope 292C is the LPC spectral fit of DS signal {tilde over (s)}(n). In other words, spectral envelope 292C is the filter frequency response of the LPC filter represented by coefficients âi (see FIGS. 2A and 2B). Spectral envelope 292C includes formant peaks 292C(1)–292C(4) corresponding to, and approximately coinciding in frequency with, formant peaks 291C(1)–291C(4). Spectral envelope 292C follows the general shape of spectrum 291C, and thus exhibits the low-pass spectral tilt. The formant amplitudes of spectrums 291C and 292C have a dynamic range (that is, maximum amplitude difference) of approximately 30 dB. For example, the amplitude difference between the minimum and maximum formant amplitudes 292C(4) and 292C(1) is within in this range.
Response set C also includes a spectral envelope 293C (depicted in long-dashed line) of spectrally-flattened signal t(n), corresponding to frequency spectrum 291C. Spectral envelope 293C is the LPC spectral fit of spectrally-flattened DS signal t(n). In other words, spectral envelope 293C is the filter frequency response of the LPC filter represented by coefficients ai in FIGS. 2A and 2B, corresponding to spectrally-flattened signal t(n). Spectral envelope 293C includes formant peaks 293C(1)–293C(4) corresponding to, and approximately coinciding in frequency with, respective ones of formant peaks 291C(1)–(4) and 292C(1)–(4) of spectrums 291C and 292C. However, the formant peaks 293(1)–293(4) of spectrum 293C have approximately equal amplitudes. That is, the formant amplitudes of spectrum 293C are approximately equal to each other. For example, while the formant amplitudes of spectrums 291C and 292C have a dynamic range of approximately 30 dB, the formant amplitudes of spectrum 293C are within approximately 3 dB of each other.
FIG. 2D is a second set of three example spectral plots D related to filter controller 102, resulting from a second example DS signal s(n) corresponding to the “sh” portion of the word “fish” spoken by a male. Response set D includes a spectrum 291D of DS signal {tilde over (s)}(n), a spectral envelope 292D of the DS signal {tilde over (s)}(n) corresponding to spectrum 291D, and a spectral envelope 293D of spectrally-flattened signal t(n). Spectrums 291D and 292D are similar to spectrums 291C and 292C of FIG. 2C, except spectrums 291D and 292D have monotonically increasing formant amplitudes. Thus, spectrums 291D and 292D have high-pass spectral tilts, instead of low-pass spectral tilts. On the other hand, spectral envelope 293D includes formant peaks having approximately equal respective amplitudes.
FIG. 2E is a third set of three example spectral plots E related to filter controller 102, resulting from a third example DS signal s(n) corresponding to the “c” (/k/ sound) of the word “canoe” spoken by a male. Response set E includes a spectrum 291E of DS signal {tilde over (s)}(n), a spectral envelope 292E of the DS signal {tilde over (s)}(n) corresponding to spectrum 291E, and a spectral envelope 293E of spectrally-flattened signal t(n). Unlike spectrums 291C and 292C, and 291D and 292D discussed above, the formant amplitudes in spectrums 291E and 292E do not exhibit a clear spectral tilt. Instead, for example, the peak amplitude of the second formant 292D(2) is higher than that of the first and the third formant peaks 292D(1) and 292D(3), respectively. Nevertheless, spectral envelope 293E includes formant peaks having approximately equal respective amplitudes.
It can be seen from example FIGS. 2C–2E, that the formant peaks of the spectrally-flattened DS signal t(n) have approximately equal respective amplitudes for a variety of different formant structures of the input spectrum, including input formant structures having a low-pass spectral tilt, a high-pass spectral tilt, a large formant peak between two small formant peaks, and so on.
Returning again to FIG. 1A, and FIGS. 2A and 2B, the filter controller of the present invention can be considered to include a first stage 294 followed by a second stage 296. First stage 294 includes a first arrangement of signal processing blocks 220–260 in FIG. 2A, and second arrangement of signal processing blocks 215–260 in FIG. 2B. Second stage 296 includes blocks 270–290. As described above, DS signal {tilde over (s)}(n) has a spectral envelope including a first plurality of formant peaks (e.g., 291C(1)–(4)). The first plurality of formant peaks typically have substantially different respective amplitudes. First stage 294 produces, from DS signal {tilde over (s)}(n), spectrally-flattened DS signal t(n) as a time-domain signal (for example, as a series of time-domain signal samples). Spectrally-flattened time-domain DS signal t(n) has a spectral envelope including a second plurality of formant peaks (e.g., 293C(1)–(4)) corresponding to the first plurality of formant peaks of DS signal {tilde over (s)}(n). The second plurality of formant peaks have respective amplitudes that are approximately equal to each other.
Second stage 296 derives the set of filter coefficients di from spectrally-flattened time-domain DS signal t(n). Filter coefficients di represent a filter response, realized in short-term filter 104, for example, having a plurality of spectral peaks approximately coinciding in frequency with the formant peaks of the spectral envelope of DS signal {tilde over (s)}(n). The filter peaks have respective magnitudes that are approximately equal to each other.
Filter 103 receives filter coefficients di. Coefficients di cause short-term filter 104 to have the above-described filter response. Filter 104 filters DS signal {tilde over (s)}(n) (or a long-term filtered version thereof in embodiments where long-term filtering precedes short-term filtering) using coefficients di, and thus, in accordance with the above-described filter response. As mentioned above, the frequency response of filter 104 includes spectral peaks of approximately equal amplitude, and coinciding in frequency with the formant peaks of the spectral envelope of DS signal {tilde over (s)}(n). Thus, filter 103 advantageously maintains the relative amplitudes of the formant peaks of the spectral envelope of DS signal {tilde over (s)}(n), while deepening spectral valleys between the formant peaks. This preserves the overall formant structure of DS signal {tilde over (s)}(n), while reducing coding noise associated with the DS signal (that resides in the spectral valleys between the formant peaks in the DS spectral envelope).
In an embodiment, filter coefficients di are all-pole short-term filter coefficients. Thus, in this embodiment, short-term filter 104 operates as an all-pole short-term filter. In other embodiments, the short-term filter coefficients may be derived from signal t(n) as all-zero, or pole-zero coefficients, as would be apparent to one of ordinary skill in the relevant art(s) after having read the present description.
3. Long-Term Postfilter
Importantly, the long-term postfilter of the present invention (for example, long-term Filter 105) does not use an adaptive scaling factor, due to the use of a novel overlap-add procedure later in the postfilter structure. It has been demonstrated that the adaptive scaling factor can be eliminated from the long-term postfilter without causing any audible difference.
Let p denote the pitch period for the current sub-frame. For the long-term postfilter, the present invention can use an all-zero filter of the form 1+γz−p, an all-pole filter of the form




  
    1
    
      1
      -
      
        λ
        ⁢
        
          
        
        ⁢
        
          z
          
            -
            p
          
        
      
    
  
  ,




or a pole-zero filter of the form





  
    
      1
      +
      
        γ
        ⁢
        
          
        
        ⁢
        
          z
          
            -
            p
          
        
      
    
    
      1
      -
      
        λ
        ⁢
        
          
        
        ⁢
        
          z
          
            -
            p
          
        
      
    
  
  .




In the transfer functions above, the filter coefficients γ and λ are typically positive numbers between 0 and 0.5.

In a predictive speech codec, the pitch period information is often transmitted as part of the side information. At the decoder, the decoded pitch period can be used as is for the long-term postfilter. Alternatively, a search of a refined pitch period in the neighborhood of the transmitted pitch may be conducted to find a more suitable pitch period. Similarly, the coefficients γ and λ are sometimes derived from the decoded pitch predictor tap value, but sometimes re-derived at the decoder based on the decoded speech signal. There may also be a threshold effect, so that when the periodicity of the speech signal is too low to justify the use of a long-term postfilter, the coefficients γ and λ are set to zero. All these are standard practices well known in the prior art of long-term postfilters, and can be used with the long-term postfilter in the present invention.
4. Overall Postfilter Structure
FIG. 3 is a block diagram of an example arrangement 300 of adaptive postfilter 103. In other words, postfilter 300 in FIG. 3 expands on postfilter 103 in FIG. 1A. Postfilter 300 includes a long-term postfilter 310 (corresponding to long-term filter 105 in FIG. 1A) followed by a short-term postfilter 320 (corresponding to short-term filter 104 in FIG. 1A). When compared against the conventional postfilter structure of FIG. 1, one noticeable difference is the lack of separate gain scaling factors for long-term postfilter 310 and short-term postfilter 320 in FIG. 3. Another important difference is the lack of sample-by-sample smoothing of an AGC scaling factor G in FIG. 3. The elimination of these processing blocks is enabled by the addition of an overlap-add block 350, which smoothes out waveform discontinuity at the sub-frame boundaries.
Adaptive postfilter 300 in FIG. 3 is depicted with an all-zero long-term postfilter (310). FIG. 4 shows an alternative adaptive postfilter arrangement 400 of filter 103, with an all-pole long-term postfilter 410. The function of each processing block in FIG. 3 is described below. It is to be understood that FIGS. 3 and 4 also represent respective methods of filtering a signal. For example, each of the functional blocks, or groups of functional blocks, depicted in FIGS. 3 and 4 perform one or more method steps of an overall method of filtering a signal.
Let {tilde over (s)}(n) denote the n-th sample of the decoded speech. Filter block 310 performs all-zero long-term postfiltering as follows to get the long-term postfiltered signal s1(n) defined as

s1(n)={tilde over (s)}(n)+γ{tilde over (s)}(n−p).

Filter block 320 then performs short-term a postfiltering operation on s1(n) to obtain the short-term postfiltered signal ss(n) given by





  
    
      s
      s
    
    ⁡
    
      (
      n
      )
    
  
  =
  
    
      
        s
        l
      
      ⁡
      
        (
        n
        )
      
    
    -
    
      
        ∑
        
          i
          =
          1
        
        L
      
      ⁢
      
        
          d
          i
        
        ⁢
        
          
            
              s
              s
            
            ⁡
            
              (
              
                n
                -
                i
              
              )
            
          
          .
        
      
    
  




Once a sub-frame, a gain scaler block 330 measures an average “gain” of the decoded speech signal {tilde over (s)}(n) and the short-term postfiltered signal ss(n) in the current sub-frame, and calculates the ratio of these two gains. The “gain” can be determined in a number of different ways. For example, the gain can be the root-mean-square (RMS) value calculated over the current sub-frame. To avoid the square root operation and keep the computational complexity low, an embodiment of gain scaler block 330 calculates the once-a-frame AGC scaling factor G as





  
    G
    =
    
      
        
          ∑
          
            n
            =
            1
          
          N
        
        ⁢
        
          
          
            
              s
              ~
            
            ⁡
            
              (
              n
              )
            
          
          
        
      
      
        
          ∑
          
            n
            =
            1
          
          N
        
        ⁢
        
          
          
            
              s
              s
            
            ⁡
            
              (
              n
              )
            
          
          
        
      
    
  
  ,




where N is the number of speech samples in a sub-frame, and the time index n=1, 2, . . . , N corresponds to the current sub-frame.

Block 340 multiplies the current sub-frame of short-term postfiltered signal ss(n) by the once-a-frame AGC scaling factor G to obtain the gain-scaled postfiltered signal sg(n), as in

sg(n)=Gss(n), for n=1,2, . . . , N.

5. Frame Boundary Smoothing

Block 350 performs a special overlap-add operation as follows. First, at the beginning of the current sub-frame, it performs the operations of blocks 310, 320, and 340 for J samples using the postfilter parameters (γ, p, and di, i=1, 2, . . . , L) and AGC gain G of the last sub-frame, where J is the number of samples for the overlap-add operation, and J≦N. This is equivalent to letting the operations of blocks 310, 320, and 340 of the last sub-frame to continue for additional J samples into the current sub-frame without updating the postfilter parameters and AGC gain. Let the resulting J samples of output of block 340 be denoted as sp(n), n=1, 2, . . . , J. Then, these J waveform samples of the signal sp(n) are essentially a continuation of the sg(n) signal in the last sub-frame, and therefore there should be a smooth transition across the boundary between the last sub-frame and the current sub-frame. No waveform discontinuity should occur at this sub-frame boundary.
Let wd(n) and wn(n) denote the overlap-add window that is ramping down and ramping up, respectively. The overlap-add block 350 calculates the final postfilter output speech signal sf(n) as follows:




  
    
      s
      f
    
    ⁡
    
      (
      n
      )
    
  
  =
  
    {
    
      
        
          
            
              
                
                  
                    w
                    d
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ⁢
                
                  
                    s
                    p
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
              +
              
                
                  
                    w
                    u
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ⁢
                
                  
                    s
                    g
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
            
            ,
          
        
        
          
            
              
                for
              
              ⁢
              
                
              
              ⁢
              1
            
            ≤
            n
            ≤
            J
          
        
      
      
        
          
            
              
                s
                g
              
              ⁡
              
                (
                n
                )
              
            
            ,
          
        
        
          
            
              
                for
              
              ⁢
              
                
              
              ⁢
              J
            
            <
            n
            ≤
            N
          
        
      
    
  




In practice, it is found that for a sub-frame size of 40 samples (5 ms for 8 kHz sampling), satisfactory results were obtained with an overlap-add length of J=20 samples. The overlap-add window functions wd(n) and wn(n) can be any of the well-known window functions for the overlap-add operation. For example, they can both be raised-cosine windows or both be triangular windows, with the requirement that wd(n)+wn(n)=1 for n=1, 2, . . . , J. It is found that the simpler triangular windows work satisfactorily.

Note that at the end of a sub-frame, the final postfiltered speech signal sf(n) is identical to the gain-scaled signal sg(n). Since the signal sp(n) is a continuation of the signal sg(n) of the last sub-frame, and since the overlap-add operation above causes the final postfiltered speech signal sf(n) to make a gradual transition from sp(n) to sg(n) in the first J samples of the current sub-frame, any waveform discontinuity in the signal sg(n) that may exist at the sub-frame boundary (where n=1) will be smoothed out by the overlap-add operation. It is this smoothing effect provided by the overlap-add block 350 that allowed the elimination of the individual gain scaling factors for long-term and short-term postfilters, and the sample-by-sample smoothing of the AGC scaling factor.
The AGC unit of conventional postfilters (such as the one in FIG. 1B) attempts to have a smooth sample-by-sample evolution of the gain scaling factor, so as to avoid perceived discontinuity in the output waveform. There is always a trade-off in such smoothing. If there is not enough smoothing, the output speech may have audible discontinuity, sometimes described as crackling noise. If there is too much smoothing, on the other hand, the AGC gain scaling factor may adapt in a very sluggish manner—so sluggish that the magnitude of the postfiltered speech may not be able to keep up with the rapid change of magnitude in certain parts of the unfiltered decoded speech.
In contrast, there is no such “sluggishness” of gain tracking in the present invention. Before the overlap-add operation, the gain-scaled signal sg(n) is guaranteed to have the same average “gain” over the current sub-frame as the unfiltered decoded speech, regardless of how the “gain” is defined. Therefore, on a sub-frame level, the present invention will produce a final postfiltered speech signal that is completely “gain-synchronized” with the unfiltered decoded speech. The present invention will never have to “chase after” the sudden change of the “gain” in the unfiltered signal, like previous postfilters do.
FIG. 5 is a flow chart of an example method 500 of adaptively filtering a DS signal including successive DS frames (where each frame includes a series of DS samples), to smooth, and thus, substantially eliminate, signal discontinuities that may arise from a filter update at a DS frame boundary. Method 500 is also be referred to as a method of smoothing an adaptively filtered DS signal.
An initial step 502 includes deriving a past set of filter coefficients based on at least a portion of a past DS frame. For example, step 502 may include deriving short-term filter coefficients d, from a past DS frame.
A next step 504 includes filtering the past DS frame using the past set of filter coefficients to produce a past filtered DS frame.
A next step 506 includes filtering a beginning portion or segment of a current DS frame using the past filter coefficients, to produce a first filtered DS frame portion or segment. For example, step 506 produces a first filtered frame portion represented as signal sp(n) for n=1 . . . J, in the manner described above.
A next step 508 includes deriving a current set of filter coefficients based on at least a portion, such as the beginning portion, of the current DS frame.
A next step 510 includes filtering the beginning portion or segment of the current DS frame using the current filter coefficients, thereby producing a second filtered DS frame portion. For example, step 510 produces a second filtered frame portion represented as signal sg(n) for n=1 . . . J, in the manner described above.
A next step 512 (performed by blocks 350 and 450 in FIGS. 3 and 4, for example) includes modifying the second filtered DS frame portion with the first filtered DS frame portion, so as to smooth a possible signal discontinuity at a boundary between the past filtered DS frame and the current filtered DS frame. For example, step 512 performs the following operation, in the manner described above:

sf(n)=wd(n)sp(n)+wu(n)sg(n), n=1, 2, . . . , N.

In method 500, steps 506, 510 and 512 result in smoothing the possible filtered signal waveform discontinuity that can arise from switching filter coefficients at a frame boundary.
All of the filtering steps in method 500 (for example, filtering steps 504, 506 and 510) may include short-term filtering or long-term filtering, or a combination of both. Also, the filtering steps in method 500 may include short-term and/or long-term filtering, followed by gain-scaling.
Method 500 may be applied to any signal related to a speech and/or audio signal. Also, method 500 may be applied more generally to adaptive filtering (including both postfiltering and non-postfiltering) of any signal, including a signal that is not related to speech and/or audio signals.
6. Further Embodiments
FIG. 4 shows an alternative adaptive postfilter structure according to the present invention. The only difference is that the all-zero long-term postfilter 310 in FIG. 3 is now replaced by an all-pole long-term postfilter 410. This all-pole long-term postfilter 410 performs long-term postfiltering according to the following equation.

s1(n)={tilde over (s)}(n)+λs1(n−p)

The functions of the remaining four blocks in FIG. 4 are identical to the similarly numbered four blocks in FIG. 3.

As discussed in Section 2.2 above, alternative forms of short-term postfilter other than




  
    1
    
      D
      ⁡
      
        (
        z
        )
      
    
  
  ,




namely the FIR (all-zero) versions of the short-term postfilter, can also be used. Although FIGS. 3 and 4 only shows





  1
  
    D
    ⁡
    
      (
      z
      )
    
  




as the short-term postfilter, it is to be understood that any of the alternative all-zero short-term postfilters mentioned in Section 2.2 can also be used in the postfilter structure depicted in FIGS. 3 and 4. In addition, even though the short-term postfilter is shown to be following the long-term postfilter in FIGS. 3 and 4, in practice the order of the short-term postfilter and long-tern postfilter can be reversed without affecting the output speech quality. Also, the postfilter of the present invention may include only a short-term filter (that is, a short-term filter but no long-term filter) or only a long-term filter.

Yet another alternative way to practice the present invention is to adopt a “pitch prefilter” approach used in a known decoder, and move the long-term postfilter of FIG. 3 or FIG. 4 before the LPC synthesis filter of the speech decoder. However, in this case, an appropriate gain scaling factor for the long-term postfilter probably would need to be used, otherwise the LPC synthesis filter output signal could have a signal gain quite different from that of the unfiltered decoded speech. In this scenario, block 330 and block 430 could use the LPC synthesis filter output signal as the reference signal for determining the appropriate AGC gain factor.
7. Generalized Adaptive Filtering Using Overlap-Add
As mentioned above, the overlap-add method described may be used in adaptive filtering of any type of signal. For example, an adaptive filter can use components of the overlap-add method described above to filter any signal. FIG. 6 is a high-level block diagram of an example generalized adaptive or time-varying filter 600. The term “generalized” is meant to indicate that filter 600 can filter any type of signal, and that the signal need not be segmented into frames of samples.
In response to a filter control signal 604, adaptive filter 602 switches between successive filters. For example, in response to filter control signal 604, adaptive filter 602 switches from a first filter F1 to a second filter F2 at a filter update time tU. Each filter may represent a different filter transfer function (that is, frequency response), level of gain scaling, and so on. For example, each different filter may result from a different set of filter coefficients, or an updated gain present in control signal 604. In one embodiment, the two filters F1 and F2 have the exact same structures, and the switching involves updating the filter coefficients from a first set to a second set, thereby changing the transfer characteristics of the filter. In an alternative embodiment, the filters may even have different structures and the switching involves updating the entire filter structure including the filter coefficients. In either case this is referred as switching from a first filter F1 to a second filter F2. This can also be thought of as switching between different filter variations F1 and F2.
Adaptive filter 602 filters a generalized input signal 606 in accordance with the successive filters, to produce a filtered output signal 608. Adaptive filter 602 performs in accordance with the overlap-add method described above, and further below.
FIG. 7 is a timing diagram of example portions (referred to as waveforms (a) through (d)) of various signals relating to adaptive filter 600, and to be discussed below. These various signals share a common time axis. Waveform (a) represents a portion of input signal 606. Waveform (b) represents a portion of a filtered signal produced by filter 600 using filter F1. Waveform (c) represents a portion of a filtered signal produced by filter 600 using filter F2. Waveform (d) represents the overlap-add output segment, a portion of the signal 608, produced by filter 600 using the overlap-add method of the present invention. Also represented in FIG. 7 are time periods tF1 and tF2 representing time periods during which filter F1 and F2 are active, respectively.
FIG. 8 is a flow chart of an example method 800 of adaptively filtering a signal to avoid signal discontinuities that may arise from a filter update. Method 800 is described in connection with adaptive filter 600 and the waveforms of FIG. 7, for illustrative purposes.
A first step 802 includes filtering a past signal segment with a past filter, thereby producing a past filtered segment. For example, using filter F1, filter 602 filters a past signal segment 702 of signal 606, to produce a past filtered segment 704. This step corresponds to step 504 of method 500.
A next step 804 includes switching to a current filter at a filter update time. For example, adaptive filter 602 switches from filter F1 to filter F2 at filter update time tU.
A next step 806 includes filtering a current signal segment beginning at the filter update time with the past filter, to produce a first filtered segment. For example, using filter F1, filter 602 filters a current signal segment 706 beginning at the filter update time tU, to produce a first filtered segment 708. This step corresponds to step 506 of method 500. In an alternative arrangement, the order of steps 804 and 806 is reversed.
A next step 810 includes filtering the current signal segment with the current filter to produce a second filtered segment. The first and second filtered segments overlap each other in time beginning at time tU. For example, using filter F2, filter 602 filters current signal segment 706 to produce a second filtered segment 710 that overlaps first filtered segment 708. This step corresponds to step 510 of method 500.
A next step 812 includes modifying the second filtered segment with the first filtered segment so as to smooth a possible filtered signal discontinuity at the filter update time. For example, filter 602 modifies second filtered segment 710 using first filtered segment 708 to produce a filtered, smoothed, output signal segment 714. This step corresponds to step 512 of method 500. Together, steps 806, 810 and 812 in method 800 smooth any discontinuities that may be caused by the switch in filters at step 804.
Adaptive filter 602 continues to filter signal 606 with filter F2 to produce filtered segment 716. Filtered output signal 608, produced by filter 602, includes contiguous successive filtered signal segments 704, 714 and 716. Modifying step 812 smoothes a discontinuity that may arise between filtered signal segments 704 and 710 due to the switch between filters F1 and F2 at time tU, and thus causes a smooth signal transition between filtered output segments 704 and 714.
Various methods and apparatuses for processing signals have been described herein. For example, methods of deriving filter coefficients from a decoded speech signal, and methods of adaptively filtering a decoded speech signal (or a generalized signal) have been described. It is to be understood that such methods and apparatuses are intended to process at least portions or segments of the aforementioned decoded speech signal (or generalized signal). For example, the present invention operates on at least a portion of a decoded speech signal (e.g., a decoded speech frame or sub-frame) or a time-segment of the decoded speech signal. To this end, the term “decoded speech signal” (or “signal” generally) can be considered to be synonymous with “at least a portion of the decoded speech signal” (or “at least a portion of the signal”).
8. Hardware and Software Implementations
The following description of a general purpose computer system is provided for completeness. The present invention can be implemented in hardware, or as a combination of software and hardware. Consequently, the invention may be implemented in the environment of a computer system or other processing system. An example of such a computer system 900 is shown in FIG. 9. In the present invention, all of the signal processing blocks depicted in FIGS. 1A, 2A–2B, 3–4, and 6, for example, can execute on one or more distinct computer systems 900, to implement the various methods of the present invention. The computer system 900 includes one or more processors, such as processor 904. Processor 904 can be a special purpose or a general purpose digital signal processor. The processor 904 is connected to a communication infrastructure 906 (for example, a bus or network). Various software implementations are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computer systems and/or computer architectures.
Computer system 900 also includes a main memory 905, preferably random access memory (RAM), and may also include a secondary memory 910. The secondary memory 910 may include, for example, a hard disk drive 912 and/or a removable storage drive 914, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive 914 reads from and/or writes to a removable storage unit 915 in a well known manner. Removable storage unit 915, represents a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive 914. As will be appreciated, the removable storage unit 915 includes a computer usable storage medium having stored therein computer software and/or data.
In alternative implementations, secondary memory 910 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 900. Such means may include, for example, a removable storage unit 922 and an interface 920. Examples of such means may include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 922 and interfaces 920 which allow software and data to be transferred from the removable storage unit 922 to computer system 900.
Computer system 900 may also include a communications interface 924. Communications interface 924 allows software and data to be transferred between computer system 900 and external devices. Examples of communications interface 924 may include a modem, a network interface (such as an Ethernet card), a communications port, a PCMCIA slot and card, etc. Software and data transferred via communications interface 924 are in the form of signals 925 which may be electronic, electromagnetic, optical or other signals capable of being received by communications interface 924. These signals 925 are provided to communications interface 924 via a communications path 926. Communications path 926 carries signals 925 and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link and other communications channels. Examples of signals that may be transferred over interface 924 include: signals and/or parameters to be coded and/or decoded such as speech and/or audio signals and bit stream representations of such signals; any signals/parameters resulting from the encoding and decoding of speech and/or audio signals; signals not related to speech and/or audio signals that are to be filtered using the techniques described herein.
In this document, the terms “computer program medium” and “computer usable medium” are used to generally refer to media such as removable storage unit 915, removable storage unit 922, a hard disk installed in hard disk drive 912, and signals 925. As used herein, the term “tangible computer readable medium” refers to tangible media such as removable storage unit 915 and removable storage unit 922. These computer program products are means for providing software to computer system 900.
Computer programs (also called computer control logic) are stored in main memory 905 and/or secondary memory 910. Also, decoded speech frames, filtered speech frames, filter parameters such as filter coefficients and gains, and so on, may all be stored in the above-mentioned memories. Computer programs may also be received via communications interface 924. Such computer programs, when executed, enable the computer system 900 to implement the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 904 to implement the processes of the present invention, such as the methods illustrated in FIGS. 2A–2B, 3–5 and 8, for example. Accordingly, such computer programs represent controllers of the computer system 900. By way of example, in the embodiments of the invention, the processes/methods performed by signal processing blocks of quantizers and/or inverse quantizers can be performed by computer control logic. Where the invention is implemented using software, the software may be stored in a computer program product and loaded into computer system 900 using removable storage drive 914, hard drive 912 or communications interface 924.
In another embodiment, features of the invention are implemented primarily in hardware using, for example, hardware components such as Application Specific Integrated Circuits (ASICs) and gate arrays. Implementation of a hardware state machine so as to perform the functions described herein will also be apparent to persons skilled in the relevant art(s).
9. Conclusion
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the invention.
The present invention has been described above with the aid of functional building blocks and method steps illustrating the performance of specified functions and relationships thereof. The boundaries of these functional building blocks and method steps have been arbitrarily defined herein for the convenience of the description. Alternate boundaries can be defined so long as the specified functions and relationships thereof are appropriately performed. Also, the order of method steps may be rearranged. Any such alternate boundaries are thus within the scope and spirit of the claimed invention. One skilled in the art will recognize that these functional building blocks can be implemented by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

## Claims

1. A method of processing a decoded speech (DS) signal comprising:
(a) filtering the DS signal using a first intermediate set of filter coefficients to generate a first intermediate spectrally-flattened DS signal,
(b) deriving a second intermediate set of filter coefficients from the first intermediate spectrally-flattened DS signal,
(c) filtering the first intermediate spectrally-flattened DS signal using the second intermediate set of filter coefficients to generate a second intermediate spectrally-flattened DS signal, and
(d) deriving a set of filter coefficients from the second intermediate spectrally-flattened DS signal.

2. The method of claim 1, further comprising:
receiving a DS signal having a spectral envelope including a plurality of formant peaks, wherein each of the plurality of DS formant peaks approximately coincides in freciuency with a respective peak in a plurality of first formant peaks in a spectral envelope of the first intermediate spectrally-flattened DS signal, and each of the plurality of first formant peaks approximately coincides in frequency with a respective peak in a plurality of second formant peaks in a spectral envelope of the second intermediate spectrally-flattened DS signal.

3. The method of claim 1, further comprising, prior to step (a):
deriving the first intermediate set of filter coefficients based on the DS signal.

4. The method of claim 3, wherein:
said step of deriving the first intermediate set of filter coefficients includes performing an LPC analysis on the DS signal, and
said step of deriving the second intermediate set of filter coefficients includes performing an LPC analysis on the first intermediate spectrally-flattened DS signal.

5. The method of claim 3, wherein:
said step of deriving the first intermediate set of filter coefficients includes deriving the first intermediate set of filter coefficients from a set of LPC predictor coefficients associated with the DS signal, and
said step of deriving the second intermediate set of filter coefficients includes performing an LPC analysis on the first intermediate spectrally-flattened DS signal.

6. The method of claim 1, wherein step (d) comprises deriving the set of filter coefficients without performing a time-domain to a frequency-domain conversion.

7. The method of claim 1, wherein step (d) comprises performing a time-domain analysis on the second intermediate spectrally-flattened DS signal.

8. The method of claim 1, wherein step (d) comprises:
performing an LPC analysis of the second intermediate spectrally-flattened DS signal.

9. The method of claim 1, further comprising:
(e) bandwidth expanding the set of filter coefficients to produce a set of bandwidth expanded filter coefficients; and
(f) smoothing the bandwidth expanded set of filter coefficients to produce a smoothed set of filter coefficients.

10. The method of claim 9, further comprising:
(g) filtering the DS signal using the smoothed set of filter coefficients.

11. The method of claim 2, wherein one or more amplitude differences between the plurality of second formant peaks are less than 3 dB when one or more amplitude differences between the plurality of DS formant peaks are less than approximately 30 dB.

12. The method of claim 1, wherein:
the set of filter coefficients represents a filter response having a plurality of spectral peaks, each spectral peak approximately coinciding in frequency with a respective one of the plurality of DS formant peaks; and
one or more amplitude differences between respective ones of the spectral peaks are less than corresponding amplitude differences between respective ones of the plurality of DS formant peaks.

13. The method of claim 12, wherein the filter response has a spectral tilt that is reduced relative to a spectral tilt of the DS signal.

14. The method of claim 1, wherein the set of filter coefficients are all-pole filter coefficients.

15. The method of claim 1, wherein the set of filter coefficients are one of a set of pole-zero filter coefficients and a set of all-zero filter coefficients.

16. A method of processing a decoded speech (DS) signal, the DS signal having a spectral envelope including a plurality of DS formant peaks having different respective amplitudes, comprising:
(a) deriving a first set of filter coefficients based on the DS signal;
(b) filtering the DS signal based on the first set of filter coefficients; to produce a first filtered DS signal;
(c) deriving a second set of filter coefficients based on the first filtered DS signal;
(d) filtering the first filtered DS signal based on the second set of filter coefficients to produce a second filtered DS signal, the second filtered DS signal having a spectral envelope including a plurality of second formant peaks corresponding to the plurality of DS formant peaks, the plurality of second formant peaks having approximately equal amplitudes; and
(e) deriving a final set of filter coefficients from the second filtered DS signal.

17. The method of claim 16, wherein step (e) comprises:
(e)(i) performing an LPC analysis on the second filtered DS signal to derive a third set of filter coefficients;
(e)(ii) bandwidth expanding the third set of filter coefficients to produce a fourth set of filter coefficients; and
(e)(iii) smoothing the fourth set of filter coefficients to produce the final set of filter coefficients.

18. The method of claim 16, further comprising:
(f) filtering the DS signal using the smoothed set of filter coefficients.

19. A computer program product (CPP) comprising a computer usable storage medium having computer readable program code (ORPO) means embodied in the medium for causing an application program to execute on a computer processor to perform processing of a decoded speech (DS) signal by a method comprising:
filtering the DS signal using a first intermediate set of filter coefficients to generate a first intermediate spectrally-flattened DS signal,
deriving a second intermediate set of filter coefficients from the first intermediate spectrally-flattened DS signal,
filtering the first intermediate spectrally-flattened DS signal using the second intermediate set of filter coefficients to generate a second intermediate spectrally-flattened DS signal, and
deriving a set of filter coefficients from the second intermediate spectrally-flattened DS signal.

20. The CPP of claim 19, further comprising:
deriving the first intermediate set of filter coefficients based on the DS signal.

21. The CPP of claim 19, further comprising:
bandwidth expanding the set of filter coefficients to produce a set of bandwidth expanded filter coefficients; and
smoothing the bandwidth expanded set of filter coefficients to produce a smoothed set of filter coefficients.

22. The CPP of claim 21, further comprising:
filtering the DS signal using the smoothed set of filter coefficients.

23. The CPP of claim 19, wherein the set of filter coefficients are one or a set of all-pole filter coefficients, a set of pole-zero filter coefficients, and a set of all-zero coefficients.

24. An apparatus for processing a decoded speech (DS) signal, comprising:
first means for producing, from the DS signal and a first intermediate set of filter coefficients, a first spectrally-flattened DS signal,
second means for deriving a second intermediate set of filter coefficients from the first spectrally-flattened time-domain DS signal,
third means for filtering the first intermediate spectrally-flattened DS signal using the second intermediate set of filter coefficients to generate a second intermediate spectrally-flattened DS signal, and
fourth means for deriving a set of filter coefficients from the second intermediate spectrally-flattened DS signal.

25. The apparatus of claim 24, further comprising:
fifth means bandwidth expanding the set of filter coefficients to produce a set of bandwidth expanded filter coefficients; and
sixth means for smoothing the bandwidth expanded set of filter coefficients to produce a smoothed set of filter coefficients.

26. The apparatus of claim 25, further comprising:
seventh means for filtering the DS signal using the smoothed set of filter coefficients.

27. An apparatus for processing a decoded speech signal, the DS signal including a plurality of formant peaks, comprising:
a filter controller including
a first controller stage configured to produce, from the DS signal and a first intermediate set of filter coefficients, a first intermediate spectrally-flattened DS signal,
a second controller stage confignred to derive a second intermediate set of filter coefficients from the first intermediate spectrally-flattened time-domain DS signal,
a third controller stage configured to derive a second intermediate spectrally-flattened DS signal from the first intermediate spectrally-flattened DS signal and the second intermediate set of filter coefficients to generate, and
a fourth controller stage configured to derive a set of filter coefficients from the second intermediate spectrally-flattened DS signal.

28. The apparatus of claim 27, further comprising:
a filter for filtering the DS signal, the filter being configured to receive the set of filter coefficients and having a frequency response controlled in accordance with the received set of filter coefficients.

29. The apparatus of claim 27, further comprising:
a fifth controller stage configured to bandwidth expand the set of filter coefficients to produce a set of bandwidth expanded filter coefficients; and
a sixth controller stage configured to smooth the bandwidth expanded set of filter coefficients to produce a smoothed set of filter coefficients.

30. The apparatus of claim 27, further comprising:
a seventh controller stage configured to filter the DS signal using the smoothed set of filter coefficients.