WO2012172750A1 - パルス位置探索装置、符号帳探索装置、及びこれらの方法 - Google Patents
パルス位置探索装置、符号帳探索装置、及びこれらの方法 Download PDFInfo
- Publication number
- WO2012172750A1 WO2012172750A1 PCT/JP2012/003674 JP2012003674W WO2012172750A1 WO 2012172750 A1 WO2012172750 A1 WO 2012172750A1 JP 2012003674 W JP2012003674 W JP 2012003674W WO 2012172750 A1 WO2012172750 A1 WO 2012172750A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- search
- pulse
- loop
- preliminary selection
- track
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 48
- 239000013598 vector Substances 0.000 claims description 52
- 238000012545 processing Methods 0.000 claims description 16
- 239000002131 composite material Substances 0.000 claims description 11
- 238000004364 calculation method Methods 0.000 description 33
- 238000005457 optimization Methods 0.000 description 24
- 238000010586 diagram Methods 0.000 description 20
- 230000003044 adaptive effect Effects 0.000 description 18
- 238000004422 calculation algorithm Methods 0.000 description 17
- 125000000205 L-threonino group Chemical group [H]OC(=O)[C@@]([H])(N([H])[*])[C@](C([H])([H])[H])([H])O[H] 0.000 description 13
- 230000005284 excitation Effects 0.000 description 12
- 239000011159 matrix material Substances 0.000 description 11
- 238000013139 quantization Methods 0.000 description 11
- 101150024193 alp1 gene Proteins 0.000 description 10
- 238000007781 pre-processing Methods 0.000 description 10
- 230000015572 biosynthetic process Effects 0.000 description 8
- 238000003786 synthesis reaction Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 7
- 238000004458 analytical method Methods 0.000 description 5
- 230000000593 degrading effect Effects 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 4
- 102100035353 Cyclin-dependent kinase 2-associated protein 1 Human genes 0.000 description 2
- 238000009795 derivation Methods 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 101150014183 Alpl gene Proteins 0.000 description 1
- 102100029860 Suppressor of tumorigenicity 20 protein Human genes 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000005236 sound signal Effects 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
- G10L19/08—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters
- G10L19/10—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters the excitation function being a multipulse excitation
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
Definitions
- the present invention relates to a pulse position search apparatus and method for searching for the positions of a plurality of pulses, and a code book search apparatus and method for searching for the positions of a plurality of pulses constituting a code book.
- CELP Code Excited Linear Prediction
- ITU-T International Telecommunication Union-Telecommunication Standardization Sector
- ITU-T standard G.729. 722.2 ETSI (European Telecommunications Standards Institute) Standard AMR (Adaptive Multiple Rate Coding), ETSI Standard AMR-WB (Adaptive Multiple Rate Coding-Wide Band) or 3GPP (3rd Generation Partnership Project) 2 Standard VMR-Multi (Variable In international standards such as (rate-Wide Band)
- CELP is adopted as many standard systems.
- FIG. 1 is a block diagram showing a configuration of a CELP encoding device.
- spectrum parameters such as LSP or ISP
- CELP is quantized.
- the LPC analysis unit 101 performs linear prediction analysis (LPC analysis) on a speech signal to obtain an LPC parameter that is spectral envelope information, and the obtained LPC parameter is converted into an LPC quantization unit 102 and an auditory weighting unit 111. Output to.
- LPC analysis linear prediction analysis
- the LPC quantization unit 102 quantizes the LPC parameter output from the LPC analysis unit 101. Then, the LPC quantization unit 102 outputs the obtained quantized LPC parameter to the LPC synthesis filter 109, and outputs an index (code) of the quantized LPC parameter to the outside of the CELP encoding apparatus 100.
- the adaptive codebook 103 stores past driving sound sources used in the LPC synthesis filter 109, and stores them according to an adaptive codebook lag corresponding to an index instructed from the distortion minimizing unit 112 described later.
- a sound source vector for one subframe is generated from the driving sound source. This excitation vector is output to multiplier 106 as an adaptive codebook vector.
- the fixed codebook 104 is a codebook for excitation coding (also called “excitation quantization” or “excitation vector coding”).
- Fixed codebook 104 stores a plurality of excitation vectors having a predetermined shape in advance, and outputs the excitation vector corresponding to the index instructed from distortion minimizing section 112 to multiplier 107 as a fixed codebook vector.
- fixed codebook 104 is an algebraic sound source, and a case where an algebraic codebook is used will be described.
- An algebraic sound source is a sound source used in many standard codecs.
- the above adaptive codebook 103 is used to express a component having strong periodicity such as voiced sound.
- the fixed codebook 104 is used to express a component with weak periodicity such as white noise.
- the gain codebook 105 is a gain for an adaptive codebook vector (adaptive codebook gain) output from the adaptive codebook 103 and a fixed codebook output from the fixed codebook 104 in accordance with an instruction from the distortion minimizing unit 112.
- Vector gain (fixed codebook gain) is generated and output to multipliers 106 and 107, respectively.
- Multiplier 106 multiplies the adaptive codebook gain output from gain codebook 105 by the adaptive codebook vector output from adaptive codebook 103, and outputs the multiplied adaptive codebook vector to adder 108.
- Multiplier 107 multiplies the fixed codebook gain output from gain codebook 105 by the fixed codebook vector output from fixed codebook 104, and outputs the fixed codebook vector after multiplication to adder 108.
- Adder 108 adds the adaptive codebook vector output from multiplier 106 and the fixed codebook vector output from multiplier 107, and outputs the added excitation vector to LPC synthesis filter 109 as a driving excitation. .
- the LPC synthesis filter 109 uses the quantized LPC parameter output from the LPC quantization unit 102 as a filter coefficient, and a filter function using the excitation vector generated by the adaptive codebook 103 and the fixed codebook 104 as a driving excitation, that is, LPC A synthesized signal is generated using a synthesis filter. This combined signal is output to adder 110.
- the adder 110 calculates an error signal by subtracting the synthesized signal generated by the LPC synthesis filter 109 from the audio signal, and outputs the error signal to the perceptual weighting unit 111. This error signal corresponds to coding distortion.
- the perceptual weighting unit 111 performs perceptual weighting on the encoded distortion output from the adder 110 using the LPC parameters input from the LPC analysis unit 101 and outputs the result to the distortion minimizing unit 112.
- the distortion minimizing unit 112 sets the indexes (codes) of the adaptive codebook 103, the fixed codebook 104, and the gain codebook 105 such that the coding distortion output from the perceptual weighting unit 111 is minimized for each subframe. These indices are output to the outside of the CELP encoding apparatus 100 as encoded information. More specifically, a series of processes for generating a composite signal based on the above-described adaptive codebook 103 and fixed codebook 104 and obtaining the coding distortion of this signal is closed loop control (feedback control), and distortion minimum
- the encoding unit 112 searches each codebook by changing the index indicated to each codebook in one subframe, and finally obtains the index of each codebook that minimizes the encoding distortion. Output.
- the algebraic codebook used as a fixed codebook (also called “stochastic codebook”), even better coding performance can be obtained with a limited amount of calculation.
- the algebraic codebook is the ITU-T standard G. 729, ITU-T standard G.729. 722.2, widely used in ETSI standard AMR or ETSI standard AMR-WB.
- the search for the excitation vector also referred to as “codebook vector” or “code vector”
- the derivation of the code are performed by searching for the excitation vector that minimizes the encoding distortion of the following equation (1).
- the derivation of the code of the fixed codebook 104 has the following encoding distortion of equation (2). This is done by searching for a fixed codebook vector to be minimized.
- the search is performed here with an ideal gain (also referred to as “optimum gain”).
- the ideal gain means a gain that minimizes coding distortion.
- the above cost function C can be obtained with a small amount of calculation. Can be calculated. That is, the coding of the algebraic codebook is performed by an algorithm for searching for the position and the polarity where the cost function C is maximized by a multiple loop of channels (also called “tracks”) of the number of pulses.
- the polarity is preliminarily selected based on whether the value of v t H is positive or negative, and at the same time, by multiplying the value of v t H and the value of H t H by the polarity, the pulse position search is performed. In this case, the polarity search can be omitted. This pre-selection of polarity can save exponentially computational complexity.
- FIG. 2 is a conceptual diagram showing the flow of conventional fixed codebook search processing.
- the flow of the fixed codebook search process can be simply expressed as shown in FIG.
- a two-pulse search is performed as many times as necessary until the number of pulses to be obtained is searched.
- the results (pulses) obtained by each two-pulse search are collected into a pulse train (not shown).
- There are various methods for collecting the results of the two-pulse search For example, ITU-T standard G.I. In 718, an algorithm is used in which the number of pulses is increased while searching for two pulses for a 4-track configuration (see Non-Patent Document 1). The description is omitted here.
- FIG. 3 is a diagram schematically showing a conventional algorithm for searching for pulse positions by grouping.
- FIG. 3 corresponds to one of the two-pulse searches in FIG.
- parameters necessary for the search are obtained using an input target or the like.
- the target can be represented by a vector and corresponds to the target vector v of the fixed codebook search described above.
- Parameters include target time-reversed composite vector (polarity preselected) v t H, pulse matrix vector correlation matrix (polarity preselected) H t H, track number, and pulse candidate position for each track Intervals, etc. are prepared.
- the search loop of track 1 is executed in the search loop of track 0 using these parameters. That is, the search loop for track 0 and the search loop for track 1 are multiple loops. By performing a search using this multiple loop, the searched position of each track, the correlation value that is the basis of the comprehensive numerator term up to this search, and the overall denominator term up to this search are obtained.
- FIG. 4 is a flowchart showing a conventional algorithm for searching for pulse positions by grouping.
- FIG. 4 specifically shows FIG.
- d [n] is a time-reversed composite vector of the target (preliminary selection of polarity).
- c [n] [m] is a correlation matrix between pulse composite vectors (polarity preselected), n ⁇ m, and the values of n and m are doubled.
- x and y are pulse candidate positions.
- xx and yy are the positions of the finally searched pulses.
- Track 0 and track 1 are track numbers (0, 1, 2, 3 in FIG. 2).
- ps_t is an element of the numerator of the cost function C before the search.
- alp_t is the total value of the denominator term of the cost function C before the search.
- L is the subframe length.
- “step” is an interval (“4” in FIG. 4) between pulse candidate positions of each track.
- the flow starts when the necessary parameters described above are input.
- the numerator term sqk of the cost function C is set to “ ⁇ 1.0”, and the denominator term apk is set to “1.0” (step ST11).
- step ST12 it is determined whether or not the pulse candidate position x is smaller than the subframe length L (step ST12).
- step ST14 the search for the pulse candidate position y is started (step ST14), and it is determined whether the pulse candidate position y is smaller than the subframe length L (step ST15).
- step ST15 no
- step ST18 when the value of (alpk * sq) is larger than the value of (sqk * alp1) (step ST18: yes), the denominator term and numerator term of the cost function C are determined, and the finally searched pulse Positions xx and yy are determined (step ST20), and the process returns to step ST19.
- the denominator term of the function C is set as the final denominator term of the cost function C (step ST21).
- step ST22 the final pulse positions xx and yy and the total value alp_t of the denominator term of the cost function C and the value of the numerator term ps_t of the cost function C are output (step ST22).
- the numerator term of the cost function C in the equation (4) is sq, and the denominator term is alpl.
- the cost function C can be obtained by dividing the numerator term by the denominator term. Since division requires a large amount of calculation, multiplication of multiplication is adopted in determining whether the cost function C is large or small.
- pre-selection of the position of the pulse is taken in the search for the pulse (see Non-Patent Document 1).
- the pre-selection of pulse position is to select a position where a pulse is likely to rise in advance and is expected to rise from the pulse candidate positions, and to reduce the number of pulse candidate positions entering the next loop. is there.
- FIG. 5 is a conceptual diagram showing the flow of conventional fixed codebook search processing. As described above, there are various methods for combining the results of the two-pulse search. In 718, an algorithm is used in which the number of tracks is increased while searching for two tracks in a 4-track configuration. The description is omitted here.
- FIG. 7B is a diagram schematically illustrating an algorithm for searching for a pulse position when the pulse position is preliminarily selected in 718.
- FIG. 6 corresponds to one of the two-pulse searches shown in FIG.
- the target can be represented by a vector and corresponds to the target vector v of the fixed codebook search described above.
- Parameters include target time-reversed composite vector (polarity preselected) v t H, pulse matrix vector correlation matrix (polarity preselected) H t H, track number, and pulse candidate position for each track Intervals, etc. are prepared.
- the number of entering the search loop of track 1 in the search loop of track 0 is limited by performing preliminary selection of track 0 in the search loop of track 0.
- the search loop for track 0 and the search loop for track 1 are multiple loops, as in the case of FIG. By performing a search using this multiple loop, the searched position of each track, the correlation value that is the basis of the comprehensive numerator term up to this search, and the overall denominator term up to this search are obtained.
- FIG. 7B is a flowchart showing an algorithm for searching for a pulse position when performing preliminary selection of a pulse position employed in 718.
- FIG. 7 specifically shows FIG. In FIG. 7, parts that are the same as in FIG. 4 are given the same reference numerals, and descriptions thereof are omitted.
- pick [n] is an array in which the order of adoption is described at each pulse position.
- thres is a value obtained from the number of candidates at the designated candidate position x. Further, the search is performed for the number of candidates specified by the search only when pick [n] is smaller than the value of thres.
- the meanings of the other symbols are the same as those in FIG.
- step ST50 when the pulse candidate position x is smaller than the subframe length L (step ST12: yes), it is determined whether pick [x] is smaller than the value of thres (step ST50).
- step ST50 no
- the next candidate position is selected (step ST16), and the process returns to step ST12.
- FIG. 8 is a block diagram showing the configuration of a fixed codebook search apparatus 300 that can perform a fixed codebook pulse search by the conventional pulse search method.
- the preprocessing unit 301 receives the target signal and obtains parameters necessary for pulse search.
- the parameters generated by calculation reflect the result of the polarity preselection of each pulse position and reflect the result, and the result of the polarity preselection (corresponding to v t H in Equation 4).
- there is a “correlation matrix between composite vectors of pulses” (corresponding to H t H in Equation 4) obtained by doubling values other than the diagonal term.
- the parameters to be set include the track number to be searched, the pulse position candidate interval of the track with the number, the subframe length, and the number of preliminary selections.
- the preprocessing unit 301 sends these parameters to the control unit 302.
- the control unit 302 receives the total number of bits, sends parameters necessary for pulse search to the multiplex loop search unit 303 in accordance with a timing signal from the pulse train encoding unit 304 described later, and the multiplex loop search unit 303 Control to search.
- the parameters sent to the multiple loop search unit 303 include, in addition to the parameters sent from the preprocessing unit 301, sequences in which the order of adoption is described at each pulse position, and the molecular terms before the search is performed. There are total value and total value of denominator term.
- the control unit 302 initializes the total value of the numerator term and the total value of the denominator term before the search is performed when the multi-loop search unit 303 is driven for the first time, and performs a two-pulse search at the next and subsequent stages. At the time of execution, what is sent from the pulse train encoding unit 304 is sent to the multiple loop search unit 303.
- the multiple loop search unit 303 searches for the position of the pulse using the multiple loop. At this time, the multiple loop search unit 303 performs a preliminary selection using the number of the preliminary selections and an array in which the order of adoption is described for each pulse position in the outermost loop, and the search is performed. The pulse position and the total value of the numerator term and the total value of the denominator term calculated at the pulse position are output to the pulse train encoding unit 304.
- the pulse train encoding unit 304 encodes a pulse by using the pulse position searched by the multiple loop search unit 303 and the total value of the numerator term and the total value of the denominator term.
- the encoding of the pulse as the fixed codebook is performed using the result of the multiple loop search unit 303 that operates a plurality of times.
- the pulse train encoding unit 304 sends the total value of the numerator term and the total value of the denominator term to the control unit 302 and also sends a timing signal to the control unit 302 in order to prompt the operation of the next multiple loop search unit 303.
- pulse train encoding section 304 outputs a code as a fixed codebook at the end.
- the multiple loop search unit 303 does not include a configuration for performing preliminary selection.
- the multiple loop search unit 303 is configured to perform preliminary selection.
- channel (track) grouping is performed in an algebraic codebook, whereby the search is performed in units of a small number of pulses, and individual small numbers are searched.
- An object of the present invention is to provide a pulse position search apparatus and method that can reduce the amount of calculation associated with pulse position search. Furthermore, a codebook search apparatus and method that can reduce the amount of calculation associated with pulse position search without degrading the encoding performance even when the number of pulses to be obtained by search in the codebook increases. Is to provide.
- the pulse position search apparatus of the present invention is a pulse position search apparatus that searches for the position of a plurality of pulses by inputting a parameter obtained by performing predetermined processing on a target signal, and using the parameter, By performing a first preliminary selection on a first candidate group at a position where one pulse is arranged and performing a first search on the result of the first preliminary selection, the first pulse is A first search means for obtaining a first position to be arranged, and a second search for all position candidates of the second candidate group at the position at which the second pulse is arranged by using the first position. And performing a second preliminary selection for the first candidate group using the second search means for obtaining the second position where the second pulse is arranged and the second position. Performing a third search on the result of the second preliminary selection More, obtains a third position in which the first pulse is arranged, a configuration comprising a third search means for outputting said third position and said second position as the search result.
- the pulse position search method of the present invention is a pulse position search method for searching for positions of a plurality of pulses by inputting a parameter obtained by performing predetermined processing on a target signal, and using the parameter,
- the first pulse is A first search step for obtaining a first position to be arranged, and a second search for all position candidates of the second candidate group at the position at which the second pulse is arranged by using the first position.
- a third search for the result of the second preliminary selection Ukoto by obtains a third position in which the first pulse is arranged, having a third search step of outputting said third position and said second position as the search result.
- the amount of calculation associated with the pulse position search can be reduced more than before.
- this pulse position search device and this method to the codebook search device and this method, even if the number of pulses to be obtained by the search increases, the pulse position search can be performed without degrading the coding performance. The amount of calculation involved can be reduced.
- the block diagram which shows the structure of a CELP encoding apparatus Conceptual diagram showing the flow of conventional fixed codebook search processing
- a diagram schematically showing a conventional algorithm for searching for pulse positions by grouping Flow diagram showing a conventional algorithm for pulse position search by grouping
- Conceptual diagram showing the flow of conventional fixed codebook search processing The figure which shows typically the algorithm of the search of the position of the pulse in the case of performing the preliminary selection of the position of the conventional pulse Flow diagram showing the algorithm for searching for the position of the pulse in the case of performing the preliminary selection of the position of the conventional pulse
- the block diagram which shows the structure of the conventional fixed codebook search apparatus Conceptual diagram showing the flow of fixed codebook search processing in the embodiment of the present invention
- the block diagram which shows the structure of the pulse position search apparatus in embodiment of this invention The flowchart which shows the search method of the position of the pulse in embodiment of this invention
- the present invention relates to quantization in which a search for a large number of pulses is combined with a search for a plurality of small pulses.
- the search for a small number of pulses uses a loop of a channel (also referred to as a track or a pulse) that performs preliminary selection (that is, the search target is initially limited) and does not perform preliminary selection (that is, sets all candidates as search targets).
- the present invention is characterized in that a sequential optimization search is performed in which each loop is sequentially performed without making these loops into multiple loops.
- this sequential optimization search used for searching for a small number of pulses it is preferable to use a loop in which preliminary selection is performed a plurality of times. In particular, it is more preferable to use a loop in which a preliminary selection is performed as at least the first loop and the last loop.
- the present invention relates to a pulse position search apparatus that searches for a small number of pulses by such a pulse position search method.
- the sequential optimization search of the pulse position search apparatus is used in the case where the number of preliminary selections is sufficiently small, the performance of the conventional simultaneous optimization search with preliminary selection will not be greatly reduced. Furthermore, since it is not a multiple loop, the amount of calculation can be greatly reduced.
- the pulse position search device of the present invention for the encoding device when the number of preliminary selections is sufficiently small, the amount of calculation is further reduced without degrading the encoding performance. be able to.
- CELP which is a speech coding technique
- a search for a large number of pulses is performed while reducing the amount of calculation by using a two-pulse search by a closed multiple loop a plurality of times.
- the amount of calculation is further reduced by limiting the number of times of entering the inner loop by preliminary selection in the outer track 0 loop.
- the performance is not reduced so much by narrowing down initially and gradually increasing the number of candidates. This uses the tendency that if the second half is searched with high accuracy, the first half of the search will not drop so much performance even if the search candidates are largely narrowed down by preliminary selection.
- the inventor of the present invention can obtain the same performance as using the simultaneous optimization search by using the sequential optimization search that uses the loop in which the preliminary selection is performed a plurality of times.
- the amount of calculation can be greatly reduced.
- a pulse position different from the search result in the simultaneous optimization search may be searched (referred to as “position error”).
- position error a pulse position different from the search result in the simultaneous optimization search
- the search by the loop in which the preliminary selection is performed is first performed to reduce the probability that the position is erroneously erroneous in the first loop, and then another track is searched.
- the search is performed again by a loop in which the preliminary selection is performed.
- the power of the combined vector of the pulse to be newly added as the denominator term of the above-mentioned cost function (the same value as “correlation value between the same pulse positions”) and the combination of the pulses searched so far It is necessary to add two of the correlation values between vectors to the total value of the denominator term before the search is performed, but it is necessary for preprocessing by omitting this correlation value calculation and using only power The calculation amount is omitted.
- a pulse position search apparatus that searches for a pulse position in a fixed codebook composed of an algebraic codebook by grouping two pulses in the CELP coding apparatus.
- This pulse position search device is applied to a fixed codebook search device included in a CELP encoding device, and pulses searched by this pulse position search device are combined into a pulse train and encoded by the fixed codebook search device.
- the CELP encoding device targets, for example, voice, music, or a signal in which these are mixed.
- the pulse position search apparatus is not limited to a CELP encoding apparatus, and can be used for an encoding apparatus that needs to perform a pulse position search.
- FIG. 9 is a conceptual diagram showing the flow of fixed codebook search processing in the embodiment of the present invention.
- a search is performed step by step in increments of two pulses from a search for a pulse with a small number of preliminary selections toward a larger number of preliminary selections. This is executed as many times as necessary until the number of pulses to be obtained is searched (the number of preliminary selections may be the same).
- the results (pulses) obtained in the search at each stage are collected into a pulse train (not shown). A description of a method for collecting the searched pulses into a pulse train is omitted. In this embodiment, it is assumed that pulse search is performed in track 0 and track 1 of the algebraic codebook at each stage.
- the difference between the search process in FIG. 5 and the search process in FIG. 9 is the same in that a two-pulse search is performed in the first stage, but in the subsequent stages, a sequential optimization search by the pulse position search method according to the present invention is performed. It is a point to do.
- the “two-pulse search” is a simultaneous optimization search (closed loop search) for performing preliminary selection in FIG. 7 described in the background art. In this example, the two-pulse search is performed again at the last stage.
- the two-pulse search (closed loop search) is adopted at the initial search stage where N0 is the smallest number of preliminary selections.
- N0 is the smallest number of preliminary selections.
- the sequential search of the present invention is performed. This is because there is a possibility that the amount of calculation at this stage is smaller in the closed loop search than in the optimization search.
- the two-pulse search is adopted even in the final search stage where the number of preliminary selections is Nm, which is that the performance of the present invention is sufficiently exerted as described above. Therefore, in the last stage where the number of preliminary selections is the largest, the possibility that the performance of the present invention is lowered is considered.
- the first stage and the last stage are thus searched for two pulses, but this configuration is not necessarily required.
- the search for pulses in the second stage or the like is performed by a sequential optimization search by the pulse position search method according to the present invention. That is, at this stage, it is assumed that the number of preliminary selections is sufficiently small, the search for track 0 for preliminary selection is performed first, and then the position of the pulse searched for track 0 is fixed and the search for track 1 is performed. This is performed without preliminary selection. Finally, the position searched for track 1 is fixed, and the search for track 0 for preliminary selection is performed again.
- FIG. 10 is a diagram schematically showing a pulse position search algorithm in the present embodiment.
- FIG. 10 corresponds to the second-stage pulse search shown in FIG.
- parameters necessary for the search are obtained using the input target and the like.
- the target can be represented by a vector and corresponds to the target vector v of the fixed codebook search described above.
- Parameters include target time-reversed composite vector (polarity preselected) v t H, pulse matrix vector correlation matrix (polarity preselected) H t H, track number, and pulse candidate position for each track Intervals, etc. are prepared.
- the search loop R1 for track 0 for preliminary selection is first executed, and then the position of the pulse searched for track 0 is fixed and the search loop R2 for track 1 is not preselected. Finally, the position searched in the track 1 is fixed, and the search loop R3 of the track 0 for performing preliminary selection is executed again.
- the searched position of each track, the correlation value that is the basis of the comprehensive numerator term up to this search, and the overall denominator term up to this search are obtained.
- the search loop of track 0 and the search loop of track 1 are changed to the above-described search loop without using a multiple loop. Since an algorithm performed in order is used, the amount of calculation associated with the pulse position search can be reduced.
- FIG. 11 is a block diagram showing a configuration of pulse position search apparatus 400 according to the embodiment of the present invention.
- FIG. 11 corresponds to the sequential optimization search shown in FIG.
- the pulse position search apparatus 400 includes a first search unit 401 that executes a search loop R1 of track 0 that performs preliminary selection, a second search unit 402 that executes without selecting the search loop R2 of track 1 and performs preliminary selection.
- the third search unit 403 executes a search loop R3 of track 0 to be performed.
- the number of pulses to be obtained by the search is two.
- the first search unit 401 receives, as input signals, parameters such as a temporal reverse-order combined vector of targets that have been pre-selected for polarity, a correlation matrix between pulse combined vectors, track numbers, and pulse position candidate intervals for each track. These are used to search for the position of one pulse while performing preliminary selection of the position of the pulse.
- the first search unit 401 outputs the search result to the second search unit 402.
- the second search unit 402 fixes the position of the pulse input as the search result from the first search unit 401, and searches for the pulse position in the next track 1 without performing a preliminary selection of the pulse position.
- the second search unit 402 outputs the search result to the third search unit 403.
- the third search unit 403 fixes the pulse position input as the search result from the second search unit 402, and searches for the pulse again for the pulse position in the track 0 while performing preliminary selection of the pulse position.
- the third search unit 403 obtains the searched position of each track, the correlation value that is the basis of the comprehensive molecular term of the cost function C up to this search, and the cost function C up to this search obtained by the search again. Output the total denominator term as an output signal.
- FIG. 12 is a flowchart showing a pulse position search method in the present embodiment.
- FIG. 12 specifically shows the operation of the pulse position search apparatus 400 of FIG.
- d [n] is a target time-reversed composite vector (polarity preselected).
- c [n] [m] is a correlation matrix between pulse composite vectors (polarity preselected), n ⁇ m, and the values of n and m are doubled.
- x and y are pulse candidate positions.
- xx and yy are finally searched positions.
- Track 0 and track 1 are track numbers (0, 1, 2, 3 in this embodiment).
- ps_t is an element of the numerator of the cost function C before the search.
- alp_t is the total value of the denominator term of the cost function C before the search.
- L is the subframe length.
- “step” is the interval (“4” in the present embodiment) between the candidate positions of the pulses of each track.
- pick [n] is an array in which the order of adoption is described at each pulse candidate position.
- thres is a value obtained from the number of candidates at the designated candidate position x. Further, the search is performed for the number of candidates specified by the search only when pick [n] is smaller than the value of thres.
- the first search unit 401 first sets the numerator term sqk of the cost function C to “ ⁇ 1.0” and the denominator term apk to “1.0” in order to search for the pulse candidate position x. (Step ST201).
- the first search unit 401 determines whether the pulse candidate position x is smaller than the subframe length L (step ST202).
- the first search unit 401 determines whether pick [x] is smaller than the value of thres (step ST203). .
- the power c [x] [x] (the correlation value between the same pulse positions) of the pulse synthesis vector newly added as the denominator term of the cost function C and the pulse synthesis searched so far
- the correlation value c [x] [*] between vectors to the total value of the denominator term of the cost function C before the search
- the calculation of the correlation value c [x] [*] is performed. Is omitted, and only the power c [x] [x] is used, thereby omitting the calculation amount necessary for the preprocessing.
- the first search unit 401 determines whether the value of (alpk * sq) is larger than the value of (sqk * alp0) (step ST206).
- step ST206 no
- step ST206 when the value of (alpk * sq) is larger than the value of (sqk * alp0) (step ST206: yes), the first search unit 401 determines the denominator and numerator terms of the cost function C, The final pulse position xx is determined (step ST207).
- step ST202 if the pulse candidate position x is greater than or equal to the subframe length L (step ST202: no), the second search unit 402 sets the numerator term sqk of the cost function C to “ ⁇ 1.0”.
- second search section 402 determines whether or not pulse candidate position y is smaller than subframe length L (step ST209).
- step ST209 yes
- alp1 alp0 + c [y] [y] + c [xx].
- the second search unit 402 determines whether or not the value of (alpk * sq) is larger than the value of (sqk * alp1) (step ST211).
- step ST211: yes when the value of (alpk * sq) is larger than the value of (sqk * alp1) (step ST211: yes), the second search unit 402 determines the denominator and numerator terms of the cost function C, The final pulse position yy is determined (step ST213).
- the third search unit 403 determines whether or not the pulse candidate position x is smaller than the subframe length L (step ST215).
- step ST215 If pulse candidate position x is smaller than subframe length L (step ST215: yes), third search section 403 determines whether pick [x] is smaller than the value of thres (step ST216). .
- the third search unit 403 determines whether or not the value of (alpk * sq) is larger than the value of (sqk * alp0) (step ST219).
- step ST219 no
- step ST219: yes when the value of (alpk * sq) is larger than the value of (sqk * alp0) (step ST219: yes), the third search unit 403 determines the denominator and numerator terms of the cost function C, The final pulse position xx is determined (step ST220).
- the third search unit 403 outputs the final pulse positions xx and yy and the total value alp_t of the denominator term of the cost function C and the value of the numerator term ps_t of the cost function C (step ST222). .
- the search loop R1 for track 0 corresponds to the processing in steps ST201 to ST208 in FIG. 12
- the search loop R2 for track 1 corresponds to steps ST208 to ST214 in FIG.
- the loop R3 corresponds to step ST214 to step ST221 in FIG.
- FIG. 13 is a block diagram showing a configuration of fixed codebook search apparatus 500 that can perform a fixed codebook pulse search by the pulse search method according to the present embodiment.
- the preprocessing unit 501 receives a target signal and obtains parameters necessary for pulse search.
- the parameters generated by calculation reflect the result of the polarity preselection of each pulse position and reflect the result, and the result of the polarity preselection (corresponding to v t H in Equation 4).
- there is a “correlation matrix between composite vectors of pulses” (corresponding to H t H in Equation 4) obtained by doubling values other than the diagonal term.
- the parameters to be set include the track number to be searched, the pulse position candidate interval of the track with the number, the subframe length, and the number of preliminary selections.
- the preprocessing unit 501 sends these parameters to the control unit 502.
- the control unit 502 receives the total number of bits, and sends parameters necessary for pulse search to the multiplex loop search unit 503 or the pulse position search device 600 in accordance with a timing signal from a pulse train encoding unit 504 described later.
- the loop search unit 503 or the pulse position search device 600 is controlled to search for pulses. In the present embodiment, control is performed so as to drive the multi-loop search unit 503 in the first stage and the last stage, and control is performed so as to drive the pulse position search apparatus 600 in other stages.
- the control unit 502 initializes the total value of the numerator term and the total value of the denominator term before the search is performed when the multi-loop search unit 503 is first driven in the first stage, and in the subsequent stages.
- two-pulse search closed loop search
- what is sent from the pulse train encoding unit 504 is sent to the multiple loop search unit 503.
- the multiple loop search unit 503 searches for the position of the pulse using a two-pulse search, that is, a closed loop search using a multiple loop. At this time, the multi-loop search unit 503 performs a preliminary selection using the number of preliminary selections and an array in which the order of adoption is described for each pulse position in the outermost loop, and the search is performed. The pulse position and the total value of the numerator term and the total value of the denominator term calculated at the pulse position are output to the pulse train encoding unit 504.
- the pulse position search device 600 corresponds to the pulse position search device 400 shown in FIG. Accordingly, the first search unit 401 corresponds to the first search unit 601, the second search unit 402 corresponds to the second search unit 602, and the third search unit 403 corresponds to the third search unit 603, and has the same configuration. . For this reason, detailed description of the pulse position search device 600 is omitted.
- the pulse train encoding unit 504 encodes a pulse using the pulse position searched by the multiple loop search unit 503 or the pulse position search device 600, and the total value of the numerator term and the total value of the denominator term.
- the encoding of the pulse as the fixed codebook is performed using the result of the multiple loop search unit 503 and the result of the pulse position search device 600.
- the pulse train encoding unit 504 sends the total value of the numerator term and the total value of the denominator term to the control unit 502, and controls the next pulse position search device 600 or the multiple loop search unit 503 in order to prompt the operation.
- a timing signal is sent to the unit 502. Then, pulse train encoding section 504 outputs a code as a fixed codebook at the end.
- the pulse position search device in the search for a small number of pulses, the search loop for track 0 for which preliminary selection is performed without searching for multiple loops, and the search for track 1 for which preliminary selection is not performed.
- the calculation amount associated with the pulse position search can be further reduced.
- this pulse position search device is applied to a fixed codebook search device, even if the number of pulses to be searched in the fixed codebook increases, the amount of calculation associated with the pulse position search is not reduced without reducing the encoding performance. Can be reduced. If such a fixed codebook search apparatus is applied to an encoding apparatus, a high-quality decoded signal can be generated when decoding a code in the decoding apparatus.
- the search for track 0 with the preliminary selection of the position of the pulse is performed again after the search for track 1 in the pulse position search device, so that the result of the search in the conventional multiple loop The possibility of obtaining different results can be reduced.
- the denominator term of the cost function used in the search of the track 0 with the preliminary selection of the pulse position to be used first in the pulse position search device is changed to the total value of the denominator term.
- the search is performed every two pulses. This is for comparison with 718, and a search can be performed for every arbitrary number of pulses such as three pulses or four pulses.
- the first stage and the last stage are the conventional simultaneous optimization search (closed loop search), but this configuration is not necessarily required.
- the fixed codebook search apparatus performs a pulse position search using a simultaneous optimization search (closed loop search) regardless of the total number of bits in the last-stage pulse group search.
- the determination may be made by the control unit.
- the sequential optimization search of the present invention includes a three-loop configuration of track 0 search (with preliminary selection), track 1 search (without preliminary selection), and track 0 search (with preliminary selection).
- the present invention is not limited to this, and the amount of calculation can be greatly reduced, so the number of loops may be further increased.
- an algebraic codebook is used as a fixed codebook.
- the present invention is not limited to this, and can be used for other codebooks other than an algebraic codebook.
- the search using the preliminary selection is performed by taking 718 as an example, the present invention is not limited to this, and the present invention can be used for arbitrary encoding using a plurality of searches for a small number of pulses.
- the present invention relates to a pulse position search. This is because it does not depend on other configurations of the 718 standard.
- CELP is used as an encoding method.
- the present invention is not limited to this, and can be applied to vector quantization. Therefore, the present invention can be applied to encoding methods other than CELP.
- it can also be used for spectrum quantization using MDCT (Modified Discrete Cosine Transform) or QMF (Quadrature Mirror Filter), and also for algorithms that search for similar spectrum shapes from the spectrum in the low-frequency region in band expansion technology. Can be applied.
- MDCT Modified Discrete Cosine Transform
- QMF Quadrature Mirror Filter
- the pulse position search apparatus is applied to an encoding apparatus for speech, music, or a signal in which these are mixed.
- the present invention is not limited to this, and speech recognition is performed.
- the present invention can also be applied to quantization used for image recognition or image encoding. This is because the present invention relates to pulse position search and does not depend on the purpose of the entire algorithm.
- each functional block used in the description of the above embodiment is typically realized as an LSI which is an integrated circuit. These may be individually made into one chip, or may be made into one chip so as to include a part or all of them. Although referred to as LSI here, it may be referred to as IC, system LSI, super LSI, or ultra LSI depending on the degree of integration.
- the method of circuit integration is not limited to LSI, and implementation with a dedicated circuit or a general-purpose processor is also possible.
- An FPGA Field Programmable Gate Array
- a reconfigurable / processor that can reconfigure the connection and setting of circuit cells inside the LSI may be used.
- the present invention is suitable for a pulse position search device that searches for the positions of a plurality of pulses or a code book search device that searches for the positions of a plurality of pulses that constitute a code book, and can also be applied to a speech encoding device. It is.
Landscapes
- Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
本実施の形態の固定符号帳の探索処理の流れについて、図9を用いて説明する。図9は、本発明の実施の形態における固定符号帳探索処理の流れを示す概念図である。
401、601 第1探索部
402、602 第2探索部
403、603 第3探索部
500 固定符号帳探索装置
501 前処理部
502 制御部
503 多重ループ探索部
504 パルス列符号化部
Claims (3)
- ターゲット信号に所定の処理を行って得られたパラメータを入力して複数のパルスの位置の探索を行うパルス位置探索装置であって、
前記パラメータを用いて、第1のパルスが配置される位置の第1候補群に対して第1の予備選択を行い、前記第1の予備選択の結果に対して第1の探索を行うことにより、前記第1のパルスが配置される第1の位置を求める第1探索手段と、
前記第1の位置を用いて、第2のパルスが配置される位置の第2候補群の全ての位置候補に対して第2の探索を行うことにより、前記第2のパルスが配置される第2の位置を求める第2探索手段と、
前記第2の位置を用いて、前記第1候補群に対して第2の予備選択を行い、前記第2の予備選択の結果に対して第3の探索を行うことにより、前記第1のパルスが配置される第3の位置を求め、前記第2の位置と前記第3の位置とを探索結果として出力する第3探索手段と、
を具備するパルス位置探索装置。 - 前記第1探索部は、
パルスの位置の最初の探索の際に、コスト関数の分母の総合値にパルスの合成ベクトルのパワのみを加算することにより前記コスト関数の分母項を作成する、
請求項1記載のパルス位置探索装置。 - ターゲット信号に所定の処理を行って得られたパラメータを入力して複数のパルスの位置の探索を行うパルス位置探索方法であって、
前記パラメータを用いて、第1のパルスが配置される位置の第1候補群に対して第1の予備選択を行い、前記第1の予備選択の結果に対して第1の探索を行うことにより、前記第1のパルスが配置される第1の位置を求める第1探索ステップと、
前記第1の位置を用いて、第2のパルスが配置される位置の第2候補群の全ての位置候補に対して第2の探索を行うことにより、前記第2のパルスが配置される第2の位置を求める第2探索ステップと、
前記第2の位置を用いて、前記第1候補群に対して第2の予備選択を行い、前記第2の予備選択の結果に対して第3の探索を行うことにより、前記第1のパルスが配置される第3の位置を求め、前記第2の位置と前記第3の位置とを探索結果として出力する第3探索ステップと、を有するパルス位置探索方法。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201280002524.3A CN103098128B (zh) | 2011-06-15 | 2012-06-05 | 脉冲位置搜索装置、码本搜索装置及其方法 |
JP2013500692A JP5981909B2 (ja) | 2011-06-15 | 2012-06-05 | パルス位置探索装置、符号帳探索装置、及びこれらの方法 |
US13/819,421 US9230553B2 (en) | 2011-06-15 | 2012-06-05 | Fixed codebook searching by closed-loop search using multiplexed loop |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2011133750 | 2011-06-15 | ||
JP2011-133750 | 2011-06-15 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012172750A1 true WO2012172750A1 (ja) | 2012-12-20 |
Family
ID=47356760
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2012/003674 WO2012172750A1 (ja) | 2011-06-15 | 2012-06-05 | パルス位置探索装置、符号帳探索装置、及びこれらの方法 |
Country Status (4)
Country | Link |
---|---|
US (1) | US9230553B2 (ja) |
JP (1) | JP5981909B2 (ja) |
CN (1) | CN103098128B (ja) |
WO (1) | WO2012172750A1 (ja) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101931414B (zh) * | 2009-06-19 | 2013-04-24 | 华为技术有限公司 | 脉冲编码方法及装置、脉冲解码方法及装置 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH11119799A (ja) * | 1997-10-14 | 1999-04-30 | Matsushita Electric Ind Co Ltd | 音声符号化方法および音声符号化装置 |
JP2001022400A (ja) * | 1998-03-31 | 2001-01-26 | Matsushita Electric Ind Co Ltd | Celp型音声符号化装置及びcelp型音声符号化方法 |
JP2004252490A (ja) * | 2004-06-10 | 2004-09-09 | Nec Corp | 音声符号化装置及び音声復号装置 |
WO2009016816A1 (ja) * | 2007-07-27 | 2009-02-05 | Panasonic Corporation | 音声符号化装置および音声符号化方法 |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001318698A (ja) * | 2000-05-10 | 2001-11-16 | Nec Corp | 音声符号化装置及び音声復号化装置 |
US6728669B1 (en) * | 2000-08-07 | 2004-04-27 | Lucent Technologies Inc. | Relative pulse position in celp vocoding |
US6980948B2 (en) * | 2000-09-15 | 2005-12-27 | Mindspeed Technologies, Inc. | System of dynamic pulse position tracks for pulse-like excitation in speech coding |
US7860710B2 (en) * | 2004-09-22 | 2010-12-28 | Texas Instruments Incorporated | Methods, devices and systems for improved codebook search for voice codecs |
SG123639A1 (en) * | 2004-12-31 | 2006-07-26 | St Microelectronics Asia | A system and method for supporting dual speech codecs |
CN100412948C (zh) | 2005-01-27 | 2008-08-20 | 广达电脑股份有限公司 | 语音编码器中搜寻语音讯号的编码向量的搜寻系统及方法 |
CN100530357C (zh) * | 2007-07-11 | 2009-08-19 | 华为技术有限公司 | 固定码书搜索方法及搜索器 |
US8566106B2 (en) * | 2007-09-11 | 2013-10-22 | Voiceage Corporation | Method and device for fast algebraic codebook search in speech and audio coding |
CN100578620C (zh) * | 2007-11-12 | 2010-01-06 | 华为技术有限公司 | 固定码书搜索方法及搜索器 |
CN101866650A (zh) | 2009-04-20 | 2010-10-20 | 陆铁根 | 一种用于语音编码的固定码本搜索方法 |
CN102299760B (zh) * | 2010-06-24 | 2014-03-12 | 华为技术有限公司 | 脉冲编解码方法及脉冲编解码器 |
-
2012
- 2012-06-05 JP JP2013500692A patent/JP5981909B2/ja not_active Expired - Fee Related
- 2012-06-05 CN CN201280002524.3A patent/CN103098128B/zh not_active Expired - Fee Related
- 2012-06-05 WO PCT/JP2012/003674 patent/WO2012172750A1/ja active Application Filing
- 2012-06-05 US US13/819,421 patent/US9230553B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH11119799A (ja) * | 1997-10-14 | 1999-04-30 | Matsushita Electric Ind Co Ltd | 音声符号化方法および音声符号化装置 |
JP2001022400A (ja) * | 1998-03-31 | 2001-01-26 | Matsushita Electric Ind Co Ltd | Celp型音声符号化装置及びcelp型音声符号化方法 |
JP2004252490A (ja) * | 2004-06-10 | 2004-09-09 | Nec Corp | 音声符号化装置及び音声復号装置 |
WO2009016816A1 (ja) * | 2007-07-27 | 2009-02-05 | Panasonic Corporation | 音声符号化装置および音声符号化方法 |
Also Published As
Publication number | Publication date |
---|---|
CN103098128B (zh) | 2014-06-18 |
US9230553B2 (en) | 2016-01-05 |
CN103098128A (zh) | 2013-05-08 |
JP5981909B2 (ja) | 2016-08-31 |
US20130166306A1 (en) | 2013-06-27 |
JPWO2012172750A1 (ja) | 2015-02-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR101414341B1 (ko) | 부호화 장치 및 부호화 방법 | |
CN101057275B (zh) | 矢量变换装置以及矢量变换方法 | |
JP4879748B2 (ja) | 最適化された複合的符号化方法 | |
JP5340261B2 (ja) | ステレオ信号符号化装置、ステレオ信号復号装置およびこれらの方法 | |
JPWO2008047795A1 (ja) | ベクトル量子化装置、ベクトル逆量子化装置、およびこれらの方法 | |
KR101414359B1 (ko) | 부호화 장치 및 부호화 방법 | |
WO2009125588A1 (ja) | 符号化装置および符号化方法 | |
JP5687706B2 (ja) | 量子化装置及び量子化方法 | |
JP6644848B2 (ja) | ベクトル量子化装置、音声符号化装置、ベクトル量子化方法、及び音声符号化方法 | |
JP5981909B2 (ja) | パルス位置探索装置、符号帳探索装置、及びこれらの方法 | |
JP5388849B2 (ja) | 音声符号化装置および音声符号化方法 | |
WO2008001866A1 (fr) | dispositif de codage vocal et procédé de codage vocal | |
JP2013068847A (ja) | 符号化方法及び符号化装置 | |
JPH09204198A (ja) | 適応コードブック探索方法 | |
JP2013055417A (ja) | 量子化装置及び量子化方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201280002524.3 Country of ref document: CN |
|
ENP | Entry into the national phase |
Ref document number: 2013500692 Country of ref document: JP Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12801193 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13819421 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 12801193 Country of ref document: EP Kind code of ref document: A1 |