EP1994531B1 - Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals - Google Patents

Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals Download PDF

Info

Publication number
EP1994531B1
EP1994531B1 EP07731605A EP07731605A EP1994531B1 EP 1994531 B1 EP1994531 B1 EP 1994531B1 EP 07731605 A EP07731605 A EP 07731605A EP 07731605 A EP07731605 A EP 07731605A EP 1994531 B1 EP1994531 B1 EP 1994531B1
Authority
EP
European Patent Office
Prior art keywords
dictionary
pattern
vector
dictionaries
positions
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
EP07731605A
Other languages
English (en)
French (fr)
Other versions
EP1994531A2 (de
Inventor
Dominique Massaloux
Romain Trilling
Claude Lamblin
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
Publication of EP1994531A2 publication Critical patent/EP1994531A2/de
Application granted granted Critical
Publication of EP1994531B1 publication Critical patent/EP1994531B1/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/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
    • 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
    • G10L2019/0001—Codebooks
    • G10L2019/0007—Codebook element generation

Definitions

  • the present invention relates to the coding / decoding of digital audio signals, known as "CELP” (for "Code Excited Linear Prediction”).
  • the invention relates to the family of coders CELP (for "Code Excited Linear Prediction"), which select the excitation signal from among a set of candidate signals by comparing the output of the synthesis filter, excited by this signal, to original signal, with introduction of perceptual weighting.
  • coders have been widely used for encoding speech signals in bit rates of 6 to 24 kbit / s, and adopted in particular in ITU-T G.729, GSM-EFR, 3GPP / WB-AMR standards.
  • the invention finds an advantageous application in hierarchical coding systems described in detail below and for which the bit stream is formed of a base layer followed by additional layers to improve the quality.
  • FIG. 1 A general scheme of a CELP coder is given to the figure 1 .
  • the figure 2 presents the associated decoder.
  • the present invention aims rather the dictionary "fixed” DlCf, while the dictionary adaptive DICA is preferentially not treated in what follows.
  • the modeling of the excitation signal is generally performed on sample blocks corresponding to signal subframes typically of the order of 5 ms.
  • N 40 samples at 8 kHz sampling frequency
  • the filter W ( z ) is the perceptual weighting filter 11 (conventionally of the type AT z / ⁇ 1 AT z / ⁇ 2 , A ( z ) denoting the LPC analysis filter, and the factors ⁇ 1 and ⁇ 2 regulating the degree of perceptual weighting).
  • the signals exc passed ( n ) and exc current ( n ) respectively represent the past excitation signal (null signal on the current block) and current (zero memory signal).
  • the elements ⁇ h ( n ) ⁇ represent the impulse response of the filter H (defined above by the relation (1) above).
  • the filter H is causal, that is to say that the elements h ( n ) such that n ⁇ 0 are zero.
  • the optimal gain associated with the selected code vector is quantized.
  • a quantization index and the index associated with the selected code vector are transmitted (via a telecommunication network) or simply stored for subsequent transmission. It is on the basis of these indices that the decoding can then take place.
  • the respective gains boy Wut at i , boy Wut f i are decoded and the indices i at Opt , i f Opt selected code vectors respectively make it possible to find the elements that compose them, to reconstruct the excitation signal, then the reconstructed signal (subsequent modules 21 and 22).
  • the choice of the excitation dictionary is guided by constraints of flow, quality (or efficiency for a given flow) and complexity. For a restricted bit rate, it will be difficult to obtain a good reproduction quality for any signal to be encoded. Complexity is also an important factor. For all communication applications, the real-time constraint imposes limitations on the calculation time.
  • the first CELP dictionaries proposed in the literature were random code vectors, which required calculating the numerator and the denominator of the criterion for each dictionary vector. The search for the best code word was then of prohibitive complexity.
  • Structured dictionaries were then proposed to accelerate the search for the Optimal waveform, some search computations being performed once for different input signals (or “pooled calculations") thanks to the induced relationships between the vectors by the dictionary structure.
  • One of the most popular categories of structured dictionaries is the family of algebraic dictionaries, composed of pulses whose position is defined by an algebraic code or according to a network of points (typically a Gosset network), regular or not.
  • the most classic representatives of such dictionaries are known as ACELP (for "Algebraic CELP").
  • the filtering of the fixed dictionary presupposes a certain continuity of the process because the filters tend to widen the support of the filtered signal, and since it is generally not possible to correct the excitation of the preceding block, irregularities at the edge of the Coded sample blocks, poorly controlled by the process, may appear.
  • orthogonal dictionaries can also be provided in this context.
  • Dispersed-pulse codebook and its application to a 4kb / s speech coder ", Yasunaga K et al, ICASSP 2000 discloses learning of the dispersion vectors.
  • Hierarchical coding structures are now briefly described. Such structures, also called “scalable”, provide coding binary data that are divided into successive layers.
  • a base layer is formed of the bits absolutely necessary for the decoding of the bitstream, and determining a minimum quality of decoding.
  • the following layers progressively improve the quality of the decoded signal, each new layer providing new information, which, exploited at decoding, output a signal of increasing quality.
  • One of the peculiarities of hierarchical coders is the possibility of intervening at any level of the transmission or storage chain to remove a part of the bitstream without having to give any particular indication to the coder or the decoder.
  • the decoder uses the binary information it receives and produces a corresponding quality signal.
  • Hierarchical CELP coders also called “nested CELPs”
  • dictionaries which can be different on each floor or identical.
  • the present invention improves the situation.
  • pulse sequence is understood to mean a succession of samples comprising pulses and possibly one or more zero samples between the pulses, and / or at the beginning and / or at the end of the succession.
  • the dictionary thus constructed is a CELP excitation dictionary of the so-called "fixed" type (referenced DICf for example on the figures 1 and 2 described above).
  • the basic pattern appearing at each occurrence in an excitation vector is multiplied by an amplitude associated with said occurrence, this amplitude being for example chosen from a set comprising the values +1 and -1.
  • all the vectors of the initial dictionary include the same number of occurrences of the basic pattern.
  • CELP excitation vector dictionaries these dictionaries being defined by the data of a basic pattern, appearing according to one or more occurrences, each occurrence being multiplied by an amplitude.
  • the patterns possibly appearing at the edge of the block are truncated to fit exactly in the block.
  • a multi-pulse dictionary well known in the state of the art, constitutes a particular case of a dictionary thus obtained, insofar as the length of a pattern in the case of a dictionary multi-pulse is simply 1.
  • This type of multi-pulse dictionary will be referred to hereinafter as the "trivial basic dictionary".
  • the method in the sense of the invention makes it possible to construct combinations of dictionaries (initial and constructed as described above without also excluding the use of one or more additional multi-pulse dictionaries).
  • a global dictionary can be constructed by a sum of basic dictionaries of which at least one is an initial dictionary defined by a basic pattern.
  • the vectors of the global dictionary are formed in this case by adding the common position pulses of the basic dictionaries vectors, preferably weighted, one by one by a gain each associated with a dictionary.
  • a global dictionary can be constructed by a union of basic dictionaries, at least one of which is an initial dictionary defined by a basic pattern. In this case, the global dictionary simply includes all the vectors of all the basic dictionaries.
  • a coding / decoding device that included a cascading of dictionaries, at least one initial dictionary of which is subsequent in the cascade, this initial dictionary comprising such a symmetrical pattern with a previous central pulse and pulses and next of amplitudes opposite to that of the central amplitude.
  • This device may advantageously comprise a high-pass filtering in a global perceptual weighting filter intervening in coding in particular in the search for an optimal excitation vector.
  • An example of such an embodiment will be described in detail later, with reference to Figures 8a, 8b, 8c and 9 . This realization made it possible to focus the search in the initial dictionary by the use of a high-pass filter.
  • this realization proposes a cascading of a multi-pulse dictionary with a dictionary defined by a motive symmetrical with respect to its center, whose occurrences of the center of the motif describe the same set as the occurrences of the pulses of the multi-pulse dictionary.
  • This implementation makes it possible to broaden the spectral range of the initial basic dictionary by adding one or more additional basic dictionaries, the search in these additional basic dictionaries then being spectrally focused by modifying the perceptual weighting filter. intervening in the search for the optimal vector, the choice of this modification and that of the motif of these additional basic dictionaries possibly being linked.
  • the positions of the patterns and / or pulses in the vectors of the dictionaries in particular when they are cascaded, describe preferentially identical sets, the position of a pattern being marked substantially by the position of a central pulse in the sequence of pulses forming the pattern.
  • the position of a pattern can be identified by the position in the sample block of the center of the pattern, if the pattern includes a number odd of samples. However, in a strictly equivalent way, a possible even length pattern may be completed by a zero to produce an odd length. More generally, any other variant for locating the position of the patterns may be considered.
  • the invention proposes very simple techniques for decoding the index of the vectors of such dictionaries, by adding the scaled occurrences of the pattern or patterns whose position and the amplitude factor for each occurrence are transmitted.
  • the index further includes an indication of the dictionary in which the best candidate vector has been found.
  • the index includes in particular an indication relative to the aforementioned initial dictionary and hence an indication as to the basic pattern that made it possible to construct the dictionary and therefore the best candidate vector.
  • the index In the case of a single basic dictionary, the index already reflects the amplitude and position associated with each of its occurrences. To decode the best candidate vector, it is then sufficient to position the basic pattern at the different positions that it must occupy in each occurrence, multiply it by the associated amplitudes, and sum the occurrences. In the case of a union of basic dictionaries, the index further informs about the selected base dictionary, as indicated above.
  • the indices of the vectors in each of the dictionaries are preferably determined and from there, for each index, the last three steps described above are applied.
  • the dictionary constructed within the meaning of the invention preferably comprises allowable pattern positions which describe a highly structured set, advantageously as a set of pulse positions of an ACELP dictionary.
  • the cascading of dictionaries including at least one basic dictionary is very advantageous. This variant is particularly suitable for the case of hierarchical coding structures. Nevertheless, the different basic dictionaries do not play the same role because, typically, the first dictionary ensures the coding of a minimum quality of the signals that it is desired to reproduce. The following dictionaries are intended to improve this quality, and will consolidate the coding, reduce sensitivity to the type of signal, or other.
  • the cascading of a plurality of dictionaries amounts to constructing a single global dictionary obtained by summation of the dictionaries weighted by gains, as indicated above.
  • each excitation vector corresponds to the sum of vectors derived from basic dictionaries multiplied by a gain, the basic dictionaries being explored one after the other, subtracting the known contribution of the partial excitation produced. by the vectors of the previous dictionaries.
  • the cascaded dictionaries are explored one after the other, subtracting, for a current dictionary, a known contribution of a partial excitation produced by the vectors of at least one preceding dictionary, which confers a hierarchical coding structure.
  • the estimate of the CELP criterion is slightly modified by the addition of the steps c) and e), with respect to the estimate of the CELP criterion in the sense of the prior art.
  • the present description aims not only at the method defined above, but also at the dictionary, itself, of CELP excitation vectors, capable of being constructed by a device for encoding / decoding digital audio signals, by an implementation of the process within the meaning of the invention.
  • the present invention also relates to a computer program as set forth in claim 7.
  • these dictionaries can be constructed by executing a computer program of the aforementioned type, then stored in a memory of such a coding / decoding device, for example by virtue of the use of an algebraic law associating the indices. from vectors to the code vectors themselves (as for example in the ACELP technique).
  • the present invention also relates to a use of such a device as set forth in claim 11.
  • all or part of the general and optional characteristics expressed above can be applied both for the construction of the dictionary, for the dictionary itself or for the coding / decoding device comprising at least one dictionary thus constructed. or for the use of such a device, or for the computer program generating the dictionary or for the computer program for the use of the device.
  • CELP type excitation vector dictionaries and their use, which offer a great potential wealth of content for a moderate size.
  • the decoding of the associated indices is of low complexity, despite this variety of forms.
  • the code vectors of a basic dictionary are obtained by defining a basic pattern. y ( j ) (- p ⁇ j ⁇ p ) as a sequence of samples ( figure 3a ) that moves in a block of length N , truncating the pattern when it overflows the block. We add K occurrences of this same pattern, multiplied by an amplitude factor, to form the code vectors of the dictionary.
  • the dashed box with the reference D2 of the figure 7 illustrates some vectors V21, V22, V2n of a basic dictionary thus constructed.
  • the first vector V21 comprises a base pattern Pat (D2) comprising a succession of eleven pulses.
  • the last vector V2n of the dictionary D2 in the example of the figure 7 contains the sum of the pulses of the two basic patterns at their edges, right for one and left for the other (tenth and eleventh pulses of the overall pattern from the left).
  • the (negative) pulse of the center of the second pattern of the vector V21 vanishes with the second (positive) pulse of the vector V12 in the sum of the vectors V21 + V12.
  • pattern positions are such that patterns overlap at least partially (in the case of the vector V2n).
  • the pulses of the overlapping patterns are added one by one.
  • vectors are formed of a basic pattern affected by a given amplitude, truncated if necessary to the edge (s) and completed by zeros.
  • the vectors ⁇ c ( n ) ⁇ of the basic dictionary are deduced from the vectors ⁇ c 0 ( n ) ⁇ by convolution with the base pattern y and truncation at the terminals of the segment [0, N -1].
  • the vector ⁇ c w ( n ) ⁇ of dimension ( N + 2 p ) is defined by the convolution of the vector ⁇ c '( n ) ⁇ given above with the impulse response of the filter H ( z ). However, in the selection of the optimal waveform, only the N central elements of this vector are used.
  • the number of non-zero elements h " ( n, j ) thus depends on the number of non-zero elements h ( n ) such that n ⁇ 0. If we assume that the filter H ( z ) is causal, all the elements b d ( n ) such that n ⁇ N -1 are zero.
  • the search for the best waveform is then carried out (step 61) using the conventional CELP search criterion, expressed as the maximization of a ratio in which the numerator uses the vector ⁇ d ' ( a k ) ⁇ and the denominator the elements ⁇ '( a k , a l ), to finally obtain the best vector-code VC (step 62).
  • figure 5 can illustrate, as an organogram, a portion of the algorithm of the computer program allowing the use of a coding / decoding device comprising at least one dictionary within the meaning of the invention.
  • the search for the waveform in a basic dictionary within the meaning of the invention finally boils down to the known and efficient search of a conventional multi-pulse dictionary.
  • positions of the centers a k ⁇ A k occurrences k (ranging from 0 to K-1) of the patterns describe the positions of the pulses of structured dictionaries of type ACELP, it will be possible to use the efficient fast algorithms that have been developed for such ACELP dictionaries.
  • Simplifications of the above method may also be provided.
  • the relative energy of the elements that are squeezed out in the truncation operation is small relative to the energy of the elements that remain in the block, for the occurrences of the edges, it can be expected simply to neglect the effects. board (without then conducting tests 54 and 58).
  • at least one (preferably step 63) or the two correction steps 53 and 63 can simply be deleted.
  • Two methods of combination can be provided to provide a global dictionary capable of providing various representations of waveforms, in particular to provide a very satisfactory spectral richness. Indeed, it is possible to orient the contents of each basic dictionary to one or more categories of signals.
  • each of the basic dictionaries is preferably explored separately, the best waveforms resulting from the search in each basic dictionary then being compared with each other in order to select the most appropriate one.
  • the complexity of the search is in this case equivalent to the sum of the complexities of searches in each basic dictionary. Quick searches; induced by the advantageous structure of the basic dictionaries as we have seen previously, have proved very effective.
  • Exploration variants may also be proposed. For example, it is possible to first determine one (or more) basic dictionary (s) among the dictionaries that make up the global dictionary, and then to limit the search to the basic dictionaries thus preselected.
  • the decoding of the indexes can be carried out by first identifying the base dictionary that has been selected (for example by comparing the index of the selected vector-code with values stored in memory corresponding to the boundaries of the basic dictionaries in the dictionary full). Then, the index of the code vector is decoded in the basic dictionary as previously indicated.
  • This embodiment is advantageous. It is about building and using dictionaries that add the vectors of the basic dictionaries to take advantage of the characteristics of the basic dictionaries that compose it, but also to take advantage of their joint characteristics.
  • the vectors of the dictionaries are formed simply by adding, one by one and sample by sample, all the vectors of the base dictionaries, possibly weighted by gains as in the second embodiment. which is described later.
  • the figure 7 illustrates the principle of such an addition of basic dictionaries. In the example shown, two D1, D2 dictionaries are added together and it will be noted that the weights of the pulses of the vectors V1i of the dictionary D1 are the same, in the sum D1 + D2, as those of the pulses of the vectors V2j of the dictionary D2.
  • a code vector belonging to a basic dictionary D2 can be represented by indicating the positions of the centers of the patterns and the amplitudes of the occurrences in the different dictionaries, that is to say for the different reasons, and then adding up the patterns scaled and so placed.
  • a second embodiment of a sum of basic dictionaries gives rise to simpler search algorithms.
  • the principle consists in cascading the summation of the basic dictionaries, a different gain being associated with each sub-vector coming from the basic dictionaries.
  • This variant is very advantageous in terms of complexity.
  • each basic dictionary is more particularly intended to enrich the global dictionary and, for example, according to a particular type of excitation signal, it may be advantageous to use different perceptual filters W i ( z ) (for i ranging from 0 at I -1) for the different searches in the basic dictionaries.
  • W i ( z ) for i ranging from 0 at I -1
  • a first base dictionary rather apt to represent the low frequency part of the excitation signal
  • a second basic dictionary rather intended to represent the high frequency part.
  • the conventional perceptual filter can be cascaded with a high-pass filter. Such an operation could also be called "spectral focusing". It will be described in detail later, with reference to the figure 9 , to illustrate a particular embodiment.
  • this second embodiment advantageously adapts to hierarchical CELP coding structures.
  • the bitstream is hierarchized and, in the implementation of this second embodiment, the bits corresponding to the indices and the gains of each of the code sub-vectors of the base dictionaries can constitute layers. separate hierarchical (or "participate" in distinct layers). If the decoder receives only a part of this information, it will be able to reconstitute at least a part of the excitation by decoding the indices and gains received associated with the sub-code-vectors of the basic dictionaries of the first layers and by summing the excitations partial thus obtained.
  • the first basic dictionary then provides the minimum quality coding and the following will allow a gradual increase in quality and a better consideration of the possible variety of signals, for example by offering an expanded spectral content.
  • the exemplary embodiment described below is in the context of a hierarchical CELP coder producing a binary train formed of two layers, a first layer of which corresponds to the "core" coding of the hierarchical structure, which operates at a rate of 8 kbit. / s and a second layer provides quality improvement for an additional 4 kbit / s, resulting in a total bit rate of 12 kbit / s.
  • the bit stream of the first layer is "compatible" with that of the ITU-T G.729 standard encoder so that an encoder or a decoder within the meaning of the invention can operate with a decoder or an encoder according to the G.729 and its annexes for the 8 kbit / s rate.
  • the hierarchy is ensured by the use of a dictionary according to the cascaded summation variant of the basic dictionaries in the sense of the invention.
  • the block size is 5ms, ie 40 samples at 8 kHz.
  • the first basic dictionary D1 ( figure 8a ) is of the "trivial" type and corresponds simply to the ACELP dictionary of the G.729 encoder, whose vectors are obtained by adding four signed pulses whose positions belong to the sets indicated in the table 2 given below.
  • ITU-T Recommendation G.729 " Coding of Speech at 8 kbps using Conjugate Structure Algebraic Code Excited Linear Prediction (CS-ACELP) ", March 1996 ).
  • the second basic dictionary D2 ( figure 8b ) is a non-trivial dictionary, whose base pattern (or "tri-pulses"), of length three, comprises three impulses of respective amplitudes - ⁇ , +1 and - ⁇ , with preferentially 0 ⁇ ⁇ 0.35 .
  • the value a may advantageously be chosen dynamically according to the characteristics of the input signal.
  • the number of occurrences, the amplitudes and the positions of the centers of the pattern are identical to those of the first dictionary.
  • the figure 8c shows the shape of the average spectra of the waveforms of the first dictionary (arrow D1) and the second dictionary (arrow D2). It is found that the first dictionary has a spectrally flat content, while the second dictionary is richer in high frequencies.
  • a first stage ET-1 introduces the adaptive dictionary DICa (vector ⁇ p (n) ⁇ ) and its associated gain g p , then the first fixed dictionary D1 (vector ⁇ c 1 (n) ⁇ ) and the associated gain g 1 .
  • a second stage ET-2 presents the search in the second fixed dictionary D2 (vector ⁇ c 2 (n) ⁇ ) and the associated gain g 2 .
  • the search in the first basic dictionary D1 is known and uses, for example, one or the other of the fast and focused algorithms described in the G.729 standard and its reduced complexity appendix A ( ITU-T Recommendation G.729, "Annex A: 8 kbit / s CS-ACELP speech codec", November 1996 ).
  • the search in the second base dictionary D2 also takes advantage of this fast algorithm, as described above.
  • the vector ⁇ c w ( n ) ⁇ is thus defined for -1 ⁇ n ⁇ 40.
  • the figure 9 can then schematically represent a device within the meaning of the invention, in particular here a coding device.
  • h ( n ) is zero for n ⁇ 0 or n ⁇ 40
  • h ' ( n ) is nonzero a priori for -1 ⁇ n ⁇ 40.
  • the dictionaries defined by the implementation of the invention offer great flexibility of use. Each block being totally independent of those which precede it or which follow it, it is possible to use for a block a dictionary totally different from that used for the neighboring blocks without particular precautions. This avoids possible problems of continuity. It is then very easy to adapt the dictionaries used to the signal to be coded, for example by modifying the pattern (s) used for the basic dictionaries. It can also be expected to modify the sets that define the positions of the centers of the patterns in the occurrences and / or sets of amplitudes. These possible modifications are for example particularly suitable for the case of variable rate encoders governed by the source.
  • high-pass filtering may be provided in a global filter for perceptual weighting, notably involved in encoding in the search for an optimal excitation vector.
  • the description may also refer to a computer program for a device for coding / decoding digital audio signals, including instructions for implementing the use

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)

Claims (13)

  1. Verfahren zum Codieren oder Decodieren digitaler Audiosignale, umfassend das Erstellen eines Anregungsvektoren-Codebuchs vom Typ CELP, wobei jeder Vektor der Dimension N Pulse umfasst, die N gültige Stellen einnehmen können,
    dadurch gekennzeichnet, dass ein Ausgangs-Codebuch erstellt wird durch:
    - Bereitstellen einer gleichbleibenden Folge von Pulsen, welche ein Grundmotiv bildet,
    - und Zuweisen des Grundmotivs zu jedem Anregungsvektor des Codebuchs, entsprechend einem oder mehreren Vorkommen, jeweils an einer oder mehreren Stelle(n) unter den N gültigen Stellen,
    und dadurch, dass das Grundmotiv drei Pulse umfasst, und zwar:
    - einen zentralen Puls,
    - einen zweiten Puls, welcher dem zentralen Puls vorangeht,
    - und einen dritten Puls, welcher auf den
    zentralen Puls folgt,
    wobei die Vorzeichen des zweiten und des dritten Pulses jeweils entgegengesetzt sind zu jenem des zentralen Pulses,
    wobei die Amplitude des zweiten und des dritten Pulses jeweils kleiner ist, im absoluten Wert, als jene des zentralen Pulses.
  2. Verfahren nach Anspruch 1, dadurch gekennzeichnet, dass das Grundmotiv, welches bei jedem Vorkommen in einem Anregungsvektor erscheint, mit einer Amplitude multipliziert wird, die dem Vorkommen zugeordnet ist.
  3. Verfahren nach einem der Ansprüche 1 und 2, dadurch gekennzeichnet, dass alle Vektoren des Ausgangs-Codebuchs die gleiche Anzahl an Vorkommen des Motivs aufweisen,
    und dadurch, dass das Ausgangs-Codebuch definiert wird durch:
    - die Folge von Pulsen, welche das Grundmotiv bilden,
    - die Anzahl der Vorkommen des Motivs in jedem Vektor,
    - die Mengen von zulässigen Stellen für die Vorkommen der Motive, und
    - die Mengen von Amplituden, welche den Vorkommen der Motive zuzuordnen sind.
  4. Verfahren nach einem der vorhergehenden Ansprüche, dadurch gekennzeichnet, dass die Motive, die am Rand eines Blocks eines Vektors erscheinen, gekürzt werden, und dass die verbleibenden Pulse der gekürzten Motive den Anfang oder das Ende des Blocks einnehmen.
  5. Verfahren nach einem der vorhergehenden Ansprüche, dadurch gekennzeichnet, dass, unter den zulässigen Stellen der Motive in jedem Block eines Vektors, Stellen der Motive derart angeordnet sind, dass Motive einander wenigstens teilweise überdecken, und dadurch, dass die Pulse der Motive, die einander überdecken, miteinander addiert werden.
  6. Verfahren nach einem der vorhergehenden Ansprüche, dadurch gekennzeichnet, dass ein Gesamt-Codebuch erstellt wird, aus einer Summe von Basis-Codebüchern, wobei wenigstens eines derselben ein Ausgangs-Codebuch ist, welches durch ein Grundmotiv definiert ist, und dadurch, dass die Vektoren des Gesamt-Codebuchs durch Addieren der Pulse an gemeinsamen Stellen von Vektoren der Basis-Codebücher gebildet werden, und dadurch, dass die Vektoren der Basis-Codebücher gewichtet werden, mit einem Gewichtungsfaktor, welcher jeweils einem Codebuch zugeordnet ist, zum Erstellen der Summe.
  7. Computerprogramm, welches Anweisungen enthält zum Ausführen des Verfahrens nach einem der Ansprüche 1 bis 6.
  8. Vorrichtung zum Codieren oder Decodieren digitaler Audiosignale, welche Mittel aufweist zum Ausführen eines Verfahrens nach einem der Ansprüche 1 bis 6.
  9. Vorrichtung nach Anspruch 8, dadurch gekennzeichnet, dass sie mehrere Codebücher in Multi-Stage-Anordnung aufweist, wobei diese wenigstens ein Ausgangs-Codebuch umfassen, welches durch Ausführen des Verfahrens nach einem der Ansprüche 1 bis 6 erhalten ist,
    und dadurch, dass sie ein Ausgangs-Codebuch aufweist, welches durch Ausführen des Verfahrens nach Anspruch 6 erstellt ist, und welches in der Multi-Stage-Anordnung der Codebücher nachfolgend ist.
  10. Vorrichtung nach Anspruch 9, dadurch gekennzeichnet, dass die Stellen der Motive und/oder der Pulse in den Vektoren der Multi-Stage-Codebücher identische Mengen beschreiben, wobei die Stelle eines Motivs im Wesentlichen durch die Stelle eines zentralen Pulses gefunden wird, in der Folge von Pulsen, welche das Motiv bildet.
  11. Verwendung der Vorrichtung nach einem der Ansprüche 8 bis 10 zum Codieren oder Decodieren digitaler Audiosignale, wobei, beim Codieren, nach Bestimmen eines am besten geeigneten Vektors in einem Ausgangs-Codebuch, ein Index gebildet wird, welcher wenigstens folgende Angaben enthält:
    - die Stelle(n) des Grundmotivs in dem am besten geeigneten Vektor, und
    - die Amplitude(n), welche der/den Stelle(n) des Motivs zugeordnet ist/sind, wobei der Index dazu bestimmt ist, übertragen zu werden für ein Decodieren zu einem späteren Zeitpunkt,
    und wobei, beim Decodieren, der am besten geeignete Vektor rekonstruiert wird, ausgehend von dem Index, durch:
    - Anordnen des Grundmotivs an den Stellen, welche durch den Index angegeben sind,
    - Multiplizieren des Motivs an jeder Stelle mit einer zugeordneten Amplitude,
    - und Addieren der Motive, die multipliziert und an den angegebenen Stellen angeordnet worden sind.
  12. Verwendung nach Anspruch 11, wobei die Vorrichtung eine Multi-Stage-Anordnung mehrerer Codebücher aufweist, wobei es zu einem Erstellen eines einzigen Gesamt-Codebuchs kommt, welches durch Summieren der mit Gewichtungsfaktoren gewichteten Codebücher erhalten wird, gemäß einem Ausführen des Verfahrens nach Anspruch 6,
    und wobei die Multi-Stage-Codebücher nacheinander durchsucht werden, durch Subtrahieren, für ein aktuelles Codebuch, eines bekannten Beitrags einer partiellen Anregung, welcher durch die Vektoren wenigstens eines vorhergehenden Codebuchs zustandekommt, wobei eine hierarchische Struktur der Codierung entsteht.
  13. Verwendung nach Anspruch 12, wobei die Suche in einem Codebuch ausgeführt wird, welches durch Ausführen des Verfahrens nach Anspruch 4 erhalten ist, und wobei, um einem Kürzen des Grundmotivs wenigstens am Rand des Blocks Rechnung zu tragen, gegebenenfalls Elemente des Vektors der Interkorrelation und/oder Elemente der Matrix korrigiert werden.
EP07731605A 2006-02-22 2007-02-13 Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals Not-in-force EP1994531B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR0601563 2006-02-22
PCT/FR2007/050780 WO2007096550A2 (fr) 2006-02-22 2007-02-13 Codage/decodage perfectionnes d'un signal audionumerique, en technique celp

Publications (2)

Publication Number Publication Date
EP1994531A2 EP1994531A2 (de) 2008-11-26
EP1994531B1 true EP1994531B1 (de) 2011-08-10

Family

ID=37308852

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07731605A Not-in-force EP1994531B1 (de) 2006-02-22 2007-02-13 Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals

Country Status (7)

Country Link
US (1) US8271274B2 (de)
EP (1) EP1994531B1 (de)
JP (1) JP5188990B2 (de)
KR (1) KR101370017B1 (de)
CN (1) CN101401153B (de)
AT (1) ATE520121T1 (de)
WO (1) WO2007096550A2 (de)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2466673B (en) 2009-01-06 2012-11-07 Skype Quantization
GB2466674B (en) * 2009-01-06 2013-11-13 Skype Speech coding
GB2466669B (en) * 2009-01-06 2013-03-06 Skype Speech coding
GB2466671B (en) * 2009-01-06 2013-03-27 Skype Speech encoding
US20100174539A1 (en) * 2009-01-06 2010-07-08 Qualcomm Incorporated Method and apparatus for vector quantization codebook search
GB2466675B (en) 2009-01-06 2013-03-06 Skype Speech coding
GB2466672B (en) * 2009-01-06 2013-03-13 Skype Speech coding
GB2466670B (en) * 2009-01-06 2012-11-14 Skype Speech encoding
US8452606B2 (en) * 2009-09-29 2013-05-28 Skype Speech encoding using multiple bit rates
WO2011052221A1 (ja) * 2009-10-30 2011-05-05 パナソニック株式会社 符号化装置、復号装置、およびそれらの方法
US9123334B2 (en) * 2009-12-14 2015-09-01 Panasonic Intellectual Property Management Co., Ltd. Vector quantization of algebraic codebook with high-pass characteristic for polarity selection
US8924203B2 (en) * 2011-10-28 2014-12-30 Electronics And Telecommunications Research Institute Apparatus and method for coding signal in a communication system
MX347921B (es) * 2012-10-05 2017-05-17 Fraunhofer Ges Forschung Un aparato para la codificacion de una señal de voz que emplea prediccion lineal excitada por codigos algebraico en el dominio de autocorrelacion.
CA3163664A1 (en) 2013-05-24 2014-11-27 Dolby International Ab Audio encoder and decoder
US9418671B2 (en) * 2013-08-15 2016-08-16 Huawei Technologies Co., Ltd. Adaptive high-pass post-filter
MY180722A (en) 2013-10-18 2020-12-07 Fraunhofer Ges Forschung Concept for encoding an audio signal and decoding an audio signal using speech related spectral shaping information
CA2927722C (en) 2013-10-18 2018-08-07 Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V. Concept for encoding an audio signal and decoding an audio signal using deterministic and noise like information
PL3069338T3 (pl) 2013-11-13 2019-06-28 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Koder do kodowania sygnału audio, system przesyłania audio i sposób określania wartości korekcji
EP2980794A1 (de) 2014-07-28 2016-02-03 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Audiocodierer und -decodierer mit einem Frequenzdomänenprozessor und Zeitdomänenprozessor
EP2980795A1 (de) 2014-07-28 2016-02-03 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Audiokodierung und -decodierung mit Nutzung eines Frequenzdomänenprozessors, eines Zeitdomänenprozessors und eines Kreuzprozessors zur Initialisierung des Zeitdomänenprozessors
US10847170B2 (en) * 2015-06-18 2020-11-24 Qualcomm Incorporated Device and method for generating a high-band signal from non-linearly processed sub-ranges

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI98104C (fi) * 1991-05-20 1997-04-10 Nokia Mobile Phones Ltd Menetelmä herätevektorin generoimiseksi ja digitaalinen puhekooderi
JPH10133697A (ja) * 1996-09-05 1998-05-22 Seiko Epson Corp 音声符号化方法およびその装置
JP3174756B2 (ja) * 1998-03-31 2001-06-11 松下電器産業株式会社 音源ベクトル生成装置及び音源ベクトル生成方法
JP3235543B2 (ja) * 1997-10-22 2001-12-04 松下電器産業株式会社 音声符号化／復号化装置
JP3175667B2 (ja) * 1997-10-28 2001-06-11 松下電器産業株式会社 ベクトル量子化法
EP1746583B1 (de) * 1997-10-22 2008-09-17 Matsushita Electric Industrial Co., Ltd. Tonkodierer und Tondekodierer
US6480822B2 (en) 1998-08-24 2002-11-12 Conexant Systems, Inc. Low complexity random codebook structure
JP4173940B2 (ja) * 1999-03-05 2008-10-29 松下電器産業株式会社 音声符号化装置及び音声符号化方法
US6449313B1 (en) * 1999-04-28 2002-09-10 Lucent Technologies Inc. Shaped fixed codebook search for celp speech coding
US6236960B1 (en) * 1999-08-06 2001-05-22 Motorola, Inc. Factorial packing method and apparatus for information coding

Also Published As

Publication number Publication date
US8271274B2 (en) 2012-09-18
CN101401153B (zh) 2011-11-16
US20090222273A1 (en) 2009-09-03
WO2007096550A2 (fr) 2007-08-30
EP1994531A2 (de) 2008-11-26
WO2007096550A3 (fr) 2007-10-11
ATE520121T1 (de) 2011-08-15
CN101401153A (zh) 2009-04-01
JP5188990B2 (ja) 2013-04-24
JP2009527784A (ja) 2009-07-30
KR101370017B1 (ko) 2014-03-05
KR20080110757A (ko) 2008-12-19

Similar Documents

Publication Publication Date Title
EP1994531B1 (de) Verbesserte celp kodierung oder dekodierung eines digitalen audiosignals
EP1692689B1 (de) Optimiertes mehrfach-codierungsverfahren
EP0801790B1 (de) Verfahren zur sprachkodierung mittels analyse durch synthese
EP0749626A1 (de) Verfahren zur sprachkodierung mittels linearer prädiktion und anregung durch algebraische kodes
EP0782128A1 (de) Verfahren zur Analyse eines Audiofrequenzsignals durch lineare Prädiktion, und Anwendung auf ein Verfahren zur Kodierung und Dekodierung eines Audiofrequenzsignals
WO2009033288A1 (en) Method and device for fast algebraic codebook search in speech and audio coding
EP0801788B1 (de) Verfahren zur sprachkodierung mittels analyse durch synthese
EP0801789B1 (de) Verfahren zur sprachkodierung mittels analyse durch synthese
EP2080194B1 (de) Dämpfung von stimmüberlagerung, im besonderen zur erregungserzeugung bei einem decoder in abwesenheit von informationen
EP1836699B1 (de) Verfahren und Vorrichtung zur Ausführung einer optimalizierten Audiokodierung zwischen zwei Langzeitvorhersagemodellen
WO2005066936A1 (fr) Transcodage entre indices de dictionnaires multi-impulsionnels utilises en codage en compression de signaux numeriques
EP2589045B1 (de) Adaptive lineare prädiktive codierung/decodierung
EP1192619B1 (de) Audio-kodierung, dekodierung zur interpolation
EP1194923B1 (de) Verfahren und system für audio analyse und synthese
EP1192618B1 (de) Audiokodierung mit adaptiver lifterung
EP1192621B1 (de) Audiokodierung mit harmonischen komponenten
WO2002029786A1 (fr) Procede et dispositif de codage segmental d'un signal audio
WO2013135997A1 (fr) Modification des caractéristiques spectrales d'un filtre de prédiction linéaire d'un signal audionumérique représenté par ses coefficients lsf ou isf
WO2001003121A1 (fr) Codage et decodage audio avec composants harmoniques et phase minimale
WO2001003119A1 (fr) Codage et decodage audio incluant des composantes non harmoniques du signal
FR2739482A1 (fr) Procede et dispositif pour l'evaluation du voisement du signal de parole par sous bandes dans des vocodeurs

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: 20080812

AK Designated contracting states

Kind code of ref document: A2

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

17Q First examination report despatched

Effective date: 20091118

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RTI1 Title (correction)

Free format text: IMPROVED CELP CODING OR DECODING OF A DIGITAL AUDIO SIGNAL

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 LT LU LV 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

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: FRENCH

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602007016433

Country of ref document: DE

Effective date: 20111006

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20110810

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20110810

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

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: 20110810

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: 20111210

Ref country code: LT

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: 20110810

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: 20111212

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: 20110810

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: 20110810

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 520121

Country of ref document: AT

Kind code of ref document: T

Effective date: 20110810

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

Ref country code: LV

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: 20110810

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: 20110810

Ref country code: PL

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: 20110810

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: 20110810

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: 20111111

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: 20110810

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: 20110810

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: 20110810

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: 20110810

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

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: 20110810

Ref country code: IT

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: 20110810

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: 20110810

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: 20110810

26N No opposition filed

Effective date: 20120511

BERE Be: lapsed

Owner name: FRANCE TELECOM

Effective date: 20120228

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007016433

Country of ref document: DE

Effective date: 20120511

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: 20120229

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: CH

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

Effective date: 20120229

Ref country code: LI

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

Effective date: 20120229

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

Ref country code: BE

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

Effective date: 20120228

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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20111121

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

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: 20111110

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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20110810

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: 20120213

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

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: 20070213

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

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

Ref country code: DE

Payment date: 20160121

Year of fee payment: 10

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

Ref country code: GB

Payment date: 20160127

Year of fee payment: 10

Ref country code: FR

Payment date: 20160121

Year of fee payment: 10

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602007016433

Country of ref document: DE

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

Effective date: 20170213

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20171031

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: 20170228

Ref country code: DE

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

Effective date: 20170901

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

Ref country code: GB

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

Effective date: 20170213