Digital speech coder having improved vector excitation source

• US 4,896,361 A
• Filed: 01/06/1989
• Issued: 01/23/1990
• Est. Priority Date: 01/07/1988
• Status: Expired due to Term

• Current Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Gerson, Ira A.
• Primary Examiner(s): Kemeny, Emanuel S.
• Application Number:
  US07/294,098
• Time in Patent Office: 382 Days
• Field of Search: 381/40, 381/49
• US Class Current: 704/222
• CPC Class Codes: G10L 19/135 Vector sum excited linear prediction [VSELP]
• CPC Class Codes: G10L 2019/0007 Codebook element generation
• CPC Class Codes: G10L 2019/0013 Codebook search algorithms
• CPC Class Codes: G10L 25/06 the extracted parameters being correlation coefficients

Abstract

An improved excitation vector generation and search technique (FIG. 1) is described for a code-excited linear prediction (CELP) speech coder (100) using a codebook memory of excitation code vectors. A set of M basis vectors v_m (n) are used along with the excitation signal codewords (i) to generate the codebook of excitation vectors u_i (n) according to a "vector sum" technique (120) of converting stored selector codewords into a plurality of interim data signals, multiplying the set of M basis vectors by the interim data signals, and summing the resultant vectors to produce the set of 2^M codebook vectors. Only M basis vectors need to be stored in memory (114), as opposed to all 2^M code vectors.

Claims

1. A means for providing a set of 2^M codebook vectors for a vector quantizer, said codebook vector providing means comprising:

memory means for storing said set of codebook vectors, said set of stored codebook vectors formed by;

converting a set of selector codewords into a plurality of interim data signals;

inputting a set of M basis vectors;

multiplying said set of basis vectors by said plurality of interim data signals to produce a plurality of interim vectors; and

summing said plurality of interim vectors to produce said set of codebook vectors;

means for addressing said memory means with a particular codeword; and

means for outputting a particular codebook vector from said memory means when addressed with said particular codeword.

2. The codebook vector providing means according to claim 1, wherein said converting step produces said plurality of interim data signals θ

_im by identifying the state of each bit of each selector codeword i, where 0≦

i≦

2^M-1, and where 1≦

m≦

M, such that θ

_im has a first value if bit m of codeword i is of a first state, and such that θ

_im has a second value if bit m of codeword i is of a second state.

3. The codebook vector providing means according to claim 1, wherein said set of basis vectors is stored in a memory.

4. A digital memory containing a codebook of excitation vectors for use in speech analysis or synthesis, said codebook having at least 2^M excitation vectors ui(n), each having N elements, where 1≦

n≦

N, and where 0≦

i≦

2^M-1, said codebook vectors generated from a set of M basis vectors v_m (n), each having N elements, where 1≦

n≦

N and where 1≦

m≦

M, and from a set of 2^M digital codewords I_i, each having M bits, where 0≦

i≦

2^M-1, said codebook vectors generated using the steps of;

}a} identifying a signal θ

_im for each bit of each codeword I_i, such that θ

_im has a first value if bit m of codeword I_i is of a first state, and such that θ

_im has a second value if bit m of codeword I_i is of a second state; and

{b} calculating said codebook of 2^M excitation vectors u_i (n) according to the equation;

##EQU28## where 1≦

n≦

N.

5. A method of reconstructing a signal from a codebook memory and from a particular excitation codeword, said signal reconstructing method comprising the steps of:

{a} addressing a codebook memory with a particular codeword, said codebook memory having a set of excitation vectors stored therein, each of said excitation vectors having been produced by;

{1} defining a plurality of interim data signals based upon said particular codeword;

{2} multiplying a set of basis vectors by said plurality of interim data signals to produce a plurality of interim vectors; and

{3} summing said plurality of interim vectors to produce a single excitation vector;

{b} outputting, from said codebook memory, a particular excitation vector corresponding to the particular addressing codeword; and

{c} signal processing said particular excitation vector to produce said reconstructed signal.

6. The method according to claim 5, wherein said set of basis vectors is stored in memory.

7. The method according to claim 5 wherein said signal processing step includes linear filtering of said particular excitation vector.

8. The method according to claim 5, wherein said defining step produces said plurality of interim data signals θ

_im by identifying the state of each bit of said particular codeword i, where 0≦

i≦

2^M-1, and where 1≦

m≦

M, such that θ

_im has a first value if bit m of codeword i is of a first state, and such that θ

_im has a second value if bit m of codeword i is of a second state.

9. A speech coder comprising:

input means for providing an input vector corresponding to a segment of input speech;

means for providing a set of codewords corresponding to a set of Y possible excitation vectors;

memory means for storing said set of Y possible excitation vectors and for providing a particular excitation vector in response to a particular codeword, each of said set of excitation vectors having been produced by;

{a} defining at least one selector codeword;

{b} defining a plurality of interim data signals based upon said selector codeword;

{c} inputting a set of X basis vectors, where X<

Y; and

{d} generating each of said excitation vectors by performing linear transformations on said X basis vectors, said linear transformations defined by said interim data signals;

said speech coder further comprising;

a first signal path including;

means for filtering said excitation vectors;

means for comparing said filtered excitation vectors to said input vector, thereby providing comparison signals; and

controller means for evaluating said set of codewords and said comparison signals, and for providing a particular codeword representative of a single excitation vector which, when passed through said first signal path, most closely resembles said input vector.

10. The speech coder according to claim 9, wherein said excitation vector generating step {d} includes the steps of:

{i} multiplying said set of X basis vectors by said plurality of interim data signals to produce a plurality of interim vectors; and

{ii} summing said plurality of interim vectors to produce said excitation vectors.

11. The speech coder according to claim 9, wherein each of said selector codewords can be represented in bits, and wherein said interim data signals are based upon the value of each bit of each selector codeword.

12. The speech coder according to claim 9, wherein Y>

2^X.