Patent US5717825A successfully refreshed from Google Patents.
US5717825A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Algebraic code-excited linear prediction speech coding method
Assignee: Orange SA
•
Filing: 1996-01-04
•
Granted: 1998-02-10
•
Expires: 2016-01-04
Abstract
Abstract The method uses the technique of CELP coding with algebraic codebook. The search for the CELP excitation includes a calculation of certain components of the covariance matrix U=H T ·H where H denotes a lower triangular Toeplitz matrix formed on the basis of the impulse response of a compound filter made up of synthesis filters and of a perceptual weighting filter. The memory-stored components of the covariance matrix are only those of the form U(pos i ,p,pos i ,p) and those of the form U(pos i ,p, pos j ,q), pos i ,p and pos j ,q respectively denoting position i and position j for the pulses p and q in the codes of the algebraic codebook.
Inventors
- 👤 Claude Lamblin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:50
CPC Classifications
G; G10; G10L; G10L13/00; G10L19/00; G10L19/04; G10L19/08; G10L19/10; G10L19/107; G10L2019/0001; G10L2019/0007; G10L2019/0008; G10L2019/0013; G10L2019/0014
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
337 words
In a code-excited linear prediction (CELP) speech coding method, comprising the steps of: digitizing a speech signal as successive frames of L samples; adaptively determining synthesis parameters defining synthesis filters, and excitation parameters including, for each frame, pulse positions in an excitation code of L samples belonging to a predetermined algebraic codebook and an associated excitation gain; and transmitting quantization values representative of the determined parameters, wherein the algebraic codebook is defined on the basis of at least one group of N sets of possible pulse positions in codes of at least L samples, a code from the codebook being represented by N pulse positions belonging respectively to the N sets of positions of a group, wherein determining the excitation parameters relating to a frame includes selecting a code from the codebook which maximizes a quantity P k 2 /α k 2 , in which P k =D·c k T denotes the scalar product of a code c k from the codebook and a target vector D depending on the speech signal of the frame and on the synthesis parameters, and α k 2 denotes the energy in the frame of the code c k filtered by a compound filter made up of the synthesis filters and a perceptual weighting filter, calculating the energies α k 2 including calculating and storing in a memory components of a covariance matrix U=H T ·H, where H denotes a lower triangular Toeplitz matrix with L rows and L columns, formed from the impulse response h(0), h(1), . . . , h(L-1) of said compound filter; the improvement comprising, for at least one group of N sets, storing in the memory only those components of the covariance matrix which are of the form: ##EQU16## with 0≦p<N and those which are of the form: ##EQU17## pos i ,p and pos j ,q respectively denoting the positions of order i and j in the sets of said group containing possible positions for the pulses p and q of the codes from the codebook.
Claim 2
Dependent Claim
337 words
In a code-excited linear prediction (CELP) speech coding method, comprising the steps of: digitizing a speech signal as successive frames of L samples; adaptively determining synthesis parameters defining synthesis filters, and excitation parameters including, for each frame, pulse positions in an excitation code of L samples belonging to a predetermined algebraic codebook and an associated excitation gain; and transmitting quantization values representative of the determined parameters, wherein the algebraic codebook is defined on the basis of at least one group of N sets of possible pulse positions in codes of at least L samples, a code from the codebook being represented by N pulse positions belonging respectively to the N sets of positions of a group, wherein determining the excitation parameters relating to a frame includes selecting a code from the codebook which maximizes a quantity P k 2 /α k 2 , in which P k =D·c k T denotes the scalar product of a code c k from the codebook and a target vector D depending on the speech signal of the frame and on the synthesis parameters, and α k 2 denotes the energy in the frame of the code c k filtered by a compound filter made up of the synthesis filters and a perceptual weighting filter, calculating the energies α k 2 including calculating and storing in a memory components of a covariance matrix U=H T ·H, where H denotes a lower triangular Toeplitz matrix with L rows and L columns, formed from the impulse response h(0), h(1), . . . , h(L-1) of said compound filter; the improvement comprising, for at least one group of N sets, storing in the memory only those components of the covariance matrix which are of the form: ##EQU16## with 0≦p<N and those which are of the form: ##EQU17## pos i ,p and pos j ,q respectively denoting the positions of order i and j in the sets of said group containing possible positions for the pulses p and q of the codes from the codebook.
Claim 3
Dependent Claim
154 words
The improvement of claim 1, wherein, for a group of N sets, said memory-stored components of the covariance matrix are structured in the form of N correlation vectors and N(N-1)/2 correlation matrices, each correlation vector R p ,p being associated with a pulse number p in the codes from the codebook (0≦p<N) and being of dimension L p ' equal to the cardinal of the set from said group which contains possible positions for the pulse p, with components i (0≦i<L p ') of the form R p ,p (i)=U(pos i ,p,pos i ,p), and each correlation matrix R p ,q being associated with two different pulse numbers p,q in the codes from the codebook (0≦p<q<N) and having L p ' rows and L q ' columns with components of the form R p ,q (i,j)=U(pos i ,p,pos j ,q) in row i and in column j (0≦i<L p ' and 0≦j<L q ').
Claim 4
Dependent Claim
64 words
The improvement of claim 2, wherein the sets of said group which contain possible positions for a pulse of the codes from the codebook all have the same cardinal L', the position of order i in the set of the possible positions for the pulse p (0≦i<L', 0≦p<N) being given by: pos.sub.i,p =δ·(iN+p)+ε, δ and ε being two integers such that δ>0 and ε≧0.
Claim 5
Dependent Claim
106 words
The improvement of claim 3, wherein the calculation of the N correlation vectors relating to a group comprises an initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1 to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p (i) of said vectors for p decreasing from N-1 to 0, a component R p ,p (i) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k) to the accumulation variable cor.
Claim 6
Dependent Claim
153 words
The improvement of claim 3, wherein the calculation of the N(N-1)/2 correlation matrices relating to a group comprises, for every integer t in the interval 1,N-1! and every integer d' in the interval 0,L'-1!, an initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1-d' to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p+t (i,i+d') of said matrices for p decreasing from N-1-t to 0 and then, if i>0, the successive calculations of the components R q ,q+N-t (i+d',i-1) of said matrices for q decreasing from t-1 to 0, a component R p ,p+t (i,i+d') or R q ,q+N-t (i+d',i-1) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k+d) to the accumulation variable cor, with d=δ·(t+d'N).
Claim 7
Dependent Claim
80 words
The improvement of claim 2, wherein the algebraic codebook is defined on the basis of M groups of N sets of L' possible positions for a pulse of a code from the codebook, with M>1, the position of order i in the set of the group m containing the possible positions for the pulse p (0≦i<L', 0≦m<M, 0≦p<N) being given by: pos.sub.i,p.sup.(m) =δ·(iN+p)+ε.sup.(m) δ, ε.sup.(0), . . . , ε.sup.(M-1) being integers such that 0≦ε.sup.(0) <. . . <ε.sup.(M-1) <δ.
Claim 8
Dependent Claim
30 words
The improvement of claim 6, wherein the correlation vectors and the correlation matrices are stored in memory only for μ of the groups, μ being an integer such that 1≦μ<M.
Claim 9
Dependent Claim
106 words
The improvement of claim 7, wherein the calculation of the N correlation vectors relating to a group comprises an initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1 to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p (i) of said vectors for p decreasing from N-1 to 0, a component R p ,p (i) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k) to the accumulation variable cor.
Claim 10
Dependent Claim
155 words
The improvement of claim 7, wherein the calculation of the N(N-1)/2 correlation matrices relating to a group comprises, for every integer t in the interval 1, N-1! and every integer d' in the interval 0, L'-1!, an initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1-d' to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p+t (i,i+d') of said matrices for p decreasing from N-1-t to 0 and then, if i>0, the successive calculations of the components R q ,q+N-t (i+d',i-1) of said matrices for q decreasing from t-1 to 0, a component R p ,p+t (i,i+d') or R q ,q+N-t (i+d',i-1) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k+d) to the accumulation variable cor, with d=δ·(t+d'N).
Claim 11
Dependent Claim
32 words
The method for code excited linear prediction (CELP) speech coding according to claim 9, wherein the N correlation vectors are calculated for at least two groups in said loop indexed by i.
Claim 12
Dependent Claim
106 words
The improvement of claim 6, wherein the calculation of the N correlation vectors relating to a group comprises an initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1 to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p (i) of said vectors for p decreasing from N-1 to 0, a component R p ,p (i) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k) to the accumulation variable cor.
Claim 13
Dependent Claim
153 words
The improvement of claim 6, wherein the calculation of the N(N-1)/2 correlation matrices relating to a group comprises, for every integer t in the interval 1, N-1! and every integer d' in the interval 0,L'-1!, initialization of an integer variable k and of an accumulation variable cor, and a loop indexed by an integer i decreasing from L'-1-d' to 0, the iteration i in said loop comprising the successive calculations of the components R p ,p+t (i,i+d') of said matrices for p decreasing from N-1-t to 0 and then, if i>0, the successive calculations of the components R q ,q+N-t (i+d',i-1) of said matrices for q decreasing from t-1 to 0, a component R p ,p+t (i,i+d') or R q ,q+N-t (i+d',i-1) being taken equal to the accumulation variable cor after δ incrementations of the integer variable k and δ corresponding additions of the terms h(k)·h(k+d) to the accumulation variable cor, with d=δ·(t+d'N).
Claim 14
Dependent Claim
32 words
The method for code excited linear prediction (CELP) speech coding according to claim 12, wherein the N(N-1)/2 correlation matrices are calculated for at least two groups in said loops indexed by i.
References Cited (Backward Citations)
US4945567A
Cited
US4945565A
Cited
US4868867A
Cited
US4899385A
Cited
US4910781A
Cited
US5265167A
Cited
US5230036A
Cited
US5444816A
Cited
US5195137A
Cited
US5495555A
Cited
US5583963A
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 |