WO1998005030A1

WO1998005030A1 - Method and apparatus for searching an excitation codebook in a code excited linear prediction (clep) coder

Info

Publication number: WO1998005030A1
Application number: PCT/US1997/013594
Authority: WO
Inventors: Andrew P. Dejaco; Ning Bi
Original assignee: Qualcomm Incorporated
Priority date: 1996-07-31
Filing date: 1997-07-31
Publication date: 1998-02-05
Also published as: BR9710640A; CA2261956A1; AU719568B2; KR20000029745A; FI990181A; ATE259532T1; CN1124589C; AU3969497A; JP2000515998A; DE69727578D1; EP0917710A1; FI990181A0; US5751901A; EP0917710B1; IL128285A0; KR100497788B1; CN1229502A

Abstract

Method and apparatus for selecting a code vector in an algebraic codebook wherein the analysis window for the coder is extended beyond the length of the target speech frame. An input signal is filtered by a perceptual weighting filter (76). Then, the filter is set to ring out for a number of samples equal to the length of the perceptual weighting filter (76), while a zero input vector is applied as input. By extending the analysis window, the two dimensional impulse response matrix can be stored as a one dimensional autocorrelation matrix in memory (60, 80), greatly saving on the computational complexity and memory required for the search.

Description

METHOD AND APPARATUS FOR SEARCHING AN

EXCITATION CODEBOOK IN A CODE EXCITED LINEAR

PREDICTION (CELP) CODER

BACKGROUND OF THE INVENTION

I. Field of the Invention

The present invention relates to speech processing. More particularly, the present invention relates to a novel and improved method and apparatus for locating an optimal excitation vector in a code excited linear prediction (CELP) coder.

II. Description of the Related Art

Transmission of voice by digital techniques has become widespread, particularly in long distance and digital radio telephone applications. This in turn has created interest in determining methods which minimize the amount of information sent over the transmission channel while maintaining high quality in the reconstructed speech. If speech is transmitted by simply sampling and digitizing, a data rate on the order of 64 kilobits per second (kbps) is required to achieve a speech quality of conventional analog telephone. However, through the use of speech analysis, followed by the appropriate coding, transmission, and resynthesis at the receiver, a significant reduction in the data rate can be achieved.

Devices which employ techniques to compress voiced speech by extracting parameters that relate to a model of human speech generation are typically called vocoders. Such devices are composed of an encoder, which analyzes the incoming speech to extract the relevant parameters, and a decoder, which resynthesizes the speech using the parameters which it receives over the transmission channel. The model is constantly changing to accurately ' model the time varying speech signal. Thus, the speech is divided into blocks of time, or analysis frames, during which the parameters are calculated. The parameters are then updated for each new frame. Of the various classes of speech coders, the Code Excited Linear

Predictive Coding (CELP), Stochastic Coding, or Vector Excited Speech Coding coders are of one class. An example of a coding algorithm of this particular class is described in the paper "A 4.8 kbps Code Excited Linear Predictive Coder" by Thomas E. Tremain et al., Proceedings of the Mobile Satellite Conference. 1988. Similarly, examples of other vocoders of this type are detailed in U.S. Patent No. 5,414,796, entitled "Variable Rate Vocoder" and assigned to the assignee of the present invention and incorporated by reference herein.

The function of the vocoder is to compress the digitized speech signal into a low bit rate signal by removing all of the natural redundancies inherent in speech. In a CELP coder, redundancies are removed by means of a short term formant (or LPC) filter. Once these redundancies are removed, the resulting residual signal can be modeled as white Gaussian noise, which also must be encoded. The process of determining the coding parameters for a given frame of speech is as follows. First, the parameters of the LPC filter are determined by finding the filter coefficients which remove the short term redundancy, due to the vocal tract filtering, in the speech. Next, an excitation signal, which is input to LPC filter at the decoder, is chosen by driving the LPC filter with a number of random excitation waveforms in a codebook, and selecting the particular excitation waveform which causes the output of the LPC filter to be the closest approximation to the original speech. Thus, the transmitted parameters relate to (1) the LPC filter and (2) an identification of the codebook excitation vector. A promising excitation codebook structure is referred to as an algebraic codebook. The actual structure of algebraic codebooks is well known in the art and is described in the paper "Fast CELP coding based on Algebraic Codes" by J.P. Adoul, et al., Proceedings of ICASSP. April 6-9, 1987. The use of algebraic codes is further disclosed in U.S. Patent No. 5,444,816, entitled "Dynamic Codebook for Efficient Speech Coding Based on Algebraic Codes", the disclosure of which is incorporated by reference.

SUMMARY OF THE INVENTION

Analysis by synthesis based CELP coders use a minimum mean square error measure to match the best synthesized speech vector to the target speech vector. This measure is used to search the codevector codebook to choose the optimum vector for the current subframe. This mean square error measure is typically limited to the window over which the excitation codevector is being chosen and thus fails to account for the contribution this codevector will make on the next subframe being searched.

In the present invention, the window size over which the mean square error measure is minimized is extended to account for this ringing of the codevector in the current subframe into the next subframe. The window extension is equal to the length of the impulse response of the perceptual weighting filter, h(n). The mean square error approach in the current invention is analogous to the autocorrelation approach to the minimum mean square error used in LPC analysis as described in the paper "A 4.8kbps Code Excited Linear Predictive Coder" by Thomas E. Tremain et al.. Proceedings of the Mobile Satellite Conference. 1988.

Formulating the mean square error problem from this perspective, the present invention has the following advantages over the current approach:

1.) The ringing of the codevector from the current subframe to the next subframe is accounted for in the measure and thus pulses placed at the end of the vector are weighted equivalently to pulses placed at the beginning of the vector. 2.) The impulse response of the perceptual weighting filter becomes stationary for the entire subframe making the autocorrelation matrix of h(n), Φ (i,j), Toeplitz, or stated another way, Φ (i,j) = Φ l i-j l . Thus the present invention turns a 2-D matrix into a 1-D vector and thus reduces RAM requirements for the codebook search as well as computational operations.

BRIEF DESCRIPTION OF THE DRAWINGS

The features, objects, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:

FIG. 1 is an illustration of the traditional apparatus for selecting a code vector in an ACELP coder; FIG. 2 is a block diagram of the apparatus of the present invention for selecting a code vector in an ACELP coder; and

FIG. 3 is a flowchart describing the method for selecting a code vector in the present invention.

DETAILED DESCRIPTION OF THE PREFERRED

EMBODIMENTS

FIG. 1 illustrates the traditional apparatus and method used to perform an algebraic codebook search. Codebook generator 6 includes a pulse generator 2 which in response to a pulse position signal, p_j, generates a signal with a unit pulse in the ith position. In the exemplary embodiment, the codebook excitation vector comprises forty samples and the possible positions for the unit impulse are divided into tracks TO to T4 as shown in TABLE 1 below.

TABLE 1

Track Positions

TO 0, 5, 10, 15, 20, 25, 30, 35

Tl 1, 6, 11, 16, 21, 26, 31, 36

T2 2, 7, 12, 17, 22, 27, 32, 37

T3 3, 8, 13, 18, 23, 28, 33, 38

T4 4, 9, 10, 19, 24, 29, 34, 39

In the exemplary embodiment, one pulse is provided for each track by pulse generator 2. Np is the number of pulses in an excitation vector. In the exemplary embodiment, Np is 5. For each pulse, pj, a corresponding sign si is assigned to the pulse. The sign of the pulse which is illustrated by multiplier 4 which multiplies the unit impulse at position, p_j, by the sign value, si. The resulting code vector, ck, is given by equation (1) below.

Np -l ^ck()) = ∑^si ^δ(J - Pi ) (1) i=0

Filter generator 12 generates the tap values for formant filter, h(n), as is well known in the art and described in detail in the aforementioned U.S. Patent No. 5,414,796. Typically, the impulse function, h(n), would be computed for M samples where M is the length of the subframe being searched, for example 40.

The composite filter coefficients, h(n), are provided to and stored as two dimensional triangular Toeplitz matrix (H) in memory element 13 where the diagonal is h(0) and the lower diagonals are h(l)..., h(M-l) as shown below.

The values are provided by memory 13 to matrix multiplication element 14. H is then multiplied by its transpose to give the correlation of the impulse response matrix Φ in accordance with equation (3) below.

M Φ(i,j) = H* • H= ∑h(n - i)h(n - j), for i > j (3) n=j

The result of the correlation operation is then provided to memory element 18 and stored as a two dimensional matrix which requires 40² or 1600 positions of memory for this embodiment.

The input speech frame s(n) is provided to and filtered by perceptual weighting filter 32 to provide the target signal, x(n). The design and implementation of perceptual weighting filter 32 is well known in the art and is described in detail in the aforementioned U.S. Patent No. 5,414,796. The sample values of the target signal, x(n), and values of the impulse matrix, H(n), are provided to matrix multiplication element 16 which computes the cross correlation between the target signal and the impulse response in accordance with equation (4) below.

M d(ι)= H* • x= ∑ x(i)h(i - j), for j=0 to M. (4)

)='

The values from memory element 20, d(i), and the codebook vector amplitude elements, c^, are provided to matrix multiplication element 22 which multiplies the codebook vector amplitude elements by the vector d(n) and squares the resulting value in accordance with equation (5) below.

Codebook vector amplitude elements, ck, and codebook pulse positioning vector p are provided to matrix multiplication element 26. Matrix multiplication element 26 computes the value, Eyy, in accordance with equation (6) below.

Np-l Np-1 N_p-1 Eyy= ∑φ(_Pl,p,) + 2 - ∑ ∑c_k(p_l )c_k(p₎)Φ(p, ,p,) (6)

,=0 1=0 j=ι+l The values of Eyy and (E_Xy)2 are provided to divider 28, which computes the value Tk in accordance with equation (7) below.

The values T for each codebook vector amplitude element, ck, and codebook pulse positioning vector p are provided to minimization element 30 and the codebook vector that maximizes the value T is selected. Referring to FIG. 2, the apparatus for selecting the code vector in the present invention is illustrated. In FIG. 3, a flowchart describing the operational flow of the present invention is illustrated. First in block 100, the present invention precomputes the values of d(k), which can be computed ahead of time and stored since its values do not change with the code vector being searched.

The speech frame, s(n) is provided to perceptual weighting filter 76 which generates the target signal, x(n). The resulting target speech segment, x(n), consists of M+L-l perceptually weighted samples which are provided to multiply and accumulate element 78. L is the length of the impulse response of perceptual weighting filter 76. This extended length target speech vector, x(n), is created by filtering M samples of the speech signal through the perceptual weighting filter 76 and then continuing to let this filter ring out for L-l additional samples while a zero input vector is applied as input to perceptual weighting filter 76. As described previously with respect to filter generator 12, filter generator 56 computes the filter tap coefficients for the formant filter and from those coefficients determines the impulse response, h(n). However filter generator 56 generates a filter response for delays from 0 to L-l, where L is the length of the impulse response, h(n). It should be noted that though, described in the exemplary embodiment, without a pitch filter the present invention is equally applicable for cases where there is a pitch filter by simple modification of the impulse response as is well known in the art.

The values of h(n) from filter generator 56 are provided to multiply and accumulate element 78. Multiply and accumulate element 78 computes the cross correlation of the target sequence, x(n), with the filter impulse response, h(n), in accordance with equation (8) below. n+L-1 d(n)= ∑x(n)h(n - j), for n=0 to M-l. (8) j=n

The computed values of d(n) are then stored in memory element 80.

In block 102, the present invention precomputes the values of Φ needed for the computation of Eyy. It is at this point where the biggest gain in memory savings of the present invention is realized. Because the mean square error measure has been extended over a larger window, h(n) is now stationary over the entire subframe and consequently the 2-D Φ(i,j) matrix becomes a 1-D vector because Φ(i,j) = Φ( I i-j I ). In the present embodiment as described in Table 1, this means that the traditional method requires 1600

Ram locations while the present invention requires only 40. Operation count savings are also obtained in the computation and store of the 1-D vector over the 2-D matrix also. In the present invention, the values of Φ are computed in accordance with equation (9) below.

L-l

Φ(i)= ∑h(n)h(n - i) (9) n=0

The values of Φ(i) are stored in memory element 80, which only requires L memory locations, as opposed to the traditional method which requires the storage of M^ elements. In this embodiment, L=M.

In block 104, the present invention computes the cross correlation value E_Xy. The values of d(k) stored in memory element 80 and the current codebook vector ci(k) from codebook generator 50 are provided to multiply and accumulate element 62. Multiply and accumulate element 62 computes the cross correlation of the target vector, x(k), and the codebook vector amplitude elements, ci(k) in accordance with equation (10).

N_p

E_xy = ∑c_i(_Pk) d(_Pk) (10) _k=o The value of E_Xy is then provided to squaring means 64 which computes the square of Exy.

In block 106, the present invention computes the value of the autocorrelation of the synthesized speech, E_yy. The codebook vector amplitude elements ci(k) and cj(k) are provided from codebook generator 50 to multiply and accumulate element 70. In addition, the values of Φ I i-j I are provided to multiply and accumulate element 70 from memory element 60. Multiply and accumulate element 70 computes the value given in equation (11) below.

N_p N_p

∑ ∑c_k(Pi ) c_k(p_j) ΦI_Pi - p_jl (11) i=0 j=i+l

The value computed by multiply and accumulate means 70 is provided to multiplier 72 where its value is multiplied by 2. The product from multiplier 72 is provided to a first input of summer 74.

Memory element 60 provides the value of Φ(0) to multiplier 75 where it is multiplied by the value Np. The product from multiplier 75 is provided to a second input of summer 74. The sum from summer 74 is the value Eyy which is given by equation (12) below.

N_p N_p E_yy =N_p Φ(0)+2 ∑ ∑c_k(_Pi) c_k(p_j) Φlp_i - p_jl (12) i=0 j=i+l

An appreciation of the savings of computational resource can be attained by comparing equation (12) of the present invention with equation (6) of the traditional search method. This savings results from faster addressing of a 1-D matrix (Φ I pi-pj I ) over a 2-D access of Φ(pi,pj), from less adds required for Eyy computation (for the exemplary embodiment equation (6) takes 15 adds while equation (12) takes 11 assuming ck(pi) are just 1 or -1 sign terms), and from the 1360 Ram location savings since Φ(i,j) does not need to be stored.

In block 108, the present invention computes the value of

The value of Eyy from summing element 74 is provided to a first input of divider 66. The value of (Exy)² is provided from squaring means 64 is provided to the second input of divider 66. Divider 66 then computes the quotient given in equation (13) below.

'xy (13)

'Tf

The quotient value from divider 66 is provided to minimization element 66. In block 110, if the all vectors ck have not been tested the flow moves back to block 104 and the next code vector is tested as described above. If all vectors have been tested then, in block 112, minimization element 68 selects the code vector which results in the maximum value of

The previous description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention. The various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

I CLAIM:

Claims

1. In a linear prediction coder to provide synthesized speech in which short term and long term redundancies by a filter means having L taps wherein said filter means has an impulse response, h(n), are removed from a frame of N digitized speech samples resulting in a residual waveform of N samples, a method for encoding said residual waveform using k codebook vector, ck, comprising: convolving a target signal, x(n), and said impulse response, h(n) to provide a first convolution; autocorrelating an impulse response matrix wherein said impulse response matrix is a lower triangular toeplitz matrix with diagonal h(0) where h(0) is the zeroth impulse response value and the lower diagonals h(l),...,h(L-l) and wherein said impulse response autcorrelation is computed in accordance with the equation:

Φ(i)= ∑h(n)h(n - i); n=0

autocorrelating said synthesized speech in accordance with said autocorrelation of said impulse response matrix and said codebook vectors, ck to provide a synthesized speech autocorrelation, Eyy; cross correlating said synthesized speech and said target speech in accordance with said first convolution and said codebook vectors to provide a cross correlation Exy; and selecting a codebook vector in accordance with said cross correlation, E_Xy, and said synthesized speech autocorrelation, Eyy.

2. The method of Claim 1 further comprising the steps of: generating a first set of filter coefficients; generating a second set of filter coefficients; combining said first set of filter coefficients and said second set of filter coefficients to provide said impulse response, h(n).

3. The method of Claim 1 further comprising: receiving said input frame of N digitized samples; and perceptual weighting said input frame to provide said target signal.

4. The method of claim 1 wherein said step of convolving said target signal and said impulse response is performed in accordance with the equation:

n+L-l d(n)= ∑x(n)h(n - j), for n=0 to M-l. j=n

5. The method of Claim 1 further comprising the step of storing said impulse response autcorrelation in a memory of L memory locations.

6. The method of Claim 1 wherein said step of cross correlating said synthesized speech and said target speech is performed in accordance with the equation:

N_p

E_xy = ∑Ci(p_k) d(p_k), k=0

where d(k) is the cross correlation of the target signal and the impulse response.

7. The method of Claim 1 wherein step of autocorrelating said synthesized speech is performed in accordance with the equation:

N_p N_p E_yy =N_p Φ(0)+2 ∑ ∑c_k(p_i) c_k(p_j) Φlp_i - p_jl. i=0 j=i+l

8. The method of Claim 1 wherein said step of selecting a codebook vector comprises the steps of: for each code vector, ck, squaring the value Exy; dividing computed value of Eyy by said square of Exy for each code vector, ck; and selecting the code vector which maximizes the quotient of Eyy and the square of Exy.

9. The method' of Claim 1 wherein said codebook vectors, c / are selected in accordance with an algebraic codebook format.