CN101483043A - Code book index encoding method based on classification, permutation and combination - Google Patents
Code book index encoding method based on classification, permutation and combination Download PDFInfo
- Publication number
- CN101483043A CN101483043A CNA2008100003396A CN200810000339A CN101483043A CN 101483043 A CN101483043 A CN 101483043A CN A2008100003396 A CNA2008100003396 A CN A2008100003396A CN 200810000339 A CN200810000339 A CN 200810000339A CN 101483043 A CN101483043 A CN 101483043A
- Authority
- CN
- China
- Prior art keywords
- index
- pulse
- code
- track
- pulse position
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a code book indexing coding method based on classification and permutation combination, including the following steps: counting the pulse required to the need to encode on the track according to the positions, to obtain the number of pulse position, the distribution of the pulse position on the track and the pulse number at each pulse position; determining a first index according to the number of the pulse position, determining a second index according to the distribution of the pulse position on the track, and determining a third index according to the pulse number at each pulse position; and generating a coding index including the first index, the second index and the third index. Using the method proposed by this invention can lower the bit number of the code book indexing at high-bit-rate.
Description
Technical field
The present invention relates to a kind of code book index encoding method, in particular, relate to a kind of code book index encoding method based on classification and permutation and combination.
Background technology
3GPP AMR_WB+ encoder frame is the mixture model of a kind of ACELP (algebraic coding be excited linear system) and TCX, in the ACELP module, after the search of all optimum pulses of each track is finished, adopted a kind of method to carry out the index coding to the position and the symbol of optimum pulse.This method pulse number on a track can reach good effect more after a little while, and is for a long time, more than the required number of coded bits of theory at a track pulse number.What adopt in AMR (sound/modulator-demodular unit plug-in card), AMR WB (broadband voice codec) and AMR WB+ all is this algebraic-codebook index encoding method method.
Suppose to have obtained the position and the symbolic information of best algebraic-codebook pulse through search.In order to carry out efficient coding, need paired pulses position and encoding symbols.At the difference of each track pulse number, final used bit number is difference to some extent also.According to the difference of encoder bit rate, 1～N the pulse of can encoding on each track supposes that each track has 2
MIndividual position, the process of 1～6 pulse of encoding on each track among the AMR_WB+ is described below respectively:
1. 1 pulse of each track coding
Because each track has 2
MIndividual position, therefore, the location index of pulse need be encoded with M bit on each track, and 1 bits of encoded need be used in the notation index of pulse.The index value of 1 tape symbol pulse of coding is:
I
1p(M)＝p+s×2
M
Wherein p ∈ [0,2
M-1] for the location index of pulse; S is the notation index of pulse, and when impulse code is timing, s is set to 0, when impulse code when negative, s is set to 1; I
1p∈ [0,2
M+1-1].1 required bit number of pulse of each track coding is: M+1.
2. 2 pulses of each track coding
According to result 1., 1 pulse of each track coding needs M+1 bit, the location index of another pulse encoded needs M bit, because the paired pulses order does not have special requirement, and can be by arranging the symbol that magnitude relationship that the pulse position index obtains be represented another pulse.The index value of 2 pulses of coding is:
I
2p(M)＝p1+I
1p0×2
M＝p1+p0×2
M+s×2
2M
Wherein p0, p1 ∈ [0,2
M-1] is respectively the location index of 2 pulses; S is the notation index of p0 pulse; The concrete expression rule of p1 impulse code is: p0＜p1 represents that 2 impulse codes are identical, p0〉p1 represents that 2 impulse codes are opposite; I
2p∈ [0,2
2M+1-1].
2 required bit numbers of pulse of each track coding are: 2M+1.
3. 3 pulses of each track coding
Each track is divided into two parts: Section A and Section B, each part respectively comprises 2
M-1Individual position.At least comprise 2 pulses in certain part, according to result 2., this part of encoding needs 2 * (M-1)+1=2M-1 bit; Another pulse is then searched on whole rail, according to result 1., needs M+1 bit; In addition, also need to indicate the part that comprises 2 pulses with 1 bit.The index value of 3 pulses of coding is:
I
3p(M)=I
2p(M-1)+k * 2
2M-1+ I
1p(M) * 2
2M, wherein k is the index of Section; I
3p∈ [0,2
3M+1-1].
3 required bit numbers of pulse of each track coding are: 3M+1.
4. 4 pulses of each track coding
Each track is divided into two parts: Section A and Section B, each part respectively comprises 2
M-1Individual position.
Can draw, 4 required bit numbers of pulse of each track coding are: 4M.
5., 5 pulses of each track coding
Each track is divided into two parts: Section A and Section B, each part respectively comprises 2
M-1Individual position.At least comprise 3 pulses in certain part, according to result 3., this part of encoding needs 3 * (M-1)+1=3M-2 bit; Remaining two pulses are then searched on whole rail, according to result 2., need 2M+1 bit; In addition, also need to indicate the part that comprises 3 pulses with 1 bit.The index value of 5 pulses of coding is:
I
5p(M)＝I
3p(M-1)+k×2
3M-2+I
1p(M)×2
3M-1
5 required bit numbers of pulse of each track coding are: 5M.
6. 6 pulses of each track coding
Each track is divided into two parts: Section A and Section B, each part respectively comprises 2
M-1Individual position.
Can draw, 6 required bit numbers of pulse of each track coding are: 6M-2.
Though the index encryption algorithm of prior art can obtain good voice quality under various code check situations,, the bit number of its required use of encoding is many.On a track pulse number more for a long time, its required bit number is more than theoretical number of coded bits.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of code book index encoding method based on classification and permutation and combination, can reduce the bit number of code book index under high code check situation.
In order to address the above problem, a kind of code book index encoding method based on classification and permutation and combination of the present invention may further comprise the steps:
(1) pulse that needs on the track to encode is added up according to the position, obtain to have pulse position number, pulse position distribution and each pulse number that pulse position is arranged in orbit arranged;
(2) determine first index according to the number that pulse position is arranged,, have the pulse number of pulse position to determine the 3rd index according to each according to there being pulse position distribution in orbit to determine second index;
(3) generate the code index that comprises described first index, second index and the 3rd index information.
Further, in the step (1), the pulse sum that needs on the described track to encode is determined according to code check.
Further, in the step (1), when adding up according to the position, the pulse for the needs coding that has symbol will obtain the impulse code information that each has pulse position.
Further, in the step (2), determine described have the pulse sum of pulse position and the corresponding relation between described the 3rd index by taking computing method or querying method.
Further, in the step (3), in code index, first index is an initial value, the information of superpose first index and second index, and the value of first index is corresponding to one of code index span independently; In decode procedure, directly determine the described number that pulse position is arranged according to the span of described code index.
Beneficial effect of the present invention:
The code book index encoding method that adopts the present invention to propose based on classification and permutation and combination, can consistently adopt for different coded pulse numbers, avoided adding up of code index redundance under the recursive fashion, made full use of coded-bit from total logic design assurance.Simultaneously owing to avoided a plurality of pulses of same position are encoded respectively, make this motion carry out merging back, position Methods for Coding and have the advantage of saving coded-bit, and increase along with coded pulse number on the track, the probability that pulse position overlaps also increases thereupon, and the advantage of the inventive method is obvious further.
Description of drawings
Fig. 1 is the coding process flow diagram of the preferred embodiment of the present invention.
Embodiment
The present invention has provided a kind of code book index encoding method based on classification and permutation and combination, by with AMR_WB+ scrambler of the prior art in coding method carry out performance relatively, evidence, during the present invention's pulse number on a track less (1～4), identical with the used bit of the method among the AMR_WB+, when a track pulse number more (more than 5), the used bit number of the present invention lacks (more than 1) than method among the AMR_WB+.
Below with reference to accompanying drawing, the preferred embodiments of the present invention are elaborated.
Step S101: the pulse that needs on the track to encode is added up according to the position, obtain to have pulse position number, have pulse position in orbit distribution and each pulse number on pulse position is arranged.
The pulse sum that needs on the track to encode is determined according to code check usually.
Among the present invention,, suppose pulse_num=ω with the pulse sum that pulse_num represents the needs coding; Represent to have the number of pulse position with pos_num, because location overlap may appear in N pulse distribution in orbit, suppose pos_num=N, N is a natural number, and N ∈ [1, ω] is obviously arranged; With pulse position vector P (N)=p (0), p (1) ..., p (N-1) } expression has a pulse position distribution in orbit; Wherein, p (n) expression has pulse position position number in orbit, n ∈ [0, N-1], and p (n) ∈ [0, M-1], M represents the total number of positions on the track in this article, general M can be 8,16 or the like; With pulse number vector S U (N)=su (0), su (1) ..., su (N-1) } represent that each has the pulse number on the pulse position; Wherein, the pulse number of su (n) expression p (n) position, obviously have su (0)+su (1)+...+su (N-1)=ω.
In addition, need the pulse of coding also may have symbol, when the pulse that needs this moment to encode is added up according to the position, also need to obtain the impulse code information that each has pulse position on to track.
With impulse code vector S (N)=s (0), s (1) ..., s (N-1) } represent the impulse code information that each has pulse position; Wherein, s (n) represents the impulse code of p (n) position, is called the notation index of p (n) position, based on the impulse code of s (n) representative or the characteristic of plus or minus, generally can adopt following simple coded system: with s (n)=0 expression positive pulse, s (n)=1 represents negative pulse.
Obviously, the value among P (N), SU (N), the S (N) has relation one to one.
Behind parameters N, the P (N) that add up the pulse that obtains the needs coding, SU (N), S (N), just parameters need be encoded to index, set up the corresponding relation between parameter and the index, make decoding enough to recover corresponding parameters according to index.
Step S102: determine the first index I1 according to the number pos_num=N that pulse position is arranged, the first index I1 has the whole in orbit possible distribution situations of pulse position corresponding under the identical pos_num.The numerical value of N variation range of pos_num is little, when setting up the corresponding relation of pos_num and I1, generally can make them and have relation one to one; Certainly, if under some pos_num numerical value, the index of other parameters only needs less bit number, these pos_num also can merge I1 of use, distinguish by extra market bit again.
The numerical value of N of pos_num has determined the total W (N) that P (N) all may situation,
Number of combinations is asked in " C " expression; Therefore an I1 is corresponding to the individual possible P of W (N) (N).
Step S103: according to there being pulse position distribution P (N) in orbit to determine the second index I2, the second index I2 indicates and the current corresponding distribution situation of distribution that pulse position is arranged from the whole possible distribution situation of the first index I1 correspondence.
Always may counting of P (N) is
Therefore data volume is bigger, relatively is fit to adopt calculated relationship with the second index I2 corresponding, and obviously W (N) promptly is all possible value numbers of I2, if the value of I2 then has I2 ∈ [0, W (N)-1] since 0 counting.
The computing method of I2 are, according to the order of setting, under the number N that pulse position is arranged to the first index I1 correspondence, P (N) all possible situations arranges, with the sequence number of the arranging second index I2 as the corresponding distribution situation of indication.
" order of setting " can be regarded as the encoding and decoding both sides according to same ordering computation rule, the order that determined P (N) all may situation.Following ordering computation rule is provided in the present embodiment:
Because the different situation of P (N) is that the different combinations of values of passing through to be comprised embody, therefore might as well arrange order to each position number that comprises among the P (N):
P (0)＜p (1)＜...＜p (N-1), perhaps p (0)〉p (1)〉... p (N-1);
Suppose to adopt the former, then have: p (0) ∈ [0, M-N], p (n) ∈ [p (n-1)+1, M-N+n], M is the total number of positions on the track.Then to the different situation of P (N) size of each dimension relatively successively, according to from small to large or order from big to small all possible P (N) is sorted.
Suppose to adopt sortord from small to large, and be numbered since 0 to the P (N) after the ordering, then:
Wherein number of combinations is asked in " C " expression; ∑ is represented summation.The implication of following formula may be interpreted as:
Represent that the 1st pulse is positioned at p (0) P (N) situation sum before;
When representing that the 1st pulse is positioned at p (0), the 2nd pulse is positioned at p (1) P (N) situation sum before;
Implication can analogize.
Step S104: have the pulse number SU (N) on the pulse position to determine the 3rd index I3 according to each.SU (N) is though be and the vector of P (N) with dimension, but be subject to su (0)+su (1)+...+su (N-1)=N, and the numerical value of N is little usually, is generally 1～6, therefore SU (N) always may count not quite, all be feasible with corresponding employing calculated relationship or the query relation of the 3rd index I3.And,, under high-dimensional situation, adopt query relation comparatively suitable in view of its vector form; More or less freely in the design of hanging down calculated relationship under the dimension situation, then dual mode all can adopt.Need to prove, under some extreme case, for example N=1 or N=ω, SU this moment (N) have only a kind of may situation, need not indicate by concrete I3, I3 can be considered as not influencing the arbitrary value that final code index generates.
Step S105: generate code index Index (ω), code index Index (ω) comprises the information of first index, second index, the 3rd index, and note is made I1, I2, I3 respectively.
I1, I2, I3 can decoded side's identification mode be placed in the code index with any, and be for example the simplest, can leave in separately in the fixing field respectively.Consider that the numerical value of N of the pos_num of I1 indication has determined the variation range of I2 and I3,, has determined the number of coded bits that I2 and I3 need that is, therefore can construct code index in the following way under the certain prerequisite of the pulse sum pulse_num of needs coding:
(1) be initial value with the first index I1, the information (I23 that promptly in next step, obtains) that superposes again and from I2 and I3, obtain; The value of I1 is corresponding to one of code index span independently; Like this, decoding side just can directly determine the numerical value of N of pos_num according to the span of code index;
(2) further, in the span that I1 delimit (usually corresponding to certain field length), I2, I3 can decoded side's identification mode place with any, and be for example the simplest, can deposit separately respectively.Because I2, I3 generally can not be expressed as 2 integer power,, I2, I3 can be combined as following form and be placed in the span that I1 delimit for save coded-bit as far as possible:
I2, I3 all since 0 the coding,
I3 ∈ [0, Class (N)-1], Class (N) always may count for SU's (N).Obviously, it is the part of W (N) that this mode is equivalent to the span that I1 delimit is divided into the individual length of Class (N), a kind of distribution situation of the corresponding SU of each part (N).
(3) certain, in coded pulse is under the situation of tape symbol pulse, Index (N) also needs to comprise the information of each impulse code index s (n), can be simply be that the field of N is placed on the fixed position of code index with impulse code vector S (N) as length, end for example.
To sum up, a kind of make of code index Index (N) can be expressed as:
Index(N)＝I1+I23×2
N+s(0)×2
N-1+s(1)×2
N-2+...+s(N-1)。
Claims (5)
1, a kind of code book index encoding method based on classification and permutation and combination is characterized in that, may further comprise the steps:
(1) pulse that needs on the track to encode is added up according to the position, obtain to have pulse position number, pulse position distribution and each pulse number that pulse position is arranged in orbit arranged;
(2) there is the number of pulse position to determine first index according to described, has pulse position distribution in orbit to determine second index, have the pulse number of pulse position to determine the 3rd index according to described each according to described;
(3) generate the code index that comprises described first index, second index and the 3rd index information.
2, method according to claim 1 is characterized in that, in the step (1), the pulse sum that needs on the described track to encode is determined according to code check.
3, method according to claim 1 is characterized in that, in the step (1), when adding up according to the position, the pulse for the needs coding that has symbol will obtain the impulse code information that each has pulse position.
4, method according to claim 1 is characterized in that, in the step (2), determines described have the pulse sum of pulse position and the corresponding relation between described the 3rd index by taking computing method or querying method.
5, method according to claim 1 is characterized in that, in the step (3), in described code index, described first index is an initial value, the information of superpose described first index and second index, and the value of first index is corresponding to one of described code index span independently; In decode procedure, directly determine the described number that pulse position is arranged according to the span of described code index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100003396A CN101483043A (en) | 2008-01-07 | 2008-01-07 | Code book index encoding method based on classification, permutation and combination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100003396A CN101483043A (en) | 2008-01-07 | 2008-01-07 | Code book index encoding method based on classification, permutation and combination |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101483043A true CN101483043A (en) | 2009-07-15 |
Family
ID=40880123
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008100003396A Pending CN101483043A (en) | 2008-01-07 | 2008-01-07 | Code book index encoding method based on classification, permutation and combination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101483043A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102299760A (en) * | 2010-06-24 | 2011-12-28 | 华为技术有限公司 | pulse coding and decoding method and pulse codec |
| CN103460284A (en) * | 2011-02-14 | 2013-12-18 | 弗兰霍菲尔运输应用研究公司 | Encoding and decoding of pulse positions of tracks of an audio signal |
| CN103886862A (en) * | 2010-06-24 | 2014-06-25 | 华为技术有限公司 | Pulse encoding and decoding method and pulse coder-decoder |
| WO2015000416A1 (en) * | 2013-07-04 | 2015-01-08 | 华为技术有限公司 | Frequency domain envelope vector quantization method and apparatus |
| US9037457B2 (en) | 2011-02-14 | 2015-05-19 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Audio codec supporting time-domain and frequency-domain coding modes |
| US9047859B2 (en) | 2011-02-14 | 2015-06-02 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for encoding and decoding an audio signal using an aligned look-ahead portion |
| US9153236B2 (en) | 2011-02-14 | 2015-10-06 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Audio codec using noise synthesis during inactive phases |
| US9384739B2 (en) | 2011-02-14 | 2016-07-05 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for error concealment in low-delay unified speech and audio coding |
| US9536530B2 (en) | 2011-02-14 | 2017-01-03 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Information signal representation using lapped transform |
| US9583110B2 (en) | 2011-02-14 | 2017-02-28 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for processing a decoded audio signal in a spectral domain |
| US9595262B2 (en) | 2011-02-14 | 2017-03-14 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Linear prediction based coding scheme using spectral domain noise shaping |
| US9620129B2 (en) | 2011-02-14 | 2017-04-11 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for coding a portion of an audio signal using a transient detection and a quality result |
| US10153780B2 (en) | 2007-04-29 | 2018-12-11 | Huawei Technologies Co.,Ltd. | Coding method, decoding method, coder, and decoder |
-
2008
- 2008-01-07 CN CNA2008100003396A patent/CN101483043A/en active Pending
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10153780B2 (en) | 2007-04-29 | 2018-12-11 | Huawei Technologies Co.,Ltd. | Coding method, decoding method, coder, and decoder |
| US10666287B2 (en) | 2007-04-29 | 2020-05-26 | Huawei Technologies Co., Ltd. | Coding method, decoding method, coder, and decoder |
| US10425102B2 (en) | 2007-04-29 | 2019-09-24 | Huawei Technologies Co., Ltd. | Coding method, decoding method, coder, and decoder |
| US9858938B2 (en) | 2010-06-24 | 2018-01-02 | Huawei Technologies Co., Ltd. | Pulse encoding and decoding method and pulse codec |
| US9508348B2 (en) | 2010-06-24 | 2016-11-29 | Huawei Technologies Co., Ltd. | Pulse encoding and decoding method and pulse codec |
| WO2011160537A1 (en) * | 2010-06-24 | 2011-12-29 | 华为技术有限公司 | Pulse encoding and decoding method and pulse codec |
| US8959018B2 (en) | 2010-06-24 | 2015-02-17 | Huawei Technologies Co.,Ltd | Pulse encoding and decoding method and pulse codec |
| US9020814B2 (en) | 2010-06-24 | 2015-04-28 | Huawei Technologies Co., Ltd. | Pulse encoding and decoding method and pulse codec |
| US10446164B2 (en) | 2010-06-24 | 2019-10-15 | Huawei Technologies Co., Ltd. | Pulse encoding and decoding method and pulse codec |
| CN102299760B (en) * | 2010-06-24 | 2014-03-12 | 华为技术有限公司 | Pulse coding and decoding method and pulse codec |
| CN103886862B (en) * | 2010-06-24 | 2018-09-28 | 华为技术有限公司 | Pulse decoding method and pulse codec |
| CN102299760A (en) * | 2010-06-24 | 2011-12-28 | 华为技术有限公司 | pulse coding and decoding method and pulse codec |
| CN103886862A (en) * | 2010-06-24 | 2014-06-25 | 华为技术有限公司 | Pulse encoding and decoding method and pulse coder-decoder |
| US9595263B2 (en) | 2011-02-14 | 2017-03-14 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Encoding and decoding of pulse positions of tracks of an audio signal |
| US9153236B2 (en) | 2011-02-14 | 2015-10-06 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Audio codec using noise synthesis during inactive phases |
| US9583110B2 (en) | 2011-02-14 | 2017-02-28 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for processing a decoded audio signal in a spectral domain |
| US9384739B2 (en) | 2011-02-14 | 2016-07-05 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for error concealment in low-delay unified speech and audio coding |
| US9595262B2 (en) | 2011-02-14 | 2017-03-14 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Linear prediction based coding scheme using spectral domain noise shaping |
| US9620129B2 (en) | 2011-02-14 | 2017-04-11 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for coding a portion of an audio signal using a transient detection and a quality result |
| US9037457B2 (en) | 2011-02-14 | 2015-05-19 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Audio codec supporting time-domain and frequency-domain coding modes |
| CN103460284A (en) * | 2011-02-14 | 2013-12-18 | 弗兰霍菲尔运输应用研究公司 | Encoding and decoding of pulse positions of tracks of an audio signal |
| CN103460284B (en) * | 2011-02-14 | 2016-05-18 | 弗劳恩霍夫应用研究促进协会 | The encoding and decoding of audio signal track pulse position |
| US9047859B2 (en) | 2011-02-14 | 2015-06-02 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Apparatus and method for encoding and decoding an audio signal using an aligned look-ahead portion |
| US9536530B2 (en) | 2011-02-14 | 2017-01-03 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Information signal representation using lapped transform |
| US10032460B2 (en) | 2013-07-04 | 2018-07-24 | Huawei Technologies Co., Ltd. | Frequency envelope vector quantization method and apparatus |
| RU2635069C2 (en) * | 2013-07-04 | 2017-11-08 | Хуавэй Текнолоджиз Ко., Лтд. | Device and method of quantizing vectors of envelope frequencies |
| US9805732B2 (en) | 2013-07-04 | 2017-10-31 | Huawei Technologies Co., Ltd. | Frequency envelope vector quantization method and apparatus |
| WO2015000416A1 (en) * | 2013-07-04 | 2015-01-08 | 华为技术有限公司 | Frequency domain envelope vector quantization method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101483043A (en) | Code book index encoding method based on classification, permutation and combination | |
| CN101388210B (en) | Coding and decoding method, coder and decoder | |
| CN101207468B (en) | Method, system and apparatus for missing frame hide | |
| CN102164025B (en) | Coder based on repeated coding and channel polarization and coding/decoding method thereof | |
| CN103370879B (en) | Use common mode inhibition and the SSO power recovered and the efficient chip of pin to chip communication | |
| CN101295506B (en) | Pulse coding and decoding method and device | |
| CN107017892B (en) | A kind of verification cascade polarization code encoding method and system | |
| MX2008003922A (en) | Irregular ldpc codes random structures low encoding. | |
| CN109450596A (en) | Coding method, coding/decoding method, encoding device, decoding device, storage medium and terminal | |
| CN102244554B (en) | Blind recognition method of punctured Turbo coding parameters | |
| CN101902228B (en) | Rapid cyclic redundancy check encoding method and device | |
| CN105680992B (en) | A kind of communication channel coding method and permutation code set generator | |
| CN104081701B (en) | Communication means, system and the device of optical network system | |
| CN103400173A (en) | Generating method and reading method of two-dimensional code containing private information | |
| CN103731239A (en) | Universal CRC parallel calculation component suitable for being used for vector processor and method | |
| US10089995B2 (en) | Vector joint encoding/decoding method and vector joint encoder/decoder | |
| CN101779379B (en) | Encoding and decoding using generalized concatenated codes (GCC) | |
| CN1301117A (en) | 'Not or' codes and serial connected encoder/decoder therewith | |
| CN102299760B (en) | Pulse coding and decoding method and pulse codec | |
| Reinhardt | The complexity of translating logic to finite automata | |
| CN101090312A (en) | Improved speech code flow enciphering Improved speech code flow enciphering method | |
| CN1307721A (en) | Invertibly mapping binary sequences into rate 2/3 (1,K) run-length-limited coded sequences with maximum transition density constrains | |
| CN108173624A (en) | A kind of polarization code of Partial Decode serially offsets decoding circuit and its method | |
| CN102244555B (en) | Blind identification method for coding parameter of Turbo code | |
| CN102568608A (en) | Improved method for strengthening QR (Quick Response) code error correcting capability |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090715 |