US4933957A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Low bit rate voice coding method and system
Assignee: International Business Machines Corp
•
Filing: 1989-03-07
•
Granted: 1990-06-12
•
Expires: 2009-03-07
Abstract
Abstract This low bit rate voice encoding involves short-term predictive filtering the voice signal s(n) using partial correlation related coefficients derived from pre-emphasized s(n), and deriving a short term signal r(n); then deriving a long-term residual signal e(n) by subtracting a delayed synthesized short term b.r'(n-31 M) from said r(n); and code excited encoding e(n) into codeword references k's and associated gains G's.
Inventors
- 👤 Francoise Bottau
- 👤 Claude Galand
- 👤 Jean Menez
- 👤 Michele Rosso
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 13:38
CPC Classifications
G; G10; G10L; G10L19/00; G10L19/04; G10L19/08; G10L19/12; G10L19/06; G10L2019/0001; G10L2019/0003; G10L2019/0004; G10L25/00; G10L25/03; G10L25/06; G10L25/09
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
143 words
A process for low bit rate block encoding a sampled voice signal s(n) based on code-excited encoding providing at least one prestored table address k and associated gain coefficient G, for each block of samples to be encoded, said process including: preemphasizing said s(n) signal into an sp(n) signal and deriving partial autocorrelation coefficients ai therefrom; filtering the voice signal s(n) using a short-term predictive filter tuned by said ai coefficients and deriving therefrom a short-term residual r(n); processing said r(n) to derive a gain factor "b" and a long-term delay M; deriving a weighted and delayed synthesized short-term residual br'(n-M) from previously subtracting br'(n-M) from r(n) to derive a long-term residual signal e(n); splitting e(n) into consecuive blocks; and, code excited encoding each block of said long-term residual e(n) into at least one TABLE address reference k and one gain coefficient G.
Claim 2
Dependent Claim
143 words
A process for low bit rate block encoding a sampled voice signal s(n) based on code-excited encoding providing at least one prestored table address k and associated gain coefficient G, for each block of samples to be encoded, said process including: preemphasizing said s(n) signal into an sp(n) signal and deriving partial autocorrelation coefficients ai therefrom; filtering the voice signal s(n) using a short-term predictive filter tuned by said ai coefficients and deriving therefrom a short-term residual r(n); processing said r(n) to derive a gain factor "b" and a long-term delay M; deriving a weighted and delayed synthesized short-term residual br'(n-M) from previously subtracting br'(n-M) from r(n) to derive a long-term residual signal e(n); splitting e(n) into consecuive blocks; and, code excited encoding each block of said long-term residual e(n) into at least one TABLE address reference k and one gain coefficient G.
Claim 3
Dependent Claim
313 words
A low bit rate block encoding system for encoding a sampled voice originated signal s(n) into a d(n) data flow including for each block of samples a prestored TABLE address k and a gain coefficient G, said system including: means for preemphasizing said s(n) signal; partial correlation means for deriving partial autocorrelation (PARCOR) coefficients k i from said preemphasized s(n), and deriving PARCOR related coefficients a i from said preemphasized s(n) signal; short-term predictive filter means tuned with said a i coefficients and fed with s(n) to derive a short term residuals signal r(n) therefrom; means for splitting r(n) into consecutive blocks of samples; computing means connected to receive r(n) and derive a pitch related long-term delay parameter M and a gain factor b; first adding means having a(+) input fed with said r(n) signal and a(-) input, and providing a long term residual signal e(n); means for splitting e(n) into blocks of predetermined length; code excited encoding means for converting each block of samples e(n) into a TABLE reference (k) and a gain coefficient (G), said reference representing the TABLE address of the codeword best matching the considered e(n) block multiplied by gain g; a second adding means having a first (+) input fed with said selected codeword multiplied by gain G, and a second (+) input, said second adding means providing a synthesized short term residual r'(n); delay means having an input fed with said synthesized residual r'(n) and for deriving a delayed synthesized residual r'(n-M); multiplying means for multiplying sand delayed synthesized residual r'(n-M) by said gain factor b and derive b·r'(n-M) therefrom; means for feeding said b·r'(n-M) into said first adder (-) input and said second adder (+) input; and, multiplexing means for multiplexing for each block of r(n) samples said gain coefficient G, table address K, gain factor b, long-term delay M and PARCOR coefficient a i .
Claim 4
Dependent Claim
313 words
A low bit rate block encoding system for encoding a sampled voice originated signal s(n) into a d(n) data flow including for each block of samples a prestored TABLE address k and a gain coefficient G, said system including: means for preemphasizing said s(n) signal; partial correlation means for deriving partial autocorrelation (PARCOR) coefficients k i from said preemphasized s(n), and deriving PARCOR related coefficients a i from said preemphasized s(n) signal; short-term predictive filter means tuned with said a i coefficients and fed with s(n) to derive a short term residuals signal r(n) therefrom; means for splitting r(n) into consecutive blocks of samples; computing means connected to receive r(n) and derive a pitch related long-term delay parameter M and a gain factor b; first adding means having a(+) input fed with said r(n) signal and a(-) input, and providing a long term residual signal e(n); means for splitting e(n) into blocks of predetermined length; code excited encoding means for converting each block of samples e(n) into a TABLE reference (k) and a gain coefficient (G), said reference representing the TABLE address of the codeword best matching the considered e(n) block multiplied by gain g; a second adding means having a first (+) input fed with said selected codeword multiplied by gain G, and a second (+) input, said second adding means providing a synthesized short term residual r'(n); delay means having an input fed with said synthesized residual r'(n) and for deriving a delayed synthesized residual r'(n-M); multiplying means for multiplying sand delayed synthesized residual r'(n-M) by said gain factor b and derive b·r'(n-M) therefrom; means for feeding said b·r'(n-M) into said first adder (-) input and said second adder (+) input; and, multiplexing means for multiplexing for each block of r(n) samples said gain coefficient G, table address K, gain factor b, long-term delay M and PARCOR coefficient a i .
Claim 5
Dependent Claim
67 words
A low bit rate encoding system according to claim 2 wherein said TABLE is made to store a normalized initial set of e(n) samples into a sequence (Y k ) with n-1,2, . . . , L wherein L is an integer number n defining a codeword length, and k=1,2, . . . , K, with K being the total number of codewords stored into said table.
Claim 6
Dependent Claim
98 words
A low bit rate encoding system according to claim 3 wherein said Code-Excited encoding means include: means for setting a predefined (1) samples long window; means for shifting said window over said TABLE, from a sample position to the next; autocorrelation means sensitive to said window shifting means for deriving Ek correlation terms: ##EQU17## wherein SIGMA symbolizes a summing operation; selecting means sensitive to said Ek terms for detecting the maximum Ek term, whereby said gain coefficient G is set equal to Ek and k is selected for being the table reference for the processed block of samples.
Claim 7
Dependent Claim
63 words
A low bit rate encoding system according to claim 2 or 3 or 4 wherein said a i computing means include: first computing means for computing ##EQU18## wherein j, is a predetermined integer value, e.g., : j'=160; second computing means for computing ##EQU19## means for converting said s(n) signal into sp(n)=S(N)-(R2/R1)·s(n-1), said sp(n) being then used to derive said ai coefficients set therefrom.
Claim 8
Dependent Claim
67 words
A low bit rate encoding system according to claim 2 or 3 or 4 wherein said system further includes: low pass filtering means connected to said short term predictive filter and providing a low frequency bandwidth signal r(n) to be Code-ExCited coded into (G, k)'s; and means for coding the energy of the removed high frequency bandwidth and for feeding said coded energy into said multiplexing means.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-06-11 | 1993-12-11 | 1994-06-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-06-11 | 1997-12-11 | 1998-06-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-06-11 | 2001-12-11 | 2002-06-12 | $7700.00 | Window Closed / Lapsed |