EP0472460A1 - Verfahren und Einrichtung für digitale Funktelefonie, insbesondere zellular-funktelefonische Kommunikation mit Mobilen - Google Patents

Verfahren und Einrichtung für digitale Funktelefonie, insbesondere zellular-funktelefonische Kommunikation mit Mobilen Download PDF

Info

Publication number
EP0472460A1
EP0472460A1 EP91402262A EP91402262A EP0472460A1 EP 0472460 A1 EP0472460 A1 EP 0472460A1 EP 91402262 A EP91402262 A EP 91402262A EP 91402262 A EP91402262 A EP 91402262A EP 0472460 A1 EP0472460 A1 EP 0472460A1
Authority
EP
European Patent Office
Prior art keywords
frequencies
frequency
numbers
bits
station
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP91402262A
Other languages
English (en)
French (fr)
Other versions
EP0472460B1 (de
Inventor
Michel Mouly
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.)
Nortel Networks France SAS
Original Assignee
Matra Communication 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 Matra Communication SA filed Critical Matra Communication SA
Publication of EP0472460A1 publication Critical patent/EP0472460A1/de
Application granted granted Critical
Publication of EP0472460B1 publication Critical patent/EP0472460B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/12—Fixed resource partitioning
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/14—Conversion to or from non-weighted codes
    • H03M7/18—Conversion to or from residue codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/715—Interference-related aspects

Definitions

  • the present invention relates in general to digital radio telephony methods and installations, the implementation of which requires that a fixed infrastructure broadcasts periodically and at high frequency, to transceiver stations, frequency order numbers constituting any subset, of cardinal at most equal to a determined value n, of a set of predetermined frequencies of cardinal N.
  • the invention finds a particularly important application in radiotelephony (the term radiotelephony having to be interpreted in a broad sense and as concerning as well the transmission of data as that of speech) qualified as cellular, whose standards are in progress preparation by the European conference of postal and telecommunications administrations.
  • radiotelephony the term radiotelephony having to be interpreted in a broad sense and as concerning as well the transmission of data as that of speech
  • the invention finds a particularly important application in radiotelephony (the term radiotelephony having to be interpreted in a broad sense and as concerning as well the transmission of data as that of speech) qualified as cellular, whose standards are in progress preparation by the European conference of postal and telecommunications administrations.
  • a description of the general characteristics of these installations can be found in the article "The European digital cellular system for communication with mobiles", by B. GHILLEBAERT and others, in l'Echo des Diegos, n ° 131, first quarter 1988.
  • the infrastructure In a cellular radio telephone installation as defined above, the infrastructure must transmit, over broadcast channels, two lists of frequencies repeated at regular intervals.
  • a first list is that of the frequencies on which, in a given cell or zone, the mobile unit must operate in frequency hopping modulation.
  • a second list is that of the frequencies of the broadcasting channels that the station must monitor in standby mode, in order to make a cell selection, and in online mode, for measurement and comparison purposes.
  • the mode of transmission must make it possible to adopt any of the possible subsets, which excludes the method which consists, in the case of a limited number of subsets, of assigning to each an identification number which would be transmitted alone.
  • the individual transmission of the serial number of each frequency of the selected subset would require, in the most unfavorable case, to code 16 serial numbers, each on 10 bits.
  • the present invention aims, in general, to reduce the volume of binary information necessary to transmit the frequency sequence numbers to be used, these sequence numbers being able to be considered as elements belonging to a set O, ... , N-1. It aims more particularly to give a simple solution to this problem when the number of elements N is equal to or little more than an integer power of 2, that is to say when N is equal to or little more than 2 k (k being an integer).
  • the invention proposes in particular a method of digital radio-telephony, according to which: the broadcasting, from a fixed infrastructure to mobile transceiver stations, is the serial numbers of working frequencies, constituting a any subset, of cardinal at most equal to a determined value n, a set of predetermined frequencies of cardinal N; frequencies in the subset are identified in each listening position from the serial numbers and the station is operated on the identified frequencies,
  • the sequence numbers of frequencies belonging to a set whose cardinal N is between 2 k ⁇ 1 and 2 k the number V of the frequency for which half of the remaining frequencies has a lower sequence number and half of the remaining frequencies has a sequence number greater than -V, modulo the total number of frequencies; the number of the frequency retained on k bits is identified; the serial numbers of the two divided frequency groups are renumbered; the determination of the frequency number is repeated on each group and the two partition frequencies are defined on k-1 bits; the renumbering, determination and definition operations are repeated until the order numbers to be transmitted are exhausted; the sequence numbers of the partition frequencies are transmitted according to a determined sequence known to the transceiver; and the working frequencies are determined from the serial numbers in the station.
  • lower order number and “higher order number” should not be interpreted as implying an order relation, but as indicating that the order numbers belong to half of the original set following the value and preceding the value, respectively, in a circular arrangement.
  • N is of the form 2 k -1 because, this avoids using arithmetic with mixed radical and therefore simplifies the calculations by substituting from simple shifts to multiplication or division operations.
  • the number of possible frequencies that is to say the number N of the elements of the set, is of the form 2 k , for reasons related to the use of a transmission in binary mode.
  • the method according to the invention makes it possible to carry out the transmission over a total number of bits which is close of the theoretical minimum.
  • the gain is not as high in the particular case of cellular digital radio telephony provided by the standard, but it is sufficient to authorize the transmission of all the serial numbers of the 16 frequencies maximum required among 1024 on 128 bits, i.e. 24 bytes, even when reserving 2 header bits.
  • the invention also provides a mobile radio station comprising transmission / reception means on several frequencies defined by serial numbers and constituting a subset of cardinal frequencies at most equal to n, belonging to a set of frequencies whose serial numbers constitute a set of cardinal N, making it possible to implement the method defined above, characterized in that the mobile station includes means making it possible to match a determined frequency with each of the numbers order of the assembly and a decoder making it possible to supply said means with the real order number, in clear, from a message established by the process defined above.
  • the means can be constituted by a processor, which is in any case necessary in the mobile station to fulfill other functions, when the various possible frequencies are deduced from each other by an algorithm involving the serial number.
  • These means can have other constitutions and for example use a correspondence table stored in a programmable read only memory.
  • the coding comes down to a process of identifying the elements, the maximum number of which is n, of a subset by a partition process implementing a tree selection structure, the coding of an element depending on the elements previously selected.
  • the selection of the nodes can be carried out by a simple, but slow process, consisting in carrying out a test on each element in turn; we can also consider fast, but more complex algorithms.
  • the values assigned to all the nodes have a number of bits independent of the values to be coded, that is to say of the sequence numbers themselves, and only depend on predetermined conventions, memorized on transmission. and at the reception, and the cardinal of the assembly.
  • the decoding operations in the mobile station, where the chosen conventions are memorized, are inverse to those which have just been described.
  • the processor first identifies the first node, whose serial number is given directly in binary coding. He then performs the numbering required to reconstruct the first two descendants. Finally, the processor, by using the predetermined algorithm linking the frequency values to their serial numbers, supplies the transmitting and receiving part of the station with the frequency values corresponding to the channels to be monitored and / or to the channel on which must be sent for communication with the infrastructure.
  • a frequency chosen arbitrarily, is identified by a single bit. Its presence or absence is indicated simply by sending a bit. This frequency must be stored in the mobile unit. It can be f0 or f1 023 for example. This leaves a maximum of sixteen elements consisting of sixteen numbers between 1 and 1,023 to be transmitted.
  • the node is chosen so that there is one more element in the group on the left: the otherwise could be used, the main thing being that it is stored in the station.
  • the first node is coded on 10 bits, even when a lower number of bits would suffice.
  • the second node is formed by the descendant of the first node, arbitrarily in the group on the left, renumbered from nine, that is to say the opposite of 520. This renumbering is indicated in brackets in the table above. We see that the value 112, (corresponding to the element originally numbered 121), divides the group into two subgroups of four and three elements respectively.
  • the third node is formed by the descendant of the first in the right group.
  • the value 53 separates this group into two sub-groups of three elements, between 54 and the value 309 opposite 53.
  • the second and third nodes can be coded on nine bits, since their value is lower than 512.
  • each even node 2m is the left descendant of the node m while the odd node 2m + 1 is the right descendant of the node m.
  • mixed radical coding is very simple because it is such that there is an exact correspondence between values and words having a decreasing number of bits.
  • Decoding is also very simple.
  • This formulation is used to differentiate from modulo, which is such that 0 ⁇ r ⁇ p-1.
  • Coding and decoding can easily be done by software.
  • a simple decoding program corresponding to a case and to a particular language will be described below, by way of simple example.
  • the bit f0 indicates whether the frequency F0 is present or not: if so, it is immediately identified.
  • serial numbers of the 16 frequencies F1 to F16 or F o to F15 are given by:
  • the program can be as follows, in ADA language. The statements have been skipped because they are obvious:
  • the coding is carried out by a process dual to that of the decoding and consequently the coding program can be deduced directly from the decoding program which has just been given.
  • a first embodiment consists in simplifying the coding by not using completely arithmetic in mixed radical base but rather using the coding of a given value with an integer number of bits.
  • 9 bits can be used to code a value between 0 and 350.
  • the cost in terms of number of bits is approximately 1/2 bit per coded value; for the example given above, the number of bits required is then increased by an amount which is zero when N is equal to 2 k -1, regardless of k integer.
  • Another process which makes it possible to preserve both the pure binary coding and the performances when the cardinal of the set is little more than 2 k -1 consists in using a cartography for the values beyond 2 k -1.
  • Another alternative embodiment makes it possible to adapt the coding and decoding method described above to the case where the possible subsets represent only a determined fraction of all the subsets of the set of N elements.
  • This variant involves giving, at the start of the format, an indication of the domain or of the fraction of the set in which all the elements of the subsets to be coded are found.
  • a first solution consists in giving the low value and the high value of the domain in which the elements are found. This requires 2 log N-1 bits. The remaining available bits are used to code the values.
  • the relation between the value k such that all the subsets having up to k values can be coded and the domain (maximum value minus minimum value) is the following, in the case of 124 bits maximum:
  • yet another variant consists in not giving the first value exactly, but in indicating only one benchmark among several, indicating that the domain does not descend below this benchmark.
  • the benchmark can for example be chosen from 21 different values in the case considered above.
  • the basic set is defined by giving, in clear, an original frequency among the 1024.
  • the serial number of this frequency being part of the set, the coded part corresponds to the parameters:

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)
EP91402262A 1990-08-20 1991-08-19 Verfahren und Einrichtung für digitale Funktelefonie, insbesondere zellular-funktelefonische Kommunikation mit Mobilen Expired - Lifetime EP0472460B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR9010485A FR2665993B1 (fr) 1990-08-20 1990-08-20 Procede et installation de radio-telephonie numerique, notamment de radio-telephonie cellulaire de communication avec les mobiles.
FR9010485 1990-08-20

Publications (2)

Publication Number Publication Date
EP0472460A1 true EP0472460A1 (de) 1992-02-26
EP0472460B1 EP0472460B1 (de) 1994-12-14

Family

ID=9399741

Family Applications (1)

Application Number Title Priority Date Filing Date
EP91402262A Expired - Lifetime EP0472460B1 (de) 1990-08-20 1991-08-19 Verfahren und Einrichtung für digitale Funktelefonie, insbesondere zellular-funktelefonische Kommunikation mit Mobilen

Country Status (8)

Country Link
EP (1) EP0472460B1 (de)
AU (1) AU638160B2 (de)
DE (1) DE69105871T2 (de)
DK (1) DK0472460T3 (de)
ES (1) ES2064954T3 (de)
FI (1) FI98431C (de)
FR (1) FR2665993B1 (de)
HK (1) HK1004584A1 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2767940A1 (fr) * 1997-08-29 1999-02-26 Canon Kk Procedes et dispositifs de codage et de decodage et appareils les mettant en oeuvre

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4850036A (en) * 1987-08-21 1989-07-18 American Telephone And Telegraph Company Radio communication system using synchronous frequency hopping transmissions

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US850036A (en) * 1905-06-06 1907-04-09 George Morin Telegraphone.

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4850036A (en) * 1987-08-21 1989-07-18 American Telephone And Telegraph Company Radio communication system using synchronous frequency hopping transmissions

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEEE Journal on Selected Areas in Communication, Vol. SAC-5, No. 5, Juin 1987, New York (US), pages 835-848; J-L. DORNSTETTER et al.: "Cellular Efficiency with Slow Frequency Hopping: Analysis of the Digital SHF900 Mobile System", le document en entier. *
International Journal of Electronics, Vol. 61, No. 1, Juillet 1986, London (GB), pages 79-84; S.N. SALOUM et al.: "Binary-to-Residue and Residue-to-Binary Converters", le document en entier. *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2767940A1 (fr) * 1997-08-29 1999-02-26 Canon Kk Procedes et dispositifs de codage et de decodage et appareils les mettant en oeuvre
EP0899888A1 (de) * 1997-08-29 1999-03-03 Canon Kabushiki Kaisha Verfahren und Vorrichtung zur Kodierung und Dekodierung sowie diese gebrauchende Anlage
US6393065B1 (en) 1997-08-29 2002-05-21 Canon Kabushiki Kaisha Coding and decoding methods and devices and equipment using them

Also Published As

Publication number Publication date
FI98431C (fi) 1997-06-10
ES2064954T3 (es) 1995-02-01
DK0472460T3 (da) 1995-05-15
DE69105871T2 (de) 1995-04-27
FI913903A (fi) 1992-02-21
AU8257591A (en) 1992-02-27
DE69105871D1 (de) 1995-01-26
AU638160B2 (en) 1993-06-17
FI913903A0 (fi) 1991-08-19
HK1004584A1 (en) 1998-11-27
EP0472460B1 (de) 1994-12-14
FR2665993A1 (fr) 1992-02-21
FR2665993B1 (fr) 1993-07-30
FI98431B (fi) 1997-02-28

Similar Documents

Publication Publication Date Title
EP1261151B1 (de) Verfahren für Resourcenzuteilung in einem MF-TDMAtelekommunicationseinrichtung
EP0565470B1 (de) Verfahren zur digitalen Funknachrichtenübertragung
EP0752191A1 (de) Verfahren und einrichtungen für nachrichten rundsendungen zu mobilen funkkommunikationsstationen
FR2758026A1 (fr) Procede et systeme pour une demodulation en parallele de plusieurs impulsions de donnees d'un signal cdma
FR2743229A1 (fr) Procede et dispositif de decodage d'un signal code
FR2937491A1 (fr) Procedes de transmission et de gestion de trames de voix, produit programme d'ordinateur, moyen de stockage et dispositifs correspondants.
EP0961264B1 (de) Sende- und Empfangsvorrichtung zur Auswahl eines Quellenkodierers und Verfahren dazu
EP0472460B1 (de) Verfahren und Einrichtung für digitale Funktelefonie, insbesondere zellular-funktelefonische Kommunikation mit Mobilen
EP1050987B1 (de) CDMA-Vielfachzugriffverfahren mit verbesserter Kapazität
FR2785118A1 (fr) Canal module d'acquisition et de poursuite pour un systeme de radiocommunications
EP3934113B1 (de) Verfahren zur übertragung in mehreren frequenzbändern zwischen zwei benachbarten geräten in einem netzwerk
FR2811169A1 (fr) Procede et dispositif de decodage et systemes les mettant en oeuvre
EP1767046B1 (de) Verfahren zur auswahl von empfangsstationen in einem datenfunkübertragungssystem
FR2843504A1 (fr) Procede et systeme pour la determination aveugle de caracteristiques de systeme a sauts de frequence et pour la synchronisation avec celui-ci.
WO2024002898A1 (fr) Procédé de retransmission coopérative dans un système omamrc
EP1249959B1 (de) Verfahren zur Mehrfachsendung von Multimediainformationen in einem zellularen Mobilfunknetz und seine Verwendung
WO2024002886A1 (fr) Procédé de transmission et système omamrc avec une stratégie de sélection lors de retransmissions tenant compte du débit des sources et d'un ou plusieurs échanges de contrôle
WO2023242295A1 (fr) Procédé de retransmission coopérative dans un système omamrc
FR2891973A1 (fr) Procede et dispositif de changement de groupes de datagrammes achemines par des paquets d'un flux de transport recu par un dispositif de reception radiofrequence
WO2023275469A1 (fr) Procede de retransmission cooperative dans un systeme omamrc
FR3136915A1 (fr) Procédé de transmission et système OMAMRC avec une stratégie de sélection lors de retransmissions tenant compte du débit des sources et d’un unique échange de contrôle
FR3141022A1 (fr) Procédé et système OMAMRC avec transmission FDM et coopérations multiples par sous-bande
FR3136920A1 (fr) Procédé de détermination homomorphe du signe d’un message par dilatation, procédés et dispositifs associés
FR2681746A1 (fr) Codeur-generateur de signaux d'identification rds pour station d'emission radiophonique.
FR2729806A1 (fr) Paquet de transmission prevu pour la transmission discontinue

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

Designated state(s): BE DE DK ES GB IT LU NL SE

17P Request for examination filed

Effective date: 19920306

17Q First examination report despatched

Effective date: 19930916

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): BE DE DK ES GB IT LU NL SE

REF Corresponds to:

Ref document number: 69105871

Country of ref document: DE

Date of ref document: 19950126

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2064954

Country of ref document: ES

Kind code of ref document: T3

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19950109

ITF It: translation for a ep patent filed

Owner name: GUZZI E RAVIZZA S.R.L.

REG Reference to a national code

Ref country code: DK

Ref legal event code: 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: GB

Ref legal event code: IF02

REG Reference to a national code

Ref country code: ES

Ref legal event code: PC2A

NLT1 Nl: modifications of names registered in virtue of documents presented to the patent office pursuant to art. 16 a, paragraph 1

Owner name: NORTEL NETWORKS FRANCE

Owner name: MATRA NORTEL COMMUNICATIONS

BECN Be: change of holder's name

Owner name: *NORTEL NETWORKS FRANCE

Effective date: 20070412

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

Ref country code: ES

Payment date: 20100727

Year of fee payment: 20

Ref country code: NL

Payment date: 20100809

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

Year of fee payment: 20

Ref country code: SE

Payment date: 20100809

Year of fee payment: 20

Ref country code: IT

Payment date: 20100817

Year of fee payment: 20

Ref country code: LU

Payment date: 20100813

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

Year of fee payment: 20

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

Ref country code: DK

Payment date: 20100723

Year of fee payment: 20

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

Ref country code: BE

Payment date: 20100826

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69105871

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69105871

Country of ref document: DE

BE20 Be: patent expired

Owner name: *NORTEL NETWORKS FRANCE

Effective date: 20110819

REG Reference to a national code

Ref country code: NL

Ref legal event code: V4

Effective date: 20110819

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

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

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 69105871

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 69105871

Country of ref document: DE

Owner name: MICROSOFT CORPORATION, REDMOND, US

Free format text: FORMER OWNER: NORTEL NETWORKS FRANCE, CHATEAUFORT, FR

Effective date: 20130528

Ref country code: DE

Ref legal event code: R082

Ref document number: 69105871

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

Effective date: 20130528

Ref country code: DE

Ref legal event code: R081

Ref document number: 69105871

Country of ref document: DE

Owner name: MICROSOFT CORPORATION, US

Free format text: FORMER OWNER: NORTEL NETWORKS FRANCE, CHATEAUFORT, FR

Effective date: 20130528

Ref country code: DE

Ref legal event code: R082

Ref document number: 69105871

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Effective date: 20130528

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20131003 AND 20131009

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20140826

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20150312 AND 20150318