EP0475520B1 - Méthode et dispositif de codage d'un signal analogique présentant un caractère répétitif - Google Patents

Méthode et dispositif de codage d'un signal analogique présentant un caractère répétitif Download PDF

Info

Publication number
EP0475520B1
EP0475520B1 EP91202274A EP91202274A EP0475520B1 EP 0475520 B1 EP0475520 B1 EP 0475520B1 EP 91202274 A EP91202274 A EP 91202274A EP 91202274 A EP91202274 A EP 91202274A EP 0475520 B1 EP0475520 B1 EP 0475520B1
Authority
EP
European Patent Office
Prior art keywords
segment
samples
coded
signal
segments
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.)
Expired - Lifetime
Application number
EP91202274A
Other languages
German (de)
English (en)
Other versions
EP0475520A3 (en
EP0475520A2 (fr
Inventor
Adrianus Alphonsius Maria Van Der Krogt
Robertus Lambertus Adrianus Van Ravesteijn
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.)
Koninklijke PTT Nederland NV
Original Assignee
Koninklijke PTT Nederland NV
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=19857655&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP0475520(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Koninklijke PTT Nederland NV filed Critical Koninklijke PTT Nederland NV
Publication of EP0475520A2 publication Critical patent/EP0475520A2/fr
Publication of EP0475520A3 publication Critical patent/EP0475520A3/en
Application granted granted Critical
Publication of EP0475520B1 publication Critical patent/EP0475520B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

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/09—Long term prediction, i.e. removing periodical redundancies, e.g. by using adaptive codebook or pitch predictor

Definitions

  • the invention relates to a method for coding a sampled analog signal having a repetitive nature, in which, for every signal segment to be coded consisting of a predetermined first number of samples, a search is made in a preceding segment containing a predetermined second number of samples which is greater than the first number of samples for a signal segment which is as similar as possible by comparing the signal segment to be coded, in steps of one sample interval, with a segment containing the first number of samples which forms part of the segment containing the second number of samples, and in which the difference signal is determined between the found, most similar segment and the segment to be coded as well as the difference between a reference time instant in the segment to be coded and a reference time instant in the found, most similar segment, expressed in the number of samples D between the two time instants.
  • analog signals having a strongly consistent nature such as, for example, speech signals can be coded after sampling in an efficient manner by consecutively carrying out a number of different transformations on consecutive segments of the signalwhich each have a particular time duration.
  • LPC linear predictive coding
  • One of the known transformations for this purpose is linear predictive coding (LPC), for an explanation of which a reference can be made to the book entitled "Digital Processing of Speech Signals" by L.R. Rabiner and R.W. Schafer; Prentice Hall, New Jersey; chapter 8.
  • LPC linear predictive coding
  • LPC linear predictive coding
  • LTP long-term prediction
  • LTP for a signal segment to be coded, a search is made for a segment with the greatest possible similarity in a signal period, preceding the said segment, having a particular duration and a signal which is representative of the difference between the segment to be coded and the found segment, and also a signal which is representative of the time duration which has elapsed since the found segment, is transmitted in coded form, which can result in an appreciable reduction of the information to be transmitted.
  • HLTP high-resolution LTP
  • the object of the invention is to provide a method in which an improvement in the LTP principle is obtained in that the chance that the segment with the greatest similarity in a preceding period having a particular duration is found increases considerably without the number of operations needed in doing this increasing to the same extent as in the case of HLTP.
  • Figure 1a shows, in the time domain, an example of the sampled version of a signal having a strongly repetitive nature, such as a speech signal.
  • a search is always made in a preceding period of 15 ms for the segment of likewise 5 ms having the greatest similarity and that the sampling frequency is 8kHz.
  • segment A the segment to be coded in this connection
  • segment B the period of 15 ms segment B
  • the wanted segment with the greatest similarity segment C are shown in Figure 1a.
  • LTP the principle of LTP is that, before the transmission of segment A, no signals are transmitted which are directly related to the samples in segment A, but firstly signals which are related to the sample values which are produced if the difference signal between segment A and segment C is determined, and in the second place, signals which are related to the time difference between segment A and segment C, expressed, for example, in the number of samples D between the beginning of segment A and the beginning of segment C.
  • segment A can now be formed because segment C is in principle already known in the decoder, for example because the samples over the preceding 15 ms are always stored in a memory so that the samples from the segment can be read out of the memory with the received signal which is representative of the difference D in number of samples between the beginning of the segments A and C, after which the segment A can be formed with the signal, also received, which is representative of the difference between the sample values of segment A and segment C.
  • the complexity of the LTP principle can be defined as follows. In segment A, 40 samples are present,and in segment B 120 samples. The segment B therefore has to be investigated in 81 steps by "shifting" the entire segment A in steps equal to a sample interval over segment B and at every step determining the degree of agreement, expressed in a correlation value, by means of correlation techniques. Said correlation value R(k) can be calculated by means of the formula: where:
  • correlation technique For a more detailed explanation of this correlation technique, reference can be made to page 147 of the abovementioned book by L. R. Rabiner.
  • correlation techniques can also be used in principle, as well as other techniques for determining the agreement between two groups of sample values, which other techniques are deemed to fall within the definition of correlation.
  • the segment B of 1440 samples now has to be searched in 961 steps by again shifting segment A oversegment B.
  • R(k) the above formula explained for the LTP principle can be used.
  • it is not necessary to calculate a correlation value also for the intermediate sample values, so that for every value of k (k 0 ... 960) 79 operations are necessary, just as in the case of LTP.
  • the spacing D between the beginning of segment A and the beginning of the segment C found can again be expressed in the number of samples between the two time instants (not more than 961) and can thus be reproduced in 10 bits.
  • the segment C with the greatest similarity is sought in the manner to be described below, which is less complex than the HLTP principle, the chance that the segment found is actually the segment with the greatest similarity being appreciably greater than in the case of the LTP principle.
  • the segment C having the greatest similarity to the segment A is first sought, according to the LTP principle explained above, in a segment B preceding a segment A to be coded.
  • This segment C is situated at a number D of samples from the segment A.
  • the found segment C ends up at a spacing equal to (D ⁇ Ob) from segment A.
  • the complexity of the method according to the invention with respect to that of LTP and HLTP can be calculated as follows: In the method according to the invention, if the same time duration of the segments A and B (5 and 15 ms, respectively) and the same sampling frequency (8 kHz) is assumed as in the example of the LTP principle described above, 6399 operations are necessary to find the segment C1.
  • the sampling frequency is increased by a factor of 12, for example by always placing 11 samplevalues equal to 0 between two consecutive known samples and by only calculating the actual sample value for samples at predetermined positions, for example by means of interpolating 7 already known samples. These predetermined positions are the positions of the samples which are situated at a spacing Dd from the original samples in the segment A.
  • the sampling frequency of the segment A is also increased and, just as in the case of HLTP, this is done by always placing 11 samples having a value equal to 0 between two known samples. Segment A therefore consists of 480 samples, of which a maximum of 40 are not equal to 0.
  • this latter segment is in fact the wanted segment because the fundamental regularity P which is present in the signal and which, for example in the case of speech, is determined by the fundamental frequency of the vocal cords, is determined by the spacing D1 between segment A and segment C1 and not by the spacing D2 between segment A and segment C2.
  • This phenomenon may be due, for example, to the presence of noise.
  • the segment Cd which is situated nearest segment A that is to say the segment having the smallest value for D
  • the segment C1 is chosen. The method described above for seeking the most suitable segment C, taking account of the regularity P in the signal, is shown in a flow chart in Figure 2.
  • the invention therefore also relates to a method for coding a sampled analog signal having a repetitive nature, in which, for a signal segment to be coded consisting of a predetermined first number of samples, a search is always made in a preceding segment containing a predetermined second number of samples which is greater than the first number of samples for a signal segment which agrees as well as possible by always comparing the signal segment to be coded, in steps of one sample interval, with a segment containing the first number of samples which forms part of the segment containing the second number of samples, and in which the difference signal is determined between the found, most similar segment and the segment to be coded as well as the difference between a reference time instant in the segment to be coded and a reference time instant in the found, most similar segment, expressed in the number of samples D between the two time instants, characterised in that of the partial segments compared with the segment to be coded that segment is chosen as the partial segment with the greatest agreement which has a correlation value R with the samples of the segment to be coded for which R
  • FIG. 3a shows a block diagram of a coding/decoding system for carrying out the method according to the invention in the case of a speech signal comprising a coding unit 10 and a decoding unit 30.
  • An analog signal delivered by a microphone 11 is limited in bandwidth by a low pass filter 12 and converted in an analog/digital convertor into a series of sampled values which are representative of the analog signal.
  • the output signal of the convertor 13 is fed to the inputs of a short-term prediction filter 14 and of a short-term analysis unit 15.
  • These two units provide the above-mentioned short-term prediction and the analysis unit 15 provides an output signal in the form of short-term prediction filter coefficients, which output signal is transmitted to the decoder 30.
  • the structure and the operation of the filter 14 and the unit 15 are well known to those skilled in the field of speech coding and are not of further importance for the essence of the present invention, so that a further explanation can be omitted.
  • Said unit 17 is shown in greater detail in Figure 3b and comprises a unit 18 for splitting off the segment A, possibly the output signal of unit 16 can also be used for this purpose, and also a unit 19 for splitting off the segment B.
  • the output signals of the units 18 and 19 are fed to a circuit 20 in which the correlation value R c1 is calculated for the segment C1 in the manner outlined above and also the value of D is determined.
  • the calculated value of D is transmitted to the decoder 30 and is also fed to a unit 21 which is designed to calculate the different values of Dd on the basis of the pre-chosen values for d and Ob.
  • the value of Dd and the segment B are fed to a unit 22 for the purpose of calculating the segments Cd.
  • the calculated Cd's are fed to a circuit 23 which calculates with the aid of formula (1) the correlation values R cd for the different segments Cd on the basis of the segment A also fed to it.
  • the correlation values R c1 and R cd are compared with one another (see also Figure 2), and d optimum is determined in the manner described above and transmitted to the decoder.
  • the optimum segment Cd determined in the unit 25 is subtracted sample by sample from corresponding samples of the segment A in a subtraction unit 26 and the resultant difference signal is quantified in a manner known per se in a unit 27 and coded in a unit 28 in order to be transmitted to the decoding unit 30.
  • the difference signal received is decoded in a decoder 31 while the segment Cd opt is reconstructed in a unit 32 from the received values of D and d opt and from the previously received and reconstructed signal segment B.
  • the decoded difference signal and the segment Cd opt are added sample by sample in order thus to reconstruct the segment A.
  • the reconstructed segment Aand the received short-term prediction filter coefficients are fed to an inverse short-term prediction filter which reconstructs the transmitted signal samples as well as possible in a manner known per se.
  • the output signal of the filter 34 is converted in a digital/analog convertor into an analog signal which is fed to a loudspeaker 37 via a pass filter 36.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Acoustics & Sound (AREA)
  • Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Computational Linguistics (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
  • Transmission Systems Not Characterized By The Medium Used For Transmission (AREA)
  • Investigating Or Analysing Biological Materials (AREA)
  • Analogue/Digital Conversion (AREA)
  • Investigating Or Analysing Materials By The Use Of Chemical Reactions (AREA)
  • Nitrogen Condensed Heterocyclic Rings (AREA)

Claims (5)

  1. Procédé de codage d'un signal analogique échantillonné présentant un caractère répétitif, dans lequel, pour chaque segment de signal à coder, constitué d'un premier nombre prédéterminé d'échantillons, on recherche, dans un segment antérieur contenant un second nombre prédéterminé d'échantillons qui est plus grand que le premier nombre d'échantillons, un segment de signal qui soit aussi ressemblant que possible, en comparant, par pas d'un intervalle d'échantillon, le segment de signal à coder à un segment contenant le premier nombre d'échantillons qui fait partie du segment contenant le second nombre d'échantillons ; et dans lequel on détermine le signal différence entre le segment le plus ressemblant trouvé et le segment à coder, ainsi que la différence entre un instant de référence du segment à coder et un instant de référence du segment le plus ressemblant trouvé exprimée par le nombre d'échantillons D entre les deux instants ; caractérisé en ce que l'on augmente, d'un facteur prédéterminé Ob, le nombre des échantillons dans le segment à coder, en plaçant (Ob-1) échantillons ayant une valeur égale à O entre deux échantillons consécutifs ; en ce que l'on augmente également du facteur Ob, par suréchantillonnage, le nombre des échantillons dans le segment antérieur ; en ce que, l'on détermine, dans le segment antérieur, des segments partiels Cd pour lesquels le nombre d'échantillons Dd, exprimé par les nombres d'échantillons après suréchantillonnage, entre l'instant de référence dans le segment à coder et l'instant de référence dans un segment partiel Cd, satisfait : Dd = (D ∗ Ob)/d
    Figure imgb0004
        dans laquelle d = 1, 2, 3, 4, ...n, où n est un nombre entier positif, et Ob et n sont choisis de manière telle que Dd soit toujours un nombre entier ; en ce que, dans les segments Cd, on détermine les valeurs d'échantillon par une technique d'interpolation au droit de positions prédéterminées, lesquelles positions prédéterminées sont situées à un écartement de Dd échantillons par rapport aux échantillons d'origine dans le segment à coder, avant que l'on ait augmenté son nombre d'échantillons ; et en ce que l'on détermine un segment partiel Cd qui est le plus ressemblant au segment à coder.
  2. Procédé selon la revendication 1, caractérisé en ce que la comparaison entre le segment à coder et les segments Cd s'effectue également pour des segments pour lesquels : Dd = (D ∗ Ob)/d + eps, où eps est égal à au moins une partie des valeurs dans la plage de eps =-(Ob-1), ..., -2, -1, +1, +2, ... (Ob-1).
  3. Procédé selon la revendication 1 ou 2, caractérisé en ce que parmi les segments Cd, on choisit, comme segment le plus ressemblant, le segment Cd qui a une valeur de corrélation Rd avec les échantillons du segment à coder pour lequel : R ≥ q. Rmax, où q < 1, et Rmax est la valeur de corrélation maximale que l'on a trouvée en corrélant les segments Cd et le segment à coder et qui est le segment qui donne pour Dd la valeur associée la plus petite.
  4. Procédé de codage d'un signal analogique échantillonné présentant un caractère répétitif, dans lequel, pour chaque segment de signal à coder, constitué d'un premier nombre prédéterminé d'échantillons, on recherche, dans un segment antérieur contenant un second nombre prédéterminé d'échantillons qui est plus grand que le premier nombre d'échantillons, un segment de signal qui est aussi ressemblant que possible, en comparant, par pas d'un intervalle d'échantillon, le segment de signal à coder à un segment contenant le premier nombre d'échantillons qui fait partie du segment contenant le second nombre d'échantillons ; et dans lequel on détermine le signal différence entre le segment le plus ressemblant trouvé et le segment à coder, ainsi que la différence entre un instant de référence du segment partiel à coder et un instant de référence du segment le plus ressemblant trouvé exprimée par le nombre d'échantillons D entre les deux instants, caractérisé en ce que parmi les segments partiels comparés au segment à coder, on choisit, comme segment partiel qui a la plus grande correspondance, le segment qui a une valeur de corrélation R avec les échantillons du segment à coder pour lequel : R ≥ q. Rmax, où q < 1, et Rmax est la valeur de corrélation maximale que l'on a trouvée en corrélant les segments partiels provenant des segments antérieurs et le segment à coder et qui est le segment qui donne pour D la valeur associée la plus petite.
  5. Dispositif de codage d'un signal analogique ayant un caractère répétitif, comprenant : un moyen pour échantillonner le signal à coder ; un moyen pour séparer un segment de signal à coder contenant un premier nombre prédéterminé d'échantillons ; un moyen pour séparer un segment de signal antérieur contenant un second nombre d'échantillons ; un moyen pour comparer, par pas d'un intervalle d'échantillon, les valeurs d'échantillon du premier segment avec les valeurs d'échantillon correspondantes d'un segment partiel contenant le premier nombre d'échantillons qui fait partie du segment antérieur ; un moyen pour déterminer le segment partiel qui présente la plus grande ressemblance avec le segment de signal à coder ; un moyen pour déterminer un signal qui est représentatif de la différence entre le segment à coder et le segment partiel trouvé ; et un moyen pour déterminer le nombre d'échantillons D entre un instant de référence dans le segment à coder et un instant de référence dans le segment partiel trouvé ; caractérisé en ce qu'il comprend en outre un moyen pour suréchantillonner le segment de signal à coder à l'aide d'un facteur prédéterminé Ob ; un moyen pour déterminer la valeur Dd = (D ∗ Ob)/d, où d = 2, 3, 4, ..., n ; un moyen d'interpolation pour déterminer, par interpolation, pour chaque valeur de d, les échantillons à tous les instants qui différent de Dd échantillons des instants associés aux valeurs d'échantillon d'origine ; et un moyen pour corréler les valeurs d'échantillon du segment à coder et les valeurs d'échantillon déterminées pour une valeur de d.
EP91202274A 1990-09-10 1991-09-06 Méthode et dispositif de codage d'un signal analogique présentant un caractère répétitif Expired - Lifetime EP0475520B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NL9001985A NL9001985A (nl) 1990-09-10 1990-09-10 Werkwijze voor het coderen van een analoog signaal met een herhalend karakter en een inrichting voor het volgens deze werkwijze coderen.
NL9001985 1990-09-10

Publications (3)

Publication Number Publication Date
EP0475520A2 EP0475520A2 (fr) 1992-03-18
EP0475520A3 EP0475520A3 (en) 1992-09-30
EP0475520B1 true EP0475520B1 (fr) 1996-04-24

Family

ID=19857655

Family Applications (1)

Application Number Title Priority Date Filing Date
EP91202274A Expired - Lifetime EP0475520B1 (fr) 1990-09-10 1991-09-06 Méthode et dispositif de codage d'un signal analogique présentant un caractère répétitif

Country Status (11)

Country Link
EP (1) EP0475520B1 (fr)
JP (1) JP2640595B2 (fr)
AT (1) ATE137354T1 (fr)
CA (1) CA2050979C (fr)
DE (1) DE69119005T2 (fr)
DK (1) DK0475520T3 (fr)
ES (1) ES2089113T3 (fr)
FI (1) FI105624B (fr)
NL (1) NL9001985A (fr)
NO (1) NO302549B1 (fr)
PT (1) PT98900B (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI116992B (fi) 1999-07-05 2006-04-28 Nokia Corp Menetelmät, järjestelmä ja laitteet audiosignaalin koodauksen ja siirron tehostamiseksi
US7388201B2 (en) 2005-05-13 2008-06-17 National University Of Singapore Radiation detector having coated nanostructure and method
CN117176177B (zh) * 2023-11-03 2024-02-06 金乡县林业保护和发展服务中心(金乡县湿地保护中心、金乡县野生动植物保护中心、金乡县国有白洼林场) 一种用于林业信息的数据共享方法及系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5648688A (en) * 1979-09-28 1981-05-01 Hitachi Ltd Sound analyser
DE3783905T2 (de) * 1987-03-05 1993-08-19 Ibm Verfahren zur grundfrequenzbestimmung und sprachkodierer unter verwendung dieses verfahrens.

Also Published As

Publication number Publication date
NL9001985A (nl) 1992-04-01
ATE137354T1 (de) 1996-05-15
DE69119005T2 (de) 1996-11-28
DE69119005D1 (de) 1996-05-30
EP0475520A3 (en) 1992-09-30
FI914261A0 (fi) 1991-09-10
JPH05206955A (ja) 1993-08-13
NO302549B1 (no) 1998-03-16
FI914261A (fi) 1992-03-11
EP0475520A2 (fr) 1992-03-18
CA2050979C (fr) 1996-05-21
CA2050979A1 (fr) 1992-03-11
NO913448L (no) 1992-03-11
JP2640595B2 (ja) 1997-08-13
ES2089113T3 (es) 1996-10-01
PT98900B (pt) 1999-02-26
NO913448D0 (no) 1991-09-03
PT98900A (pt) 1994-01-31
FI105624B (fi) 2000-09-15
DK0475520T3 (da) 1996-09-02

Similar Documents

Publication Publication Date Title
KR100275054B1 (ko) 음성코딩 장치 및 음성엔코딩방법
KR100253136B1 (ko) 저계산 복잡도의 디지탈 필터뱅크
US5265190A (en) CELP vocoder with efficient adaptive codebook search
US5371853A (en) Method and system for CELP speech coding and codebook for use therewith
DE69634645T2 (de) Verfahren und Vorrichtung zur Sprachkodierung
KR100426514B1 (ko) 복잡성이감소된신호전송시스템
US5179594A (en) Efficient calculation of autocorrelation coefficients for CELP vocoder adaptive codebook
AU653969B2 (en) A method of, system for, coding analogue signals
JPH04270398A (ja) 音声符号化方式
EP0578436B1 (fr) Application sélective de techniques de codage de parole
EP0602826B1 (fr) Décalement du temps pour codage avec analyse par synthèse
EP0475520B1 (fr) Méthode et dispositif de codage d&#39;un signal analogique présentant un caractère répétitif
CA2166138C (fr) Codeur vocal celp dote d&#39;un predicteur a long terme ameliore
US5528629A (en) Method and device for coding an analog signal having a repetitive nature utilizing over sampling to simplify coding
US6157907A (en) Interpolation in a speech decoder of a transmission system on the basis of transformed received prediction parameters
CA2053133C (fr) Methode et dispositif de codage et de decodage de signaux analogiques echantillonnes de nature repetitive
RU2130233C1 (ru) Система передачи с восстановлением пропущенных отсчетов сигнала
US4908863A (en) Multi-pulse coding system
US4962536A (en) Multi-pulse voice encoder with pitch prediction in a cross-correlation domain
US4873724A (en) Multi-pulse encoder including an inverse filter
JP3249144B2 (ja) 音声符号化装置
JPH0651799A (ja) 音声メッセージ符号化装置と復号化装置とを同期化させる方法
JP3112462B2 (ja) 音声符号化装置
KR100283087B1 (ko) 음성 및 톤 부호화 방법
JPH0632030B2 (ja) 音声符号化方法

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

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH DE DK ES FR GB GR IT LI LU NL SE

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH DE DK ES FR GB GR IT LI LU NL SE

17P Request for examination filed

Effective date: 19930310

17Q First examination report despatched

Effective date: 19951002

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE DK ES FR GB GR IT LI LU NL SE

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

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 PRE;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.SCRIBED TIME-LIMIT

Effective date: 19960424

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

REF Corresponds to:

Ref document number: 137354

Country of ref document: AT

Date of ref document: 19960515

Kind code of ref document: T

REG Reference to a national code

Ref country code: CH

Ref legal event code: NV

Representative=s name: ISLER & PEDRAZZINI AG PATENTANWAELTE

REF Corresponds to:

Ref document number: 69119005

Country of ref document: DE

Date of ref document: 19960530

ET Fr: translation filed
REG Reference to a national code

Ref country code: DK

Ref legal event code: T3

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

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2089113

Country of ref document: ES

Kind code of ref document: T3

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2089113

Country of ref document: ES

Kind code of ref document: T3

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

26N No opposition filed
REG Reference to a national code

Ref country code: CH

Ref legal event code: PFA

Free format text: KONINKLIJKE PTT NEDERLAND N.V. TRANSFER- KONINKLIJKE KPN N.V.

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

REG Reference to a national code

Ref country code: FR

Ref legal event code: CA

Ref country code: FR

Ref legal event code: CD

REG Reference to a national code

Ref country code: CH

Ref legal event code: PCAR

Free format text: ISLER & PEDRAZZINI AG;POSTFACH 1772;8027 ZUERICH (CH)

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

Ref country code: ES

Payment date: 20100924

Year of fee payment: 20

Ref country code: CH

Payment date: 20100923

Year of fee payment: 20

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

Ref country code: FR

Payment date: 20101005

Year of fee payment: 20

Ref country code: AT

Payment date: 20100914

Year of fee payment: 20

Ref country code: SE

Payment date: 20100914

Year of fee payment: 20

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

Ref country code: GB

Payment date: 20100921

Year of fee payment: 20

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

Ref country code: NL

Payment date: 20100916

Year of fee payment: 20

Ref country code: DK

Payment date: 20100913

Year of fee payment: 20

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

Ref country code: DE

Payment date: 20100922

Year of fee payment: 20

Ref country code: BE

Payment date: 20100913

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69119005

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69119005

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: V4

Effective date: 20110906

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: DK

Ref legal event code: EUP

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20110905

BE20 Be: patent expired

Owner name: KONINKLIJKE *PTT NEDERLAND N.V.

Effective date: 20110906

REG Reference to a national code

Ref country code: SE

Ref legal event code: EUG

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 EXPIRATION OF PROTECTION

Effective date: 20110905

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 EXPIRATION OF PROTECTION

Effective date: 20110906

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20120509

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 EXPIRATION OF PROTECTION

Effective date: 20110907

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 EXPIRATION OF PROTECTION

Effective date: 20110907