EP1692687B1 - Transcodierung zwischen den indizes von mehrimpuls-wörterbüchern zur codierung bei der digitalen signalkomprimierung - Google Patents

Transcodierung zwischen den indizes von mehrimpuls-wörterbüchern zur codierung bei der digitalen signalkomprimierung Download PDF

Info

Publication number
EP1692687B1
EP1692687B1 EP04805537A EP04805537A EP1692687B1 EP 1692687 B1 EP1692687 B1 EP 1692687B1 EP 04805537 A EP04805537 A EP 04805537A EP 04805537 A EP04805537 A EP 04805537A EP 1692687 B1 EP1692687 B1 EP 1692687B1
Authority
EP
European Patent Office
Prior art keywords
positions
pulse
subframe
coder
format
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.)
Not-in-force
Application number
EP04805537A
Other languages
English (en)
French (fr)
Other versions
EP1692687A1 (de
Inventor
Claude Lamblin
Mohamed Ghenania
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Orange SA
Original Assignee
France Telecom SA
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by France Telecom SA filed Critical France Telecom SA
Priority to PL04805537T priority Critical patent/PL1692687T3/pl
Publication of EP1692687A1 publication Critical patent/EP1692687A1/de
Application granted granted Critical
Publication of EP1692687B1 publication Critical patent/EP1692687B1/de
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • 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/16—Vocoder architecture
    • G10L19/173—Transcoding, i.e. converting between two coded representations avoiding cascaded coding-decoding
    • 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/12—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters the excitation function being a code excitation, e.g. in code excited linear prediction [CELP] vocoders

Definitions

  • the present invention relates to the encoding / decoding of digital signals, particularly in applications for transmitting or storing multimedia signals such as audio signals (speech and / or sounds).
  • the synthesis model is used in coding to extract the parameters modeling the signals to be coded.
  • the compression ratio varies from 1 to 16.
  • These encoders operate at rates of 2 to 16 kbit / s in the telephone band, and at rates of 6 to 32 kbit / s in broadband.
  • CELP-type digital coding / decoding device which is the most widely used synthesis analysis coder / decoder for the coding / decoding of speech signals, is briefly described below.
  • the speech signal is sampled and converted into a series of blocks of the samples called frames. In general, each frame is cut into smaller blocks of L samples, called subframes.
  • Each block is synthesized by filtering a waveform extracted from a repertoire (also called dictionary), multiplied by a gain, through two filters varying in time.
  • the excitation dictionary is a finite set of waveforms of L samples.
  • the first filter is the long-term prediction filter.
  • LTP Long Term Prediction
  • LPC Linear Prediction Coding
  • the method used to determine the innovation sequence is the method of synthesis analysis.
  • a large number of excitation dictionary innovation sequences are filtered by the two LTP and LPC filters, and the selected waveform is the one producing the synthetic signal closest to the original signal according to a criterion.
  • perceptual weighting commonly known as the CELP criterion.
  • CELP coders such as CELP decoders
  • the 5.3 kbit / s mode multi-pulse dictionary belongs to the well-known family of ACELP dictionaries.
  • the structure of an ACELP directory is based on the ISPP technique (for "Interleaved Single-Pulse Permutation") which consists in dividing all the L positions into K interleaved tracks, each of the N pulses being located in certain predefined tracks.
  • the L dimension of code words can be extended to L + N.
  • the block size of 60 samples was extended to 64 samples and the 32 even (odd) positions were divided into 4 tracks. interlaced length 8 not overlapping. So there are two groups of 4 tracks, one for each parity.
  • Table 1 below shows for each pulse denoted i 0 to i 3 all of these 4 tracks for the even positions.
  • Table 1 Positions and magnitudes of the 5.3 kbit G.723.1 encoder ACELP dictionary ⁇ / i> / ⁇ i> s ⁇ / i>
  • the ACELP innovation dictionaries are used in many synthetic analysis coders that are standardized (ITU-T G.723.1, ITU-T G.729, IS-641, 3GPP NB-AMR, 3GPP WB-AMR). Tables 2 to 4 below show some examples of these ACELP dictionaries for a block length of 40 samples. Note that the parity constraint is not used in these dictionaries.
  • Table 2 shows the 17-bit ACELP dictionary and 4 non-zero pulses ⁇ 1, used in the ITU-T G.729 8-bit / sec encoder, in the 7.4 kbit / s IS-641 encoder as well as in the 7.4 and 7.95 kbit / s modes of the 3GPP NB-AMR encoder.
  • Table 2 Positions and amplitudes of the ACELP dictionary pulses of ITU-T G.
  • each code vector contains 10 non-zero pulses of amplitude ⁇ 1.
  • the block of 40 samples is divided into 5 tracks of length 8, each containing 2 pulses. Note that the two pulses of the same track can overlap and result in a single pulse amplitude ⁇ 2.
  • This dictionary is presented in Table 3.
  • Table 4 presents the 11-bit ACELP dictionary and 2 non-zero pulses of ⁇ 1 amplitude, used in the low-bit-rate (6.4 bps / sec) extension of the ITU-T G.729 encoder and in the 5.9 kbit / s mode of the 3GPP NB-AMR encoder.
  • Table 4 ACELP dictionary pulses and magnitudes of ITU-T G.
  • the search for the optimal modeling of a vector to be coded consists in choosing from the set (or in a subset) of the code vectors of the dictionary, the one that "resembles" it the most, that is to say the one that minimizes a measure of distance between him and this input vector. To do this, we proceed to a step called "exploration" of the dictionaries.
  • this step amounts to looking for the combination of pulses that optimizes the proximity between the signal to be modeled and the signal resulting from the choice of pulses.
  • this exploration may be exhaustive or not (so more or less complex).
  • the algorithm for encoding a vector of standardized transform coefficients exploits this property to determine its nearest neighbor among all the code vectors while calculating only a limited number of distance criteria (with a use of so-called "absolute leaders").
  • the exploration of multi-pulse dictionaries is not exhaustive except for small dictionaries. For higher-rate dictionaries, only a small percentage of the dictionary is explored.
  • the exploration of ACELP multi-pulse dictionaries is usually done in two steps. To simplify this search, a first step pre-selects for each possible pulse position its amplitude (and hence its sign as indicated above) by a simple quantization of a signal dependent on the input signal. The amplitudes of the pulses being fixed, the positions of the pulses are then sought by a synthesis analysis technique (according to the CELP criterion).
  • Some of these known methods are used in the standard coders mentioned above. Their purpose is to reduce the number of combinations of positions to explore based on the properties of the signal to be modeled. For example, we can cite the so - called "depth-first tree" algorithm , used by many standardized ACELP coders. In this algorithm, certain positions are preferred, such as the local maxima of the tracks of a target signal depending on the input signal, the synthetic signal passed and the filter composed of the synthesis and perceptual weighting filters. There are several variants depending on the size of the dictionary used. To explore the ACELP dictionary at 35 bits and 10 pulses (table 3), the first pulse is placed at the same position as the overall maximum of the target signal.
  • this same ACELP dictionary is explored by a different method of focusing.
  • the algorithm performs an iterative search by nesting four pulse search loops (one per pulse).
  • the search is focused by making the entry in the inner loop (searching for the last pulse belonging to tracks 3 or 4) conditional on exceeding an adaptive threshold.
  • This threshold also depends on the properties of the target signal (local and average maxima of the first 3 tracks).
  • the maximum number of explorations of combinations of 4 pulses is fixed at 1440 (17.6% of the 8192 combinations).
  • Transcoding becomes necessary when, in a transmission chain, a compressed signal frame sent by an encoder can not continue its path, in this format. Transcoding makes it possible to convert this frame into another format compatible with the rest of the transmission chain.
  • the most basic solution (and the most common at the moment) is the end-to-end addition of a decoder and an encoder.
  • the compressed frame comes in a first format, it is uncompressed. This decompressed signal is then recompressed in a second format accepted later in the communication chain. This cascading of a decoder and an encoder is called “tandem". This solution is very expensive in complexity (mainly because of the recoding) and it degrades the quality.
  • the second coding is done on a decoded signal, which is a degraded version of the original signal.
  • a frame may encounter several tandems before reaching its destination. We can easily imagine the cost in calculation and the loss of quality.
  • the delays related to each tandem operation builds up and can interfere with the interactivity of communications.
  • Another case of multiple-coding in parallel is post-decision multi-mode compression.
  • the complexity of each of the modes of compression limits the number and / or leads to elaborate a selection a priori of a very limited number of modes.
  • New multimedia communication applications (such as audio and video) often require multiple codings either in cascade (transcoding) or in parallel (multi-coding and multi-mode coding with ex-post decision).
  • the complexity barrier posed by all these codings remains a problem to be solved, in spite of the increase of the current processing powers.
  • Most of these known multi-coding operations do not take into account the interactions between the formats and between the format of E and its contents.
  • some intelligent transcoding techniques have been proposed that do not just decode but recode, but exploit the similarities between encoding formats and thus reduce the complexity while limiting the degradation provided.
  • the encodings can be strictly identical. They can be identical in the modeling and the calculation of the parameter, but can be differentiated simply by the translation of the coding in the form of bits. Finally, they can be completely different as much by the modeling of the parameter as its quantification, or even by its frequency of analysis or sampling.
  • the two coders are distinguished only by the binary translation of the calculated parameter, it suffices to decode the binary field of the first format, then to return to the binary domain using the coding method according to the second format .
  • This conversion can also be performed by bijective correspondence tables. This is the case, for example when transcoding the fixed excitations of the G.729 standard to the AMR standard (7.4 and 7.95kbit / s).
  • both encoding formats compute a parameter in the same way but quantify it differently.
  • the differences in quantification can be related to the chosen precision or to the chosen method (scalar, vector, predictive, or other). It is then enough to decode the parameter, then to quantify it by the method of the second coding format.
  • This known method is currently applied, in particular for the transcoding of excitation gains.
  • the decoded parameter must be modified before requantification. For example, if the encoders have parameter analysis frequencies or different frame / subframe lengths, it is common to interpolate / decimate the parameters. The interpolation can be done for example according to the method described in the published document US2003 / 033142 . Another possible modification is to round the parameter to the precision imposed on it by the second coding format. This case is especially for the height of the fundamental frequency (or "pitch").
  • a flow rate change procedure is presented which can be considered as a special case of intelligent transcoding. Indeed, this procedure makes it possible to requantize a vector of a first dictionary by a vector of a second dictionary. For this purpose, it distinguishes two cases according to whether or not the vector to be requantized in the second dictionary. If the quantified vector belongs to the new dictionary, the modeling is identical; otherwise, the partial decoding method is applied.
  • the present invention proposes, as indicated in claims 1 and 22, 23, by departing from all these known techniques, a multi-pulse transcoding based on a selection of a subset of combinations of pulse positions of a set of sets of pulses from a combination of pulse positions of another set of pulse sets, the two sets being distinguishable by the number of pulses they comprise as well as by the rules governing their positions and / or their amplitudes.
  • This transcoding is very useful in particular for multiple coding in cascade (transcoding) or in parallel (multi-coding and multi-mode coding).
  • the present invention firstly proposes a transcoding method between a first encoder / decoder in compression and at least one second encoder / decoder in compression.
  • These first and second encoders / decoders are of pulse type and use multi-pulse dictionaries in which each pulse has a position marked by an associated index.
  • step d) involves a number of possible pulse positions less than the total number of possible pulse positions of the dictionary of the second coder / decoder.
  • step e) in the case where the second encoder / decoder mentioned above is an encoder, the selected pulse positions are transmitted to this encoder, for search coding only among the transmitted positions. In the case where the aforementioned second encoder / decoder is a decoder, these selected pulse positions are transmitted for a decoding of these positions.
  • step b) uses a partial decoding of the bitstream provided by the first coder / decoder in order to identify a first number of pulse positions used by the first coder / decoder, in a first coding format.
  • the number chosen in step b) preferably corresponds to this first number of pulse positions.
  • the above steps are implemented by a computer program product comprising program instructions for this purpose.
  • the present invention also aims at such a computer program product intended to be stored in a memory of a processing unit, in particular a computer or a mobile terminal, or on a removable memory medium intended for to cooperate with a drive of the processing unit.
  • the present invention also relates to a transcoding device between first and second encoders / decoders in compression, and then having a memory adapted to store instructions of a computer program product of the type described above.
  • the present invention is part of the modeling and coding of digital multimedia signals such as audio signals (speech and / or sounds) by multi-pulse dictionaries. It can be implemented in the context of cascading or parallel coding / multiple decoding or any other system using the modeling of a signal by a multi-pulse representation and which, from the knowledge of a first game of pulses belonging to a first set, must determine at least one set of pulses of a second set. For the sake of brevity, only the case of a passage from one set to another set is described but the invention is also applicable in the case of passage to n (n ⁇ 2) sets. Furthermore, only the case of a "transcoding" between two coders is described below, but, of course, the transcoding between an encoder and a decoder can be deduced without major difficulty.
  • FIG. 1a and 1b there is shown a transcoding device D between a first encoder E, using a first encoding format COD1, and a second encoder S, using a second coding format COD2.
  • the encoder E delivers a coded binary stream (or " train") s CE (in the form of a succession of coded frames) to the transcoding device D, which comprises a partial decoding module 10 to recover the number Ne of positions d pulses used in the first coding format and the positions p e of these pulses.
  • the transcoding device in the sense of the invention proceeds to extract the neighborhoods of the right v e d and left v e g of each pulse position p e and selects, in the union of these neighborhoods, pulse positions that will be recognized by the second encoder S.
  • the module 11 of the transcoding device shown on the Figures 1a and 1b therefore performs these steps to deliver this selection of positions (noted S j on these Figures 1a and 1b )
  • this selection S j there is constituted a sub-directory smaller than the size of the dictionary that usually uses the second encoder S, according to an advantage that provides the invention.
  • the encoding performed by the encoder S is of course faster because it is more restricted, without affecting the quality of the coding.
  • the transcoding device D furthermore comprises a module 12 for at least partial decoding of the coded stream S CE delivered by the first coder E.
  • the module 12 then supplies the second coder S with an at least partially decoded version s' 0 of the signal d origin s 0 .
  • the second encoder S then delivers, based on this version s' 0 , a coded bitstream s CS .
  • the transcoding device D thus performs an encoding adaptation between the first encoder E and the second encoder S, advantageously favoring a faster (because more restricted) coding with the second encoder S.
  • the entity referenced S on the Figures 1a and 1b can be a decoder and, in this variant, the device D within the meaning of the invention performs a transcoding, properly speaking, between an encoder E and a decoder S, this decoding taking place quickly thanks to the information provided by the device D. Since the process is reversible, it will be understood that, more generally, the transcoding device D within the meaning of the present invention operates between a first encoder / decoder E and a second encoder / decoder S.
  • the arrangement of the encoder E, the transcoder D and the encoder S can respect a "cascade" configuration , as shown in FIG. figure 1a .
  • this arrangement can comply with a configuration "in parallel".
  • the two encoders E and S receive the original signal s 0 and the two encoders E and S respectively deliver the coded streams S CE and S CS .
  • the second encoder S no longer has to receive here the version s' 0 of the figure 1a and the at least partial decoding module 12 of the transcoding device D is no longer necessary.
  • the encoder E can provide an output compatible with the input of the module 11 (both with respect to its number of pulses and with respect to its pulse positions), the module 10 can simply be omitted or "short-circuited".
  • transcoding device D may simply be equipped with a memory storing the instructions for carrying out the above steps and a processor for processing these instructions.
  • the application of the invention is therefore as follows.
  • the first encoder E has performed its coding operation on a given signal s 0 (for example the original signal).
  • the positions of the pulses chosen by the first coder E are thus available.
  • This coder has determined these positions p e by a technique which is specific to it during the coding process.
  • the second encoder S must also perform its coding.
  • the second encoder S has only the bitstream generated by the first encoder and the invention is applicable here to "intelligent" transcoding as defined above.
  • the second coder S also has the signal available to the first coder and the invention applies here to "intelligent multi-coding".
  • a system that wants to encode the same content in several formats can exploit the information of a first format to simplify the coding operations of other formats.
  • the invention can also be applied to the particular case of multiple coding in parallel, which is the multi-mode coding with a posterior decision.
  • the present invention makes it possible to quickly determine the positions p s (or, indiscriminately noted hereinafter, s i ) pulses for another encoding format from positions p e (or, noted indistinctly further below, e i ) pulses of a first format. It makes it possible to considerably reduce the calculation complexity of this operation for the second encoder by limiting the number of possible positions. For this purpose, it uses the positions chosen by the first coder to define a restricted set of positions in all the possible positions of the second encoder, a restricted set in which the best set of positions for the pulses will be sought. This results in a significant gain in complexity while limiting the degradation of the signal compared to a conventional exhaustive or focused search.
  • the present invention limits the number of possible positions by defining a restricted set of positions from the positions of the first encoding format. It differs from existing solutions insofar as they use only the properties of the signal to be modeled to limit the number of possible positions, by favoring and / or eliminating positions.
  • each pulse of a set of a first set two neighborhoods (a right and a left) of adjustable width more or less constrained are defined and a set of possible positions is extracted from it, in which at least one combination of pulses respecting the constraints of the second set.
  • the transcoding method makes it possible to optimize the complexity / quality compromise by adapting the number of pulse positions and / or the respective sizes (in terms of combinations of pulse positions) of the right and left neighborhoods for each pulse. .
  • This adjustment can be done at the start of processing or at each subframe depending on the authorized complexity and / or the set of starting positions.
  • the invention also makes it possible to adjust / limit the number of combinations of positions by advantageously favoring immediate neighborhoods.
  • the present invention also relates to a computer program product whose algorithm is designed in particular for the extraction of neighboring positions which facilitates the composition of the combinations of pulses of the second set.
  • Encoders can be distinguished by many features. In particular, two of them substantially determine the mode of operation of the invention. This is the sampling frequency and the duration of a sub-frame.
  • the sampling frequencies are compared. If the frequencies are equal, we compare, in test 23, the subframe times. Otherwise, the sampling frequencies are adapted, in step 32, according to a method described hereinafter.
  • the subframe durations are equal, we compare, in the test 24, the numbers of pulse positions N e and N s used. respectively by the first and the second coding format. Otherwise, the subframe times are adapted in step 33 by a method which will also be described hereinafter.
  • steps 22, 23, 32 and 33 together define step a) of adaptation of the coding parameters mentioned above. It is indicated that the steps 22 and 32 (adaptation of the sampling frequencies), on the one hand, and the steps 23 and 33 (adaptation of the subframe durations), on the other hand, can be reversed.
  • the encoder E calculated the positions of its N e pulses on the sub-frame s e . We note below e i (or, indistinctly, p e ) these positions.
  • the restricted set P s of the preferred positions for the pulses of the repertoire of the encoder S then consists of Ne positions e i and their neighborhoods.
  • the values of v d i and v boy Wut i chosen in step 27 of the figure 2 are larger or smaller depending on the complexity and quality desired. These sizes can be set arbitrarily at the start of processing, or be chosen at each subfield S e .
  • the set P s then contains each position e i as well as its v d i neighbors right and his v boy Wut i neighbors on the left.
  • N s pulses of S belong to pre-defined subsets of positions, a given number of pulses sharing the same subset of allowed positions.
  • the pulses of the 12.2 bit / s mode of the 3GPP NB-AMR encoder are distributed 2 by 2 in 5 different subsets, as shown in Table 3 given above.
  • Neighborhoods v d i and v boy Wut i must be of sufficient size so that no intersection is empty. In this way, neighborhood sizes need to be readjusted, if necessary, according to the starting set of pulses. This is the object of test 34 of the figure 2 , with an increase in the size of the neighborhoods (step 35) and return to the definition of the union P s of the groups formed in step c) (step 29 on the figure 2 ) if one of the intersections is empty.
  • the invention exploits. the directory structure.
  • the directory of the encoder S is of type ACELP, it is the intersections of the positions of the tracks with P s that are calculated.
  • the directory of the encoder E is also of the ACELP type, the procedure for extracting neighborhoods also exploits the structure in tracks and the two steps of extraction of the neighborhoods and composition of the restricted subsets of positions, are judiciously associated.
  • the neighborhood extraction algorithm takes into account the composition of the combinations of pulses according to the constraints of the second set. As will be seen later, neighborhood extraction algorithms are elaborated to facilitate the composition of the combinations of pulses of the second set. An example of such an algorithm is illustrated by one of the embodiments given below (ACELP 2 pulses to ACELP 4 pulses).
  • the number of possible position combinations is thus limited and the size of the subset of the encoder directory S is generally much smaller than that of the original directory, which greatly reduces the complexity of the penultimate stage of the transcoding. It is specified here that the number of combinations of pulse positions defines the size of the aforementioned subset. It is furthermore specified that it is the number of pulse positions that is reduced in the sense of the invention, which leads to a reduction in the number of combinations of pulse positions and thus makes it possible to obtain a sub-number of pulse positions. restricted directory.
  • the referenced step 46 on the figure 3 then consists in launching the search for the best set of positions for the N s pulses in this sub-directory of restricted size.
  • the selection criterion is similar to that of the process of coding. To further reduce complexity, the exploration of this subdirectory can be accelerated using known focusing techniques described above.
  • the figure 3 summarizes the steps of the invention for the case where the encoder E uses at least as many pulses as the encoder S. However, it is indicated that, as has already been seen with reference to FIG. figure 2 if the number of positions N s in the second format (the format of S) is greater than the number of positions Ne in the first format (the format of E), the treatment provided is distinguished by only a few advantageous variants which will be described later .
  • step 45 the coder S then chooses a set of positions in the restricted directory obtained in step 44.
  • the method therefore continues with a step 46 of searching in this subdirectory received by the encoder S of an optimal set of positions (opt (S j )) having the second number N s of positions, as indicated above.
  • This step 46 of searching for the optimal set of positions is implemented preferentially by a focused search to accelerate the exploration of the sub-directory.
  • the processing continues naturally by the coding then carried out by the second coder S.
  • the processing is similar to the treatment discussed above. However, it may happen that S-format pulses do not have positions in the restricted directory. In this case, in a first embodiment, all possible positions for these pulses are allowed. In a second, preferred embodiment, the size of the neighborhoods at V ' d and V' g is simply increased, at step 28 of FIG. figure 2 .
  • Ne is close to N s , typically N e ⁇ N s ⁇ 2N e , then a preferred way of determining the positions is conceivable, although the above treatment is still quite applicable.
  • the processing of the first embodiment uses a direct quantization of the time scale of the first format by that of the second format.
  • This quantization operation which can be tabulated or calculated by a formula, thus makes it possible to find, for each position of a subframe of the first format, its equivalent in a subframe of the second format and vice versa.
  • this correspondence may use the formula above or advantageously be tabulated for the values.
  • One can also choose an intermediate solution that will tabulating the e first values ( l e The e d , d being the greatest common divisor of Le and L s ), the remaining positions being easily deduced then.
  • positions of the subframe of S can also be mapped to a position of a subframe of E. For example, by retaining the immediately lower and immediately higher positions of F s F e * p e .
  • Table 5c Restricted time correspondence table from NB-AMR to WB-AMR ⁇ / i> NB-AMR Positions 0 1 2 3 4 WB-AMR positions 0 2 3 5 6 WB-AMR positions 0 1 2 3 4 5 6 7 NB-AMR Positions 0 1 1 2 2 3 4 4
  • the quantization step a1) is performed by calculation and / or tabulation from a function which, at a pulse position p e in a first format subframe, matches a position p s pulse in a subframe with the second format, and this function is substantially a linear combination involving a multiplier coefficient corresponding to the ratio of the second sampling frequency to the first sampling frequency.
  • transcoding method is completely reversible and adapts both in a transcoding direction (E-> S) and in the other (S-> E).
  • a conventional principle of change of sampling frequency is used.
  • F s the sampling frequency of the second format
  • F s the sampling frequency of the second format
  • F s containing the pulses of filtered E.
  • This processing can also be performed by "on-line” calculation .
  • a preferred embodiment proposes a low complexity solution for determining a restricted repertoire of position combinations for the second format pulses from the positions of the pulses. of the first format.
  • the subframe of S and that of E are not of the same size, it is not possible to establish a direct temporal correspondence between a subframe of S and a subframe of E.
  • the show it figure 4 In which the E and S frames are respectively designated ST E and ST S ), the boundaries of the subframes of the two formats are not aligned and over time these subframes shift relative to one another. to the other.
  • p o e p e + i e ⁇ The e ⁇
  • p o s p s + j s ⁇ The s with 0 ⁇ p e ⁇ The e and 0 ⁇ p s ⁇ The s
  • the positions p e located in a sub-frame j s are used to determine, according to the general processing described above, a restricted set of positions for pulses of S in the sub-frame j s .
  • Le> L s it may happen that a subframe of S contains no pulse.
  • the pulses of the sub-frame STE0 are represented by vertical lines.
  • the format of E can very well concentrate the pulses of STE0 at the end of the subframe so that the pseudo subframe STE'0 does not contain any impulses. All the pulses placed by E are found in STE'1 when cutting. In this case, a conventional focused search is preferentially applied to the pseudo STE'O subframe.
  • This common reference is the position (number 0) from which the positions of the pulses in the following subframes are numbered.
  • This position 0 can be defined in different ways, depending on the system using the transcoding method within the meaning of the present invention. For example, for a transcoding module included in an equipment of a transmission system, it will be natural to take as origin the first position of the first frame received after the start of the equipment.
  • the disadvantage of this choice is that the positions take larger and larger values and it may become necessary to limit them. For this, it is sufficient to update the position of the common origin whenever possible.
  • the position of the common origin is updated each time the subframes of E and S are aligned. This happens periodically, the period (in samples) being equal to the least common multiple of L e and L s .
  • T e (k) T s (k ')
  • the common origin is updated (and taken at the position k ⁇ L e or else at k' ⁇ L s ).
  • T e and T s they are preferentially reset.
  • the temporal position of the common origin is periodically updated (step 74) at each instant when respective subframe boundaries of first duration St (L e ) and second duration St (L s ). are aligned in time (test 73 performed on these borders).
  • the first embodiment is applied to intelligent transcoding between the MP-MLQ model of G.723.1 at 6.3 kbit / s and the ACELP model at 4 pulses of G.723.1 at 5.3 kbit / s.
  • Intelligent transcoding of the G.723.1's high bitrate to low bit rate brings together a 6 and 5 pulse MP-MLQ model with an ACELP model at 4 pulses.
  • the exemplary embodiment presented here makes it possible to determine the positions of the four pulses of the ACELP from the positions of the pulses of the MP-MLQ.
  • the ITU-T G.723.1 multi-rate encoder and its multi-pulse directories have been presented above. It is specified only that a frame of G.723.1 has 240 samples at 8 kHz, and is divided into four subframes of 60 samples. The same restriction is imposed on the pulse positions of any vector-code of each of the three multi-pulse dictionaries. These positions must all have the same parity (all pairs or all odd).
  • the sub-frame of 60 (+4) positions is thus cut into two gates of 32 positions.
  • the even grid has the positions numbered [0, 2, 4, ..., 58, (60,62)].
  • the odd grid has the positions [1, 3, 5, ..., 59, (61,63)]. For each flow, the exploration of the directory, even if not exhaustive, remains complex as indicated previously.
  • a next step then consists in directly extracting the right and left neighborhoods of these 5 pulses.
  • the right and left neighborhoods are taken here equal to 2.
  • S 0 P s ⁇ 0 ⁇ 8 ⁇ 16 ... 56 ;
  • S 1 P s ⁇ 2 ⁇ 10 ⁇ 18 ... 58 ;
  • S 2 P s ⁇ 4 ⁇ 12 ⁇ 20 ⁇ 52 60 ;
  • S 3 P s ⁇ 6 , , 14 , 22 , ⁇ , 54 , 62 ; from where :
  • S 0 0 ⁇ 8 ⁇ 40 ⁇ 48 ;
  • S 1 2 ⁇ 10 ⁇ 26 ;
  • S 2 28 ⁇ 36 ⁇ 44 ;
  • S 3 6 ⁇ 30 ⁇ 38 ⁇ 46 ;
  • S 0 P s ⁇ 1 , 9 , , ⁇ , 57 ;
  • S 1 P s ⁇ 3 ⁇ 11 ⁇ 59 ;
  • S 2 P s ⁇ 5 ⁇ 13 ⁇ 53 61 ;
  • S 3 P s ⁇ 7 , , 15 , 22 , ⁇ , 55 , 63 ; from where :
  • S 0 1 ⁇ 9 ;
  • S 1 27 ;
  • S 2 29 ⁇ 37 ⁇ 45 ;
  • S 3 7 ⁇ 39 ⁇ 47 ;
  • the combination of these selected positions constitutes the new restricted directory in which the search will take place.
  • the procedure for selecting the optimal positions set is based on the criterion CELP as the G.723.1 does in the 5.3 kbit / s mode, the exploration can be exhaustive or, preferably, focused.
  • the number of combinations can be further restricted by considering only the parity chosen in the 6.3 kbit / s mode (in the example cited the even parity). In this case, the number of combinations in the restricted directory is 144.
  • the following second example illustrates the application of the invention to intelligent transcoding between ACELP models of the same length.
  • this second exemplary embodiment is applied to intelligent transcoding between the 4-pulse ACELP of the G.729 at 8 kbit / s and the ACELP at 2 pulses of the G.729 at 6.4 bit / s.
  • Intelligent transcoding between the 6.4 kbit / s and 8 kbit / s modes of the G.729 encoder brings together a two-pulse and a four-pulse ACELP repertoire.
  • the example presented here makes it possible to determine the positions of 4 pulses (8 kbit / s) from the positions of 2 pulses (6.4 kbit / s) and vice versa.
  • a G.729 frame has 80 samples at 8 kHz. This frame is divided into two subframes of 40 samples. For each subframe, the G.729 models the innovation signal by pulses according to the ACELP model. It uses four in the 8 kbit / s mode and two in the 6.4 kbit / s mode. Tables 2 and 4 above give the positions that pulses can take for these two rates. At 6.4 kbit / s, a exhaustive search of all combinations (512) positions is performed. At 8 kbit / s, a focused search is preferably used.
  • All pulses are characterized by their track and their rank in this track.
  • the 8 kbit / s mode places a pulse on each of the first three tracks and the last pulse on one of the last two tracks.
  • the 6.4 kbit / s mode puts its first pulse on the tracks P 1 or P 3 , and its second pulse on the tracks P 0 , P 1 , P 2 or P 4 .
  • ⁇ i> Table 7 Distribution of pulses from G.729 ACELP directories at 8 and 6.4 kbit ⁇ / i> / ⁇ i> s in the five tracks.
  • the interlacing of tracks is used in this embodiment to facilitate the extraction of neighborhoods and the composition of restricted subsets of positions.
  • To move from one track to another simply move one unit to the right or to the left. For example, if you are at the 5 th position of track 2 (of absolute position 22), a shift of 1 to the right (+1) moves to the 5 th position of track 3 (of position absolute 23) and a shift to the left (-1) moves to the 5 th position of track 1 (absolute position 21).
  • a subframe of G.729 is considered to be in the 6.4 kbit / s mode.
  • Two pulses are placed by this encoder but it is necessary to determine the positions of the other pulses that must place the G.729 at 8 kbit / s.
  • the selection step is therefore immediate.
  • Two of the four G.729 pulses at 8 kbit / s are selected at the same positions as the 6.4 kbit / s mode, and then the two remaining pulses are placed in close proximity to the first two. As indicated above, the track structure is exploited.
  • the positions of the mode pulses is noted e k 6.4 kbit / s and that of the S k mode 8 kbit / s. Table 8 below presents for each case the positions chosen.
  • the columns marked "P j + d P i 'specify the neighborhood law at the slopes and leading to the track P i. Recall that level P i tracks.
  • each pulse s k can be taken as equal to that of the pulse e j from which it is deduced.
  • the first step is the recovery of the positions of the four pulses generated by the 8 kbit / s mode.
  • the decoding of the bit index (over 13 bits) of the 4 positions makes it possible to obtain their rank in their respective track for the first three positions (tracks 0 to 2) and the track (3 or 4) of the fourth pulse as well. than his rank in this track.
  • Each position e i (0 i i ⁇ 4) is characterized by the pair (p i , m i ) where p i is the index of its track and m i its rank in this track.
  • the restriction on the right neighbor for a position of the fourth pulse belonging to the fourth track makes it possible to ensure that the neighboring position is not outside the sub-frame.
  • a right (respectively left) neighbor of +1 (respectively -1) of the impulse (p, m) belongs to T ' (p + 1) ⁇ 5 (respectively at T ' (p-1) ⁇ 5 ).
  • edge effects must be taken into account.
  • a right neighbor of + d (respectively left of -d) of the pulse (p, m) belongs to T ' (p + d) ⁇ 5 (respectively to T' (pd) ⁇ 5 ).
  • the fourth and last step is to perform the search for the optimal torque in the two subsets obtained.
  • the search algorithm like the normalized one using the track structure
  • the track storage of the pulses further simplify the search algorithm. In practice, it is therefore unnecessary to explicitly form the restricted subsets S 0 and S 1 because sets T ' j can be used alone.
  • a neighborhood of size 1 For a neighborhood of size 1, less than 8% of combinations of positions is to explore on average without exceeding 10% (50 combinations). For a neighborhood size 2, less than 17% of combinations of positions is to explore on average and at most 25% of the combinations is to explore.
  • the complexity of the treatment proposed in the invention (by adding the cost of the search in the directory restricted to the cost of the extraction of neighborhoods associated with the composition of the intersections) represents less than 30% of an exhaustive search for an equivalent quality.
  • the last example illustrates the transitions between the 8 kbit / s G.729 ACELP model and the 6.3 kbit / s G.723.1 MP-MLQ model.
  • Intelligent pulse transcoding between G.723.1 (6.3 kbit / s mode) and G.729 (8 kbit / s mode) has two major difficulties.
  • the second difficulty is related to the different structure of the dictionaries, the ACELP type for the G.729 and the MP-MLQ type for the G.723.1.
  • the example of realization presented here shows how the invention overcomes these two difficulties in order to transcode the pulses at a lower cost while preserving the quality of the transcoding.
  • a temporal correspondence is made between the positions in the two formats taking into account the difference in size of the subframes for aligning the positions relative to an origin common to E and S.
  • the lengths of the subframes of the G: 729 and G.723.1 having as least common multiple 120 the temporal correspondence is performed in blocks of 120 samples or two subframes of G.723.1 for three subframes of G.729, as shown by the example of the figure 4b .
  • blocks of complete frames In this case, blocks of 240 samples are chosen, ie a G.723.1 frame (4 subframes) for three G.729 frames (6 subframes).
  • the selection of a subset of the MP-MLQ directory of G.723.1 at 6.3 kbit / s is now described from elements of the 4-pulse G.729 ACELP directory at 8 kbit / s.
  • the first step consists of recovering the positions of the pulses in blocks of 3 subframes (index i e , 0 i i e ⁇ 2) of G.729.
  • p e ( i e ) a position of the subframe i e of this block.
  • these 12 positions p e ( i e ) are converted into 12 positions denoted p s ( j s ), distributed in two subframes (of index j s , 0 ⁇ j s ⁇ 1 ) of G.723.1.
  • p s ( j s ) 12 positions denoted p s ( j s ), distributed in two subframes (of index j s , 0 ⁇ j s ⁇ 1 ) of G.723.1.
  • the 4 positions retrieved in the block sub-frame STE0 are directly assigned to the sub-frame STS0 with the same position, those of the block sub-frame STE2 are directly assigned to the sub-frame STS1 with an increment of +20 in position, the sub-frame positions STE1 less than 20 are assigned to the sub-frame STS0 with an increment of +40, the others being allocated to the sub-frame STS1 with a decrement of -20.
  • the neighborhoods are then extracted from these 12 positions. It should be noted that the right (respectively left) neighborhoods of the positions of the subframe STS0 (respectively STS1) can be allowed to leave their subframe, these neighboring positions then being in the subframe STS1 (respectively STSO ).
  • the temporal matching and neighborhood extraction step can be reversed.
  • the right (respectively left) neighborhoods of the positions of the STE0 subframe (respectively STE2) can be allowed to leave their subframe, these neighboring positions then being in the subframe STE1.
  • the right (respectively left) neighborhoods of the positions in STE1 can lead to neighboring positions in STE2 (respectively STEO).
  • the last step is to explore for each sub-frame STS its restricted directory thus formed to select the Np (6 or 5) pulses of the same parity.
  • This procedure may be derived from the standard algorithm or may be inspired by other focusing procedures.
  • This subdirectory is finally transmitted to the selection algorithm which determines the N p best positions in the sense of the CELP criterion for the subframes STS0 and STS1 of G.723.1. This considerably reduces the number of combinations tested. Indeed, for example in the sub-frame STS0, there remain 9 even positions and 8 odd positions instead of 30 and 30.
  • the present invention makes it possible to determine at a lower cost the positions of a set of pulses from a first set of pulses, the two sets of pulses belonging to two multi-pulse repertoires.
  • These two directories can be distinguished by their size, the length and the number of pulses of their codewords as well as by the rules governing the positions and / or amplitudes of the pulses.
  • the invention also makes it possible to exploit the structure of the starting and / or arrival directories in order to further reduce the complexity.
  • the invention is easily applicable to two multi-pulse models having different structural constraints.
  • the second exemplary embodiment having the passage between two models having a different number of pulses but based on the same ACELP structure, it will be understood that the invention advantageously allows the exploitation of the directory structure to reduce the complexity of transcoding.
  • the third example showing the passage between an MP-MLQ model and an ACELP model, it will be understood that the invention can be applied even for coders of different subframe lengths or sampling frequencies.
  • the invention makes it possible to adjust the quality / complexity compromise and, in particular, to greatly reduce the computation complexity for a minimal degradation compared to a conventional search for a multi-pulse model.

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)
  • Analogue/Digital Conversion (AREA)
  • Reduction Or Emphasis Of Bandwidth Of Signals (AREA)

Claims (23)

  1. Transcodierverfahren zwischen einem ersten Kompressions-Codierer/Decodierer und mindestens einem zweiten Kompressions-Codierer/Decodierer, wobei der erste und der zweite Codierer/Decodierer vom Impulstyp sind und Multipuls-Verzeichnisse verwenden, in denen jeder Impuls eine durch einen zugeordneten Index gekennzeichnete Position aufweist,
    dadurch gekennzeichnet, dass es die folgenden Schritte aufweist:
    a) gegebenenfalls Anpassung von Codierparametern zwischen dem ersten und zweiten Codierer/Decodierer,
    b) Erhalt, ausgehend vom ersten Codierer/Decodierer, einer gewählten Anzahl (Ne) von Impulspositionen und von jeweils zugeordneten Positionsindices (ei),
    c) für jede laufende Impulsposition mit gegebenem Index, Bildung einer Gruppe von Impulspositionen, die mindestens die laufende Impulsposition und Impulspositionen mit zugeordneten Indices aufweisen, die direkt unter und direkt über dem gegebenen Index liegen,
    d) Auswahl, in Abhängigkeit von vom zweiten Codierer/Decodierer zugelassenen Impulspositionen (Tj), mindestens eines Teils der Impulspositionen in einer Einheit (Ps), die aus einer Vereinigung der im Schritt c) gebildeten Gruppen besteht, und
    e) Übertragung der so ausgewählten Impulspositionen an den zweiten Codierer/Decodierer für eine Codierung/Decodierung ausgehend von den übertragenen Positionen,
    wobei die Auswahl des Schritts d) dann eine Anzahl von möglichen Impulspositionen einsetzt, die geringer ist als die Gesamtanzahl von möglichen Impulspositionen des Verzeichnisses des zweiten Codierer/Decodierers.
  2. Verfahren nach Anspruch 1, bei dem der erste Codierer/Decodierer (E) in einem ersten Codierformat eine erste Anzahl von Impulsen verwendet,
    dadurch gekennzeichnet, dass die im Schritt b) gewählte Anzahl (Ne) dieser ersten Anzahl von Impulspositionen entspricht.
  3. Verfahren nach Anspruch 2, bei dem:
    - der erste Codierer/Decodierer (E) in einem ersten Codierformat eine erste Anzahl (Ne) von Impulspositionen verwendet,
    - der zweite Codierer/Decodierer (S) in einem zweiten Codierformat eine zweite Anzahl (Ns) von Impulspositionen verwendet,
    dadurch gekennzeichnet, dass es außerdem einen Schritt aufweist, der darin besteht, mindestens die Fälle zu unterscheiden, in denen:
    - die erste Anzahl (Ne) größer als die oder gleich der zweiten Anzahl (Ns) ist,
    - die erste Anzahl (Ne) kleiner als die zweite Anzahl (Ns) ist.
  4. Verfahren nach Anspruch 3, bei dem die erste Anzahl (Ne) größer als die oder gleich der zweiten Anzahl (Ns) ist, (Ne ≥ Ns),
    dadurch gekennzeichnet, dass jede im Schritt c) gebildete Gruppe rechte benachbarte Impulspositionen (Vi d) und linke benachbarte Impulspositionen (Vi g) der laufenden Impulsposition mit gegebenem Index aufweist, und dass die jeweiligen Anzahlen von links und rechts benachbarten Impulspositionen in Abhängigkeit von einem Kompromiss bei der Komplexität und der Qualität der Transcodierung gewählt werden.
  5. Verfahren nach Anspruch 4, dadurch gekennzeichnet, dass im Schritt d) ein Unterverzeichnis von Kombinationen von Impulspositionen konstruiert wird, die aus den Kreuzungen (Sj):
    - der Einheit (Ps), die aus einer Vereinigung der im Schritt c) gebildeten Gruppen besteht, und
    - Impulspositionen (Tj), die vom zweiten Codierer/Decodierer zugelassen werden,
    resultieren, so dass das Unterverzeichnis eine kleinere Größe hat als die Zahl von Kombinationen von Impulspositionen (Tj), die vom zweiten Codierer/Decodierer zugelassen werden.
  6. Verfahren nach Anspruch 5, dadurch gekennzeichnet, dass nach dem Schritt e) in dem Unterverzeichnis nach einem optimalen Satz von Positionen gesucht wird, der die zweite Anzahl (Ns) von Positionen auf der Ebene des zweiten Codierers (S) aufweist.
  7. Verfahren nach Anspruch 6, dadurch gekennzeichnet, dass der Schritt der Suche nach dem optimalen Satz von Positionen von einer fokussierten Suche eingesetzt wird, um das Abtasten des Unterverzeichnisses zu beschleunigen.
  8. Verfahren nach einem der vorhergehenden Ansprüche, bei dem der erste Codierer/Decodierer angeordnet ist, um eine Folge von codierten Rahmen zu liefern, dadurch gekennzeichnet, dass die jeweiligen Anzahlen von Impulspositionen in den im Schritt c) gebildeten Gruppen nacheinander von einem Rahmen zum anderen gewählt werden.
  9. Verfahren nach Anspruch 3, bei dem die erste Anzahl (Ne) kleiner als die zweite Anzahl (Ns) ist (Ne<Ns)
    dadurch gekennzeichnet, dass außerdem getestet wird, ob die in der zweiten Anzahl von Impulspositionen (Ns) vorgesehenen Impulspositionen sich unter den Impulspositionen der Gruppen befinden, die im Schritt c) geformt werden,
    und dass im Fall einer negativen Antwort auf diesen Test die Anzahl von Impulspositionen in den im Schritt c) geformten Gruppen erhöht wird.
  10. Verfahren nach Anspruch 3, dadurch gekennzeichnet, dass außerdem der Fall unterschieden wird, in dem die zweite Anzahl Ns zwischen ein und zweimal so groß wie die erste Anzahl Ne ist (Ne<Ns<2Ne), und in diesem Fall:
    c1) von vorneherein die Ne Impulspositionen ausgewählt werden,
    c2) und außerdem eine komplementäre Anzahl von Impulspositionen Ns-Ne ausgewählt wird, die in der direkten Nähe der Impulspositionen definiert sind, die im Schritt c1) ausgewählt werden.
  11. Verfahren nach einem der vorhergehenden Ansprüche, bei dem der erste Codierer/Decodierer angeordnet ist, um mit einer ersten gegebenen Tastfrequenz und ausgehend von einer ersten gegebenen Subrahmendauer zu arbeiten,
    dadurch gekennzeichnet, dass die Codierparameter, für die die Anpassung des Schritts a) ausgeführt wird, mindestens eine Subrahmendauer und eine Tastfrequenz aufweisen, während der zweite Codierer/Decodierer mit einer zweiten Tastfrequenz und einer zweiten Subrahmendauer arbeitet, und dass im Schritt a) die folgenden vier Fälle unterschieden werden:
    - die erste und die zweite Dauer sind gleich und die erste und die zweite Frequenz sind gleich,
    - die erste und die zweite Dauer sind gleich und die erste und die zweite Frequenz sind unterschiedlich,
    - die erste und die zweite Dauer sind unterschiedlich und die erste und die zweite Frequenz sind gleich,
    - die erste und die zweite Dauer sind unterschiedlich und die erste und die zweite Frequenz sind unterschiedlich.
  12. Verfahren nach Anspruch 11, bei dem die erste und die zweite Dauer gleich und die erste und die zweite Tastfrequenz unterschiedlich sind,
    dadurch gekennzeichnet, dass es Schritte:
    a1) der direkten Quantifizierung der Zeitskala von der ersten Frequenz zur zweiten Frequenz,
    a2) und der Bestimmung, in Abhängigkeit von der Quantifizierung, jeder Impulsposition in einem Subrahmen im zweiten Codierformat gekennzeichnet durch die zweite Testfrequenz aufweist, ausgehend von einer Impulsposition in einem Subrahmen im ersten Codierformat gekennzeichnet durch die erste Tastfrequenz.
  13. Verfahren nach Anspruch 12, dadurch gekennzeichnet, dass der Schritt a1) der Quantifizierung durch Berechnung und/oder Tabellierung ausgehend von einer Funktion erfolgt, die einer Impulsposition in einem Subrahmen im ersten Format (pe) eine Impulsposition in einem Subrahmen im zweiten Format (ps) entsprechen lässt, wobei die Funktion sich im Wesentlichen wie eine lineare Kombination präsentiert, die einen multiplikativen Koeffizienten einsetzt, der dem Verhältnis der zweiten Tastfrequenz zur ersten Tastfrequenz entspricht.
  14. Verfahren nach Anspruch 13, dadurch gekennzeichnet, dass, um umgekehrt von einer Impulsposition in einem Subrahmen im zweiten Format (ps) zu einer Impulsposition in einem Subrahmen im ersten Format (pe) überzugehen, eine inverse Funktion der linearen Kombination angewendet wird, die an eine Impulsposition in einem Subrahmen im zweiten Format (ps) angewendet wird.
  15. Verfahren nach Anspruch 11, bei dem die erste und die zweite Dauer gleich und die erste und die zweite Tastfrequenz unterschiedlich sind,
    dadurch gekennzeichnet, dass es die folgenden Schritte aufweist:
    a'1) Übertasten eines Subrahmens im ersten Codierformat, gekennzeichnet durch die erste Tastfrequenz, mit einer Frequenz gleich dem kleinsten gemeinsamen Vielfachen der ersten und der zweiten Tastfrequenz, und
    a'2) Anwenden an den übergetasteten Subrahmen einer Tiefpassfilterung, gefolgt von einer Untertastung, um eine Tastfrequenz zu erreichen, die der zweiten Tastfrequenz entspricht.
  16. Verfahren nach Anspruch 15, dadurch gekennzeichnet, dass das Verfahren durch den Erhalt, durch Schwellwertbildung, einer Anzahl von Positionen fortgesetzt wird, die ggf. variabel ist.
  17. Verfahren nach Anspruch 12, dadurch gekennzeichnet, dass es außerdem einen Schritt der Zuordnung, für jede Position (pe) eines Impulses eines Subrahmens im ersten Codierformat gekennzeichnet durch die erste Tastfrequenz, einer Gruppe von Impulspositionen (ps) in einem Subrahmen im zweiten Codierformat gekennzeichnet durch die zweite Tastfrequenz, aufweist, wobei jede Gruppe eine Anzahl von Positionen aufweist, die vom Verhältnis zwischen der zweiten und der ersten Tastfrequenz (Fs/Fe) abhängt.
  18. Verfahren nach Anspruch 11, bei dem die erste und die zweite Dauer von Subrahmen unterschiedlich sind,
    dadurch gekennzeichnet, dass es die Schritte:
    a20) der Definition eines gemeinsamen Ursprungs (O) der Subrahmen des ersten und des zweiten Formats,
    a21) der Aufteilung der aufeinanderfolgenden Subrahmen des ersten Codierformats gekennzeichnet durch eine erste Subrahmendauer, um Pseudo-Subrahmen mit Dauern zu bilden, die der Subrahmendauer des zweiten Formats entsprechen,
    a22) der Aktualisierung des gemeinsamen Ursprungs,
    a23) und einer Zuordnungsbestimmung zwischen den Impulspositionen in den Pseudo-Subrahmen und in den Subrahmen im zweiten Format aufweist.
  19. Verfahren nach Anspruch 18, dadurch gekennzeichnet, dass außerdem die folgenden Fälle unterschieden werden:
    - die erste und die zweite Dauer sind zeitlich fest, und
    - die erste und die zweite Dauer sind zeitlich variabel.
  20. Verfahren nach Anspruch 19, bei dem die erste und die zweite Dauer zeitlich fest sind,
    dadurch gekennzeichnet, dass die zeitliche Position des gemeinsamen Ursprungs periodisch in jedem Augenblick aktualisiert wird, in dem Grenzen von Subrahmen erster bzw. zweiter Dauer zeitlich angeglichen sind.
  21. Verfahren nach Anspruch 19, bei dem die erste und die zweite Dauer zeitlich variieren,
    dadurch gekennzeichnet, dass:
    a221) nacheinander Summierungen der Dauern der Subrahmen im ersten Format bzw. der Dauern der Subrahmen im zweiten Format durchgeführt werden,
    a222) ein Vorliegen einer Gleichheit zwischen den zwei Summen erfasst wird, die einen Aktualisierungszeitpunkt des gemeinsamen Ursprungs definiert,
    a223) die zwei Summen nach dem Vorliegen für eine spätere Erfassung eines nächsten gemeinsamen Ursprungs erneut initialisiert werden.
  22. Computerprogrammprodukt, das dazu bestimmt ist, in einem Speicher einer Verarbeitungseinheit gespeichert zu werden, insbesondere einem Computer oder einem mobilen Endgerät, oder in einem lösbaren Speicherträger, der dazu bestimmt ist, mit einem Lesegerät der Verarbeitungseinheit zusammenzuwirken,
    dadurch gekennzeichnet, dass es Anweisungen für die Anwendung des Transcodierverfahrens nach einem der vorhergehenden Ansprüche aufweist.
  23. Vorrichtung zur Transcodierung zwischen einem ersten Kompressions-Codierer/Decodierer und mindestens einem zweiten Kompressions-Codierer/Decodierer, wobei der erste und der zweite Codierer/Decodierer vom Impulstyp sind und Multipuls-Verzeichnisse verwenden, in denen jeder Impuls eine durch einen zugeordneten Index gekennzeichnete Position aufweist,
    dadurch gekennzeichnet, dass sie einen Speicher aufweist, der die Anweisungen eines Computerprogrammprodukts nach Anspruch 22 enthält.
EP04805537A 2003-12-10 2004-11-24 Transcodierung zwischen den indizes von mehrimpuls-wörterbüchern zur codierung bei der digitalen signalkomprimierung Not-in-force EP1692687B1 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PL04805537T PL1692687T3 (pl) 2003-12-10 2004-11-24 Transkodowanie pomiędzy wskaźnikami wieloimpulsowych słowników stosowanych do kodowania przy kompresji sygnałów cyfrowych

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR0314489A FR2867648A1 (fr) 2003-12-10 2003-12-10 Transcodage entre indices de dictionnaires multi-impulsionnels utilises en codage en compression de signaux numeriques
PCT/FR2004/003008 WO2005066936A1 (fr) 2003-12-10 2004-11-24 Transcodage entre indices de dictionnaires multi-impulsionnels utilises en codage en compression de signaux numeriques

Publications (2)

Publication Number Publication Date
EP1692687A1 EP1692687A1 (de) 2006-08-23
EP1692687B1 true EP1692687B1 (de) 2008-03-19

Family

ID=34746280

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04805537A Not-in-force EP1692687B1 (de) 2003-12-10 2004-11-24 Transcodierung zwischen den indizes von mehrimpuls-wörterbüchern zur codierung bei der digitalen signalkomprimierung

Country Status (12)

Country Link
US (1) US7574354B2 (de)
EP (1) EP1692687B1 (de)
JP (1) JP4970046B2 (de)
KR (1) KR101108637B1 (de)
CN (1) CN1890713B (de)
AT (1) ATE389933T1 (de)
DE (1) DE602004012600T2 (de)
ES (1) ES2303129T3 (de)
FR (1) FR2867648A1 (de)
MX (1) MXPA06006621A (de)
PL (1) PL1692687T3 (de)
WO (1) WO2005066936A1 (de)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2867649A1 (fr) * 2003-12-10 2005-09-16 France Telecom Procede de codage multiple optimise
US20070250308A1 (en) * 2004-08-31 2007-10-25 Koninklijke Philips Electronics, N.V. Method and device for transcoding
FR2880724A1 (fr) 2005-01-11 2006-07-14 France Telecom Procede et dispositif de codage optimise entre deux modeles de prediction a long terme
US20060262851A1 (en) * 2005-05-19 2006-11-23 Celtro Ltd. Method and system for efficient transmission of communication traffic
KR100918377B1 (ko) * 2006-05-30 2009-09-22 주식회사 메디슨 영상압축 방법
US8214200B2 (en) * 2007-03-14 2012-07-03 Xfrm, Inc. Fast MDCT (modified discrete cosine transform) approximation of a windowed sinusoid
EP2827327B1 (de) 2007-04-29 2020-07-29 Huawei Technologies Co., Ltd. Pulskodierungsmethode von Anregungssignalen
CN101295506B (zh) * 2007-04-29 2011-11-16 华为技术有限公司 脉冲编解码方法及脉冲编解码器
EP2045800A1 (de) * 2007-10-05 2009-04-08 Nokia Siemens Networks Oy Transkodierverfahren und -vorrichtung
CN101931414B (zh) 2009-06-19 2013-04-24 华为技术有限公司 脉冲编码方法及装置、脉冲解码方法及装置
US8738679B2 (en) * 2009-07-03 2014-05-27 Stmicroelectronics International N.V. Offset-free sinc interpolator and related methods
CN102299760B (zh) 2010-06-24 2014-03-12 华为技术有限公司 脉冲编解码方法及脉冲编解码器
US8805697B2 (en) * 2010-10-25 2014-08-12 Qualcomm Incorporated Decomposition of music signals using basis functions with time-evolution information
CN102623012B (zh) 2011-01-26 2014-08-20 华为技术有限公司 矢量联合编解码方法及编解码器
US9472199B2 (en) * 2011-09-28 2016-10-18 Lg Electronics Inc. Voice signal encoding method, voice signal decoding method, and apparatus using same
US8731081B2 (en) * 2011-12-07 2014-05-20 Motorola Mobility Llc Apparatus and method for combinatorial coding of signals
WO2019028602A1 (zh) * 2017-08-07 2019-02-14 深圳市汇顶科技股份有限公司 应用于超取样转换器的向量量化数模转换电路
CN114598558B (zh) * 2022-03-28 2023-10-31 厦门亿联网络技术股份有限公司 音频设备级联自修复系统及自修复方法

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3109594B2 (ja) * 1998-08-18 2000-11-20 日本電気株式会社 移動通信システムおよび移動端末接続方法
US6604070B1 (en) * 1999-09-22 2003-08-05 Conexant Systems, Inc. System of encoding and decoding speech signals
US7315815B1 (en) * 1999-09-22 2008-01-01 Microsoft Corporation LPC-harmonic vocoder with superframe structure
US7222070B1 (en) * 1999-09-22 2007-05-22 Texas Instruments Incorporated Hybrid speech coding and system
FR2802329B1 (fr) 1999-12-08 2003-03-28 France Telecom Procede de traitement d'au moins un flux binaire audio code organise sous la forme de trames
US6687668B2 (en) * 1999-12-31 2004-02-03 C & S Technology Co., Ltd. Method for improvement of G.723.1 processing time and speech quality and for reduction of bit rate in CELP vocoder and CELP vococer using the same
US6704703B2 (en) * 2000-02-04 2004-03-09 Scansoft, Inc. Recursively excited linear prediction speech coder
JP4231987B2 (ja) * 2001-06-15 2009-03-04 日本電気株式会社 音声符号化復号方式間の符号変換方法、その装置、そのプログラム及び記憶媒体
US7272555B2 (en) * 2001-09-13 2007-09-18 Industrial Technology Research Institute Fine granularity scalability speech coding for multi-pulses CELP-based algorithm
CN100527225C (zh) * 2002-01-08 2009-08-12 迪里辛姆网络控股有限公司 基于celp的语音代码之间的代码转换方案
US6829579B2 (en) * 2002-01-08 2004-12-07 Dilithium Networks, Inc. Transcoding method and system between CELP-based speech codes
JP4304360B2 (ja) 2002-05-22 2009-07-29 日本電気株式会社 音声符号化復号方式間の符号変換方法および装置とその記憶媒体
JP4238535B2 (ja) * 2002-07-24 2009-03-18 日本電気株式会社 音声符号化復号方式間の符号変換方法及び装置とその記憶媒体
CA2501368C (en) * 2002-10-11 2013-06-25 Nokia Corporation Methods and devices for source controlled variable bit-rate wideband speech coding
US7363218B2 (en) * 2002-10-25 2008-04-22 Dilithium Networks Pty. Ltd. Method and apparatus for fast CELP parameter mapping
US7523032B2 (en) * 2003-12-19 2009-04-21 Nokia Corporation Speech coding method, device, coding module, system and software program product for pre-processing the phase structure of a to be encoded speech signal to match the phase structure of the decoded signal
US7177804B2 (en) * 2005-05-31 2007-02-13 Microsoft Corporation Sub-band voice codec with multi-stage codebooks and redundant coding

Also Published As

Publication number Publication date
US7574354B2 (en) 2009-08-11
DE602004012600T2 (de) 2009-04-30
KR20060131781A (ko) 2006-12-20
ATE389933T1 (de) 2008-04-15
CN1890713A (zh) 2007-01-03
DE602004012600D1 (de) 2008-04-30
WO2005066936A1 (fr) 2005-07-21
ES2303129T3 (es) 2008-08-01
JP2007515676A (ja) 2007-06-14
PL1692687T3 (pl) 2008-10-31
KR101108637B1 (ko) 2012-02-09
JP4970046B2 (ja) 2012-07-04
US20070124138A1 (en) 2007-05-31
EP1692687A1 (de) 2006-08-23
CN1890713B (zh) 2010-12-08
FR2867648A1 (fr) 2005-09-16
MXPA06006621A (es) 2006-08-31

Similar Documents

Publication Publication Date Title
EP1692687B1 (de) Transcodierung zwischen den indizes von mehrimpuls-wörterbüchern zur codierung bei der digitalen signalkomprimierung
EP2277172B1 (de) Verbergung von übertragungsfehlern in einem digitalsignal in einer hierarchischen decodierungsstruktur
EP1372289B1 (de) Erzeugung einer Rahmenbeschreibung der Stille zur Erzeugung eines angenehmen Hintergrundrauschens
EP1994531B1 (de) Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals
EP2104936B1 (de) Transformationsködierung mit geringer verzögerung unter verwendung von gewichtgsfenstern
EP1709743A1 (de) Vektorquantifizierung mit variabler auflösung und variabler dimension
EP2727107B1 (de) Verzögerungsoptimierte kodierungs-/dekodierungs-gewichtungsfenster durch überlappungstransformation
WO2005066938A1 (fr) Procede de codage multiple optimise
EP0906613B1 (de) Verfahren und vorrichtung zur kodierung eines audiosignals mittels &#34;vorwärts&#34;- und &#34;rückwärts&#34;-lpc-analyse
EP1836699B1 (de) Verfahren und Vorrichtung zur Ausführung einer optimalizierten Audiokodierung zwischen zwei Langzeitvorhersagemodellen
EP2080194B1 (de) Dämpfung von stimmüberlagerung, im besonderen zur erregungserzeugung bei einem decoder in abwesenheit von informationen
EP2795618B1 (de) Verfahren zur erkennung eines vorgegebenen frequenzbandes in einem audiodatensignal, erkennungsvorrichtung und computerprogramm dafür
WO2006114494A1 (fr) Procede d’adaptation pour une interoperabilite entre modeles de correlation a cout terme de signaux numeriques
WO2013057453A2 (fr) Codage hierarchique perfectionne
EP1037196A1 (de) Verfahren zur Kodierung, Dekodierung und Transkodierung eines Audiosignals
EP1197952B1 (de) Verfahren zur Kodierung von Prosodie für die Sprachkodierung mit sehr niedriger Datenrate
EP2652735B1 (de) Verbesserte kodierung einer verbesserungsstufe bei einem hierarchischen kodierer
EP2203915B1 (de) Übertragungsfehlerverdeckung bei einem digitalem signal mit komplexitätsverteilung
EP1665234B1 (de) Informationsfluss-übertragungsverfahren, wobei der fluss in einen sprach-datenfluss eingefügt wird, und zu seiner implementierung verwendeter parametrischer codec
EP2691953B1 (de) Verarbeitung eines codierten audiosignals im kodierten bereich durch micda-kodierung
WO2010001020A2 (fr) Codage/decodage par plans de bits, perfectionne
FR2830970A1 (fr) Procede et dispositif de synthese de trames de substitution, dans une succession de trames representant un signal de parole
WO2010112607A1 (fr) Procédé de décodage par ré-encodage, dispositif et programme d&#39;ordinateur correspondants

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20060526

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LU MC NL PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LU MC NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 602004012600

Country of ref document: DE

Date of ref document: 20080430

Kind code of ref document: P

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: FRENCH

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2303129

Country of ref document: ES

Kind code of ref document: T3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

REG Reference to a national code

Ref country code: IE

Ref legal event code: FD4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080619

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080826

REG Reference to a national code

Ref country code: PL

Ref legal event code: T3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080719

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: IE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

26N No opposition filed

Effective date: 20081222

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080619

BERE Be: lapsed

Owner name: FRANCE TELECOM S.A.

Effective date: 20081130

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081130

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081130

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081130

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081130

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081124

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080920

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080620

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: TR

Payment date: 20151105

Year of fee payment: 12

Ref country code: IT

Payment date: 20151023

Year of fee payment: 12

Ref country code: GB

Payment date: 20151027

Year of fee payment: 12

Ref country code: DE

Payment date: 20151022

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: PL

Payment date: 20151026

Year of fee payment: 12

Ref country code: ES

Payment date: 20151110

Year of fee payment: 12

Ref country code: FR

Payment date: 20151023

Year of fee payment: 12

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602004012600

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20161124

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20170731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161130

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170601

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161125

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20181120

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161124