[go: up one dir, main page]

EP3430830B1 - Noeud de commande et procédé associé - Google Patents

Noeud de commande et procédé associé Download PDF

Info

Publication number
EP3430830B1
EP3430830B1 EP16725476.2A EP16725476A EP3430830B1 EP 3430830 B1 EP3430830 B1 EP 3430830B1 EP 16725476 A EP16725476 A EP 16725476A EP 3430830 B1 EP3430830 B1 EP 3430830B1
Authority
EP
European Patent Office
Prior art keywords
control node
association
remote radio
csi
radio heads
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.)
Active
Application number
EP16725476.2A
Other languages
German (de)
English (en)
Other versions
EP3430830A1 (fr
Inventor
Johan Christer Qvarfordt
James Gross
Hadi GHAUCH
Muhammad Mahboob UR RAHMAN
Sahar IMTIAZ
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of EP3430830A1 publication Critical patent/EP3430830A1/fr
Application granted granted Critical
Publication of EP3430830B1 publication Critical patent/EP3430830B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0205—Traffic management, e.g. flow control or congestion control at the air interface
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • H04W88/085—Access point devices with remote components

Definitions

  • the invention relates to a control node. Furthermore, the invention also relates to a corresponding method and a corresponding computer program product.
  • Traditionally cellular networks have employed a fixed structure of infrastructure antennas to support user data requests.
  • the most prominent element in this structure has been the base station, which utilizes a set of radio resources in a certain spatial area, leading to the deployment of many base stations over a bigger area to achieve coverage, e.g. in a city.
  • user terminals are typically associated with one base station, which serves the user as long as the user is in its coverage range. If the user moves out of the coverage range, then typically a handover is performed such that the user experience can be preserved by the network.
  • a handover typically involves the association of the user with a new base station leading to a redirection of backlogged and newly arriving data in the backbone to the new base station.
  • Load imbalance If significantly more users are associated locally to one base station in comparison to the neighbouring ones, then load balancing might be invoked which consists of handing over selected user terminals from the overloaded cell. Several reasons can lead to such load balancing action, such as overload of the backhaul, clogging of the random access channel, or insufficient radio resources on the air interface to serve all users.
  • CRAN Cloud Radio Access Network
  • RRHs Remote Radio Heads
  • AN Aggregation Node
  • the AN coordinates the transmission of multiple RRHs and therefore requires the RRHs to be assigned to the AN, building a so called Antenna Domain (AD).
  • AD Antenna Domain
  • user terminals are associated to some RRH, and through the RRH to some AN.
  • This novel architecture has significant advantages when it comes to serving the associated terminals as the transmission of the multiple RRHs can be coordinated leading (among other issues) to a fine-grained control of the interference.
  • each RRH is connected to the AN via a constrained backhaul link.
  • the backhaul links of different RRHs are assumed to have different capacities.
  • the per-RRH backhaul constraint into an equivalent per-RRH transmit power constraint is then re-formulated. They then solve the problem of weighted sum rate maximization by doing static/dynamic user-centric clustering of RRHs (i.e., multiple RRHs jointly serving a user, similar to CoMP) while RRHs within one cluster employ Weighted Minimum Mean Square Error (WMMSE) precoding scheme.
  • WMMSE Weighted Minimum Mean Square Error
  • the authors also propose some heuristic, sub-optimal methods for RRH clustering. The simulation results show a performance gain of proposed methods compared to naive RRH clustering methods available in the literature.
  • Radio resource limitations on the air interface between RRHs and user terminals/limitations on the control channel/limitations on the random access channel It is open in CRAN how to deal with strongly varying user distribution over a certain area of interest with multiple ANs and many RRHs, i.e. how to perform load balancing in CRAN, except for resorting to traditional load balancing techniques.
  • Processing limitations of the RRHs or the AN It is open how to deal with limitations with respect to the processing capabilities of either RRHs (if they are equipped with such resources), and/or how to deal with processing limitations at the ANs.
  • US patent 2013,029,655 A1 discloses systems and methods directed to a reference signal (RS) transmission scheme in which the RRHs (or RRH groups) are dynamically scheduled and mapped to the antenna ports for RS transmission based on user density distribution such that the accuracy of the channel state information (CSI) estimation in the DAS is optimized.
  • RS reference signal
  • US patent 2013,242,748 A1 discloses a new method, apparatus and software related product for network management through a hierarchical architecture with a control functionality of a network server (e.g., C-SON) in relationship to clusters comprising eNBs (access points), and for implementing coordinated multipoint (CoMP) transmission and reception in conjunction with inter-cell interference coordination (ICIC) in wireless networks such as LTE wireless networks.
  • a network server e.g., C-SON
  • CoMP coordinated multipoint
  • COC inter-cell interference coordination
  • An objective of embodiments of the invention is to provide a solution which mitigates or solves the drawbacks and problems of conventional solutions.
  • a further objective of embodiments of the invention is to provide mechanisms that allow the formation and re-formation of antenna domains in a wireless communication system.
  • Fig. 1 shows a control node 100 according to an embodiment of the invention.
  • the control node 100 comprises a transceiver 102 communicably coupled with a processor 104.
  • the transceiver may further be coupled with an antenna 106 for wireless communication and/or a modem 108 for wired communication over a wired line 110.
  • the transceiver 102 is configured to receive a first set of Channel State Information (CSI) comprising CSI for radio channels between a plurality of first remote radio heads 410a, 410b,..., 410n and a plurality of user devices 500a, 500b,..., 500n (see Fig. 3 ).
  • the processor 104 is configured to determine a first association 110 based on the first set of CSI, wherein the first association 110 comprises an association between the plurality of first remote radio heads 410a, 410b,..., 410n and the first control node 100.
  • CSI Channel State Information
  • the control node 100 can be a centralized server hosting baseband functionality for a number of Remote Radio Heads (RRH) or equivalently Transmission and Reception Points (TRPs).
  • the control node 100 can further be an RRM server controlling the base stations that shall coordinate their transmissions/receptions.
  • RRM Remote Radio Heads
  • DU Distributed Units
  • cRRM coordinated RRM
  • MeNB master eNB
  • Both these nodes could be a control node 100.
  • the control node 100 could be an Access and Mobility Control (AMC) node.
  • AMC Access and Mobility Control
  • the control node 100 would be similar to an SRNC in UMTS, although UMTS did not support such tight CoMP as described herein.
  • Fig. 2 shows a corresponding method which may be executed in a control node, such as the one shown in Fig. 1 .
  • the method 200 comprises receiving 202 a first set of CSI comprising CSI for radio channels between a plurality of first remote radio heads 410a, 410b,..., 410n and a plurality of user devices 500a, 500b,..., 500n.
  • the method 200 further comprises determining 204 a first association 110 based on the first set of CSI.
  • the first association 110 comprises an association between the plurality of first remote radio heads 410a, 410b,..., 410n and the first control node 100.
  • Fig. 3 illustrates an exemplary embodiment of the invention in a cellular wireless communication system 600. Is its illustrated how the first control node 100 receive a first set of CSI from first remote radio heads 410a, 410b,..., 410n over communication link 610. After having determined the first association 110 the first control node 100 transmits the first association 110 to the remote radio heads 410a, 410b,..., 410n.
  • Fig. 3 further illustrates the cooperation and interaction between control nodes of the system. Only two control nodes are shown in Fig. 3 but it is realized that the present solution is not limited thereof.
  • the second control node 300 transmits a second set of CSI to the first control node 100.
  • the second set of CSI comprises CSI for radio channels between a plurality of second remote radio heads 420a, 420b,..., 420n and the plurality of user devices 500a, 500b,..., 500n.
  • the first control node 100 is configured to determine the first association 110 based on a concatenation of the first set of CSI and the second set of CSI for even better system performance.
  • Fig. 3 also illustrates further signaling between the control nodes of the system for yielding even better performance due to cooperative aspects of embodiments of the invention.
  • the first control node 100 transmits the first association 110 to the second control node 300.
  • the first control node 100 transmits the first set of CSI to the second control node (300).
  • the first control node 100 determines a first trigger 130 comprising an instruction for the second control node 300 to determine a second association 112 between the plurality of second remote radio heads 420a, 420b,..., 420n and the second control node 300. Further, the first control node 100 transmits the first trigger 130 to the second control node 300. Accordingly, the first control node 100 receives a second trigger 132 from the second control node 300. The second trigger 132 comprising an instruction for the first control node 100 to determine the first association 110. Upon reception of the second trigger 132 the first control node 100 determines the first association (110) in response to the reception of the second trigger (132).
  • each Control Node (CN) or equivalently Aggregation Node (AN) is limited in the number of RRHs and user terminals that might be associated to it due to several reasons such as the backhaul capacity and processing capacity of the multiple ADs.
  • RRHs can potentially establish backhaul connections to more than one AN, different compositions of ADs are possible which leads to the so-called antenna domain formation (ADF) problem, namely which AD formation to choose.
  • ADF antenna domain formation
  • interference leakage minimization the objective is to minimize pairwise interference leakage between all the RRHs in the Area of Interest (Aol).
  • ADF Area of Interest
  • CRAN is not limited in application to CRAN architecture only. It is rather applicable to any "suitable" cellular architecture, where a suitable architecture is defined as a layered architecture with three layers of communication nodes, i.e., user devices, transmit antennas (such as RRHs), and control nodes. Having said this, CRAN is one such suitable architecture where the transmit antennas are called RRHs, and control nodes are called ANs.
  • the present solution proposes a novel control node and corresponding method to optimize system-level performance in a cellular architecture, where a suitable architecture is defined as a layered architecture with three layers of nodes. Having said this, in the following disclosure the proposed solution is described and explained in the context of CRAN which is one such suitable architecture where the transmit antennas are called RRHs, and CNs are called ANs. The present solution is however no limited thereof.
  • the cellular architecture When the proposed solution is in force, the cellular architecture will be in one of the three states as shown in Fig. 4 .
  • the cellular system has the desired system-level throughput, and is therefore in stable state.
  • the ADF state II The cellular system transitions to this state due to some external trigger (e.g. user movement), or, internal trigger (e.g. backhaul constraints). Then, the ADF state consists of three sequential mechanisms as illustrated in Fig. 5 where each mechanism outlines the characteristics of control data flow between network elements, i.e., ANs, RRHs, and user devices.
  • some external trigger e.g. user movement
  • internal trigger e.g. backhaul constraints
  • the cellular system transitions to this state when the ADF state has reached a stable solution based on the current user device-RRH assignment.
  • the user device-RRH assignment can be revisited based on the same criterion as for the ADF state to further increase the performance.
  • the system can transition back to the ADF state to see if there is an even better solution, or it can transition to the stable operation state if there is no better solution to be found, or the system performance increase is lower than a threshold.
  • the ADF state consists of three essential mechanisms, as already pointed out above. To utilize the present solution, these three mechanisms must be executed in sequential order by the network. In the following, we first describe each mechanism in an abstract form (and in CRAN context), and illustrate each step then with respect to "interference leakage minimization" by ADF. Note that this is only an example to better explain the mechanism steps. Additionally, we assume that some initial RRHs-to-AN associations as well as user device-to-RRH-associations are given.
  • each of the AN in the Aol assigns orthogonal/non-orthogonal (w.r.t. other ANs) radio/coding resources to its associated users for piloting on the uplink.
  • the users then transmit pilots on the uplink which help each AN gather the Channel State Information at the Transmitter (CSIT) of/all the users in the Aol (through its associated RRHs).
  • CSIT Channel State Information at the Transmitter
  • control and data signalling (over AN-AN backhaul) is utilized by the ANs to exchange the CSIT data between the ANs. Then, in the end, either one AN has the global CSIT (for the whole Aol) (centralized computation of new formation), or, multiple ANs have the global CSIT (distributed computation of new formation).
  • a primitive (a well-defined communication procedure which may be invoked by a higher layer and executed by a lower layer) is required to query status information either regarding an AN, and/or an AN and its associated RRHs, and/or an AN, its associated RRHs, and its associated user terminals.
  • the primitive allows to specify the type of information of interest, for instance the (average or instantaneous) computational load of the AN, the (average or instantaneous) load of the backhaul of the AN or of the associated RRHs, the number of associated user terminals to an AN, the number of associated terminals to a RRH, the (average or instantaneous) channel state between an associated user terminal and some specified RRH, an aggregate of the channel state information of a set of terminals and a specified RRH, as well as information regarding the position of user terminals associated to an AN.
  • This information needs to be collected/monitored by the AN upfront, or upon the reception of the primitive this information is collected and afterwards provided to the requesting entity that sent the primitive.
  • AN1 transmits a Status request to a AN2.
  • AN2 collects information and transmits a Status report comprising the collected information to AN1.
  • CSI channel state information
  • each AN could track the positions of the associated user terminals and report the positions back in case the primitive is executed by an external entity.
  • the global CSIT data gathered by AN(s) is processed to yield improved RRH-to-AN associations (as well as improved user-to-RRH associations).
  • the decentralized approach can consist of an iterative process (e.g., by using the BCD method) where - in a predetermined sequence - intermediate solutions are computed and passed on to other ANs on AN-AN backhaul through a separate signalling protocol. This sequence might be terminated after a predefined quality threshold is reached to reduce the signalling on the AN-AN backhaul, and this is typically done when the metric that is optimized does not change significantly any more, or alternatively when a certain absolute value is reached.
  • the first association 110 is determined by compute at least one cross coupling between the plurality of first remote radio heads 410a, 410b,..., 410n and a plurality of user devices 500a, 500b,..., 500n based on the first set of CSI, and determine the first association 110 based on the computed cross coupling.
  • the first control node 100 computes a first cross coupling between the plurality of first remote radio heads 410a, 410b,..., 410n and a plurality of user devices 500a, 500b,..., 500n for a first candidate association. Further, computes at least one second cross coupling between the plurality of first remote radio heads 410a, 410b,..., 410n and a plurality of user devices 500a, 500b,..., 500n for a second candidate association. Finally, determines the first association 110 by selecting the first candidate association or the second candidate association having the lowest cross coupling.
  • the first control node 100 determines the first association 110 by iteratively:
  • cross coupling in this context is based on the CSI information for the channels between a user device and a RRH, wherein the RRH is associated to another control node (second control node 300) than the control node (first control node 100) that the RRH that the user device is assigned to is associated to.
  • the cross coupling is then the sum of CSI over all the user devices assigned to an AD and all the RRHs in other ADs and vice versa.
  • An example of the cross coupling is shown in Fig. 8 , where two RRHs (410n and 420n) are associated to different ANs (100 and 300) and two user devices (500n) is assigned to each RRH, represented with the solid arrows.
  • the cross coupling between the two ADs is represented with the dashed arrows between the RRHs and user devices (500n).
  • ADF computation can be executed either centrally organized or de-centrally organized.
  • one designated AN triggers all assigned ANs regarding their status information through the primitive.
  • the assigned ANs then provide the status information which is the basis for performing the computation of the new ADF.
  • this computation of the new ADF could also be triggered by one (or multiple) of the assigned ANs requesting a recomputation of the ADF, for example due to high utilization of backhaul capacity or computational power.
  • the designated AN could request further status information from the remaining assigned ANs and then execute the computation of the new AD.
  • a set of ANs exchange first status information mutually, such that all ANs in the set have the entire CSI. Then, a distributed computation of the new ADF can be performed, where each AN computes an incremental update on the new ADF based on its local objective function only. Once the local computation is performed, the partial solution is passed to the next AN in a predefined order. This sequential computation can be terminated once a predefined quality level is not increased anymore or the percentage increase is lower than a given threshold, for example. All information exchange between the ANs is performed through the AN-AN backhaul.
  • the formation of the set of ANs which are involved in the ADF process, as well as the selection of the centralized or decentralized ADF computation method, as well as the selection of the designated node in the centralized case, as well as the selection of the iteration sequence in the decentralized method are all governed by corresponding primitives of the control plane. Potentially, multiple such ADF processes could be running in parallel in different modes (centralized/decentralized), for example relating the resulting ADFs to different time slots in a bigger time reference structure. Finally, note that the computation of the ADF could also include the redistribution of user terminals. In this case, one possible implementation could involve first a computation of an ADF based on a fixed assignment of user terminals to RRHs.
  • the user terminal association to the RRHs is reconsidered/recomputed.
  • the ADF computation is invoked again to consider the RRHs assignment to ANs based on a given (previously computed) user terminal assignment.
  • the ADF problem can be defined as: Given an Aol with N (> A ) RRHs and A ANs, which RRHs should be assigned to which AN at a given time such that some performance objective (i.e., sum interference leakage minimization) is achieved? We eliminate the sum interference within Aol in a hierarchical manner. That is, we first formulate ADF as an IP problem and solve it using an iterative algorithm called Block Coordinate Descent (BCD) (this minimizes the interference across the ADs).
  • BCD Block Coordinate Descent
  • WMMSE Weighted Minimum Mean Square Error
  • CB Coordinated Beamforming
  • each AN locally/partially solves the interference leakage minimization problem. More precisely, during each iteration, each AN first obtains the latest (binary-valued) association vectors x(t) from all other ANs illustrated with the arrow x(t) from AN1 to AN2 in Fig. 7 . Based in latest (binary-valued) association vectors x(t) the AN updates its own association vector.
  • the AN then sends out its updated association vector (x(t+1)) to all other ANs illustrated with the arrow x(t+1) from AN 2 to AN1 in Fig. 7 .
  • This message exchange between the ANs is carried out over AN-AN backhaul, and the signalling continues, potentially until there is no further decrease in interference leakage or until a certain quality indicator is not improved by a target percentage anymore.
  • the information exchange between the control nodes, x(t), is the resulting binary association matrix (#RRH x #AN), which is the outcome of the optimization process performed in the transmitting control node (AN1).
  • the receiving control node (AN2) makes the optimization based on at least the received x(t) and the CSI information it has.
  • AN2 further sends the outcome of the optimization process performed in AN2, x(t+1), to AN1, which repeats the process until the resulting x(t+n+1) is equal to the received x(t+n). That would be reaching the stable state.
  • the new set of associations are conveyed to all nodes in the network and the corresponding re-associations are invoked (including transfer of backlogged data to different ANs).
  • Re-associations might also be implemented iteratively to minimize the impact on the backhaul.
  • the designated ANs - In a centrally organized set of ANs to perform the ADF, the designated ANs - once the ADF is finally generated - executes primitives on the control plane to reconfigure the ANs. For this, the designated node informs each AN about the new RRH assignments, such that upon the receipt of this information the ANs can hand over the RRHs to their newly assigned ANs. This includes also the transfer of backlogged data, as well as the rerouting of ongoing data transmissions to the new AN through the control plane. In case that the ADF is solved through RRH assignment and user terminal assignment, the designated node hands out both of these information sets to the ANs, and lets them then perform hand over of RRHs and user terminals.
  • signalling primitive on the control channel/backhaul is executed to inform the RRHs of their new associations (to potentially different ANs), for the fixed user association case.
  • signalling on the control channel/downlink of air-interface is executed to let user terminals know of their new associations (to potentially different RRHs).
  • future data as well as currently backlogged data for each user is re-routed towards potentially different ANs.
  • the system transitions from ADF state to this state to further improve the system-level throughput by updating the users-to-RRH association within the whole Aol.
  • a measurement (retrieval of status information) phase is conducted where the performance impact from various user-to-RRH associations is determined by the ANs within the Aol (independently, or, jointly).
  • RRH-to-AN associations are updated next. This iterative procedure is continued until there is no further improvement in system performance metric.
  • any methods according to embodiments of the invention may be implemented in a computer program, having code means, which when run by processing means causes the processing means to execute the steps of the method.
  • the computer program is included in a computer readable medium of a computer program product.
  • the computer readable medium may comprises of essentially any memory, such as a ROM (Read-Only Memory), a PROM (Programmable Read-Only Memory), an EPROM (Erasable PROM), a Flash memory, an EEPROM (Electrically Erasable PROM), or a hard disk drive.
  • control node 100 comprise the necessary communication capabilities in the form of e.g., functions, means, units, elements, etc., for performing the present solution.
  • means, units, elements and functions are: processors, memory, buffers, control logic, encoders, decoders, rate matchers, de-rate matchers, mapping units, multipliers, decision units, selecting units, switches, interleavers, deinterleavers, modulators, demodulators, inputs, outputs, antennas, amplifiers, receiver units, transmitter units, DSPs, MSDs, TCM encoder, TCM decoder, power supply units, power feeders, communication interfaces, communication protocols, etc. which are suitably arranged together for performing the present solution.
  • the processors of the present control node 100 may comprise, e.g., one or more instances of a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • the expression "processor” may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones mentioned above.
  • the processing circuitry may further perform data processing functions for inputting, outputting, and processing of data comprising data buffering and device control functions, such as call processing control, user interface control, or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Claims (12)

  1. Premier nœud de commande pour un système de communication sans fil (600), le premier nœud de commande (100) comprenant
    un émetteur-récepteur (102) configuré pour
    recevoir, en provenance d'une pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) initialement attribuées au premier nœud de commande (100), un premier ensemble d'informations d'état de canal, CSI, comprenant des CSI pour des canaux radio entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans une zone d'intérêt, dans lequel de multiples nœuds de commande et de nombreuses têtes radio déportées sont déployés dans la zone d'intérêt, tous les dispositifs utilisateurs (500a, 500b, ..., 500n) sont associés à une certaine tête radio déportée, et par l'intermédiaire de la tête radio déportée à un certain nœud de commande,
    l'émetteur-récepteur (102) caractérisé en ce qu'il est en outre configuré pour recevoir un second ensemble de CSI en provenance d'un second nœud de commande (300), le second ensemble de CSI comprenant des CSI pour des canaux radio entre une pluralité de secondes têtes radio déportées (420a, 420b, ..., 420n) initialement attribuées au second nœud de commande (300) et tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans la zone d'intérêt,
    un processeur (104) caractérisé en ce qu'il est configuré pour déterminer une première association (110) basée sur une concaténation du premier ensemble de CSI et du second ensemble de CSI, la première association (110) comprenant un vecteur d'association mise à jour indiquant quelles têtes radio déportées parmi la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et la pluralité de secondes têtes radio déportées (420a, 420b, ..., 420n) sont nouvellement attribuées au premier nœud de commande (100).
  2. Premier nœud de commande (100) selon la revendication 1, dans lequel le processeur (104) est configuré pour déterminer la première association (110) en calculant au moins un couplage croisé entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et une pluralité de dispositifs utilisateurs (500a, 500b, ..., 500n) sur la base du premier ensemble de CSI, dans lequel l'au moins un couplage croisé est la somme des CSI sur un sous-ensemble de tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans la zone d'intérêt non attribués au premier nœud de commande (100) et la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) initialement attribuées au premier nœud de commande (100),
    la détermination de la première association (110) sur la base du couplage croisé calculé.
  3. Premier nœud de commande (100) selon la revendication 2, dans lequel le processeur (104) est configuré pour déterminer la première association (110) en calculant un premier couplage croisé entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et une pluralité de dispositifs utilisateurs (500a, 500b, ..., 500n) pour une première association candidate sur la base du premier ensemble de CSI, dans lequel le premier couplage croisé est la somme de CSI sur un premier sous-ensemble de tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans la zone d'intérêt non attribués au premier nœud de commande (100) et la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) initialement attribuées au premier nœud de commande (100),
    le calcul d'au moins un second couplage croisé entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et une pluralité de dispositifs utilisateurs (500a, 500b, ..., 500n) pour une seconde association candidate sur la base du premier ensemble de CSI, dans lequel l'au moins un second couplage croisé est la somme de CSI sur un second sous-ensemble de tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans la zone d'intérêt non attribués au premier nœud de commande (100) et la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) initialement attribuées au premier nœud de commande (100),
    la détermination de la première association (110) en sélectionnant la première association candidate ou la seconde association candidate ayant le couplage croisé le plus faible.
  4. Premier nœud de commande (100) selon la revendication 3, dans lequel le processeur (104) est configuré pour déterminer la première association (110) de façon itérative en
    calculant le premier couplage croisé dans une itération,
    calculant le second couplage croisé dans une itération ultérieure,
    déterminant la première association (110) dans l'itération ultérieure.
  5. Premier nœud de commande (100) selon la revendication 1, dans lequel l'émetteur-récepteur (102) est configuré pour émettre la première association (110) vers le second nœud de commande (300).
  6. Premier nœud de commande (100) selon la revendication 1 ou 5, dans lequel l'émetteur-récepteur (102) est configuré pour émettre le premier ensemble de CSI vers le second nœud de commande (300).
  7. Premier nœud de commande (100) selon l'une quelconque des revendications 1, 5 et 6, dans lequel le processeur (104) est configuré pour
    déterminer un premier déclenchement (130) comprenant une instruction pour le second nœud de commande (300) pour déterminer une seconde association (112) qui comprend une association mise à jour entre la pluralité de secondes têtes radio déportées (420a, 420b, ..., 420n) et le second nœud de commande (300), dans lequel l'émetteur-récepteur (102) est configuré pour
    émettre le premier déclenchement (130) vers le second nœud de commande (300).
  8. Premier nœud de commande (100) selon l'une quelconque des revendications 1 et 5 à 7, dans lequel l'émetteur-récepteur (102) est configuré pour
    recevoir un second déclenchement (132) en provenance du second nœud de commande (300), le second déclenchement (132) comprenant une instruction pour le premier nœud de commande (100) pour déterminer la première association (110), dans lequel le processeur (104) est configuré pour
    déterminer la première association (110) en réponse à la réception du second déclenchement (132).
  9. Premier nœud de commande (100) selon l'une quelconque des revendications précédentes, dans lequel l'émetteur-récepteur (102) est configuré pour émettre la première association (110) vers la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n).
  10. Premier nœud de commande (100) selon l'une quelconque des revendications précédentes, dans lequel l'association entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et le premier nœud de commande (100) comprend l'attribution de la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) au premier nœud de commande (100).
  11. Procédé pour un système de communication sans fil (600), le procédé (200) réalisé par un premier nœud de commande (100) comprenant :
    la réception (202), par un émetteur-récepteur (102), d'un premier ensemble de CSI en provenance d'une pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) initialement attribuées au premier nœud de commande (100), comprenant des CSI pour des canaux radio entre la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans une zone d'intérêt, dans lequel de multiples nœuds de commande et de nombreuses têtes radio déportées sont déployés dans la zone d'intérêt, tous les dispositifs utilisateurs (500a, 500b, ..., 500n) sont associés à une certaine tête radio déportée, et par l'intermédiaire de la tête radio déportée à un certain nœud de commande,
    caractérisé par
    la réception, par l'émetteur-récepteur (102), d'un second ensemble de CSI en provenance d'un second nœud de commande (300),
    dans lequel le second ensemble de CSI comprend des CSI pour des canaux radio entre une pluralité de secondes têtes radio déportées (420a, 420b, ..., 420n) initialement attribuées au second nœud de commande (300) et tous les dispositifs utilisateurs (500a, 500b, ..., 500n) dans la zone d'intérêt,
    la détermination (204), par un processeur (104), d'une première association (110) basée sur une concaténation du premier ensemble de CSI et du second ensemble de CSI, dans lequel la première association (110) comprend un vecteur d'association mise à jour indiquant quelles têtes radio déportées parmi la pluralité de premières têtes radio déportées (410a, 410b, ..., 410n) et la pluralité de secondes têtes radio déportées (420a, 420b, ...420n) sont nouvellement attribuées au premier nœud de commande (100).
  12. Programme informatique doté d'un code de programme provoquant l'exécution d'un procédé selon la revendication 11 quand le programme d'ordinateur s'exécute sur un processeur du premier nœud de commande selon la revendication 1.
EP16725476.2A 2016-05-20 2016-05-20 Noeud de commande et procédé associé Active EP3430830B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2016/061437 WO2017198311A1 (fr) 2016-05-20 2016-05-20 Nœud de commande et procédé associé

Publications (2)

Publication Number Publication Date
EP3430830A1 EP3430830A1 (fr) 2019-01-23
EP3430830B1 true EP3430830B1 (fr) 2021-09-22

Family

ID=56084013

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16725476.2A Active EP3430830B1 (fr) 2016-05-20 2016-05-20 Noeud de commande et procédé associé

Country Status (4)

Country Link
US (1) US10652898B2 (fr)
EP (1) EP3430830B1 (fr)
CN (1) CN109479203B (fr)
WO (1) WO2017198311A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112088555B (zh) 2018-05-02 2023-09-12 华为技术有限公司 用于无线通信系统中的资源分配的协调器网络节点和网络接入节点
US11838748B2 (en) 2019-07-02 2023-12-05 Commscope Technologies Llc Fronthaul interface for use with a cloud radio access network
US11502793B2 (en) * 2020-11-30 2022-11-15 ISRD Sp. z o.o. Cooperative radio resource allocation in a wireless communication network and methods for use therewith
US11889494B2 (en) 2020-12-29 2024-01-30 ISRD Sp. z o.o. Cooperative radio resource scheduling in a wireless communication network and methods for use therewith
US11356155B1 (en) 2021-11-11 2022-06-07 King Abdulaziz University Method of optimizing multi-cell association in downlink multi-user, multiple-input, multiple-output (MU-MIMO) systems via statistical beamforming
US11870527B2 (en) 2022-01-21 2024-01-09 ISRD Sp. z o.o. Wireless communication network with master distributed unit and methods for use therewith
US12356196B2 (en) 2023-09-08 2025-07-08 ISN Sp. z o.o. Security in a flexible software-defined radio access network architecture and methods for use therewith

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9673945B2 (en) * 2011-02-18 2017-06-06 Qualcomm Incorporated Implicitly linking aperiodic channel state information (A-CSI) reports to CSI-reference signal (CSI-RS) resources
US9288743B2 (en) * 2011-04-01 2016-03-15 Intel Corporation Uplink power control scheme for distributed RRH systems with same cell ID
KR101767997B1 (ko) * 2011-06-24 2017-08-14 삼성전자 주식회사 직교 주파수 분할 다중 접속 이동통신 시스템을 기반으로 하는 분산 안테나 시스템에서 하향링크 간섭 측정 방법 및 장치
JP5978566B2 (ja) * 2011-07-07 2016-08-24 ソニー株式会社 通信装置、通信方法および基地局
US8611916B2 (en) * 2011-07-26 2013-12-17 Hitachi, Ltd. Reference signal design for distributed antenna systems
WO2013025051A2 (fr) * 2011-08-17 2013-02-21 엘지전자 주식회사 Procédé et appareil permettant la coordination du brouillage intercellulaire pour un groupe de points de transmission
US9917629B2 (en) * 2011-12-14 2018-03-13 Qualcomm Incoroporated Multi-hypothesis channel quality indicator feedback
WO2013125900A1 (fr) * 2012-02-23 2013-08-29 엘지전자 주식회사 Procédé destiné à exécuter un transfert dans des systèmes c-ran et appareil associé
KR20130101294A (ko) * 2012-03-05 2013-09-13 삼성전자주식회사 협력 통신 방법 및 장치
US8798021B2 (en) * 2012-03-16 2014-08-05 Nokia Siemens Networks Oy Hierarchical network and interference management
US9094855B2 (en) * 2012-05-30 2015-07-28 Intel Corporation Measurement of nodes in coordinated multipoint (CoMP) systems
US9125047B2 (en) * 2012-07-26 2015-09-01 Nec Laboratories America, Inc. Cloud-based radio access network for small cells
KR102052420B1 (ko) * 2012-11-02 2019-12-05 코란씨, 엘엘씨 통신 시스템에서 간섭 측정을 위한 방법 및 그 장치
US9161299B2 (en) * 2013-01-28 2015-10-13 Transpacific Ip Management Group Ltd. Remote radio header selection
WO2014139588A1 (fr) * 2013-03-15 2014-09-18 Nokia Solutions And Networks Oy Transmission commune multipoint coordonnée ayant des exigences plus souples en termes de liaison terrestre
US9167382B2 (en) * 2014-03-10 2015-10-20 Interlite Aktiebolag Method and system for wireless communication
US10177826B2 (en) * 2015-12-28 2019-01-08 Qualcomm Incorporated Transmission of channel state information based on selected non-frequency domain components of channel responses
US10034176B2 (en) * 2016-02-29 2018-07-24 Alcatel Lucent Extending a wireless coverage area in an unlicensed frequency band of a small cell using remote radio heads
WO2017193056A1 (fr) * 2016-05-05 2017-11-09 Ntt Docomo, Inc. Mécanisme et procédure de sélection de station de base basée sur une détection de pilote de liaison montante et de proximité d'utilisateur distribuée

Also Published As

Publication number Publication date
WO2017198311A1 (fr) 2017-11-23
US20190090247A1 (en) 2019-03-21
CN109479203A (zh) 2019-03-15
US10652898B2 (en) 2020-05-12
EP3430830A1 (fr) 2019-01-23
CN109479203B (zh) 2020-10-27

Similar Documents

Publication Publication Date Title
EP3430830B1 (fr) Noeud de commande et procédé associé
CN110546995B (zh) 用于无线通信系统中的负载均衡的设备和方法
US10952236B2 (en) Beam selection systems and methods
US12088389B2 (en) Methods and devices for radio beam determination
TWI796529B (zh) 網路系統及針對使用者設備控制下行鏈路資料傳輸模式之方法
US11777558B2 (en) Active set management for multiple-input multiple-output communications
CN111316570A (zh) 并行调度器架构
US20160352394A1 (en) System and method implementing spatial multiplexing and joint coordinated multipoint transmission of data
KR20230085891A (ko) 무선 네트워크에서 협력 전송을 위한 빔 선택 및 클러스트링 방법 및 그 장치
US11026143B2 (en) Network unit and methods therein for determining a target radio network node
US11032841B2 (en) Downlink active set management for multiple-input multiple-output communications
US9906338B1 (en) Dynamic base station selection based on extent to which a base station can provide multi-user multiple-input multiple-output (MU-MIMO) service
US20230049277A1 (en) Method and apparatus for providing uplink signal-based location service
WO2024035326A1 (fr) Procédé pour une inférence côté réseau d'une prédiction de paire de faisceaux à l'aide d'une signalisation de référence de liaison montante (ul-rs)
EP4578109A1 (fr) Procédé de sélection de précodeur de signal de référence de sondage de liaison montante pour suppression d'interférence
US11984939B2 (en) Methods and devices for inter-cell interference estimation
US20250203691A1 (en) Base station apparatus, control method, and storage medium
CN120513682A (zh) 用于无线通信的节点中的方法及装置
WO2022172056A1 (fr) Partage de spectre dynamique sensible à entrées multiples et sorties multiples (mu-mimo) multi-utilisateurs
CN116458080A (zh) 多小区协作预编码

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20181018

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20191010

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20210514

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016063997

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 1433309

Country of ref document: AT

Kind code of ref document: T

Effective date: 20211015

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20210922

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

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

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

Ref country code: HR

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

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

Ref country code: NO

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

Ref country code: RS

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

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

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1433309

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210922

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

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

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

Ref country code: AT

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

Effective date: 20210922

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

Ref country code: IS

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

Effective date: 20220122

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

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

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

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

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

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

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

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

Ref country code: AL

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016063997

Country of ref document: DE

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

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

Effective date: 20220623

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

Ref country code: SI

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

Effective date: 20210922

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220531

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

Effective date: 20210922

Ref country code: LU

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

Effective date: 20220520

Ref country code: LI

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

Effective date: 20220531

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

Ref country code: CH

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

Effective date: 20220531

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

Ref country code: IE

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

Effective date: 20220520

Ref country code: FR

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

Effective date: 20220531

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

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; INVALID AB INITIO

Effective date: 20160520

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

Ref country code: SM

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

Ref country code: MK

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

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

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

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

Ref country code: MT

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

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

Ref country code: DE

Payment date: 20250402

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

Year of fee payment: 10