Patent US5243685A successfully refreshed from Google Patents.
US5243685A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and device for the coding of predictive filters for very low bit rate vocoders
Assignee: Thales SA
•
Filing: 1990-10-31
•
Granted: 1993-09-07
•
Expires: 2010-10-31
Abstract
Abstract A method of breaking up a vocal signal into binary frames of a predetermined duration. The frames are grouped together in packets of successive frames by associating a predictive filter with each frame of a packet. Furthermore, the coefficients of each predictive filter are quantified by taking into account the stable or non-stable configuration of the vocal signal.
Inventors
- 👤 Pierre-Andre Laurent
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:33
CPC Classifications
G; G10; G10L; G10L19/00; G10L19/04; G10L19/06
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
108 words
A speech encoding method for the coding of very low bit rate vocoders, comprising the steps of: cutting up a vocal signal into binary frames of a predetermined duration, grouping together of a predetermined number of frames in packets of successive frames, quantifying the coefficients of a predetermined number of first predictive filters associated with each frame in each packet respectively, quantifying the coefficients of at least one second predictive filter associated to a predetermined combination of frames, selecting the predictive filter for which a predictive error is minimum, and restoring said vocal signal as a speech signal as a function of coefficients of said selected predictive filter.
Claim 2
Dependent Claim
108 words
A speech encoding method for the coding of very low bit rate vocoders, comprising the steps of: cutting up a vocal signal into binary frames of a predetermined duration, grouping together of a predetermined number of frames in packets of successive frames, quantifying the coefficients of a predetermined number of first predictive filters associated with each frame in each packet respectively, quantifying the coefficients of at least one second predictive filter associated to a predetermined combination of frames, selecting the predictive filter for which a predictive error is minimum, and restoring said vocal signal as a speech signal as a function of coefficients of said selected predictive filter.
Claim 3
Dependent Claim
21 words
A method according to claim 1, wherein the predetermined number of frames in a packet ranges from 2 to 4 inclusively.
Claim 4
Independent Claim
21 words
A method according to any one of claims 1 or 2 wherein the number of combinations is four, eight or sixteen.
Claim 5
Dependent Claim
47 words
A method according to claim 3, wherein the choice of combinations is limited to four: a first combination where the predictive filters are identical; a second and third combination where only two predictive filters are identical; and a fourth combination where all three predictive filters are different.
Claim 6
Dependent Claim
35 words
A method according to claim 4 wherein, for each combination, the prediction coefficients and the energy of the prediction error are computed to select only the prediction coefficients for which the prediction error is minimal.
Claim 7
Dependent Claim
52 words
A method according to claim 5 wherein, for the computation of the prediction coefficients, a computation is made, in each frame, of the self-correlation coefficients R i ,k of the vocal signal sampled, and the algorithm of Leroux-Gueguen or of Schur is applied to determine the reflection coefficients of each predictive filter.
Claim 8
Dependent Claim
34 words
A method according to claim 6, wherein the reflection coefficients L i ,j of the filters are ten in number and are coded on a total length of 33 bits, irrespectively of the combination.
Claim 9
Dependent Claim
76 words
A method according to claim 7, wherein the reflection coefficients L 1 to L 10 of the filters respectively have the following lengths: (5,5,4,4,4,3,2,2,2,2) bits according to the first combination, (5,4,4,3,3,2,2,2,2,0,0) bits and (3,2,2,1,0,0,0,0,0,0) bits according to the second and third combinations, (4,4,3,3,3,2,2,0,0) bits for the coding of the intermediate frame, the frame 2, according to the fourth combination (3,2,2,1,1,0,0,0,0,0,0) bits for the other two frames, frame 1 and frame 3, according to the fourth combination.
Claim 10
Dependent Claim
38 words
A method according to claim 6, wherein the reflection coefficients of the filters are determined by the relationship: L.sub.i,j =K.sub.i,j /(1-K.sub.ij.sup.2).sup.31 2 wherein L i ,j represents the reflection coefficients and K i ,j represents the prediction coefficients.
References Cited (Backward Citations)
US4797925A
Cited
US4853780A
Cited
US4868867A
Cited
US4852179A
Cited
US4817157A
Cited
US4963034A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-09-06 | 1997-03-08 | 1997-09-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-09-06 | 2001-03-08 | 2001-09-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-09-06 | 2005-03-08 | 2005-09-07 | $7700.00 | Window Closed / Lapsed |