US5717822A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computational complexity reduction during frame erasure of packet loss
Assignee: Nokia of America Corp
•
Filing: 1996-02-16
•
Granted: 1998-02-10
•
Expires: 2016-02-16
Abstract
Abstract A speech coding system robust to frame erasure (or packet loss) is described. Illustrative embodiments are directed to a modified version of CCITT standard G.728. In the event of frame erasure, vectors of an excitation signal are synthesized based on previously stored excitation signal vectors generated during non-erased frames. This synthesis differs for voiced and non-voiced speech. During erased frames, linear prediction filter coefficients are synthesized as a weighted extrapolation of a set of linear prediction filter coefficients determined during non-erased frames. The weighting factor is a number less than 1. This weighting accomplishes a bandwidth-expansion of peaks in the frequency response of a linear predictive filter. Computational complexity during erased frames is reduced through the elimination of certain computations needed during non-erased frames only. This reduction in computational complexity offsets additional computation required for excitation signal synthesis and linear prediction filter coefficient generation during erased frames.
Inventors
- 👤 Juin-Hwey Chen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 04:11
CPC Classifications
H; H04; H04B; H04B7/00; G; G10; G10L; G10L19/00; G10L19/005; G10L19/04; G10L19/08; G10L19/12
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
141 words
A method of operating a decoder, the decoder adapted for receiving input signals of non-erased frames and for receiving input signals of erased frames, the method comprising the steps of: in response to receiving an input signal of a given non-erased frame, performing a plurality of signal processing operations which generate one or more parameter signals for use in decoding said input signals of said non-erased frames; and in response to receiving an input signal of a given erased frame, performing a subset of said plurality of signal processing operations, said subset of said plurality of signal processing operations comprising one or more signal processing operations for storing signals for use in generating said parameter signals in a future non-erased frame, said subset of said plurality of signal processing operations excluding at least one of said plurality of signal processing operations.
Claim 2
Independent Claim
141 words
A method of operating a decoder, the decoder adapted for receiving input signals of non-erased frames and for receiving input signals of erased frames, the method comprising the steps of: in response to receiving an input signal of a given non-erased frame, performing a plurality of signal processing operations which generate one or more parameter signals for use in decoding said input signals of said non-erased frames; and in response to receiving an input signal of a given erased frame, performing a subset of said plurality of signal processing operations, said subset of said plurality of signal processing operations comprising one or more signal processing operations for storing signals for use in generating said parameter signals in a future non-erased frame, said subset of said plurality of signal processing operations excluding at least one of said plurality of signal processing operations.
Claim 3
Dependent Claim
45 words
The method of claim 1 wherein the step of performing the subset of said plurality, of signal processing operations comprises performing substantially only the one or more signal processing operations for storing signals for use in generating said parameter signals in a future non-erased frame.
Claim 4
Dependent Claim
40 words
The method of claim 1 wherein the decoder generates an output signal applied to a postfilter, the method further comprising the step of performing signal processing operations which generate signals for use by said postfilter during said given erased frame.
Claim 5
Dependent Claim
13 words
The method of claim 1 wherein the decoder comprises a vector gain adapter.
Claim 6
Dependent Claim
25 words
The method of claim 4 wherein said one or more signal processing operations for storing signals comprises storing a signal reflecting a synthesized excitation signal.
Claim 7
Dependent Claim
68 words
The method of claim 5, the decoder including a first excitation signal generator responsive to said input signals of said non-erased frames, the method further comprising the steps of: storing samples of a first excitation signal generated by said first excitation signal generator; and responsive to a signal indicating a current erased frame, synthesizing a second excitation signal based on previously stored samples of the first excitation signal.
Claim 8
Dependent Claim
68 words
The method of claim 5 wherein the one or more signal processing operations for storing signals further comprises: generating a first signal representing a root-mean-square of a set of synthesized excitation signal samples; generating a second signal representing the logarithm of the first signal; and generating the signal reflecting a synthesized excitation signal by forming a difference between the second signal and a constant signal stored in memory.
Claim 9
Dependent Claim
13 words
The method of claim 1 wherein the decoder comprises a synthesis filter adapter.
Claim 10
Dependent Claim
25 words
The method of claim 8 wherein said one or more signal processing operations for storing signals comprises storing signals output from an LPC synthesis filter.
Claim 11
Dependent Claim
42 words
The method of claim 9 wherein said one or more signal processing operations further comprises: generating eleven autocorrelation coefficient signals based on the stored signal from the LPC synthesis filter; and generating tenth order linear prediction coefficients based on said autocorrelation coefficients.
References Cited (Backward Citations)
US4969192A
Cited
US5414796A
Cited
US5233660A
Cited
US5339384A
Cited
US5327520A
Cited
US5450449A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-02-09 | 2001-08-11 | 2002-02-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-02-09 | 2005-08-11 | 2006-02-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-02-09 | 2009-08-11 | 2010-02-10 | $7700.00 | Window Closed / Lapsed |