Method for suppressing noise in a digital speech signal

[0002] The present invention relates to digital techniques for suppressing noise in speech signals. It relates more particularly to noise suppression by non-linear spectral subtraction.

[0003] Because of the widespread adoption of new forms of communication, in particular mobile telephones, communications are increasingly made in very noisy environments. The noise, added to the speech, then tends to interfere with the communication by preventing optimum compression of the speech signal and creating unnatural background noise. The noise makes understanding the spoken message difficult and tiring.

[0004] Many algorithms have been investigated in attempts to reduce the effects of noise in a communication. S. F. Boll (“Suppression of acoustic noise in speech using spectral subtraction”, IEEE Trans. on Acoustics, Speech and Signal Processing, Vol. ASSP-27, No. 2, April 1979) has proposed an algorithm based on spectral subtraction. This technique consists of estimating the spectrum of the noise during phases of silence and subtracting it from the received signal. It reduces the received noise level. Its main defect is that it creates musical noise which is particularly bothersome because it is unnatural.

[0005] This work was taken up and improved on by D. B. Paul (“The spectral envelope estimation vocoder”, IEEE Trans. on Acoustics, Speech and Signal Processing, Vol. ASSP-29, No. 4, August 1981) and by P. Lockwood and J. Boudy (“Experiments with a nonlinear spectral subtractor (NSS), Hidden Markov Models and the projection, for robust speech recognition in cars”, Speech Communication, Vol. 11, June 1992, pages 215-228, and EP-A-0 534 837) and has significantly reduced the level of the noise whilst preserving its natural character. Moreover, this contribution had the merit of incorporating the principle of masking into the computation of the noise suppression filter for the first time. Based on this idea, a first attempt was made by S. Nandkumar and J. H. L. Hansen (“Speech enhancement on a new set of auditory constrained parameters”, Proc. ICASSP 94, pages I.1-I.4) to use explicitly computed masking curves in the spectral subtraction. Despite the disappointing results of the above technique, this contribution had the merit of emphasizing the importance of not degrading the speech signal during noise suppression.

[0006] Other methods based on breaking the speech signal down into singular values, and thus on projecting the speech signal into a smaller space, were investigated by Bart De Moore (“The singular value decomposition and long and short spaces of noisy matrices”, IEEE Trans. on Signal Processing, Vol. 41, No. 9, September 1993, pages 2826-2838) and by S. H. Jensen et al. (“Reduction of broad-band noise in speech by truncated QSVD”, IEEE Trans. on Speech and Audio Processing, Vol. 3, No. 6, November 1995). The principle of the above technique is to consider the speech signal and the noise signal as totally decorrelated and to consider the speech signal to have sufficient predictability to be predicted on the basis of a restricted set of parameters. This technique produces acceptable noise suppression for highly voiced signals, but totally alters the nature of the speech signal. Faced with relatively coherent noise, such as vehicle tire or engine noise, the noise can be more easily predicted than the unvoiced speech signal. There is then a tendency to project the speech signal into part of the vector space of the noise. The method does not take the speech signal into account, in particular unvoiced speech areas where the predictability is low. Moreover, predicting the speech signal on the basis of a small set of parameters prevents all of the intrinsic richness of speech from being taken into account. The limitations of techniques based only on mathematical considerations and overlooking the particular nature of speech are clear.

[0007] Finally, other techniques are based on criteria of coherence. The coherence function is particularly well developed by J. A. Cadzow and O. M. Solomon (“Linear modeling and the coherence function”, IEEE Trans. on Acoustics, Speech and Signal Processing, Vol. ASSP-35, No. 1, January 1987, pages 19-28), and its application to noise suppression has been investigated by R. Le Bouquin (“Enhancement of noisy speech signals: application to mobile radio communications”, Speech Communication, Vol. 18, pages 3-19). This method is based on the fact that the speech signal is significantly more coherent than the noise if a plurality of independent channels is used. The results obtained appear to be fairly encouraging. However, this technique unfortunately requires a plurality of sound pick-up points, which is not always the case.

[0008] A main object of the present invention is to propose a new noise suppression technique which takes account of the characteristics of perception of speech by the human ear, so enabling efficient noise suppression without deteriorating the perception of the speech.

[0009] The invention therefore proposes a method of suppressing noise in a digital speech signal processed by successive frames, comprising the steps of:

[0010] computing spectral components of the speech signal of each frame;

[0011] computing, for each frame, overestimates of spectral components of the noise included in the speech signal;

[0012] performing a spectral subtraction including at least a first subtraction step in which a respective first quantity dependent on parameters including the overestimate of the corresponding spectral component of the noise for said frame is subtracted from each spectral component of the speech signal of the frame, to obtain spectral components of a first noise-suppressed signal; and

[0013] subjecting the result of the spectral subtraction to a transformation into the time domain to construct a noise-suppressed speech signal.

[0014] According to the invention, the spectral subtraction further includes the following steps

[0015] computing a masking curve by applying an auditory perception model on the basis of spectral components of the first noise-suppressed signal;

[0016] comparing overestimates of the spectral components of the noise for the frame to the computed masking curve; and

[0017] a second subtraction step in which a respective second quantity depending on parameters including a difference between the overestimate of the corresponding spectral component of the noise and the computed masking curve is subtracted from each spectral component of the speech signal of the frame.

[0018] The second quantity subtracted can in particular be limited to the fraction of the overestimate of the corresponding spectral component of the noise which is above the masking curve. This approach is based on the observation that it is sufficient to suppress audible noise frequencies. In contrast, there is no utility eliminating noise masked by speech.

[0019] It is generally desirable to overestimate the spectral envelope of the noise so that the overestimate thereby obtained is robust to sudden variations of the noise. However, excessive overestimation usually has the drawback of distorting the speech signal. This affects the voiced character of the speech signal, eliminating some of its predictability. This drawback is very bothersome in telephony, since it is in the voiced areas that the speech signal then has the most energy. The invention greatly attenuates this drawback by limiting the subtracted quantity if the whole or part of a frequency component of the overestimated noise proves to be masked by the speech.

[0020] FIG. 1 is a block diagram of a noise suppression system implementing the present invention;

[0021] FIGS. 2 and 3 are flowcharts of procedures used by a vocal activity detector of the system shown in FIG. 1;

[0022] FIG. 4 is a diagram representing the states of a vocal activity detection automaton;

[0023] FIG. 5 is a graph showing variations in a degree of vocal activity;

[0024] FIG. 6 is a block diagram of a module for overestimating the noise of the system shown in FIG. 1;

[0025] FIG. 7 is a graph illustrating the computation of a masking curve;

[0026] FIG. 8 is a graph illustrating the use of masking curves in the system shown in FIG. 1;

[0027] FIG. 9 is a block diagram of another noise suppression system implementing the present invention;

[0028] FIG. 10 is a graph illustrating a harmonic analysis method that can be used in a method according to the invention; and

[0029] FIG. 11 shows part of a variant of the block diagram shown in FIG. 9.

[0030] The noise suppression system shown in FIG. 1 processes a digital speech signal s. A windowing module 10 formats the signal s in the form of successive windows or frames each made up of a number N of digital signal samples. In the usual way, these frames can overlap each other. In the remainder of this description, the frames are considered to be made up of N=256 samples with a sampling frequency F_eof 8 kHz, with Hamming weighting in each window and with 50% overlaps between consecutive windows, although this is not limiting on the invention.

[0031] The signal frame is transformed into the frequency domain by a module 11 using a conventional fast Fourier transform (FFT) algorithm to compute the modulus of the spectrum of the signal. The module 11 then delivers a set of N=256 frequency components S_n,fof the speech signal, where n is the number of the current frame and f is a frequency from the discrete spectrum. Because of the properties of the digital signals in the frequency domain, only the first N/2=128 samples are used.

[0032] Instead of using the frequency resolution available downstream of the fast Fourier transform to compute the estimates of the noise contained in the signal s, a lower resolution is used, determined by a number I of frequency bands covering the bandwidth [0, F_e/2] of the signal. Each band i (1≦i≦I) extends from a lower frequency f(i−1) to a higher frequency f(i), with f(0)=0 and f(I)=F_e/2. The subdivision into frequency bands can be uniform (f(i)−f(I−1)=F_e/2I). It can also be non-uniform (for example according to a barks scale). A module 12 computes the respective averages of the spectral components S_n,fof the speech signal in bands, for example by means of a uniform weighting such as: $\begin{array}{cc}{S}_{n,i}=\frac{1}{f\left(i\right)-f\left(i-1\right)}\sum _{f\in [f\left(i-1\right),f\left(i\right)[}{S}_{n,f}& \left(1\right)\end{array}$

[0033] This averaging reduces fluctuations between bands by averaging the contributions of the noise in the bands, which reduces the variance of the noise estimator. Also, this averaging greatly reduces the complexity of the system.

[0034] The averaged spectral components S_n,iare sent to a vocal activity detector module 15 and a noise estimator module 16. The two modules 15, 16 operate conjointly in the sense that degrees of vocal activity γ_n,imeasured for the various bands by the module 15 are used by the module 16 to estimate the long-term energy of the noise in the various bands, whereas the long-term estimates {circumflex over (B)}_n,iare used by the module 15 for a priori suppression of noise in the speech signal in the various bands to determine the degrees of vocal activity γ_n,i.

[0035] The operation of the modules 15 and 16 can correspond to the flowcharts shown in FIGS. 2 and 3.

[0036] In steps 17 through 20, the module 15 effects a priori suppression of noise in the speech signal in the various bands i for the signal frame n. This a priori noise suppression is effected by a conventional non-linear spectral subtraction scheme based on estimates of the noise obtained in one or more preceding frames. In step 17, using the resolution of the bands I, the module 15 computes the frequency response Hp_n,iof the a priori noise suppression filter from the equation: $\begin{array}{cc}{\mathrm{Hp}}_{n,1}=\frac{S_{n,i}-{\alpha }_{n-\mathrm{\tau 1},i}^{\prime }·{\hat{B}}_{n-\mathrm{\tau 1},i}}{S_{n-\mathrm{\tau 2},i}}& \left(2\right)\end{array}$

[0037] where τ1 and τ2 are delays expressed as a number of frames (τ1≧1, τ2≧0), and α_n,i^′ is a noise overestimation coefficient determined as explained later. The delay τ1 can be fixed (for example τ1=1) or variable. The greater the degree of confidence in the detection of vocal activity, the lower the value of τ1.

[0038] In steps 18 to 20, the spectral components Êp_n,iare computed from:

[0039] Êp_n,i=max{Hp_n,i·S_n,i, βp_i·{circumflex over (B)}_n−τ1,i}  (3)

[0040] where βp_iis a floor coefficient close to 0, used conventionally to prevent the spectrum of the noise-suppressed signal from taking negative values or excessively low values which would give rise to musical noise.

[0041] Steps 17 to 20 therefore essentially consist of subtracting from the spectrum of the signal an estimate of the a priori estimated noise spectrum, over-weighted by the coefficient α_n−τ1,i^′.

[0042] In step 21, the module 15 computes the energy of the a priori noise-suppressed signal in the various bands i for frame n: E_n,i=Êp_n,i². It also computes a global average E_n,0of the energy of the a priori noise-suppressed signal by summing the energies for each band E_n,iweighted by the widths of the bands. In the following notation, the index i=0 is used to designate the global band of the signal.

[0043] In steps 22 and 23, the module 15 computes, for each band i (0≦i≦I), a magnitude ΔE_n,irepresenting the short-term variation in the energy of the noise-suppressed signal in the band i and a long-term value {overscore (E)}_n,iof the energy of the noise-suppressed signal in the band i. The magnitude ΔE_n,ican be computed from a simplified equation: $\Delta E_{n,i}=\left|\frac{E_{n-4,i}+E_{n-3,i}-E_{n-1,i}-E_{n,i}}{10}\right|.$

[0044] As for the long-term energy {overscore (E)}_n,i, it can be computed using a forgetting factor B1 such that 0<B1<1, namely {overscore (E)}_n,i=B1·{overscore (E)}_n−1,i+(1−B1)·E_n,i.

[0045] After computing the energies E_n,iof the noise-suppressed signal, its short-term variations ΔE_n,iand its long-term values {overscore (E)}_n,iin the manner indicated in FIG. 2, the module 15 computes, for each band i (0≦i≦I), a value ρ_irepresentative of the evolution of the energy of the noise-suppressed signal. This computation is effected in steps 25 to 36 in FIG. 3, executed for each band i from i=0 to i=I. The computation uses a long-term noise envelope estimator ba_i, an internal estimator bi_iand a noisy frame counter b_i.

[0046] In step 25, the magnitude ΔE_n,iis compared to a threshold ε1. If the threshold ε1 has not been reached, the counter b_iis incremented by one unit in step 26. In step 27, the long-term estimator b_aiis compared to the smoothed energy value {overscore (E)}_n,i. If ba_i≧{overscore (E)}_n,i, the estimator ba_iis taken as equal to the smoothed value {overscore (E)}_n,iin step 28 and the counter b_iis reset to zero. The magnitude ρ_i, which is taken as equal to ba_i/{overscore (E)}_n,i(step 36 ), is then equal to 1.

[0047] If step 27 shows that ba_i<{overscore (E)}_n,i, the counter b_iis compared to a limit value bmax in step 29. If b_i>bmax, the signal is considered to be too stationary to support vocal activity. The aforementioned step 28, which amounts to considering that the frame contains only noise, is then executed. If b_i≦bmax in step 29, the internal estimator bi_iis computed in step 33 from the equation:

[0048] bi_i=(1−Bm)·{overscore (E)}_n,i+Bm·ba_i  (4)

[0049] In the above equation, Bm represents an update coefficient from 0.90 to 1. Its value differs according to the state of a vocal activity detector automaton (steps 30 to 32). The state δ_n−1is that determined during processing of the preceding frame. If the automaton is in a speech detection state (δ_n−1=2 in step 30), the coefficient Bm takes a value Bmp very close to 1 so the noise estimator is very slightly updated in the presence of speech. Otherwise, the coefficient Bm takes a lower value Bms to enable more meaningful updating of the noise estimator in the silence phase. In step 34, the difference ba_i−bi_ibetween the long-term estimator and the internal noise estimator is compared with a threshold ε2. If the threshold ε2 has not been reached, the long-term estimator ba_iis updated with the value of the internal estimator bi_iin step 35. Otherwise, the long-term estimator ba_iremains unchanged. This prevents sudden variations due to a speech signal causing the noise estimator to be updated.

[0050] After the magnitudes ρ_ihave been obtained, the module 15 proceeds to the vocal activity decisions of step 37. The module 15 first updates the state of the detection automaton according to the magnitude ρ₀calculated for all of the band of the signal. The new state δⁿof the automaton depends on the preceding state δ_n−1and on ρ₀, as shown in FIG. 4.

[0051] Four states are possible: δ=0 detects silence, or absence of speech, δ=2 detects the presence of vocal activity and states δ=1 and δ=3 are intermediate rising and falling states. If the automaton is in the silence state (δ_n−1=0) it remains there if ρ₀does not exceed a first threshold SE1, and otherwise goes to the rising state. In the rising state (δ_n−1=1), it reverts to the silence state if ρ₀is smaller than the threshold SE1, goes to the speech state if ρ₀is greater than a second threshold SE2 greater than the threshold SE1 and it remains in the rising state if SE1≦ρ₀≦SE2. If the automaton is in the speech state (δ_n−1=2) it remains there if ρ₀exceeds a third threshold SE3 lower than the threshold SE2, and enters the falling state otherwise. In the falling state (δ_n−1=3), the automaton reverts to the speech state if ρ₀is higher than the threshold SE2, reverts the silence state if ρ₀is below a fourth threshold SE4 lower than the threshold SE2 and remains in the falling state if SE4≦ρ₀≦SE2.

[0052] In step 37, the module 15 also computes the degrees of vocal activity γ_n,iin each band i≧1. This degree γ_n,iis preferably a non-binary parameter, i.e. the function γ_n,i=g(ρ_i) is a function varying continuously in the range from 0 to 1 as a function of the values taken by the magnitude ρ_i. This function has the shape shown in FIG. 5, for example.

[0053] The module 16 calculates the estimates of the noise on a band by band basis, and the estimates are used in the noise suppression process, employing successive values of the components S_n,iand the degrees of vocal activit γ_n,i. This corresponds to steps 40 to 42 in FIG. 3. Step 40 determines if the vocal activity detector automaton has just gone from the rising state to the speech state. If so, the last two estimates {circumflex over (B)}_n−1,iand {circumflex over (B)}_n−2,ipreviously computed for each band i≧1 are corrected according to the value of the preceding estimate {circumflex over (B)}_n−3,i. The correction is done to allow for the fact that, in the rise phase (δ=1), the long-term estimates of the energy of the noise in the vocal activity detection process (steps 30 to 33 ) were computed as if the signal included only noise (Bm=Bms), with the result that they may be subject to error.

[0054] In step 42, the module 16 updates the estimates of the noise on a band by band basis using the equations:

[0055] {tilde over (B)}_n,i=λ_B·{circumflex over (B)}_n−1,i+(1−λ_B)·S_n,i  (5)

[0056] {circumflex over (B)}_n,i=γ_n,i·{circumflex over (B)}_n−1,i+(1−γ_n,i)·{tilde over (B)}_n,i  (6)

[0057] in which λ_Bdesignates a forgetting factor such that 0<λ_B<1. Equation (6) shows that the non-binary degree of vocal activity γ_n,iis taken into account.

[0058] As previously indicated, the long-term estimates of the noise {circumflex over (B)}_n,iare overestimated by a module 45 (FIG. 1) before noise suppression by non-linear spectral subtraction. The module 45 computes the overestimation coefficient α_n,i^′ previously referred to, along with an overestimate {circumflex over (B)}_n,i^′ which essentially corresponds to α_n,i^′·{circumflex over (B)}_n,i.

[0059] FIG. 6 shows the organisation of the overestimation module 45. The overestimate {circumflex over (B)}_n,i^′ is obtained by combining the long-term estimate {circumflex over (B)}_n,iand a measurement ΔB_n,i^maxof the variability of the component of the noise in the band i around its long-term estimate. In the example considered, the combination is essentially a simple sum performed by an adder 46. It could instead be a weighted sum.

[0060] The overestimation coefficient α_n,i^′ is equal to the ratio between the sum {circumflex over (B)}_n,i+ΔB_n,i^maxdelivered by the adder 46 and the delayed long-term estimate {circumflex over (B)}_n−τ3,i(divider 47 ), with a ceiling limit value α_max, for example α_dmax=4 (block 48 ). The delay τ3 is used to correct the value of the overestimation coefficient α_n,i⁴⁰if necessary, in the rising phases (δ=1), before the long-term estimates have been corrected by steps 40 and 41 from FIG. 3 (for example τ3=3).

[0061] The overestimate {circumflex over (B)}_n,i^′ is finally taken as equal to α_n,i^′·{circumflex over (B)}_n−τ3,i(multiplier 49 ).

[0062] The measurement ΔB_n,i^maxof the variability of the noise reflects the variance of the noise estimator. It is obtained as a function of the values of S_n,iand of {circumflex over (B)}_n,icomputed for a certain number of preceding frames over which the speech signal does not feature any vocal activity in band i. It is a function of the differences |S_n−k,i−{circumflex over (B)}n−k,i| computed for a number K of silence frames (n−k≦n). In the example shown, this function is simply the maximum (block 50). For each frame n, the degree of vocal activity γ_n,iis compared to a threshold (block 51) to decide if the difference |S_n,i−{circumflex over (B)}_n,i|, calculated at 52-53, must be loaded into a queue 54 with K locations organised in first-in/first-out (FIFO) mode, or not. If γ_n,idoes not exceed the threshold (which can be equal to 0 if the function g( ) has the form shown in FIG. 5), the FIFO 54 is not loaded; otherwise it is loaded. The maximum value contained in the FIFO 54 is then supplied as the measured variability ΔB_n,i^max.

[0063] The measured variability ΔB_n,i^maxcan instead be obtained as a function of the values S_n,f(not S_n,i) and {circumflex over (B)}_n,i. The procedure is then the same, except that the FIFO 54 contains, instead of |S_n−k,i−{circumflex over (B)}_n−k,i| for each of the bands i, $\underset{f\in [f\left(i-1\right),f\left(i\right)[}{\max }\left|S_{n-k,f}-{\hat{B}}_{n-k,i}\right|.$

[0064] Because of the independent estimates of the long-term fluctuations {circumflex over (B)}_n,iand short-term variability ΔB_n,i^maxof the noise, the overestimator {circumflex over (B)}_n,i^′ makes the noise suppression process highly robust to musical noise.

[0065] The module 55 shown in FIG. 1 performs a first spectral subtraction phase. This phase supplies, with the resolution of the bands i (1≦i≦I), the frequency response H_n,i¹of a first noise suppression filter, as a function of the components S_n,iand {circumflex over (B)}_n,iand the overestimation coefficients α_n,i^′. This computation can be performed for each band i using the equation: $\begin{array}{cc}{H}_{n,i}^1=\frac{\max \left\{S_{n,i}-{\alpha }_{n,i}^{\prime }·{\hat{B}}_{n,i},{\beta }_i^1·{\hat{B}}_{n,i}\right\}}{S_{n-\mathrm{\tau 4},i}}& \left(7\right)\end{array}$

[0066] in which τ4 is an integer delay such that τ4≧0 (for example τ4=0). The coefficient β_i¹in equation (7), like the coefficient βp_iin equation (3), represents a floor used conventionally to avoid negative values or excessively low values of the noise-suppressed signal.

[0067] In a manner known in the art (see EP-A-0 534 837), the overestimation coefficient α_n,i^′ in equation (7) could be replaced by another coefficient equal to a function of α_n,i^′ and an estimate of the signal-to-noise ratio (for example S_n,i/{circumflex over (B)}_n,i), this function being a decreasing function of the estimated value of the signal-to-noise ratio. This function is then equal to α_n,i^′ for the lowest values of the signal-to-noise ratio. If the signal is very noisy, there is clearly no utility in reducing the overestimation factor. This function advantageously decreases toward zero for the highest values of the signal/noise ratio. This protects the highest energy areas of the spectrum, in which the speech signal is the most meaningful, the quantity subtracted from the signal then tending toward zero.

[0068] This strategy can be refined by applying it selectively to the harmonics of the pitch frequency of the speech signal if the latter features vocal activity.

[0069] Accordingly, in the embodiment shown in FIG. 1, a second noise suppression phase is performed by a harmonic protection module 56. This module computes, with the resolution of the Fourier transform, the frequency response H_n,f²of a second noise suppression filter as a function of the parameters H_n,i¹, α_n,i^′, {circumflex over (B)}_n,i, δ_n, S_n,iand the pitch frequency f_p=F_e/T_pcomputed outside silence phases by a harmonic analysis module 57. In a silence phase (δ_n=0), the module 56 is not in service, i.e. H_n,f²=H_n,i¹for each frequency f of a band i. The module 57 can use any prior art method to analyse the speech signal of the frame to determine the pitch period T_p, expressed as an integer or fractional number of samples, for example a linear prediction method.

[0070] The protection afforded by the module 56 can consist in effecting, for each frequency f belonging to a band i: $\{\begin{array}{cc}{H}_{n,f}^2=1& \mathrm{if}\{\begin{array}{cc}{S}_{n,i}-{\alpha }_{n,i}^{\prime }·{\hat{B}}_{n,i}>{\beta }_i^2·{\hat{B}}_{n,i}& (8\\ \mathrm{and}\exists \eta \mathrm{integer}\text{/}\left|f-n·f_p\right|\le \Delta f\text{/}2& (9\end{array}\\ H_{n,f}^2=H_{n,f}^1& \mathrm{otherwise}\end{array}$

[0071] Δf=F_e/N represents the spectral resolution of the Fourier transform. If H_n,f²=1, the quantity subtracted from the component S_n,f, is zero. In this computation, the floor coefficients β_i²(for example β_i²=β_i¹) express the fact that some harmonics of the pitch frequency f_pcan be masked by noise, so that there is no utility in protecting them.

[0072] This protection strategy is preferably applied for each of the frequencies closest to the harmonics of f_p, i.e. for any integer η.

[0073] If δf_pdenotes the frequency resolution with which the analysis module 57 produces the estimated pitch frequency f_p, i.e. if the real pitch frequency is between f_p−δf_p/2 and f_p+δf_p/2, then the difference between the η−th harmonic of the real pitch frequency and its estimate η×f_p(condition (9)) can go up to ±η×δf_p/2. For high values of η, the difference can be greater, than the spectral half-resolution Δf/2 of the Fourier transform. To take account of this uncertainty, and to guarantee good protection of the harmonics of the real pitch, each of the frequencies in the range [η×f_p−η×δf_p/2, η×f_p+η×δf_p/2] can be protected, i.e. condition (9) above can be replaced with:

[0074] ∃ηinteger/|f−η·f_p|≦(η·δf_p+Δf)/2  (9′)

[0075] This approach (condition (9′)) is of particular benefit if the values of η can be high, especially if the process is used in a broadband system.

[0076] For each protected frequency, the corrected frequency response H_n,f²can be equal to 1, as indicated above, which in the context of spectral subtraction corresponds to the subtraction of a zero quantity, i.e. to complete protection of the frequency in question. More generally, this corrected frequency response H_n,f²could be taken as equal to a value from 1 to H_n,f¹, according to the required degree of protection, which corresponds to subtracting a quantity less than that which would be subtracted if the frequency in question were not protected.

[0077] The spectral components S_n,f²of a noise-suppressed signal are computed by a multiplier 58:

[0078] S_n,f²=H_n,f²·S_n,f  (10)

[0079] This signal S_n,f²is supplied to a module 60 which computes a masking curve for each frame n by applying a psychoacoustic model of how the human ear perceives sound.

[0080] The masking phenomenon is a well-known principle of the operation of the human ear. If two frequencies are present simultaneously, it is possible for one of them not to be audible. It is then said to be masked.

[0081] There are various methods of computing masking curves. The method developed by J. D. Johnston can be used, for example (“Transform Coding of Audio Signals Using Perceptual Noise Criteria”, IEEE Journal on Selected Areas in Communications, Vol. 6, No. 2, February 1988). That method operates in the barks frequency scale. The masking curve is seen as the convolution of the spectrum spreading function of the basilar membrane in the bark domain with the exciter signal, which in the present application is the signal S_n,f². The spectrum spreading function can be modelled in the manner shown in FIG. 7. For each bark band, the contribution of the lower and higher bands convoluted with the spreading function of the basilar membrane is computed from the equation: $\begin{array}{cc}{c}_{n,q}=\sum _{q^{\prime }=0}^{q-1}\frac{s_{n,q^{\prime }}^2}{{\left({10}^{10/10}\right)}^{\left(q-q^{\prime }\right)}}+\sum _{q^{\prime }=q+1}^Q\frac{s_{n,q^{\prime }}^2}{{\left({10}^{25/10}\right)}^{\left(q^{\prime }-q\right)}}& \left(11\right)\end{array}$

[0082] in which the indices q and q′ designate the bark bands (0≦q,q′≦Q) and S_n,q²represents the average of the components S_n,f²of the noise-suppressed exciter signal for the discrete frequencies f belonging to the bark band q′.

[0083] The module 60 obtains the masking threshold M_n,qfor each bark band q from the equation:

[0084] M_n,q=C_n,q/R_q  (12)

[0085] in which R_qdepends on whether the signal is relatively more or relatively less voiced. As is well-known in the art, one possible form of R_qis:

[0086] 10.log₁₀(R_q)=(A+q)·χ+B·(1−χ)  (13)

[0087] with A=14.5 and B=5.5. χ designated a degree of voicing of the speech signal, varying from 0 (no voicing) to 1 (highly voiced signal). The parameter χ can be of the form known in the art: $\begin{array}{cc}\chi =\min \left\{\frac{\mathrm{SFM}}{{\mathrm{SFM}}_{\max }},1\right\}& \left(12\right)\end{array}$

[0088] where SFM represents the ratio in decibels between the arithmetic mean and the geometric mean of the energy of the bark bands and SFM_max=−60 dB.

[0089] The noise suppression system further includes a module 62 which corrects the frequency response of the noise suppression filter as a function of the masking curve M_n,qcomputed by the module 60 and the overestimates {circumflex over (B)}_n,i^′computed by the module 45. The module 62 decides which noise suppression level must really be achieved.

[0090] By comparing the envelope of the noise overestimate with the envelope formed by the masking thresholds M_n,q, a decision is taken to suppress noise in the signal only to the extent that the overestimate {circumflex over (B)}_n,i^′is above the masking curve. This avoids unnecessary suppression of noise masked by speech.

[0091] The new response H_n,f³, for a frequency f belonging to the band i defined by the module 12 and the bark band q, thus depends on the relative difference between the overestimate {overscore (B)}_n,i^′of the corresponding spectral component of the noise and the masking curve M_n,q, in the following manner: $\begin{array}{cc}{H}_{n,f}^3=1-\left(1-H_{n,f}^2\right)·\max \{\begin{array}{cc}\frac{{\hat{B}}_{n,i}^{\prime }-M_{n,q}}{{\hat{B}}_{n,i}^{\prime }},& 0\end{array}\}& \left(14\right)\end{array}$

[0092] In other words, the quantity subtracted from a spectral component S_n,f, in the spectral subtraction process having the frequency response H_n,f³, is substantially equal to whichever is the lower of the quantity subtracted from this spectral component in the spectral subtraction process having the frequency response H_n,f²and the fraction of the overestimate {circumflex over (B)}_n,i^′ of the corresponding spectral component of the noise which possibly exceeds the masking curve M_n,q.

[0093] FIG. 8 illustrates the principle of the correction applied by the module 62. It shows in schematic form an example of a masking curve M_n,qcomputed on the basis of the spectral components S_n,f²of the noise-suppressed signal as well as the overestimate {circumflex over (B)}_n,i^′ of the noise spectrum. The quantity finally subtracted from the components S_n,fis that shown by the shaded areas, i.e. it is limited to the fraction of the overestimate {circumflex over (B)}_n,i^′of the spectral components of the noise which is above the masking curve.

[0094] The subtraction is effected by multiplying the frequency response H_n,f³of of the noise suppression filter by the spectral components S_n,fof the speech signal (multiplier 64). The module 65 then reconstructs the noise-suppressed signal in the time domain by applying the inverse fast Fourier transform (IFFT) to the samples of frequency S_n,f³delivered by the multiplier 64. For each frame, only the first N/2=128 samples of the signal produced by the module 65 are delivered as the final noise-suppressed signal s³, after overlap-add reconstruction with the N/2=128 last samples of the preceding frame (module 66).

[0095] FIG. 9 shows a preferred embodiment of a noise suppression system using the invention. The system includes a number of components similar to corresponding components of the system shown in FIG. 1, for which the same reference numbers are used. Accordingly, the modules 10, 11, 12, 15, 16, 45 and 55 supply in particular the quantities S_n,i, {circumflex over (B)}_n,i, α_n,i^′, {circumflex over (B)}_n,i^′ and H_n,f¹used for selective noise suppression.

[0096] The frequency resolution of the fast Fourier transform 11 constitutes a limitation of the system shown in FIG. 1. The frequency protected by the module 56 is not necessarily the precise pitch frequency f_p, but the frequency closest to it in the discrete spectrum. In some cases, harmonics relatively far away from the pitch harmonics may be protected. The system shown in FIG. 9 alleviates this drawback by appropriately conditioning the speech signal.

[0097] This conditioning modifies the sampling frequency of the signal so that the period 1/f_pexactly covers an integer number of sample times of the conditioned signal.

[0098] Many methods of harmonic analysis which can be used by the module 57 are capable of supplying a fractional value of the delay T_p, expressed as a number of samples at the initial sampling frequency F_e. A new sampling frequency f_eis then chosen which is equal to an integer multiple of the estimated pitch frequency, i.e. f_e=p·f_p=p·F_e/T_p=K·F_e, where p is an integer. To avoid losing signal samples, f_emust be higher than F_e. In particular, to facilitate conditioning it is possible to impose the condition that f_emust lie in the range from F_eto 2F_e(1≦K≦2).

[0099] Of course, it is not necessary to condition the signal if no vocal activity is detected in the current frame (δ_n≠0) or if the delay T_pestimated by the module 57 is an integer delay.

[0100] For each pitch harmonic to correspond to an integer number of samples of the conditioned signal, the integer p must be a factor of the size N of the signal window produced by the module 10: N=αp, where α is an integer. This size N is usually a power of 2 for the implementation of the FFT. It is 256 in the example considered here.

[0101] The spectral resolution Δf of the discrete Fourier transform of the conditioned signal is given by the equation Δf=p·f_p/N=f_p/α. It is therefore beneficial to make p small, to maximise α, but large enough to perform oversampling. In the example considered here, where F_e=8 kHz and N=256, the values chosen for the parameters p and α are indicated in table I.

[0102] The choice is made by a module 70 according to the value of the delay T_psupplied by the harmonic analysis module 57. The module 70 supplies the ratio K between the sampling frequencies to three frequency changer modules 71, 72, 73.

[0103] The module 71 transforms the values S_n,i, {circumflex over (B)}_n,i, α_n,i^′, {circumflex over (B)}_n,i^{′ and H}_n,f¹relating to the bands i defined by the module 12 into the modified frequency scale (sampling frequency f_e). This transformation merely expands the bands i by the factor K. The transformed values are supplied to the harmonic protection module 56.

[0104] The latter module then operates as before to supply the frequency response H_n,f²of the noise suppression filter. This response H_n,f²is obtained in the same manner as in FIG. 1 (conditions (8) and (9)), except that, in condition (9), the pitch frequency f_p=f_e/p is defined according to the value of the integer delay p supplied by the module 70, the module 70 also supplying the frequency resolution Δf.

[0105] The module 72 oversamples the frame of N samples supplied by the windowing module 10. Oversampling by a rational factor K (K=K1/K2) consists in first oversampling by the integer factor K1 and then undersampling by the integer factor K2. This oversampling and undersampling by integer factors can be effected in the conventional way by means of banks of polyphase filters.

[0106] The conditioned signal frame s′ supplied by the module 72 includes KN samples at the frequency f_e. The samples are sent to a module 75 which computes their Fourier transform. The transformation can be effected on the basis of two blocks of N=256 samples: one constituted by the first N samples of the frame of length KN of the conditioned signal s′ and the other of the last N samples of that frame. The two blocks therefore have an overlap of (2−K)×100%. For each of the two blocks, a set of Fourier components S_n,fis obtained. The components S_n,fare supplied to the multiplier 58, which multiplies them by the spectral response H_n,f²to deliver the spectral components S_n,f²of the first noise-suppressed signal.

[0107] The components S_n,f²are sent to the module 60 which computes the masking curves in the manner previously indicated.

[0108] When computing the masking curves, the magnitude χ designating the degree of voicing of the speech signal (equation (13)) is preferably taken in the form χ=1−H, where H is an entropy of the autocorrelation of the spectral components S_n,f²of the noise-suppressed conditioned signal. The autocorrelations A(k) are computed by a module 76, for example using the equation: $\begin{array}{cc}A\left(k\right)=\frac{\sum _{f=0}^{N\text{/}2-1}{s}_{n,f}^2·s_{n,f+k}^2}{\sum _{f=0}^{N\text{/}2-1}\sum _{f^{\prime }=0}^{N\text{/}2-1}{s}_{n,f}^2·s_{n,f+f^{\prime }}^2}& \left(15\right)\end{array}$

[0109] A module 77 then computes the normalised entropy H and supplies it to the module 60 for computing the masking curve (see S. A. McClellan et al. : “Spectral Entropy: an Alternative Indicator for Rate Allocation?”, Proc. ICASSP′94, pages 201-204): $\begin{array}{cc}H=\frac{\sum _{k=0}^{N\text{/}2-1}A\left(k\right)·\log \left[A\left(k\right)\right]}{\log \left(N\text{/}2\right)}& \left(16\right)\end{array}$

[0110] Because of the conditioning of the signal, and its noise suppression by the filter H_n,f²the normalised entropy H constitutes a measurement of voicing that is very robust to noise and to pitch variations.

[0111] The correction module 62 operates in the same manner as that of the system shown in FIG. 1, allowing for the overestimated noise {circumflex over (B)}_n,irescaled by the frequency changer module 71. It supplies the frequency response H_n,f³of the final noise suppression filter, which is multiplied by the spectral components S_n,fof the conditioned signal by the multiplier 64. The resulting components S_n,f³are processed back to the time domain by the IFFT module 65. A module 80 at the output of the IFFT module 65 combines, for each frame, the two signal blocks resulting from the processing of the two overlapping blocks supplied by the FFT 75. This combination can consist of a Hamming weighted sum of the samples to form a noise-suppressed conditioned signal frame of KN samples.

[0112] The module 73 changes the sampling frequency of the noise-suppressed conditioned signal supplied by the module 80. The sampling frequency is returned to F_e=f_e/K by operations which are the inverse of those effected by the module 75. The module 73 delivers N=256 samples per frame. After overlap-add reconstruction using the last N/2=128 samples of the preceding frame, only the first N/2=128 samples of the current frame are finally retained to form the final noise-suppressed signal s³(module 66).

[0113] In a preferred embodiment, a module 82 manages the windows formed by the module 10 and saved by the module 66, to retain a number M of samples equal to an integer multiple of T_p=F_e/f_p. This avoids problems of phase discontinuity between frames. In a corresponding manner, the management module 82 controls the windowing module 10 so that the overlap between the current frame and the next corresponds to N-M. This overlap of N-M samples is taken into account in the overlap-add operation effected by the module 66 when processing the next frame. From the value of T_psupplied by the harmonic analysis module 57, the module 82 computes the number of samples to be retained M=T_p×E[N/(2T_p)], E[0 ] designating the integer part, and controls the modules 10 and 66 accordingly.

[0114] In the embodiment just described, the pitch frequency is estimated as an average over the frame. The pitch can vary slightly over this duration. It is possible to allow for these variations in the context of the present invention by conditioning the signal to obtain a constant pitch in the frame by artificial means.

[0115] This requires the harmonic analysis module 57 to supply the time intervals between consecutive breaks of the speech signal which can be attributed to glottal closures of the speaker occurring during the duration of the frame. Methods which can be used to detect such micro-breaks are well-known in the art of harmonic analysis of speech signals. In this connection, reference may be had to the following articles: M. BASSEVILLE et al., “Sequential detection of abrupt changes in spectral characteristics of digital signals”, IEEE Trans. on Information Theory, 1983, Vol. IT-29, No.5, pages 708-723; R. ANDRE-OBRECHT, “A new statistical approach for the automatic segmentation of continuous speech signals”, IEEE Trans. on Acous., Speech and Sig. Proc., Vol. 36, No. 1 January 1988; and C. MURGIA et al., “An algorithm for the estimation of glottal closure instants using the sequential detection of abrupt changes in speech signals”, Signal Processing VII, 1994, pages 1685-1688.

[0116] The principle of the above methods is to effect a statistical test between a short-term model and a long-term model. Both models are adaptive linear prediction models. The value of the statistical test w_mis the cumulative sum of the a posteriori likelihood ratio of two distributions, corrected by the Kullback divergence. For a distribution of residues having a Gaussian statistic, the value w_mis given by: $\begin{array}{cc}{w}_m=\frac{1}{2}\left[\frac{2·e_m^0·e_m^1}{{\sigma }_1^2}-\left(1+\frac{{\sigma }_0^2}{{\sigma }_1^2}\right)·\frac{{\left(e_m^0\right)}^2}{{\sigma }_0^2}+\left(1-\frac{{\sigma }_0^2}{{\sigma }_1^2}\right)\right]& \left(17\right)\end{array}$

[0117] where e_m⁰and σ₀²represent the residue computed at the time of sample m of the frame and the variance of the long-term model, e_m¹and σ₁²likewise representing the residue and the variance of the short-term model. The closer the two models, the closer the statistical test value w_mto 0. In contrast, if the two models are far away from each other, the value w_mbecomes negative, which denotes a break R in the signal.

[0118] Thus FIG. 10 shows one possible example of the evolution of the value w_m. showing the breaks R in the speech signal. The time intervals t_r(r=1,2, etc.) between two consecutive breaks R are computed and expressed as a number of samples of the speech signal. Each interval t_ris inversely proportional to the pitch frequency f_p, which is thus estimated locally: f_p=F_e/t_rover the r-th interval.

[0119] The time variations of the pitch (i.e. the fact that the intervals t_rare not all equal over a given frame), can then be corrected to obtain a constant pitch frequency in each of the analysis frames. This correction is effected by modifying the sampling frequency over each interval t_rto obtain constant intervals between two glottal closures after oversampling. Thus the duration between two breaks is modified by oversampling with a variable ratio, so as to lock onto the greatest interval. Also, the conditioning constraint, whereby the oversampling frequency is a multiple of the estimated pitch frequency, is complied with.

[0120] FIG. 11 shows the means employed to perform the conditioning of the signal in the latter case. The harmonic analysis module 57 uses the above analysis method and supplies the intervals t_rrelating to the signal frame produced by the module 10. For each of these intervals, the module 70 (block 90 in FIG. 11) computes the oversampling ratio K_r=P_r/t_r, where the integer P_ris given by the third column of table I if t_rtakes the values indicated in the second column. These oversampling ratios K_rare supplied to the frequency changer modules 72 and 73 so that the interpolations are effected with the sampling ratio K_rover the corresponding time interval t_r.

[0121] The greatest time interval T_pof the time intervals t_rsupplied by the module 57 for a frame is selected by the module 70 (block 91 in FIG. 11) to obtain a pair p,α as indicated in table I. The modified sampling frequency is then f_e=p·F_e/T_pas previously, the spectral resolution Δf of the discrete Fourier transform of the conditioned signal still being given by Δf=F_e/(α·T_p). For the frequency changer module 71, the oversampling ratio K is given by K=p/T_p(block 92). The module 56 for protecting the pitch harmonics operates in the same manner as before, using for condition (9) the spectral resolution Δf supplied by the block 91 and the pitch frequency f_p=f_e/p defined according to the value of the integer delay p supplied by the block 91.

[0122] This embodiment of the invention also implies adaptation of the window management module 82. The number M of samples of the noise-suppressed signal to be retained over the current frame here corresponds to an integer number of consecutive time intervals t_rbetween two glottal closures (see FIG. 10). This avoids the problems of phase discontinuity between frames, whilst allowing for possible variations of the time intervals t_rover a frame.