WIDE BAND SPEECH SYNTHESIS BY MEANS OF A MAPPING MATRIX

Abstract: The invention describes a system that generates a wide band signal (100 - 7000 Hz) from a telephony band (or narrow band: 300 - 3400 Hz) speech signal to obtain an extended band speech signal (100 - 3400 Hz). This technique is particularly advantageous since it increases signal naturalness and listening comfort with keeping compatibility with all current telephony systems. The described technique is inspired on Linear Predictive speech coders. The speech signal is thus split into a spectral envelope and a short-term residual signal. Both signals are extended separately and recombined to create an extended band signal.

Description: WIDE BAND SPEECH SYNTHESIS BY MEANS OF A MAPPING MATRIX FIELD OF THE INVENTION The invention relates to digital transmission systems and more particularly to a system for enabling at the receiving end to extend a speech signal received in a narrow band, for example the telephony band (300 - 3400 Hz) into an extended speech signal in a wider band (for example 100- 7000 Hz). BACKGROUND ART Most current telecommunication systems transmit a speech bandwidth limited to 300 - 3400 Hz (narrow band speech). This is sufficient for a telephone conversation but natural speech bandwidth is much wider (100 - 7000 Hz) Actually, the low band (100 - 300 Hz) and the high band (3400 - 7000 Hz) are important for listening comfort, speech naturalness and for better recognizing the speaker voice The regeneration of these frequency bands at a phone receiver would thus enable to strongly improve speech quality in telecommunication systems Moreover, dunng a phone conversation, speech is often corrupted by background noise especially when mobile phones are used Also, the telephone network may transmit music played by switchboards. Therefore, the system that generates the low band and high band should both fit as much as possible to speech and should allow to reduce noise and improve music subjective quality. The US patent number 5,581,652 descnbes a Code book Mapping method foi extending the spectral envelope of a speech signal towards low frequencies. According to this method, low band synthesis filter coefficients are generated from narrow band analysis filter coefficients thanks to a training procedure using vector quantization as descnbed in the article by Y. Linde, A. Buzo, R. M Gray "An algonthm for Vector Quantizer Design", IEEE Transactions on Communications, Vol COM-28, No 1, January 1980 The training procedure allows to compute two different code books an extended one for the extended frequency band and a narrow one for the narrow band Said narrow code book is computed from the extended code book using vector quantization so that each vector of the extended code book is linked with a vector of the narrow band code book Then the coefficients of the low band synthesis filter are computed from these code books However, this method presents some drawbacks, which are responsible for the production of a rattling background sound. First the number of synthesis filter shapes is limited to the size of the code books. Second the extracted vectors in the extended band are not very correlated with the vectors obtained from the linear prediction of the narrow band speech signal. Another method called extension matnx was thus developed in order to improve signal quality at the receiving end. SUMMARY OF THE INVENTION It is an object of the invention to provide a method for extending at the receiving end a narrow band speech signal into a wider band speech signal in order to increase signal naturalness and listening comfort which yields to a better signal quality The invention is particularly advantageous in telephony systems In accordance with the invention, the received speech signal is detected with respect to a specific speech charactenstic before an extension matnx is applied to the signal, said extension matnx having coefficients depending on said detected charactenstic In a preferred embodiment of the invention, said specific charactenstic called voicing relates to the detected presence of voiced/unvoiced sounds in the received speech signal which can be detected by known methods such as the one descnbed in the manual "Speech Coding and Synthesis", by W.B. Kleijn and K K. Pahwal, published by Elsevier in 1995. Then the matnxes are computed from a data base, said data base being split with respect to the detected voicing, by applying an algonthm based on Least Squared Error cntenon on Linear Prediction Coding (LPC) parameters as descnbed by C L Lawson and R J. Hanson, in "Solving Least Squares Problems", Prentice-Hall, 1974, or based on the Constrained Least Square method descnbed in "Practical Optimization" by P.E. Gill, W Murray and M.H Wπght published by Academic Press, London 1981 BRIEF DESCRIPTION OF THE DRAWINGS The invention and additional features, which may be optionally used to implement the invention, are apparent from and will be elucidated with reference to the drawings descnbed hereinafter. Fig. 1 is a general schematic showing a system according to the invention Fig. 2 is a general bloc diagram of a receiver illustrating wide band synthesis according to the invention Fig. 3 is a general bloc diagram of a receiver according to a preferred embodiment of the invention. Fig. 4 is a bloc diagram illustrating a method according to the invention. Fig. 5 is a schematic showing the path of consecutive LSF in narrow band and extended band spaces. DETAILED DESCRIPTION OF THE DRAWINGS An example of a system according to the invention is shown in figure 1. The system is a mobile telephony system and comprises at least a transmission part 1 (e.g. a base station) and at least a receiving part 2 (e.g. a mobile phone) which can communicate speech signals through a transmission medium 3. The invention also concerns a receiver (Fig. 2 and 3) and a method (Fig. 4) for improving the audio quality of transmitted speech signals at the receiving part 2. Speech production is often modeled by a source-filter model as follows. The filter represents the short-term spectral envelope of the speech signal. This synthesis filter is an "all pole" filter of order P that represents the short-term correlation between the speech samples. In general, P equals 10 for narrow band speech and 20 for wide band speech (100 - 7000 Hz). The filter coefficients may be obtained by linear prediction (LP) as described in the cited manual "Speech Coding and Synthesis", by W.B. Kleijn and K.K. Paliwal. Therefore, the synthesis filter is referred to as «LP synthesis filter». The source signal feeds this filter, so it is also called the excitation signal. In speech analysis, it corresponds to the difference between the speech signal and its short-term prediction. In this case, this signal called the residual signal is obtained by filtering speech with the «LP inverse filter» which is the inverse of the synthesis filter. The source signal is often approximated by pulses at the pitch frequency for voiced speech, and by a white noise for unvoiced speech. This model enables to simplify the wide band synthesis by splitting this issue into two complementary parts before adding the resulting signals together as shown in Fig.2 which applies to the low band signal generation (100 - 300 Hz) as well as the high band generation (3400 - 7000 Hz). During the generation of the wide band spectral envelope from the narrow band speech spectral envelope, the problem is to obtain the synthesis filter coefficients. This is made by Linear Prediction analysis 11 of the narrow band speech signal SNB, then envelope extension 12 for controlling a synthesis filter 13 and a rejection filtering 14 for rejecting the narrow band signal which will be better extracted from the original narrow band speech signal. From the original narrow band speech signal SNB and the LP analysis bloc 11, the wide band excitation signal is generated for exciting the synthesis filter 13. The creation of the wide band excitation signal from the narrow band residual (or a derivative of it) is made by up-sampling 16 the received signal SNB and band-pass filtering 17 for obtaining the narrow band from the original signal. Most of the source-filter methods use the same principle to determine the low band synthesis filter. In a first step, the speech signal envelope spectrum parameters are extracted by LP analysis 11. These parameters are converted into an appropriate representation domain. Then, a function is applied on these parameters to obtain the Low band synthesis filter parameters 13. The particularity of each method resides principally in the choice of the function that is employed to create the low band LP synthesis filter. The determination of the excitation signal is also important as the maximum rejection level of the low band is not specified by telecommunication standard. In this case, methods that try to recover the low band residual of the speech signal before transmission from the received low band residual are quite risky because the signal to quantization noise ratio is unknown in this frequency band. The gist of the invention is to create a linear function to derive the extended band spectral envelope from the narrow band spectral envelope. A method according to the invention for creating this function will be described hereafter in relation to Fig. 4. A preferred embodiment of the invention is shown in Figure 3 introducing a voicing detection in order to apply a different linear function with respect to the content of the received signal. An overview of the low band extension scheme is given. The same applies to the high band extension. In this embodiment, S N denotes the narrow band speech, which is, for example, a signal between 0 and 4 kHz. The synthesized wide band speech is, for example, between 0 and 8 kHz and is denoted Sw- The narrow band speech is segmented into segments of 20 ms, referred to as a speech frame. A voicing detector 21 uses the narrow-band speech segment to classify the frame. The frame is either voiced, unvoiced, transition or silence. The classification is called the voicing decision and is indicated as voicing in Fig. 3. The voicing detection will be described afterwards. The voicing decision is used for selecting the mapping matrix 22. The order of the LPC analysis filter 23 may be 40 to have a high order estimate of the envelope. Using the current speech frame and the calculated LPC parameters, the narrow-band residual signal is created. The envelope and the residual are extended in parallel. To extend the envelope, the LPC parameters are first converted in LSF parameters. Using the voicing decision a mapping matrix 22 is selected. There are 4 different mapping matrices dependent on the voicing decision: voiced, unvoiced, transition and silence. The mapping matrices are created during an off-line training as described in relation to the figure 4. Using the narrowband LSF vector and the appropriate mapping matrix, the extended wide-band LSF vector is calculated. This LSF vector is then converted to direct form LPC parameters which are used in the synthesis filter 24. A wide band excitation generation bloc 25 using LPC analysis results is used to excite the synthesis filter 24. The narrow band signal S N is up-sampled 26 by zero padding before band-pass filtering 27 to complete the wide band signal S - The residual extension performs better if a high order LPC analysis is used. For this reason the system uses a 40th order LPC analysis. The order of both narrow-band and wide-band LPC vectors is 40. Although the performance of the envelope extension decreases slightly, the overall quality of the above system increases by the high order LPC vectors. For the voicing detection the algorithm is used as described in (TN harmony). This algorithm classifies a 10 ms segment into either voiced or unvoiced. An energy threshold is added to indicate silence frames. So, for a 20 ms frame, 2 voicing decision are taken. Based on these two voicing decisions the frame is classified. In the following table it is shown how the classification in 4 categories is made dependent on the 2 voicing decisions. Table 1 Voicing decision The voicing decision of the frame is used to select the mapping matrix and to apply gain scaling in unvoiced cases. A method for implementing the preferred embodiment shown in figure 3 is described with respect to Fig. 4. The algorithm requires two major stages to run. The first one is a training stage where extension matnxes are computed for extending the bandwidth at the receiving end. The second one is simply for running the bandwidth extension algonthm on the target product for example a mobile telephone handset. Fig. 4 relates to the training stage. It shows the LSF extension from a narrow- band LSF space 41, to an extended band LSF space 42. In the narrow-band space 41, the ongmal LSF path is represented by a continuous line, while vector quantification LSF jump is represented by a non continuous line. In the extended band space 42, the matnx extended LSF path is represented by a continuous line while the code book mapped LSF centroide jumps is represented by a non continuous line. Only extension matnxes preserve proximity and continuity. The extension matnxes are generated as illustrated in Fig.5, for example from 16 kHz phonetically balanced speech samples The steps are illustrated with the boxes 31 to 38 Step 31 : the speech samples are split into, for example, 20 ms consecutive windows (320 samples) which will be referred to as the wide band windows. Step 32 • these speech samples are filtered by a low-pass filter (to cut-off frequencies above 4kHz). Step 33 : the filtered speech samples are then down sampled to 8 kHz Step 34 the down sampled speech samples are split into 20 ms consecutive windows (160 samples) which will be referred to as the narrow band windows, in order to have a correspondence between narrow band and wide band windows for a given window index Step 35 . each narrow or wide band window is classified with respect to a speech cntena such as the presence of sounds which are voiced / unvoiced / transition / silence, etc. Step 36 for each window, a high order LSF vector is computed, for example 40th order. Step 37 : each narrow band LSF vector and its corresponding wide band LSF vector are put into a cluster among voiced, unvoiced, transition, silence, etc. Step 38 : For each cluster, an extension matnx is computed as descnbed below. These matnxes denoted M_V , M_UN ; M_T , M_S respectively for voiced , unvoiced ; transition and silence LSF determine a wide band LSF vector from a narrow band LSF vector with respect to its class. For example, for a narrow band voiced LSF vector denoted LSF_WB, the wide band LSF vector denoted LSF_NB is computed as follows : LSF_WB = M_V x LSF_NB. Instead of a voicing detection, other speech signal characteristics could be detected in order to make different classifications of the received signals such as a recognition based on phoneme models or a vector quantification. The creation of the extension matrix in step 38 according to the preferred embodiment of the invention is explained hereafter to derive the extended band spectral envelope from the narrow band spectral envelope. Let denote w * = ^ l ^ 2 )' ~ - we ( p )) the extended band LSF vector and w n - ) >w n( 2 ) > --w n (P)) tne narrow band LSF vector, both being of order P , where " ^ ' represents ith the narrow band LSF and e ^ ' represents the ith extended band LSF. ' — ' 1VI The extension matrix is defined as follows by e ~ n , where j s a P χ P matrix whose coefficients are denoted m(k,k), with l≤k≤P : [wj l ) w 2) ■ • • w ] = [w_π w n (2) w n (P)] - Thus, the spectral envelope extension is computed by multiplying the narrow band LSF vector by the extension matrix giving an extended spectral envelope LSF vector. As depicted in fig.5, showing the path of consecutive LSF in narrow band and extended band spaces, the extension matrix enables to provide wide band LSF vectors with the following interesting proprieties : - wide band LSF vectors are correlated with the narrow band LSF, - a continuous evolution of narrow band LSF leads to a continuous evolution of extended band LSF, - the extended band LSF set size is infinite. These characteristics of the original extended band LSF were not conserved with the code book mapping method. The equation (1) requires a pre-calculation of the matrix . According to a first embodiment of the invention, the matrix M j s computed using the Least Square (LS) algorithm as described in the manual by S. Haykin, "Adaptive Filter Theory", 3rd edition, Prentice Hall, 1996. In this case, the equation (1) is first extended to W e = W n M (2) where el W e = W eN and w ek is the extended band vector, with k = [X - - - N] Thus, each row of w n and w e correspond to a narrow band LSF and its corresponding extended band LSF Then, M is computed by the formula : M = (w n 'W n )" w n 'W e (3) Although the formula (3) will provide the best approximation in the least square sense, this is probably not the best extension matnx to be applied to LSF domain. Indeed, the LSF domain has not a structure of vector space. Therefore, (3) is likely to lead to extended vectors that do not belong to the LSF domain. This was confirmed by simulations where an important number of extended vectors did not fall in the LSF domain. The LSF domain is warranted by the condition : 0 < w, < vv 2 < • ■ • < w p < π (4) Consequently, two possibilities anse: ■ Changing the spectral envelope representation domain such that it has a structure of vector space (e.g. LAR). ■ Applying a constraint that reflects (4) dunng the computation of the extension matnx Because LSF is the preferred representation domain for spectral envelope, it has been decided to opt for the second possibility. According to a second embodiment of the invention, formula (3) is replaced by the following formula (5) : M - argmιn{tr[(W e - NW n )' (W e - NW n )f, with n(ι, j) ≥ 0 , V(/, ;)ε [l.._ f (5) N This constraint makes sure that the LSF coefficients are not negative. The algonthm that was used to solve (5), called the Non Negative Least Squares (NNLS), is descnbed by C. L. Lawson and R. J. Hanson, in the manual "Solving Least Squares Problems", Prentice-Hall, 1974. However, this algonthm has two drawbacks - It is quite stringent because all the matrix elements are forced to be positive. - It does not guarantee the LSF ordering. Consequently, the matrix is not the optimal one, which limits the performances of the extension process. Besides, there are some situations where the computed w e do not obey to the constraint of equation (4). This leads to an unstable filter. To avoid it, the extended band LSF vector has to be artificially stabilized. Although, informal listening tests showed that the NNLS algorithm provided encouraging performances, M has to be determined differently. According to a preferred embodiment of the invention, the Constrained Least Square (CLS) algorithm is used. Here, the optimization has to be computed on a vector. Thus, it is necessary to concatenate the columns of M . From (1), it can be derived : w ek = w n k - (6) and then, (7) Now, the constraint of equation (4) can be translated by w ek = (8) And then, P < e (9) For all the acquisitions, it corresponds to, (10) Thus, the matrix can be computed from the CLS algorithm y = argmin Ax - b , with Cx < d , with x ; The wide band excitation generation can be done by using a method such as the one described in the US patent number 5,581,652 cited as prior art.

Claims: CLAIMS: 1. Telecommunication system comprising at least a transmitter and a receiver for transmitting a speech signal with a given bandwidth, the receiver comprising means for extending the bandwidth of the received signal, and wherein said receiver comprises : - filtering means having control parameters for filtering said received signal and - a specific speech detector for detecting a speech characteristic of the received speech signal and for selecting said control parameters with respect to said detected speech characteristic. 2. Telecommunication system as claimed in claim 1, wherein said speech characteristic is voicing. 3. Telecommunication system as claimed in claim 1, wherein said control parameters are coefficients of a mapping matrix. 4. Receiver for receiving speech signals with a given bandwidth and comprising means for extending the bandwidth of said received signal, characterized in that it comprises filtering means having control parameters for filtering said received signal and a specific speech detector for detecting a speech characteristic of the received speech signal and for selecting said control parameters with respect to said detected speech characteristic. 5. Method for extending at the receiving end the bandwidth of a received signal, characterized in that it comprises the following steps : • a speech detection step for detecting a characteristic of the received speech signal, • a linear predictive analysis step for extracting speech parameters of the received signal, • a selection step for selecting a mapping extension matrix with respect to the detected characteristic of the received speech signal, • a filtering step for filtering the received signal using a filter whose coefficients are computed according to the LPC analysis results and the selected matrix. 6. Computer program product for a receiver as claimed in claim 4, computing a set of instructions which, when loaded into the receiver, causes the receiver to carry out the method as claimed in claim 5. 7. A signal for carrying a computer program, the computer program being arranged to carry the following steps : • a speech detection step for detecting a characteristic of a received speech signal, • a linear predictive analysis step for extracting speech parameters of the received speech signal, • a selection step for selecting a mapping extension matrix with respect to the detected characteristic of the received speech signal, • a filtering step for filtering the received speech signal using a filter whose coefficients are computed according to the LPC analysis results and the selected matrix.

Inventors: GERRITS ANDY, MIET GILLES, GERRITS, ANDY, MIET, GILLES
Applicants: KONINKL PHILIPS ELECTRONICS NV, KONINKLIJKE PHILIPS ELECTRONICS N.V.
Application year: 2000
Main classification: G10L21
IPC codes: G10L11, G10L13, G10L21