CN103377653A - Method and device for searching algebraic code table in speech coding, and speech coding method - Google Patents
Method and device for searching algebraic code table in speech coding, and speech coding method Download PDFInfo
- Publication number
- CN103377653A CN103377653A CN2012101184624A CN201210118462A CN103377653A CN 103377653 A CN103377653 A CN 103377653A CN 2012101184624 A CN2012101184624 A CN 2012101184624A CN 201210118462 A CN201210118462 A CN 201210118462A CN 103377653 A CN103377653 A CN 103377653A
- Authority
- CN
- China
- Prior art keywords
- code table
- search
- algebraically
- track
- alternative
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000012545 processing Methods 0.000 claims description 31
- 125000004122 cyclic group Chemical group 0.000 description 8
- 230000008878 coupling Effects 0.000 description 6
- 238000010168 coupling process Methods 0.000 description 6
- 238000005859 coupling reaction Methods 0.000 description 6
- 230000003044 adaptive effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 208000019901 Anxiety disease Diseases 0.000 description 2
- 230000036506 anxiety Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005314 correlation function Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Images
Abstract
The invention discloses a method and device for searching an algebraic code table in speech coding, and a speech coding method and system. The method for searching the algebraic code table in the speech coding comprises the steps of (1) obtaining the algorithm complexity of various alternative algebraic code table search strategies on the basis of the coding mode; (2) determining a target algebraic code table search strategy on the basis of performance parameters of a system and the algorithm complexity of the alternative algebraic code table search strategies, wherein the target algebraic code table search strategy comprises the number of audio tracks to be searched in a traverse mode; (3) searching an algebraic code selectable signal position which corresponds to the coding mode to obtain the algebraic code table which corresponds to the coding mode on the basis of the determined target algebraic code table search strategy. According to the technical scheme, the relation among the algorithm complexity of algebraic code table searching, coding quality and system performance can be balanced.
Description
Technical field
The present invention relates to moving communicating field, particularly searching method and the device of algebraically code table in a kind of voice coding, voice coding method and system.
Background technology
The search of algebraically code table is take the important step of Code Excited Linear Prediction as the voice coding on basis.
Take the adaptive multi-rate speech coding (AMR-NB) that is absorbed as standard by 3GPP as example.The AMR-NB voice coding is widely used in the second generation and the 3-G (Generation Three mobile communication system).Scrambler can be supported eight provenance code rates, thereby according to the proportion of the more intelligent distribution source coding and channel coding of the condition of current channel.Therefore, limited wireless network resource obtains more effective and reasonable utilization.
The AMR-NB coding has adopted adaptability Code Excited Linear Prediction (ACEIP) model.Under the sampling rate of 8000Hz, scrambler is processed the speech frame of 20 milliseconds of 160 sampled points, extracts the parameter of linear incentive predictive mode, comprises the parameter of linear prediction filter, the index of self-adaptation and algebraically code table and gain are encoded and are transmitted parameter.At receiving end, decoding parametric, and make up linear prediction synthesis filter by corresponding parameter and come synthetic speech signal.Concrete technology can be with reference to 3GPP AMR standard (GPP TS 26.090 " Adaptive Multi-Rate (AMR) speech codec; Transcoding Functions " and 3GPP TS 26.190 " Adaptive Multi-Rate-Wideband (AMR-WB) speech codec; Transcoding Functions ").
Because the quality of algebraically code table impact coding, and the computational complexity of algebraically code table search is subjected to the restriction of system performance, therefore the computational complexity that how balance algebraically code table is searched for, the relation between coding quality and the system performance three becomes one of present problem demanding prompt solution of voice coding.
Summary of the invention
The problem that the present invention solves is the computational complexity of balance algebraically code table search, the relation between coding quality and the system performance three.
For addressing the above problem, technical scheme of the present invention provides the searching method of algebraically code table in a kind of voice coding, comprising:
Based on coding mode, obtain the computational complexity of various alternative algebraically code table search strategies;
Based on the computational complexity of the performance parameter of system and described alternative algebraically code table search strategy, determine object algebra code table search strategy, described object algebra code table search strategy comprises the number of the track for the treatment of traversal search;
Based on determined object algebra code table search strategy, search for the optional signal location of algebraic code corresponding to described coding mode, obtain the algebraically code table of corresponding described coding mode.
For addressing the above problem, technical scheme of the present invention also provides the searcher of algebraically code table in a kind of voice coding, comprising:
Acquiring unit in order to based on coding mode, obtains the computational complexity of various alternative algebraically code table search strategies;
Determining unit in order to the computational complexity based on the performance parameter of system and described alternative algebraically code table search strategy, is determined object algebra code table search strategy, and described object algebra code table search strategy comprises the number of the track for the treatment of traversal search;
Search unit in order to based on determined object algebra code table search strategy, is searched for the optional signal location of algebraic code corresponding to described coding mode, obtains the algebraically code table of corresponding described coding mode.
For addressing the above problem, technical scheme of the present invention also provides a kind of voice coding method, comprising:
Utilize the searching method search of algebraically code table in the aforesaid voice coding to obtain the algebraically code table, carry out voice coding based on described algebraically code table.
For addressing the above problem, technical scheme of the present invention also provides a kind of speech coding system, comprising:
The searcher of algebraically code table in the aforesaid voice coding is used for search and obtains the algebraically code table;
Code device is used for carrying out voice coding based on described algebraically code table.
Compared with prior art, technical scheme of the present invention has the following advantages:
The performance parameter of coupling system is adjusted the computational complexity of algebraically code table search, and this can rationally utilize the resource of system, the wasting of resources or the anxiety of anti-locking system, and the algebraically code table after the adjustment can guarantee at the preferably coding quality that satisfies under the system resource constraints.Realized like this computational complexity of algebraically code table search, the balance of coding quality and system performance Relations Among.
Description of drawings
Fig. 1 is the process flow diagram of the searching method of algebraically code table in the voice coding that provides of the embodiment of the invention;
Fig. 2 is the structural drawing of the searcher of algebraically code table in the voice coding that provides of the embodiment of the invention.
Embodiment
For above-mentioned purpose of the present invention, feature and advantage can more be become apparent, below in conjunction with accompanying drawing the specific embodiment of the present invention is described in detail.
Set forth detail in the following description so that fully understand the present invention.But the present invention can be different from alternate manner described here and implements with multiple, and those skilled in the art can do similar popularization in the situation of intension of the present invention.Therefore the present invention is not subjected to the restriction of following public embodiment.
The search of algebraically code table is take the important step of Code Excited Linear Prediction as the voice coding on basis.Take the 3GPPAMR speech coding standard as example.
3GPP AMR speech coding standard (comprising AMR-NB speech coding standard and AMR-WB speech coding standard) uses the method for algebraically code table search, the square mean error amount between the input speech signal of minimizing weighting and the code table synthetic speech signal of weighting.Because overall traversal search has great computational complexity, difficult realization, therefore, 3GPP AMR speech coding standard has defined the Depth Priority Searching take two tracks as step-length.
3GPP AMR speech coding standard (comprising AMR-NB speech coding standard and AMR-WB speech coding standard) uses the method for algebraically code table search, the square mean error amount between the input speech signal of minimizing weighting and the code table synthetic speech signal of weighting.
In a subframe (subframe) coding, suppose that c is the algebraic code sequence, d is the correlation function of echo signal x and weighted comprehensive filtrator impulse response h (n), and Φ is the incidence matrix of h (n), and the search of algebraically code table needs the maximization following formula:
Wherein, d and Φ had calculated acquisition before the search of algebraically code table.3GPPAMR speech coding standard (comprising MR-NB speech coding standard and AMR-WB speech coding standard) is divided into a plurality of tracks (track) with a subframe (subframe), and each track has impulse corresponding to the algebraic code of fixed number (pulse).For example, under the 12.2kbps pattern in the AMR-NB speech coding standard, each subframe contains 40 input signals 0～39, is divided into 5 tracks, has 10 impulse i0～i9 that algebraic code is corresponding, and the optional signal location of algebraic code is as shown in table 1 below.
Table 1
| Track | The impulse number | |
| 1 | 2 | 0，5，10，15，20，25，30，35 |
| 2 | 2 | 1，6，11，16，21，26，31，36 |
| 3 | 2 | 2，7，12，17，22，27，32，37 |
| 4 | 2 | 3，8，13，18，23，28，33，38 |
| 5 | 2 | 4，9，14，19，24，29，34，39 |
The all possible impulse combination of traversal search has great computational complexity.
The 3GPPAMR speech coding standard has defined the Depth Priority Searching take two tracks as step-length.In the search in each step, under the prerequisite of the impulse that each step has been searched out before inheriting, the track at two impulse places that this step is investigated carries out traversal search.The impulse position that each step has been searched out before needing to depend in the search in each step.
The Depth Priority Searching that it is step-length that algebraically code table search in the 3GPP AMR speech coding standard (comprising AMR-NB speech coding standard and AMR-WB speech coding standard) is based on two tracks.This method has been fixed the computational complexity of search, can not adaptive realization coding quality and the computational complexity of algebraically code table between balance.In view of the above problems, the inventor has proposed technical scheme of the present invention.
Fig. 1 is the process flow diagram of algebraically code table searching method in the voice coding that provides of the embodiment of the invention, describes in detail below in conjunction with Fig. 1.
The searching method of algebraically code table comprises in the described voice coding:
Step S1 based on coding mode, obtains the computational complexity of various alternative algebraically code table search strategies;
Step S2 based on the computational complexity of the performance parameter of system and described alternative algebraically code table search strategy, determines object algebra code table search strategy, and described object algebra code table search strategy comprises the number of the track for the treatment of traversal search;
Step S3 based on determined object algebra code table search strategy, searches for the optional signal location of algebraic code corresponding to described coding mode, obtains the algebraically code table of corresponding described coding mode.
Among the described step S1, different speech coding standards has different coding modes, and the same speech coding standard also can have the Multi-encoding pattern.Under a kind of coding mode, the optional signal location of corresponding one or more different algebraic codes.Under the different coding modes, the computational complexity of the optional signal location of algebraic code and alternative algebraically code table search strategy also is not quite similar.The optional signal location of algebraic code and alternative algebraically code table search strategy are determined based on speech coding standard and coding mode thereof, described alternative algebraically code table search strategy is corresponding one by one with the number of the track of traversal search, and the number of the track of described traversal search can be more than or equal to 1.
Concrete, after speech coding standard and coding mode thereof were determined, the optional signal location of the algebraic code that this coding mode is corresponding was also substantially definite.All under the fixed condition, the computational complexity of algebraically code table search strategy is determined by the number of the track for the treatment of traversal search at the optional signal location of algebraic code corresponding to speech coding standard, coding mode and coding mode.The number of track for the treatment of traversal search is more, and the computational complexity of algebraically code table search strategy is higher.
Among the described step S2, described search (namely searching for the optional signal location of algebraic code corresponding to described coding mode) can comprise multi-step searching, the track of traversal search fixed number in per step search; Adopt the method for depth-first to determine the algebraically code table between each step search; Described object algebra code table search strategy also comprises the step number of search, and the described number of the track of traversal search for the treatment of comprises the fixed number for the treatment of the track of traversal search in each step search.The fixed number of described track is more than or equal to 1, and optional, the fixed number of described track is 1～3.
When searching for the optional signal location of algebraic code corresponding to described coding mode and comprising multi-step searching, the computational complexity of described algebraically code table search strategy represents the computational complexity of the track of traversal search fixed number in per step, and the computational complexity of the track of described traversal search fixed number is determined by described fixed number.
In same step search, the number of the track of traversal search is (being the track of traversal search fixed number in per step search) of fixing, but for asynchronous search, the number of the track of traversal search can be identical, also can be different.For example, described object algebra code table search strategy determines that the step number of the optional signal location of algebraic code that the described coding mode of search is corresponding was two steps, the number of the track of traversal search can be two in the first step search, and the number of the track of traversal search can be three in the second step search.
When searching for the optional signal location of algebraic code corresponding to described coding mode and comprising multi-step searching, among the described step S1, the computational complexity that obtains various alternative algebraically code table search strategies comprises: based on the optional signal location of algebraic code corresponding to described coding mode, determine the computational complexity of the algebraically code table search strategy corresponding with the number of the track of traversal search.For example, be the computational complexity (computational complexity of 1 track of traversal search) of 1 corresponding algebraically code table search strategy with the number of the track of traversal search, being the computational complexity (computational complexities of 2 tracks of traversal search) of 2 corresponding algebraically code table search strategies with the number of the track of traversal search, is the computational complexity (computational complexities of 3 tracks of traversal search) of 3 corresponding algebraically code table search strategies with the number of the track of traversal search.
Search for the optional signal location of algebraic code corresponding to described coding mode and also can be single step, the computational complexity of described algebraically code table search strategy represents the computational complexity of the track of traversal search fixed number in this step.
The 12.2kbps pattern of the below in the 3GPP ARM speech coding standard describes as example.For the 12.2kbps pattern in the 3GPP ARM speech coding standard, each subframe contains 40 input signals 0～39, is divided into 5 tracks, has 10 impulse i0～i9 that algebraic code is corresponding, and optional signal location is shown in aforementioned table 1.Table 1 is under the 12.2kbps pattern in the 3GPP ARM speech coding standard, the optional signal location of algebraic code.
3GPP AMR speech coding standard has defined the Depth Priority Searching take two tracks as step-length.In conjunction with aforementioned table 1,12.2kbps pattern regulation i0 is corresponding to the impulse with Global maximum absolute amplitude value in the AMR-NB speech coding standard, and carry out cyclic search four times: in each search, i1 is each defined in four of being different from the track of i0 place, and is the impulse with the maximum absolute amplitude value of this track.Two of all the other impulses are one group and carry out traversal search according to the step, and two track number of searching in per step guarantee that according to 1～5 circumference cyclic order each track contains two impulses among each cyclic search result.Two track number of searching in per step are as shown in table 2.At last, that obtains maximum A value among four cyclic search results elected the final plan of algebraically code table search as.In each step traversal search, the selectable location number of any one impulse is 8, optional impulse number of combinations so altogether, and namely the computational complexity of the algebraically code table search strategy of two tracks of search of per step is: 4 * 4 * (8 * 8)=1024.
Table 2
| Track | The impulse number | |
| 1 | i0，15 | 0，5，10，15，20，25，30，35 |
| 2 | i1，i6 | 1，6，11，16，21，26，31，36 |
| 3 | i2，i7 | 2，7，12，17，22，27，32，37 |
| 4 | i3，i8 | 3，8，13，18，23，28，33，38 |
| 5 | i4，i9 | 4，9，14，19，24，29，34，39 |
In like manner, in the Depth Priority Searching of step-length, carry out cyclic search take a track four times, track of per step search.At last, obtain peaked that among four cyclic search results and elect the final plan of algebraically code table search as.In each step traversal search, the selectable location number of any one impulse is 8, optional impulse number of combinations so altogether, and namely the computational complexity of the algebraically code table search strategy of a track of search of per step is: 4 * (8 * 8)=256.
In like manner, in the Depth Priority Searching of step-length, carry out cyclic search take three tracks four times, three tracks of per step search.At last, obtain peaked that among four cyclic search results and elect the final plan of algebraically code table search as.In each step traversal search, the selectable location number of any one impulse is 8, optional impulse number of combinations so altogether, namely the computational complexity of the algebraically code table search strategy of three tracks of search of per step is: 4 * (8 * 8 * 8+8 * 8 * 8+8 * 8)=4352.
The computational complexity of the above-mentioned searching method corresponding with the track number of traversal search in each per step further is scaled the frequency parameter with used processor coupling.Different processors is not identical for the processing time (frequency) that same computing needs.Computational complexity further is scaled the frequency parameter that mates with used processor, can makes in the following method:
Method one: determine this processor fundamental operation, such as addition, multiplication, the processing time of storage etc.; Determine searching method in the fundamental operation that relates to and the basic information such as number of calculating, as carry out addition, multiplication, the number of the computings such as storage, number of times etc.; Count the processing time of the fundamental operation that relates in the searching method, then further the computational complexity in the searching method is scaled the frequency parameter with used processor coupling.
By way of example, determine in the searching method, the track number of per step traversal search is that 1 o'clock computational complexity is 256, required fundamental operation is multiplication, number of times is n time, the processing time that processor is processed multiplying is 0.03s, and the track number of adding up per step traversal search is that 1 o'clock required processing time was 0.03s * n; Then further the computational complexity in the searching method is scaled the frequency parameter with used processor coupling: 256 ÷ (0.03s * n), also can be called " corresponding to the processing frequency of the computational complexity of the algebraically code table search strategy of 1 track of traversal search ".Similarly, " corresponding to the processing frequency of the computational complexity of the algebraically code table search strategy of 2 tracks of traversal search " and " corresponding to the processing frequency of the computational complexity of the algebraically code table search strategy of 3 tracks of traversal search " can convert and obtain.
Method two: experiment detects and obtains: the processing time that counts the fundamental operation that relates in the searching method; Then further the computational complexity in the searching method is scaled the frequency parameter with used processor coupling.
Among the described step S2, the performance parameter of system comprises: the available dominant frequency that is used for the processor of voice coding.Described available dominant frequency represents that current processor is remaining, can be for the dominant frequency of the optional signal location consumption of algebraic code corresponding to the described coding mode of search.If described system comprises a plurality of processors, be respectively applied to search, coding etc., then the performance parameter of described system comprises at least: the available dominant frequency that is used for the processor of search.
When the performance parameter of described system is the available dominant frequency of processor, if the fixed number of the track for the treatment of traversal search of per step search is identical, described based on system performance parameter and the computational complexity of described alternative algebraically code table search strategy, determine that object algebra code table search strategy comprises:
When the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, determine then to treat in per step search that the fixed number of the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
Specifically, if the available dominant frequency of described processor is more than or equal to corresponding to being the processing frequency of the computational complexity of 1 corresponding algebraically code table search strategy (the first alternative algebraically code table search strategy) with the number of the track of traversal search, and less than corresponding to being the processing frequency of the computational complexity of 2 corresponding algebraically code table search strategies (the second alternative algebraically code table search strategy) with the number of the track of traversal search, determine then in the described object algebra code table search strategy that per step treats that the fixed number of the track of traversal search is 1;
If the available dominant frequency of described processor is more than or equal to corresponding to being the processing frequency of the computational complexity of 2 corresponding algebraically code table search strategies (the first alternative algebraically code table search strategy) with the number of the track of traversal search, and less than corresponding to being the processing frequency of the computational complexity of 3 corresponding algebraically code table search strategies (the second alternative algebraically code table search strategy) with the number of the track of traversal search, determine then in the described object algebra code table search strategy that per step treats that the fixed number of the track of traversal search is 2;
If the available dominant frequency of described processor is more than or equal to corresponding to being the processing frequency of the computational complexity of 3 corresponding algebraically code table search strategies (the first alternative algebraically code table search strategy) with the number of the track of traversal search, and less than corresponding to being the processing frequency of the computational complexity of 4 corresponding algebraically code table search strategies (the second alternative algebraically code table search strategy) with the number of the track of traversal search, determine then in the described object algebra code table search strategy that per step treats that the fixed number of the track of traversal search is 3.In the specific implementation process, determine that per step in the described object algebra code table search strategy can by that analogy, repeat no more when treating the fixed number of track of traversal search herein.
When the performance parameter of described system is the available dominant frequency of processor, if the fixed number of the track for the treatment of traversal search of asynchronous search is different, described based on system performance parameter and the computational complexity of described alternative algebraically code table search strategy, determine that object algebra code table search strategy comprises:
Before per step search, when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, the fixed number of then determining to treat in this step search the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
Among the described step S3, based on determined object algebra code table search strategy, search for the optional signal location of algebraic code corresponding to described coding mode, obtain the algebraically code table of corresponding described coding mode.Algebraically code table based on the corresponding described coding mode that obtains can carry out follow-up coding work.
Based on the searching method of algebraically code table in the described voice coding, embodiments of the invention also provide a kind of voice coding method, utilize the searching method search of algebraically code table in the described voice coding to obtain the algebraically code table, carry out voice coding based on described algebraically code table.
Fig. 2 is the structural drawing of the searcher of algebraically code table in the voice coding that provides of the embodiment of the invention, describes in detail below in conjunction with Fig. 1.
The searcher of algebraically code table comprises in the described voice coding:
Acquiring unit 1 in order to based on coding mode, obtains the computational complexity of various alternative algebraically code table search strategies;
Determining unit 2 in order to the computational complexity based on the performance parameter of system and described alternative algebraically code table search strategy, is determined object algebra code table search strategy, and described object algebra code table search strategy comprises the number of the track for the treatment of traversal search; Determining unit 2 links to each other with acquiring unit 1, and determining unit 2 is obtained the computational complexity of alternative algebraically code table search strategy from acquiring unit 1;
The described search that described search unit 3 is carried out comprises multi-step searching, the track of traversal search fixed number in per step search; Adopt the method for depth-first to determine the algebraically code table between each step search; Described object algebra code table search strategy also comprises the step number of search, and the described number of the track of traversal search for the treatment of comprises the fixed number for the treatment of the track of traversal search in each step search.The fixed number of track is more than or equal to 1.
Described acquiring unit 1 is in order to based on the optional signal location of algebraic code corresponding to described coding mode, determines the computational complexity of the algebraically code table search strategy corresponding with the number of the track of traversal search.
The performance parameter of described system comprises: the available dominant frequency that is used for the processor of voice coding.
In one embodiment, described determining unit in order to when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, determine then to treat in per step search that the fixed number of the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
In another embodiment, described determining unit is in order to before per step search, when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, the fixed number of then determining to treat in this step search the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
The searcher of algebraically code table can be integrated in speech coding system in the described voice coding, and the searcher of algebraically code table obtains the algebraically code table for search in the described voice coding; Described speech coding system can also comprise code device, in order to carry out voice coding based on described algebraically code table.
Technical scheme of the present invention has following advantage at least:
The performance parameter of coupling system is adjusted the computational complexity of algebraically code table search.This can rationally utilize the resource of system, the wasting of resources or the anxiety of anti-locking system, and the algebraically code table after the adjustment can guarantee at the preferably coding quality that satisfies under the system resource constraints.Realized like this computational complexity of algebraically code table search, the balance of coding quality and system performance Relations Among.
Although the present invention with preferred embodiment openly as above; but it is not to limit the present invention; any those skilled in the art without departing from the spirit and scope of the present invention; can utilize method and the technology contents of above-mentioned announcement that technical solution of the present invention is made possible change and modification; therefore; every content that does not break away from technical solution of the present invention; to any simple modification, equivalent variations and modification that above embodiment does, all belong to the protection domain of technical solution of the present invention according to technical spirit of the present invention.
Claims (16)
1. the searching method of algebraically code table in the voice coding is characterized in that, comprising:
Based on coding mode, obtain the computational complexity of various alternative algebraically code table search strategies;
Based on the computational complexity of the performance parameter of system and described alternative algebraically code table search strategy, determine object algebra code table search strategy, described object algebra code table search strategy comprises the number of the track for the treatment of traversal search;
Based on determined object algebra code table search strategy, search for the optional signal location of algebraic code corresponding to described coding mode, obtain the algebraically code table of corresponding described coding mode.
2. the searching method of algebraically code table in the voice coding as claimed in claim 1 is characterized in that described search comprises multi-step searching, the track of traversal search fixed number in per step search; Adopt the method for depth-first to determine the algebraically code table between each step search; Described object algebra code table search strategy also comprises the step number of search, and the described number of the track of traversal search for the treatment of comprises the fixed number for the treatment of the track of traversal search in each step search.
3. the searching method of algebraically code table in the voice coding as claimed in claim 2 is characterized in that the fixed number of described track is more than or equal to 1.
4. the searching method of algebraically code table in the voice coding as claimed in claim 3 is characterized in that, the described computational complexity that obtains various alternative algebraically code table search strategies comprises:
Based on the optional signal location of algebraic code corresponding to described coding mode, determine the computational complexity of the algebraically code table search strategy corresponding with the number of the track of traversal search.
5. the searching method of algebraically code table in the voice coding as claimed in claim 4 is characterized in that the performance parameter of described system comprises: the available dominant frequency that is used for the processor of voice coding.
6. the searching method of algebraically code table in the voice coding as claimed in claim 5 is characterized in that, described based on system performance parameter and the computational complexity of described alternative algebraically code table search strategy, determine that object algebra code table search strategy comprises:
When the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, determine then to treat in per step search that the fixed number of the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
7. the searching method of algebraically code table in the voice coding as claimed in claim 5 is characterized in that, described based on system performance parameter and the computational complexity of described alternative algebraically code table search strategy, determine that object algebra code table search strategy comprises:
Before per step search, when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, the fixed number of then determining to treat in this step search the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
8. the searcher of algebraically code table in the voice coding is characterized in that, comprising:
Acquiring unit in order to based on coding mode, obtains the computational complexity of various alternative algebraically code table search strategies;
Determining unit in order to the computational complexity based on the performance parameter of system and described alternative algebraically code table search strategy, is determined object algebra code table search strategy, and described object algebra code table search strategy comprises the number of the track for the treatment of traversal search;
Search unit in order to based on determined object algebra code table search strategy, is searched for the optional signal location of algebraic code corresponding to described coding mode, obtains the algebraically code table of corresponding described coding mode.
9. the searcher of algebraically code table in the voice coding as claimed in claim 8 is characterized in that described search comprises multi-step searching, the track of traversal search fixed number in per step search; Adopt the method for depth-first to determine the algebraically code table between each step search; Described object algebra code table search strategy also comprises the step number of search, and the described number of the track of traversal search for the treatment of comprises the fixed number for the treatment of the track of traversal search in each step search.
10. the searcher of algebraically code table in the voice coding as claimed in claim 9 is characterized in that the fixed number of described track is more than or equal to 1.
11. the searcher of algebraically code table in the voice coding as claimed in claim 10, it is characterized in that, described acquiring unit is in order to based on the optional signal location of algebraic code corresponding to described coding mode, determines the computational complexity of the algebraically code table search strategy corresponding with the number of the track of traversal search.
12. the searcher of algebraically code table is characterized in that in the voice coding as claimed in claim 11, the performance parameter of described system comprises: the available dominant frequency that is used for the processor of voice coding.
13. the searcher of algebraically code table in the voice coding as claimed in claim 12, it is characterized in that, described determining unit in order to when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, determine then to treat in per step search that the fixed number of the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
14. the searcher of algebraically code table in the voice coding as claimed in claim 12, it is characterized in that, described determining unit is in order to before per step search, when the available dominant frequency of described processor more than or equal to the processing frequency corresponding to the computational complexity of the first alternative algebraically code table search strategy, and less than the processing frequency corresponding to the computational complexity of the second alternative algebraically code table search strategy, the fixed number of then determining to treat in this step search the track of traversal search is the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy;
Wherein, the described first alternative algebraically code table search strategy and the second alternative algebraically code table search strategy are the algebraically code table search strategy corresponding with the number of the track of traversal search, and the number of the track of the traversal search corresponding with the described first alternative algebraically code table search strategy less than with the number of the track of traversal search corresponding to the described second alternative algebraically code table search strategy.
15. a voice coding method is characterized in that, comprising:
Utilize the searching method search of algebraically code table in each described voice coding of claim 1 to 7 to obtain the algebraically code table, carry out voice coding based on described algebraically code table.
16. a speech coding system is characterized in that, comprising:
The searcher of algebraically code table in each described voice coding of claim 8 to 14 is used for search and obtains the algebraically code table;
Code device is used for carrying out voice coding based on described algebraically code table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210118462.4A CN103377653B (en) | 2012-04-20 | 2012-04-20 | The searching method of algebraically code table and device in voice coding, voice coding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210118462.4A CN103377653B (en) | 2012-04-20 | 2012-04-20 | The searching method of algebraically code table and device in voice coding, voice coding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103377653A true CN103377653A (en) | 2013-10-30 |
| CN103377653B CN103377653B (en) | 2016-03-16 |
Family
ID=49462684
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210118462.4A Active CN103377653B (en) | 2012-04-20 | 2012-04-20 | The searching method of algebraically code table and device in voice coding, voice coding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103377653B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114171034A (en) * | 2021-12-02 | 2022-03-11 | 深圳市高速达科技有限公司 | High-definition set top box voice data coding and decoding system and method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010010038A1 (en) * | 2000-01-14 | 2001-07-26 | Sang Won Kang | High-speed search method for LSP quantizer using split VQ and fixed codebook of G.729 speech encoder |
| CN101303857A (en) * | 2007-11-05 | 2008-11-12 | 华为技术有限公司 | Encoding method and encoder |
| WO2009132544A1 (en) * | 2008-04-30 | 2009-11-05 | 华为技术有限公司 | A transcoding method and device |
| CN101765880A (en) * | 2007-07-27 | 2010-06-30 | 松下电器产业株式会社 | Audio encoding device and audio encoding method |
-
2012
- 2012-04-20 CN CN201210118462.4A patent/CN103377653B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010010038A1 (en) * | 2000-01-14 | 2001-07-26 | Sang Won Kang | High-speed search method for LSP quantizer using split VQ and fixed codebook of G.729 speech encoder |
| CN101765880A (en) * | 2007-07-27 | 2010-06-30 | 松下电器产业株式会社 | Audio encoding device and audio encoding method |
| CN101303857A (en) * | 2007-11-05 | 2008-11-12 | 华为技术有限公司 | Encoding method and encoder |
| WO2009132544A1 (en) * | 2008-04-30 | 2009-11-05 | 华为技术有限公司 | A transcoding method and device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114171034A (en) * | 2021-12-02 | 2022-03-11 | 深圳市高速达科技有限公司 | High-definition set top box voice data coding and decoding system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103377653B (en) | 2016-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101542589A (en) | Pitch lag estimation | |
| CN101996636B (en) | Sub-band voice codec with multi-stage codebooks and redundant coding | |
| CN105976830B (en) | Audio-frequency signal coding and coding/decoding method, audio-frequency signal coding and decoding apparatus | |
| CN101111887B (en) | Scalable encoding device and scalable encoding method | |
| CN104966517A (en) | Voice frequency signal enhancement method and device | |
| CN101399043A (en) | Self-adapting multi-speed narrowband coding method and coder | |
| CN101266797B (en) | Post processing and filtering method for voice signals | |
| CN102194462B (en) | Fixed codebook searching apparatus | |
| CN101176147A (en) | Audio encoding apparatus and spectrum modifying method | |
| CN101114450A (en) | Speech encoding selectivity encipher method | |
| CN1173939A (en) | Speech coding method using synthesis analysis | |
| CN103915097B (en) | Voice signal processing method, device and system | |
| Yu et al. | Convolutional autoencoder-based phase shift feedback compression for intelligent reflecting surface-assisted wireless systems | |
| CN103377653A (en) | Method and device for searching algebraic code table in speech coding, and speech coding method | |
| CN102163430A (en) | Method for realizing AMR-WB (adaptive multi-rate wideband) voice coding or decoding by adopting information hiding technology | |
| US10332533B2 (en) | Frequency domain parameter sequence generating method, encoding method, decoding method, frequency domain parameter sequence generating apparatus, encoding apparatus, decoding apparatus, program, and recording medium | |
| CN101981616A (en) | Stereo signal converter, stereo signal reverse converter, and methods for both | |
| CN101350199A (en) | Audio encoder and audio encoding method | |
| EP2766900B1 (en) | Apparatus and method using combinatorial coding of audio, video, image and telemetry signals | |
| CN101101755A (en) | Audio frequency bit distribution and quantitative method and audio frequency coding device | |
| CN100416652C (en) | Searching method of fixing up codebook quickly for enhanced AMR encoder | |
| CN102903366A (en) | Digital signal processor (DSP) optimization method based on G729 speech compression coding algorithm | |
| CN104025191A (en) | An improved method and apparatus for adaptive multi rate codec | |
| CN100487790C (en) | Method and device for selecting self-adapting codebook excitation signal | |
| CN103456309B (en) | Speech coder and algebraically code table searching method thereof and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170203 Address after: Room 32, building 3205F, No. 707, Zhang Yang Road, free trade zone,, China (Shanghai) Patentee after: Xin Xin Finance Leasing Co.,Ltd. Address before: Zuchongzhi road in Pudong Zhangjiang hi tech park Shanghai 201203 Lane 2288 Pudong New Area Spreadtrum Center Building 1 Patentee before: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20170707 Address after: Room 2062, Wenstin administration apartment, No. 9 Financial Street B, Beijing, Xicheng District Patentee after: Xin Xin finance leasing (Beijing) Co.,Ltd. Address before: Room 32, building 707, Zhang Yang Road, China (Shanghai) free trade zone, 3205F Patentee before: Xin Xin Finance Leasing Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CI03 | Correction of invention patent |
Correction item: Patentee|Address Correct: Xin Xin finance leasing (Beijing) Co.,Ltd.|100033 room 2062, Wenstin administrative apartments, 9 Financial Street B, Xicheng District, Beijing. False: Core Xin financing lease (Beijing) limited liability|100033 room 2062, Wenstin administrative apartments, 9 Financial Street B, Xicheng District, Beijing. Number: 30-02 Volume: 33 |
|
| CI03 | Correction of invention patent | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20131030 Assignee: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. Assignor: Xin Xin finance leasing (Beijing) Co.,Ltd. Contract record no.: 2018990000163 Denomination of invention: Speech coding method using synthesis analysis Granted publication date: 20160316 License type: Exclusive License Record date: 20180626 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200306 Address after: 201203 Zuchongzhi Road, China (Shanghai) pilot Free Trade Zone, Pudong New Area, Shanghai 2288 Patentee after: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. Address before: 100033 room 2062, Wenstin administrative apartments, 9 Financial Street B, Xicheng District, Beijing. Patentee before: Xin Xin finance leasing (Beijing) Co.,Ltd. |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20200529 Address after: 361012 unit 05, 8 / F, building D, Xiamen international shipping center, No.97 Xiangyu Road, Xiamen area, China (Fujian) free trade zone, Xiamen City, Fujian Province Patentee after: Xinxin Finance Leasing (Xiamen) Co.,Ltd. Address before: 201203 Zuchongzhi Road, China (Shanghai) pilot Free Trade Zone, Pudong New Area, Shanghai 2288 Patentee before: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. Assignor: Xin Xin finance leasing (Beijing) Co.,Ltd. Contract record no.: 2018990000163 Date of cancellation: 20210301 |
|
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20131030 Assignee: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. Assignor: Xinxin Finance Leasing (Xiamen) Co.,Ltd. Contract record no.: X2021110000010 Denomination of invention: Search method and device of pronoun table in speech coding, speech coding method Granted publication date: 20160316 License type: Exclusive License Record date: 20210317 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230705 Address after: 201203 Shanghai city Zuchongzhi road Pudong New Area Zhangjiang hi tech park, Spreadtrum Center Building 1, Lane 2288 Patentee after: SPREADTRUM COMMUNICATIONS (SHANGHAI) Co.,Ltd. Address before: 361012 unit 05, 8 / F, building D, Xiamen international shipping center, 97 Xiangyu Road, Xiamen area, China (Fujian) pilot Free Trade Zone, Xiamen City, Fujian Province Patentee before: Xinxin Finance Leasing (Xiamen) Co.,Ltd. |