# Patent

## Title
Method, system and computer program product for suppressing noise using multiple signals

## Abstract

In response to a first envelope within a kth frequency band of a first channel, a speech level within the kth frequency band of the first channel is estimated. In response to a second envelope within the kth frequency band of a second channel, a noise level within the kth frequency band of the second channel is estimated. A noise suppression gain for a time frame n is computed in response to the estimated speech level for a preceding time frame, the estimated noise level for the preceding time frame, the estimated speech level for the time frame n, and the estimated noise level for the time frame n. An output channel is generated in response to multiplying the noise suppression gain for the time frame n and the first channel.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This application claims priority to U.S. Provisional Patent Application Ser. No. 61/524,928, filed Aug. 18, 2011, entitled METHOD FOR MULTIPLE MICROPHONE NOISE SUPPRESSION BASED ON PERCEPTUAL POST-PROCESSING, naming Devangi Nikunj Parikh et al. as inventors, which is hereby fully incorporated herein by reference for all purposes.


BACKGROUND
The disclosures herein relate in general to audio processing, and in particular to a method, system and computer program product for suppressing noise using multiple signals.
In mobile telephone conversations, improving quality of uplink speech is an important and challenging objective. If noise suppression parameters (e.g., gain) are updated too infrequently, then such noise suppression is less effective in response to relatively fast changes in the received signals. Conversely, if such parameters are updated too frequently, then such updating may cause annoying musical noise artifacts.
SUMMARY
In response to a first envelope within a kth frequency band of a first channel, a speech level within the kth frequency band of the first channel is estimated. In response to a second envelope within the kth frequency band of a second channel, a noise level within the kth frequency band of the second channel is estimated. A noise suppression gain for a time frame n is computed in response to the estimated speech level for a preceding time frame, the estimated noise level for the preceding time frame, the estimated speech level for the time frame n, and the estimated noise level for the time frame n. An output channel is generated in response to multiplying the noise suppression gain for the time frame n and the first channel.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a perspective view of a mobile smartphone that includes an information handling system of the illustrative embodiments.
FIG. 2 is a block diagram of the information handling system of the illustrative embodiments.
FIG. 3 is an information flow diagram of an operation of the system of FIG. 2.
FIG. 4 is an information flow diagram of a blind source separation operation of FIG. 3.
FIG. 5 is an information flow diagram of a post processing operation of FIG. 3.
FIG. 6 is a graph of various frequency bands that are suitable for human perceptual auditory response, which are applied by an auditory filter bank operation of FIG. 5.
FIG. 7 is a graph of an example non-linear expansion of a speech segment's dynamic range, in which the speech segment's noise level is reduced by an expansion factor, while estimated speech level remains constant in low-frequency bands.
FIG. 8 is a graph of an example non-linear expansion of a speech segment's dynamic range, in which the speech segment's noise level is reduced by an expansion factor, while average speech level from speech-dominant frequency bands is applied to low-frequency bands.
FIG. 9 is a graph of noise suppression gain in response to a signal's a posteriori speech-to-noise ratio (“SNR”) for different values of the signal's a priori SNR, in accordance with one example of automatic gain control (“AGC”) noise suppression in the illustrative embodiments.
FIG. 10 is a graph of a rate of change of gain with fixed attenuation, and a rate of change of gain with variable attenuation, for various frequency bands of a speech sample that was corrupted by noise at 5 dB SNR.
FIG. 11 is a graph of such rates of change during noise-only periods.
FIG. 12 is a graph of such rates of change during speech periods.



DETAILED DESCRIPTION
FIG. 1 is a perspective view of a mobile smartphone, indicated generally at 100, that includes an information handling system of the illustrative embodiments. In this example, the smartphone 100 includes a primary microphone, a secondary microphone, an ear speaker, and a loud speaker, as shown in FIG. 1. Also, the smartphone 100 includes a touchscreen and various switches for manually controlling an operation of the smartphone 100.
FIG. 2 is a block diagram of the information handling system, indicated generally at 200, of the illustrative embodiments. A human user 202 speaks into the primary microphone (FIG. 1), which converts sound waves of the speech (from a voice of the user 202) into a primary voltage signal V1. The secondary microphone (FIG. 1) converts sound waves of noise (e.g., from an ambient environment that surrounds the smartphone 100) into a secondary voltage signal V2. Also, the signal V1 contains the noise, and the signal V2 contains leakage of the speech.
A control device 204 receives the signal V1 (which represents the speech and the noise) from the primary microphone and the signal V2 (which represents the noise and leakage of the speech) from the secondary microphone. In response to the signals V1 and V2, the control device 204 outputs: (a) a first electrical signal to a speaker 206; and (b) a second electrical signal to an antenna 208. The first electrical signal and the second electrical signal communicate speech from the signals V1 and V2, while suppressing at least some noise from the signals V1 and V2.
In response to the first electrical signal, the speaker 206 outputs sound waves, at least some of which are audible to the human user 202. In response to the second electrical signal, the antenna 208 outputs a wireless telecommunication signal (e.g., through a cellular telephone network to other smartphones). In the illustrative embodiments, the control device 204, the speaker 206 and the antenna 208 are components of the smartphone 100, whose various components are housed integrally with one another. Accordingly in a first example, the speaker 206 is the ear speaker of the smartphone 100. In a second example, the speaker 206 is the loud speaker of the smartphone 100.
The control device 204 includes various electronic circuitry components for performing the control device 204 operations, such as: (a) a digital signal processor (“DSP”) 210, which is a computational resource for executing and otherwise processing instructions, and for performing additional operations (e.g., communicating information) in response thereto; (b) an amplifier (“AMP”) 212 for outputting the first electrical signal to the speaker 206 in response to information from the DSP 210; (c) an encoder 214 for outputting an encoded bit stream in response to information from the DSP 210; (d) a transmitter 216 for outputting the second electrical signal to the antenna 208 in response to the encoded bit stream; (e) a computer-readable medium 218 (e.g., a nonvolatile memory device) for storing information; and (f) various other electronic circuitry (not shown in FIG. 2) for performing other operations of the control device 204.
The DSP 210 receives instructions of computer-readable software programs that are stored on the computer-readable medium 218. In response to such instructions, the DSP 210 executes such programs and performs its operations, so that the first electrical signal and the second electrical signal communicate speech from the signals V1 and V2, while suppressing at least some noise from the signals V1 and V2. For executing such programs, the DSP 210 processes data, which are stored in memory of the DSP 210 and/or in the computer-readable medium 218. Optionally, the DSP 210 also receives the first electrical signal from the amplifier 212, so that the DSP 210 controls the first electrical signal in a feedback loop.
In an alternative embodiment, the primary microphone (FIG. 1), the secondary microphone (FIG. 1), the control device 204 and the speaker 206 are components of a hearing aid for insertion within an ear canal of the user 202. In one version of such alternative embodiment, the hearing aid omits the antenna 208, the encoder 214 and the transmitter 216.
FIG. 3 is an information flow diagram of an operation of the system 200. In accordance with FIG. 3, the DSP 210 performs an adaptive linear filter operation to separate the speech from the noise. In FIG. 3, s1[n] and s2[n] represent the speech (from the user 202) and the noise (e.g., from an ambient environment that surrounds the smartphone 100), respectively, during a time frame n. Further, x1[n] and x2[n] are digitized versions of the signals V1 and V2, respectively, of FIG. 2.
Accordingly: (a) x1[n] contains information that primarily represents the speech, but also the noise; and (b) x2[n] contains information that primarily represents the noise, but also leakage of the speech. The noise includes directional noise (e.g., a different person's background speech) and diffused noise. The DSP 210 performs a dual-microphone blind source separation (“BSS”) operation, which generates y1[n] and y2[n] in response to x1[n] and x2[n], so that: (a) y1[n] is a primary channel of information that represents the speech and the diffused noise while suppressing most of the directional noise from x1[n]; and (b) y2[n] is a secondary channel of information that represents the noise while suppressing most of the speech from x2[n].
After the BSS operation, the DSP 210 performs a post processing operation. In the post processing operation, the DSP 210: (a) in response to y2[n], estimates the diffused noise within y1[n]; and (b) in response to such estimate, generates ŝ1[n], which is an output channel of information that represents the speech while suppressing most of the noise from y1[n]. The DSP 210 performs the post processing operation within various frequency bands that are suitable for human perceptual auditory response. As discussed hereinabove in connection with FIG. 2, the DSP 210 outputs such ŝ1[n] information to: (a) the AMP 212, which outputs the first electrical signal to the speaker 206 in response to such ŝ1[n] information; and (b) the encoder 214, which outputs the encoded bit stream to the transmitter 216 in response to such ŝ1[n] information. Optionally, the DSP 210 writes such ŝ1[n] information for storage on the computer-readable medium 218.
FIG. 4 is an information flow diagram of the BSS operation of FIG. 3. A speech estimation filter H1: (a) receives x1[n], y1[n] and y2[n]; and (b) in response thereto, adaptively outputs an estimate of speech that exists within y1[n]. A noise estimation filter H2: (a) receives x2[n], y1[n] and y2[n]; and (b) in response thereto, adaptively outputs an estimate of directional noise that exists within y2[n].
As shown in FIG. 4, y1[n] is a difference between: (a) x1[n]; and (b) such estimated directional noise from the noise estimation filter H2. In that manner, the BSS operation iteratively removes such estimated directional noise from x1[n], so that y1[n] is a primary channel of information that represents the speech and the diffused noise while suppressing most of the directional noise from x1[n]. Further, as shown in FIG. 4, y2[n] is a difference between: (a) x2[n]; and (b) such estimated speech from the speech estimation filter H1. In that manner, the BSS operation iteratively removes such estimated speech from x2[n], so that y2[n] is a secondary channel of information that represents the noise while suppressing most of the speech from x2[n].
The filters H1 and H2 are adapted to reduce cross-correlation between y1[n] and y2[n], so that their filter lengths (e.g., 20 filter taps) are sufficient for estimating: (a) a path of the speech from the primary channel to the secondary channel; and (b) a path of the directional noise from the secondary channel to the primary channel. In the BSS operation, the DSP 210 estimates a level of a noise floor (“noise level”) and a level of the speech (“speech level”).
The DSP 210 computes the speech level by autoregressive (“AR”) smoothing (e.g., with a time constant of 20 ms). The DSP 210 estimates the speech level as Ps[n]=α·Ps[n−1]+(1−α)·y1[n]2, where: (a) α=exp(−1/Fsτ); (b) Ps[n] is a power of the speech during the time frame n; (c) Ps[n−1] is a power of the speech during the immediately preceding time frame n−1; and (d) Fs is a sampling rate. In one example, α=0.95, and τ=0.02.
The DSP 210 estimates the noise level (e.g., once per 10 ms) as: (a) if Ps[n]>PN[n−1]·Cu, then PN[n]=PN[n−1]·Cu, where PN[n] is a power of the noise level during the time frame n, PN[n−1] is a power of the noise level during the immediately preceding time frame n−1, and Cu is an upward time constant; or (b) if Ps[n]<PN[n−1]. Cd, then PN[n]=PN[n−1]·Cd, where Cd is a downward time constant; or (c) if neither (a) nor (b) is true, then PN[n]=Ps[n]. In one example, Cu is 3 dB/sec, and Cd is −24 dB/sec.
FIG. 5 is an information flow diagram of the post processing operation. For simplicity of notation, FIG. 5 shows y1[n] and y2[n] as y1 and y2, respectively. Also, for simplicity of notation, FIG. 5 shows ŝ1[n] as ŝ.
FIG. 6 is a graph of various frequency bands that are suitable for human perceptual auditory response. As shown in FIG. 6, each frequency band partially overlaps neighboring frequency bands. For example, in FIG. 6, one frequency band ranges from  ̃1350 Hz to 2500 Hz, and such frequency band partially overlaps: (a) a frequency band that ranges from  ̃850 Hz to  ̃1650 Hz; (b) a frequency band that ranges from  ̃1100 Hz to  ̃2000 Hz; (c) a frequency band that ranges from  ̃1650 Hz to  ̃3050 Hz; and (d) a frequency band that ranges from  ̃2000 Hz to  ̃3650 Hz.
A particular band is referenced as the kth band, where: (a) k is an integer number that ranges from 1 through N; and (b) N is a total number of such bands. Referring again to FIG. 5, in an auditory filter bank operation (which models a cochlear filter bank operation), the DSP 210: (a) receives y1 and y2 from the BSS operation; (b) converts y1 from a time domain to a frequency domain, and decomposes the frequency domain version of y1 into a primary channel of the N bands; and (c) converts y2 from time domain to frequency domain, and decomposes the frequency domain version of y2 into a secondary channel of the N bands. By decomposing y1 and y2 into the primary and secondary channels of N bands that are suitable for human perceptual auditory response, instead of decomposing them with a fast Fourier transform (“FFT”), the DSP 210 is able to perform its noise suppression operation while preserving higher quality (e.g., less distortion, more naturally sounding, more intelligible, and more audible) speech with fewer artifacts.
From the kth band of the primary channel, the DSP 210 uses a low-pass filter to identify a respective envelope epk[n], so that such envelopes for all N bands are notated as ep in FIG. 5 for simplicity. Similarly, from the kth band of the secondary channel, the DSP 210 uses a low-pass filter to identify a respective envelope esk[n], so that such envelopes for all N bands are notated as es in FIG. 5 for simplicity.
In response to epk[n], the DSP 210 estimates (e.g., once per millisecond) a respective speech level ekmax for the kth band as

ekmax=max(αspeechekmax,epk[n]),  (1)

where αspeech is a forgetting factor. The DSP 210 sets αspeech to implement a time constant, which is four (4) times higher than a time constant of the low-pass filter that the DSP 210 uses for identifying epk[n]. In that manner, ekmax rises more quickly than it falls between the immediately preceding time frame n−1 and the time frame n, so that ekmax quickly rises in response to higher epk[n], yet slowly falls in response to lower epk[n]. In FIG. 5, such estimated speech levels ekmax for all N bands are notated as emax for simplicity.

In response to esk[n], the DSP 210 estimates (e.g., once per millisecond) a respective noise level ekmin for the kth band as

ekmin=αnoiseekmin+(1−αnoise)esk[n],  (2)

where αnoise=0.95. In that manner, ekmin rises approximately as quickly as it falls between the immediately preceding time frame n−1 and the time frame n, so that ekmin closely tracks esk[n], yet ekmin smoothes rapid changes in esk[n]. In FIG. 5, such estimated noise levels ekmin for all N bands are notated as emin for simplicity.

In response to ekmax and ekmin, the DSP 210 estimates a respective peak speech-to-noise ratio Mk for the kth band, so that such peak speech-to-noise ratios for all N bands are notated as M in FIG. 5 for simplicity. Accordingly, a band's respective Mk represents such band's respective long-term dynamic range, which the DSP 210 computes as Mk=ekmax/ekmin.
Also, the DSP 210 computes a respective noise suppression gain Gk[n] for the kth band as

Gk[n]=βk(epk[n])α−1,  (3)

where: (a) βk=(ekmax)(1−α); (b) α=1−(log Kk/log Mk); and (c) Kk is an expansion factor for the kth band, so that such expansion factors for all N bands are notated as K in FIG. 5 for simplicity. Initially, the DSP 210 sets Kk=0.01. In real-time causal implementations of the system 200, a band's respective Mk, Kk and Gk[n] are variable per time frame n.

The DSP 210 computes Kk in response to an estimate of a priori speech-to-noise ratio (“SNR”), which is a logarithmic ratio between a clean version of the signal's energy (e.g., as estimated by the DSP 210) and the noise's energy (e.g., as represented by y2[n]). By comparison, a posteriori SNR is a logarithmic ratio between a noisy version of the signal's energy (e.g., speech and diffused noise as represented by y1[n]) and the noise's energy (e.g., as represented by y2[n]). In the illustrative embodiments, the DSP 210 performs automatic gain control (“AGC”) noise suppression in response to both a posteriori SNR and estimated a priori SNR.
The DSP 210 updates (e.g., once per millisecond) its estimate of a priori SNR as




  
    
      
        
          
                        prio
          
          ⁡
          
            [
            n
            ]
          
        
        =
        
          
            
              
                α
                speech
              
              ⁡
              
                (
                
                  
                    
                      
                        G
                        k
                      
                      ⁡
                      
                        [
                        
                          n
                          -
                          1
                        
                        ]
                      
                    
                    ⁢
                    
                      
                        e
                        
                          p
                          k
                        
                      
                      ⁡
                      
                        [
                        n
                        ]
                      
                    
                  
                  
                    e
                    
                      k
                      min
                    
                  
                
                )
              
            
            2
          
          +
          
            
              (
              
                1
                -
                
                  α
                  speech
                
              
              )
            
            ⁢
            
              max
              ⁡
              
                (
                
                  
                    
                      (
                      
                        
                          
                            e
                            
                              p
                              k
                            
                          
                          ⁡
                          
                            [
                            n
                            ]
                          
                        
                        
                          e
                          min
                        
                      
                      )
                    
                    2
                  
                  ,
                  0
                
                )
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




During the nth time frame, prio[n] is not yet determined exactly, so the DSP 210 updates its decision-directed estimate of prio[n] in response to Gk[n−1] from the immediately preceding time frame n−1, as shown by Equation (4). Accordingly, the DSP 210: (a) smoothes its estimate of a priori SNR at relatively low values thereof; and (b) adjusts its estimate of a priori SNR at relatively high values thereof in a manner that closely tracks (with a delay of one time frame) a posteriori SNR. In that manner, the DSP 210 helps to reduce annoying musical noise artifacts.
The DSP 210 sets a maximum attenuation Kmax, so that it determines a gain slope for a maximum a priori SNR, which is notated as max(prio). Similarly, the DSP 210 sets a minimum attenuation Kmin, so that it determines a gain slope for a minimum a priori SNR, which is notated as min(prio). In one example, Kmax=−20 dB, max(prio)=10 dB, Kmin=−15 dB, and min(prio)=−40 dB.
For any particular time frame n, the DSP 210 computes Kk as




  
    
      
        
          
            K
            k
          
          =
          
            
              a
              ⁢
              
                
                                    prio
                
                ⁡
                
                  [
                  n
                  ]
                
              
            
            +
            b
          
        
        ,
        
          

        
        ⁢
        where
      
    
    
      
        (
        5
        )
      
    
  
  
    
      
        
          a
          =
          
            
              
                
                  K
                  min
                
                -
                
                  K
                  max
                
              
              
                
                  min
                  ⁡
                  
                    (
                    
                                            prio
                    
                    )
                  
                
                -
                
                  max
                  ⁡
                  
                    (
                    
                                            prio
                    
                    )
                  
                
              
            
            ⁢
            and
          
        
        ,
      
    
    
      
        (
        6
        )
      
    
  
  
    
      
        b
        =
        
          
            
              
                
                  min
                  ⁡
                  
                    (
                    
                                            prio
                    
                    )
                  
                
                ⁢
                
                  K
                  max
                
              
              -
              
                
                  max
                  ⁡
                  
                    (
                    
                                            prio
                    
                    )
                  
                
                ⁢
                
                  K
                  min
                
              
            
            
              
                min
                ⁡
                
                  (
                  
                                        prio
                  
                  )
                
              
              -
              
                max
                ⁡
                
                  (
                  
                                        prio
                  
                  )
                
              
            
          
          .
        
      
    
    
      
        (
        7
        )
      
    
  




FIG. 7 is a graph of an example non-linear expansion of a speech segment's dynamic range, in which the speech segment's noise level emin is reduced by an expansion factor K<1.0, while estimated speech level emax remains constant in low-frequency bands (e.g., below  ̃200 Hz). However, in such low-frequency bands, the noise may dominate the speech, so that the estimated speech level emax may nevertheless correspond to the noise level emin. Accordingly, in the example of FIG. 7, low-frequency artifacts become audible, because such expansion causes unnatural modulation in low-frequency bands where the noise is dominant.
FIG. 8 is a graph of an example non-linear expansion of a speech segment's dynamic range, in which the speech segment's noise level emin is reduced by an expansion factor K<1.0, while average speech level emax from speech-dominant frequency bands (e.g., between  ̃300 Hz and  ̃1000 Hz) is applied to low-frequency bands (e.g., below  ̃200 Hz). In comparison to the example of FIG. 7, fewer low-frequency artifacts become audible in the example of FIG. 8. Similarly, the DSP 210 effectively adjusts (e.g., non-linearly expands) a speech segment's dynamic range in the kth band by: (a) estimating the kth band's respective ekmax and ekmin in accordance with Equations (1) and (2) respectively; (b) computing the kth band's respective expansion factor Kk in accordance with Equation (5); (c) in response to ekmax and ekmin, estimating the kth band's respective peak speech-to-noise ratio Mk as discussed hereinabove; and (d) in response to epk[n], ekmax, Kk and Mk, computing the kth band's respective noise suppression gain Gk[n] in accordance with Equation (3).
In that manner, the DSP 210 performs its noise suppression operation to preserve higher quality speech, while reducing artifacts in frequency bands whose SNRs are relatively low. Accordingly, in the illustrative embodiments, Gk[n] varies in response to both a posteriori SNR and estimated a priori SNR. For example, a priori SNR is represented by Kk, because Kk varies in response to only a priori SNR, as shown by Equation (5).
Referring again to FIG. 5, after the DSP 210 computes the kth band's respective noise suppression gain Gk[n] for the time frame n, the DSP 210 generates a respective noise-suppressed version ŝ1k[n] of the primary channel's kth band y1k[n] by applying Gk[n] thereto (e.g., by multiplying Gk[n] and the primary channel's kth band y1k[n] for the time frame n). After the DSP 210 generates the respective noise-suppressed versions ŝkk[n] of all N bands of the primary channel for the time frame n, the DSP 210 composes ŝ for the time frame n by performing an inverse of the auditory filter bank operation, in order to convert a sum of those noise-suppressed versions ŝkk[n] from a frequency domain to a time domain.
For reducing an extent of annoying musical noise artifacts in the illustrative embodiments, the DSP 210 implicitly smoothes the gain Gk and thereby reduces its rate of change. In non-causal implementations: (a) a band's respective Mk and Kk are not variable per time frame n; and (b) a rate of change of Gk with respect to time is




  
    
      
        
          
            d
            
              G
              k
            
          
          
            d
            t
          
        
        =
        
          
            -
            
              
                log
                ⁢
                
                  
                
                ⁢
                K
              
              
                log
                ⁢
                
                  
                
                ⁢
                
                  M
                  k
                
              
            
          
          ·
          
            
              G
              k
            
            
              e
              k
            
          
          ·
          
            
              
                d
                
                  e
                  k
                
              
              
                d
                t
              
            
            .
          
        
      
    
    
      
        (
        8
        )
      
    
  




By comparison, in causal implementations, if Mk is variable per time frame n, then the rate of change of Gk with respect to time increases to




  
    
      
        
          
            d
            
              G
              k
            
          
          
            d
            t
          
        
        =
        
          
            
              -
              
                
                  log
                  ⁢
                  
                    
                  
                  ⁢
                  K
                
                
                  log
                  ⁢
                  
                    
                  
                  ⁢
                  
                    M
                    k
                  
                
              
            
            ·
            
              
                G
                k
              
              
                e
                k
              
            
            ·
            
              
                d
                
                  e
                  k
                
              
              
                d
                t
              
            
          
          +
          
            
              
                G
                k
              
              ·
              
                ln
                ⁡
                
                  (
                  
                    
                      e
                      k
                    
                    
                      e
                      
                        k
                        max
                      
                    
                  
                  )
                
              
              ·
              
                d
                
                  d
                  t
                
              
            
            ⁢
            
              
                (
                
                  -
                  
                    
                      log
                      ⁢
                      
                        
                      
                      ⁢
                      K
                    
                    
                      log
                      ⁢
                      
                        
                      
                      ⁢
                      
                        M
                        k
                      
                    
                  
                
                )
              
              .
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




The second term in Equation (9) causes a potential increase in dGk/dt. For simplicity of notation, Equations (8) and (9) show Kk as K.
FIG. 9 is a graph of noise suppression gain in response to a signal's a posteriori SNR (current sample) for different values of the signal's a priori SNR (previous sample), in accordance with one example of automatic gain control (“AGC”) noise suppression in the illustrative embodiments. As shown in FIG. 9, for different values of a priori SNR, the DSP 210 attenuates the signal by respective amounts, but a range (between such respective amounts) is progressively wider in response to progressively lower values of a posteriori SNR.
In experiments where values of max(prio) and min(prio) were selected to cover a range of observed SNR, the limits of a priori SNR did not seem to change an extent of perceived musical noise artifacts. By comparison, if Kmin and Kmax were reduced to achieve more noise suppression, then more artifacts were perceived. One possibility is that, in addition to a rate of change (e.g., modulation frequency) of gain, a modulation depth of gain could also be a factor in perception of such artifacts.
To quantify a rate of change of gain, a Euclidean norm of dG/dt may be computed as




  
    
      
        
          ||
          
            ∇
            G
          
          ||
        
        =
        
          
            
              
                (
                
                  
                    d
                    G
                  
                  
                    d
                    t
                  
                
                )
              
              2
            
          
          .
        
      
    
    
      
        (
        10
        )
      
    
  




In a first implementation, K is fixed over time, so it has fixed attenuation. In a second implementation, K varies according to Equation (5), so it has variable attenuation. For comparing rates of change of gain between such first and second implementations, their respective values of =∫t∥∇G∥dt may be computed, so that: (a) fix is  for the first implementation that has fixed attenuation; and (b) var is  for the second implementation that has variable attenuation.
FIG. 10 is a graph of fix and var for various frequency bands of a speech sample that was corrupted by noise at 5 dB SNR. In FIGS. 12, 13 and 14, the values of fix are shown by “O” markings, and the values of var are shown by “X” markings
FIG. 11 is a graph of such fix and var during noise-only periods. In the example of FIG. 11, var is lower than fix in all of the frequency bands. Accordingly, during the noise-only periods, the second implementation (in comparison to the first implementation) achieved a lower rate of change of gain. Such lower rate caused fewer musical noise artifacts.
FIG. 12 is a graph of such fix and var during speech periods. In FIG. 12, var>fix in frequency band numbers 12-17, which correspond to speech-dominant frequencies (whose center frequencies range from 613 Hz to 1924 Hz). Accordingly, in the speech-dominant frequencies, the second implementation (in comparison to the first implementation) achieved a higher rate of change of gain. Although some musical noise artifacts were observed in the speech-dominant frequencies during those speech periods, such artifacts were not annoying, because the post processing operation was performed in a manner that preserved higher quality speech.
In the illustrative embodiments, a computer program product is an article of manufacture that has: (a) a computer-readable medium; and (b) a computer-readable program that is stored on such medium. Such program is processable by an instruction execution apparatus (e.g., system or device) for causing the apparatus to perform various operations discussed hereinabove (e.g., discussed in connection with a block diagram). For example, in response to processing (e.g., executing) such program's instructions, the apparatus (e.g., programmable information handling system) performs various operations discussed hereinabove. Accordingly, such operations are computer-implemented.
Such program (e.g., software, firmware, and/or microcode) is written in one or more programming languages, such as: an object-oriented programming language (e.g., C++); a procedural programming language (e.g., C); and/or any suitable combination thereof. In a first example, the computer-readable medium is a computer-readable storage medium. In a second example, the computer-readable medium is a computer-readable signal medium.
A computer-readable storage medium includes any system, device and/or other non-transitory tangible apparatus (e.g., electronic, magnetic, optical, electromagnetic, infrared, semiconductor, and/or any suitable combination thereof) that is suitable for storing a program, so that such program is processable by an instruction execution apparatus for causing the apparatus to perform various operations discussed hereinabove. Examples of a computer-readable storage medium include, but are not limited to: an electrical connection having one or more wires; a portable computer diskette; a hard disk; a random access memory (“RAM”); a read-only memory (“ROM”); an erasable programmable read-only memory (“EPROM” or flash memory); an optical fiber; a portable compact disc read-only memory (“CD-ROM”); an optical storage device; a magnetic storage device; and/or any suitable combination thereof.
A computer-readable signal medium includes any computer-readable medium (other than a computer-readable storage medium) that is suitable for communicating (e.g., propagating or transmitting) a program, so that such program is processable by an instruction execution apparatus for causing the apparatus to perform various operations discussed hereinabove. In one example, a computer-readable signal medium includes a data signal having computer-readable program code embodied therein (e.g., in baseband or as part of a carrier wave), which is communicated (e.g., electronically, electromagnetically, and/or optically) via wireline, wireless, optical fiber cable, and/or any suitable combination thereof.
Although illustrative embodiments have been shown and described by way of example, a wide range of alternative embodiments is possible within the scope of the foregoing disclosure.

## Claims

1. A method performed by an information handling system for suppressing noise, the method comprising:
receiving a first signal that represents speech and the noise, wherein the noise includes directional noise and diffused noise;
receiving a second signal that represents the noise and leakage of the speech;
in response to the first and second signals, generating: a first channel of information that represents the speech and the diffused noise while suppressing most of the directional noise from the first signal; and a second channel of information that represents the noise while suppressing most of the speech from the second signal; and
in response to the first and second channels, generating frequency bands of an output channel of information that represents the speech while suppressing most of the noise from the first channel;
wherein the frequency bands include at least N frequency bands, wherein k is an integer number that ranges from 1 through N, and wherein generating a kth frequency band of the output channel includes: in response to a first envelope within the kth frequency band of the first channel, estimating a speech level within the kth frequency band of the first channel; in response to a second envelope within the kth frequency band of the second channel, estimating a noise level within the kth frequency band of the second channel; computing a noise suppression gain for a time frame n in response to the estimated speech level for a preceding time frame, the estimated noise level for the preceding time frame, the estimated speech level for the time frame n, and the estimated noise level for the time frame n; and generating the kth frequency band of the output channel for the time frame n in response to multiplying the noise suppression gain for the time frame n and the kth frequency band of the first channel for the time frame n.

2. The method of claim 1, wherein the frequency bands include at least first and second frequency bands that partially overlap one another.

3. The method of claim 2, wherein the frequency bands are suitable for human perceptual auditory response.

4. The method of claim 1, and comprising: performing a first filter bank operation for converting a time domain version of the first channel to the frequency bands of the first channel; and performing a second filter bank operation for converting a time domain version of the second channel to the frequency bands of the second channel.

5. The method of claim 4, and comprising: generating the output channel, wherein generating the output channel includes performing an inverse of the first filter bank operation for converting a sum of the frequency bands of the output channel to a time domain.

6. The method of claim 1, wherein estimating the speech level includes: estimating the speech level so that it rises more quickly than it falls between a preceding time frame and a time frame n.

7. The method of claim 6, wherein estimating the noise level includes: estimating the noise level so that it rises approximately as quickly as it falls between the preceding time frame and the time frame n.

8. The method of claim 1, wherein estimating the speech level includes: with a low-pass filter, identifying the first envelope within the kth frequency band of the first channel.

9. The method of claim 8, wherein the low-pass filter is a first low-pass filter, and wherein estimating the noise level includes: with a second low-pass filter, identifying the second envelope within the kth frequency band of the second channel.

10. The method of claim 1, wherein computing the noise suppression gain includes:
computing a first speech-to-noise ratio of the kth band for the preceding time frame, wherein computing the first speech-to-noise ratio includes dividing the estimated speech level for the preceding time frame by the estimated noise level for the preceding time frame;
computing a second speech-to-noise ratio of the kth band for the time frame n, wherein computing the second speech-to-noise ratio includes dividing the estimated speech level for the time frame n by the estimated noise level for the time frame n; and
computing the noise suppression gain in response to the first and second speech-to-noise ratios.

11. A system for suppressing noise, the system comprising:
at least one device for: receiving a first signal that represents speech and the noise, wherein the noise includes directional noise and diffused noise; receiving a second signal that represents the noise and leakage of the speech; in response to the first and second signals, generating: a first channel of information that represents the speech and the diffused noise while suppressing most of the directional noise from the first signal; and a second channel of information that represents the noise while suppressing most of the speech from the second signal; and, in response to the first and second channels, generating frequency bands of an output channel of information that represents the speech while suppressing most of the noise from the first channel;
wherein the frequency bands include at least N frequency bands, wherein k is an integer number that ranges from 1 through N, and wherein generating a kth frequency band of the output channel includes: in response to a first envelope within the kth frequency band of the first channel, estimating a speech level within the kth frequency band of the first channel; in response to a second envelope within the kth frequency band of the second channel, estimating a noise level within the kth frequency band of the second channel; computing a noise suppression gain for a time frame n in response to the estimated speech level for a preceding time frame, the estimated noise level for the preceding time frame, the estimated speech level for the time frame n, and the estimated noise level for the time frame n; and generating the kth frequency band of the output channel for the time frame n in response to multiplying the noise suppression gain for the time frame n and the kth frequency band of the first channel for the time frame n.

12. The system of claim 11, wherein the frequency bands include at least first and second frequency bands that partially overlap one another.

13. The system of claim 12, wherein the frequency bands are suitable for human perceptual auditory response.

14. The system of claim 11, wherein the at least one device is for: performing a first filter bank operation for converting a time domain version of the first channel to the frequency bands of the first channel; and performing a second filter bank operation for converting a time domain version of the second channel to the frequency bands of the second channel.

15. The system of claim 14, wherein the at least one device is for: generating the output channel, wherein generating the output channel includes performing an inverse of the first filter bank operation for converting a sum of the frequency bands of the output channel to a time domain.

16. The system of claim 11, wherein estimating the speech level includes: estimating the speech level so that it rises more quickly than it falls between a preceding time frame and a time frame n.

17. The system of claim 16, wherein estimating the noise level includes: estimating the noise level so that it rises approximately as quickly as it falls between the preceding time frame and the time frame n.

18. The system of claim 11, wherein estimating the speech level includes: with a low-pass filter, identifying the first envelope within the kth frequency band of the first channel.

19. The system of claim 18, wherein the low-pass filter is a first low-pass filter, and wherein estimating the noise level includes: with a second low-pass filter, identifying the second envelope within the kth frequency band of the second channel.

20. The system of claim 11, wherein computing the noise suppression gain includes:
computing a first speech-to-noise ratio of the kth band for the preceding time frame, wherein computing the first speech-to-noise ratio includes dividing the estimated speech level for the preceding time frame by the estimated noise level for the preceding time frame;
computing a second speech-to-noise ratio of the kth band for the time frame n, wherein computing the second speech-to-noise ratio includes dividing the estimated speech level for the time frame n by the estimated noise level for the time frame n; and
computing the noise suppression gain in response to the first and second speech-to-noise ratios.

21. A computer program product for suppressing noise, the computer program product comprising:
a tangible computer-readable storage medium; and
a computer-readable program stored on the tangible computer-readable storage medium, wherein the computer-readable program is processable by an information handling system for causing the information handling system to perform operations including: receiving a first signal that represents speech and the noise, wherein the noise includes directional noise and diffused noise; receiving a second signal that represents the noise and leakage of the speech; in response to the first and second signals, generating: a first channel of information that represents the speech and the diffused noise while suppressing most of the directional noise from the first signal; and a second channel of information that represents the noise while suppressing most of the speech from the second signal; and, in response to the first and second channels, generating frequency bands of an output channel of information that represents the speech while suppressing most of the noise from the first channel;
wherein the frequency bands include at least N frequency bands, wherein k is an integer number that ranges from 1 through N, and wherein generating a kth frequency band of the output channel includes: in response to a first envelope within the kth frequency band of the first channel, estimating a speech level within the kth frequency band of the first channel; in response to a second envelope within the kth frequency band of the second channel, estimating a noise level within the kth frequency band of the second channel; computing a noise suppression gain for a time frame n in response to the estimated speech level for a preceding time frame, the estimated noise level for the preceding time frame, the estimated speech level for the time frame n, and the estimated noise level for the time frame n; and generating the kth frequency band of the output channel for the time frame n in response to multiplying the noise suppression gain for the time frame n and the kth frequency band of the first channel for the time frame n.

22. The computer program product of claim 21, wherein the frequency bands include at least first and second frequency bands that partially overlap one another.

23. The computer program product of claim 22, wherein the frequency bands are suitable for human perceptual auditory response.

24. The computer program product of claim 21, wherein the operations include: performing a first filter bank operation for converting a time domain version of the first channel to the frequency bands of the first channel; and performing a second filter bank operation for converting a time domain version of the second channel to the frequency bands of the second channel.

25. The computer program product of claim 24, wherein the operations include: generating the output channel, wherein generating the output channel includes performing an inverse of the first filter bank operation for converting a sum of the frequency bands of the output channel to a time domain.

26. The computer program product of claim 21, wherein estimating the speech level includes: estimating the speech level so that it rises more quickly than it falls between a preceding time frame and a time frame n.

27. The computer program product of claim 26, wherein estimating the noise level includes: estimating the noise level so that it rises approximately as quickly as it falls between the preceding time frame and the time frame n.

28. The computer program product of claim 21, wherein estimating the speech level includes: with a low-pass filter, identifying the first envelope within the kth frequency band of the first channel.

29. The computer program product of claim 28, wherein the low-pass filter is a first low-pass filter, and wherein estimating the noise level includes: with a second low-pass filter, identifying the second envelope within the kth frequency band of the second channel.

30. The computer program product of claim 21, wherein computing the noise suppression gain includes:
computing a first speech-to-noise ratio of the kth band for the preceding time frame, wherein computing the first speech-to-noise ratio includes dividing the estimated speech level for the preceding time frame by the estimated noise level for the preceding time frame;
computing a second speech-to-noise ratio of the kth band for the time frame n, wherein computing the second speech-to-noise ratio includes dividing the estimated speech level for the time frame n by the estimated noise level for the time frame n; and
computing the noise suppression gain in response to the first and second speech-to-noise ratios.