← Back to Patent Explorer
US5265190A Expired / Lapsed US ⏱️ 0.0 years remaining

CELP vocoder with efficient adaptive codebook search

Assignee: Motorola Solutions Inc
•
Filing: 1991-05-31
•
Granted: 1993-11-23
•
Expires: 2011-05-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A new method for Code Excited Linear Predictive (CELP) coding of speech reduces the computational complexity by removing a convolution operation from a recursive loop used to poll the adaptive code book vectors. In a preferred embodiment, an impulse function of a short term perceptually weighted filter is first convolved with perceptual weighted target speech and the result cross-correlated with each vector in the codebook to produce an error function. The vector having the minimum error function is chosen to represent the particular speech frame being examined.

Inventors

  • 👤 William C. Yip
  • 👤 David L. Barron

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 12:53
CPC Classifications
G; G10; G10L; G10L19/00; G10L19/04; G10L19/08; G10L19/09; G10L2019/0001; G10L2019/0002; G10L2019/0013; G10L2019/0014; G10L25/00; G10L25/03; G10L25/06; G10L25/18

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 349 words
A method for coding a frame of speech comprising N successive samples of input analog speech and using an adaptive codebook containing K target perceptually weighted excitation vectors C k (n), where k is an integer index running from 1 to K, and n in another integer index identifying successive speech samples n=1, . . . , n=N within the frame of speech, to determine an optimum codebook vector C k=j (n) which best synthesizes the speech frame, comprising: providing one or more linear predictive coding (LPC) filters for synthesizing trial replicas of the frame of speech when excited by the codebook vectors C k (n), wherein the LPC filter has an impulse response H(n); providing a perceptually weighted target speech residual X(n) for comparison to the results of exciting the one or more LPC filters with the codebook vectors C k (n); then convolving X(n) with H(n) for each value of n once per frame to produce a convolved output W(n) for delivery to a cross-correlator and thereafter cross-correlating the convolved output W(n) with C k (n) for each value of n and k to produce a cross-correlated output for delivery to a squarer whose output is coupled to a divider; auto-correlating C k (n) for each value of n and k to provide a first auto-correlation output U k (m) where m is a dummy index running from m=0 to m=N-1 for delivery to a multiplier; auto-correlating H(n) to produce a second auto-correlated output φ(m) where m is a dummy index running from m=0 to m=N-1 for delivery to the multiplier; multiplying the first and second auto-correlation outputs in the multiplier to produce an output product for delivery to a summer; summing the product for each value of k to produce a summed output for delivery to the divider; and finding the ratio of the cross-correlation output and the summed output for delivery to a peak selector; selecting in the peak selector that value C k=j (n) of C k (n) which produces the greatest magnitude of output from the divider, for delivery to a channel coder.
Claim 2
Independent Claim 349 words
A method for coding a frame of speech comprising N successive samples of input analog speech and using an adaptive codebook containing K target perceptually weighted excitation vectors C k (n), where k is an integer index running from 1 to K, and n in another integer index identifying successive speech samples n=1, . . . , n=N within the frame of speech, to determine an optimum codebook vector C k=j (n) which best synthesizes the speech frame, comprising: providing one or more linear predictive coding (LPC) filters for synthesizing trial replicas of the frame of speech when excited by the codebook vectors C k (n), wherein the LPC filter has an impulse response H(n); providing a perceptually weighted target speech residual X(n) for comparison to the results of exciting the one or more LPC filters with the codebook vectors C k (n); then convolving X(n) with H(n) for each value of n once per frame to produce a convolved output W(n) for delivery to a cross-correlator and thereafter cross-correlating the convolved output W(n) with C k (n) for each value of n and k to produce a cross-correlated output for delivery to a squarer whose output is coupled to a divider; auto-correlating C k (n) for each value of n and k to provide a first auto-correlation output U k (m) where m is a dummy index running from m=0 to m=N-1 for delivery to a multiplier; auto-correlating H(n) to produce a second auto-correlated output φ(m) where m is a dummy index running from m=0 to m=N-1 for delivery to the multiplier; multiplying the first and second auto-correlation outputs in the multiplier to produce an output product for delivery to a summer; summing the product for each value of k to produce a summed output for delivery to the divider; and finding the ratio of the cross-correlation output and the summed output for delivery to a peak selector; selecting in the peak selector that value C k=j (n) of C k (n) which produces the greatest magnitude of output from the divider, for delivery to a channel coder.
Claim 3
Dependent Claim 31 words
The method of claim 1 further comprising providing a gain calculator for determining a gain scaling factor G k=j (n) corresponding to C k (m), for delivery to the channel coder.
Claim 4
Dependent Claim 49 words
The method of claim 1 wherein the step of providing a perceptually weighted target speech residual X(n), comprises subtracting in a subtractor a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame to provide the target speech residual.
Claim 5
Dependent Claim 74 words
The method of claim 1 wherein the step of providing a perceptually weighted target speech residual X(n) further comprises, subtracting in a subtractor a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame to provide a first target speech residual, passing the first target speech through a spectrum inverse filter containing only zeros in the complex plane to provide the target speech residual.
Claim 6
Dependent Claim 110 words
The method of claim 1 wherein the step of providing a perceptually weighted target speech residual X(n) further comprises, subtracting in a subtractor a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame to provide a first target speech residual, then passing the first target speech through a spectrum inverse filter containing only zeros in the complex plane to provide a second target speech residual, and then passing the second target speech residual through a cascade weighting filter containing only poles in the complex plane to produce a speech residual which is perceptually weighted as the target speech residual.
Claim 7
Independent Claim 381 words
An apparatus for coding a frame of speech comprising N successive samples n=1 top n=N of input analog speech, to determine an optimum codebook vector C k=j (n) which best synthesizes the speech frame, comprising: an adaptive codebook containing K possible perceptually weighted excitation vectors C k (n), where k is an integer index running from 1 to K for identifying the vectors, and n=1 to n=N is the integer index identifying the successive speech samples within the frame of speech; one or more linear predictive coding (LPC) filters for synthesizing trail replicas of the frame of speech when excited by the codebook vectors C k (n), wherein the LPC filter has an impulse response H(n); means for generating a perceptually weighted target speech residual X(n) for comparison to the results of exciting the one or more LPC filters with the codebook vectors C k (n) to determine the optimum codebook vector C k=j (n) which best synthesizes the speech frame; means for convolving X(n) with H(n) for each value of n once per frame to produce a convolved output for delivery to a cross-correlator; means for auto-correlating H(n) to produce a first auto-correlated output for delivery to a multiplier means; recursive means for evaluating the codebook vectors C k (n) to determine the optimum codebook vector C k=j (n) which best synthesizes the speech frame, said recursive means comprising: means for cross-correlating the convolved output with C k (n) for each value of n and k to produce a cross-correlated output for delivery to a squarer whose output is coupled to a divider; means for auto-correlating C k (n) for each value of n and k to provide a second auto-correlation output for delivery to the multiplier means; multiplier means for multiplying the first and second auto-correlation outputs to produce an output product for delivery to a means for summing; means for summing the product for each value of k to produce a summed output for delivery to the divider; means for finding the ratio of the cross-correlation output and the adder summed output for delivery to a peak selector; and peak selector for selecting that value C k=j (n) of C k (n) which produces the greatest magnitude of output from the divider, for delivery to a channel coder.
Claim 8
Independent Claim 381 words
An apparatus for coding a frame of speech comprising N successive samples n=1 top n=N of input analog speech, to determine an optimum codebook vector C k=j (n) which best synthesizes the speech frame, comprising: an adaptive codebook containing K possible perceptually weighted excitation vectors C k (n), where k is an integer index running from 1 to K for identifying the vectors, and n=1 to n=N is the integer index identifying the successive speech samples within the frame of speech; one or more linear predictive coding (LPC) filters for synthesizing trail replicas of the frame of speech when excited by the codebook vectors C k (n), wherein the LPC filter has an impulse response H(n); means for generating a perceptually weighted target speech residual X(n) for comparison to the results of exciting the one or more LPC filters with the codebook vectors C k (n) to determine the optimum codebook vector C k=j (n) which best synthesizes the speech frame; means for convolving X(n) with H(n) for each value of n once per frame to produce a convolved output for delivery to a cross-correlator; means for auto-correlating H(n) to produce a first auto-correlated output for delivery to a multiplier means; recursive means for evaluating the codebook vectors C k (n) to determine the optimum codebook vector C k=j (n) which best synthesizes the speech frame, said recursive means comprising: means for cross-correlating the convolved output with C k (n) for each value of n and k to produce a cross-correlated output for delivery to a squarer whose output is coupled to a divider; means for auto-correlating C k (n) for each value of n and k to provide a second auto-correlation output for delivery to the multiplier means; multiplier means for multiplying the first and second auto-correlation outputs to produce an output product for delivery to a means for summing; means for summing the product for each value of k to produce a summed output for delivery to the divider; means for finding the ratio of the cross-correlation output and the adder summed output for delivery to a peak selector; and peak selector for selecting that value C k=j (n) of C k (n) which produces the greatest magnitude of output from the divider, for delivery to a channel coder.
Claim 9
Dependent Claim 39 words
The apparatus of claim 6 further comprising means for providing a gain calculator for determining a gain scaling factor G k=j (n) corresponding to C k=j (n) which best matches the input speech, for delivery to the channel coder.
Claim 10
Dependent Claim 37 words
The apparatus of claim 6 further comprising means for subtracting a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame for providing the target speech residual.
Claim 11
Dependent Claim 64 words
The apparatus of claim 6 further comprising, means for subtracting a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame to provide a first target speech residual and a spectrum inverse filter containing only zeros in the complex plane for receiving an output of the subtracting means for providing the target speech residual.
Claim 12
Dependent Claim 99 words
The apparatus of claim 6 further comprising, means for subtracting a ringing signal of the LPC filter arising from a previous speech frame from the speech of the current speech frame to provide a first target speech residual, a spectrum inverse filter containing only zeros in the complex plane coupled to an output of the subtracting means to provide a second target speech residual, and a cascade weighting filter containing only poles in the complex plane coupled to an output of the spectrum inverse filter for producing a speech residual which is perceptually weighted as the target speech residual.
Claim 13
Independent Claim 227 words
An apparatus for receiving input speech and delivering quantized signals representing the input speech to a communication transmission path, comprising; means for receiving the speech and providing therefrom, input speech samples; a stochastic codebook searcher; an adaptive codebook searcher; a channel coder for receiving signals representing speech and delivering quantized signals representing speech to the communication transmission path and to a channel decoder; a linear predictive coding (LPC) analyzer for receiving the input speech samples and producing LPC filter coefficients based thereon; an LPC coefficient coder coupled to the LPC analyzer for quantizing the LPC coefficients and providing quantized LPC coefficients; first decoder means coupled to the LPC coefficient coder for decoding the quantized LPC coefficients and providing decoded LPC coefficients, wherein information relating to the decoded LPC coefficients is coupled to the stochastic codebook searcher, the adaptive codebook searcher and the channel coder; channel decoder coupled to the channel coder for receiving the quantized signals representing speech and producing therefrom decoded signals representing speech; means coupled to the channel decoder for reconstructing speech based on the decoded signals representing speech; and means for comparing the input speech samples to the reconstructed speech derived from the channel decoder to produce error signals, the error signals being used to correct the signals being provided to the channel coder by the stochastic codebook searcher and the adaptive codebook searcher.
Claim 14
Independent Claim 227 words
An apparatus for receiving input speech and delivering quantized signals representing the input speech to a communication transmission path, comprising; means for receiving the speech and providing therefrom, input speech samples; a stochastic codebook searcher; an adaptive codebook searcher; a channel coder for receiving signals representing speech and delivering quantized signals representing speech to the communication transmission path and to a channel decoder; a linear predictive coding (LPC) analyzer for receiving the input speech samples and producing LPC filter coefficients based thereon; an LPC coefficient coder coupled to the LPC analyzer for quantizing the LPC coefficients and providing quantized LPC coefficients; first decoder means coupled to the LPC coefficient coder for decoding the quantized LPC coefficients and providing decoded LPC coefficients, wherein information relating to the decoded LPC coefficients is coupled to the stochastic codebook searcher, the adaptive codebook searcher and the channel coder; channel decoder coupled to the channel coder for receiving the quantized signals representing speech and producing therefrom decoded signals representing speech; means coupled to the channel decoder for reconstructing speech based on the decoded signals representing speech; and means for comparing the input speech samples to the reconstructed speech derived from the channel decoder to produce error signals, the error signals being used to correct the signals being provided to the channel coder by the stochastic codebook searcher and the adaptive codebook searcher.
Claim 15
Dependent Claim 92 words
The apparatus of claim 11 wherein the means for comparing the input speech samples to the reconstructed speech samples derived from the channel decoder to produce error signals, comprises a gain multiplier for adjusting the signal gain, and long delay pitch predictor for producing a first speech residual, a short delay spectrum predictor for producing a speech signal, means for subtracting the speech signal produced by the short delay spectrum predictor from the input speech samples, and spectral shaping filters for weighting the output of the subtractor to produce the error signals.
Claim 16
Independent Claim 186 words
A method for receiving input speech and delivering quantized signals representing the input speech to a communication transmission path, comprising: receiving the input speech and providing therefrom, input speech samples; receiving the input speech samples and producing therefrom linear predictive coding (LPC) filter coefficients at least partially representative of such input speech samples; providing quantized LPC coefficients; decoding the quantized LPC coefficients and providing decoded LPC coefficients at least partially representative of such speech samples; coupling information relating to the decoded LPC coefficients to a stochastic codebook searcher, an adaptive codebook searcher and a channel coder; receiving in a channel coder, other signals representing speech; quantizing the signals representing speech and delivering quantized signals representing speech to the communication transmission path and to a channel decoder; decoding the quantized signals representing speech and producing therefrom decoded signals representing speech; reconstructing speech based on the decoded signals representing speech; comparing the input speech samples to the reconstructed speech to produce error signals; and using the error signals to correct the signals being used to provide the quantized signals representing speech being delivered to the communication transmission path.
Claim 17
Independent Claim 186 words
A method for receiving input speech and delivering quantized signals representing the input speech to a communication transmission path, comprising: receiving the input speech and providing therefrom, input speech samples; receiving the input speech samples and producing therefrom linear predictive coding (LPC) filter coefficients at least partially representative of such input speech samples; providing quantized LPC coefficients; decoding the quantized LPC coefficients and providing decoded LPC coefficients at least partially representative of such speech samples; coupling information relating to the decoded LPC coefficients to a stochastic codebook searcher, an adaptive codebook searcher and a channel coder; receiving in a channel coder, other signals representing speech; quantizing the signals representing speech and delivering quantized signals representing speech to the communication transmission path and to a channel decoder; decoding the quantized signals representing speech and producing therefrom decoded signals representing speech; reconstructing speech based on the decoded signals representing speech; comparing the input speech samples to the reconstructed speech to produce error signals; and using the error signals to correct the signals being used to provide the quantized signals representing speech being delivered to the communication transmission path.
Claim 18
Dependent Claim 63 words
The method of claim 13 wherein the step of comparing the input speech samples to the reconstructed speech samples, comprises adjusting the signal gain, passing the signal derived thereby through a long delay pitch predictor for producing a first speech residual and a short delay spectrum predictor for producing a speech signal input to a subtractor for comparison to the input speech samples.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-22 1997-05-24 1997-11-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-22 2001-05-24 2001-11-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-22 2005-05-24 2005-11-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag