WO2012128008A1 - Station de base et procédé de planification dans un système de communication mobile - Google Patents

Station de base et procédé de planification dans un système de communication mobile Download PDF

Info

Publication number
WO2012128008A1
WO2012128008A1 PCT/JP2012/055103 JP2012055103W WO2012128008A1 WO 2012128008 A1 WO2012128008 A1 WO 2012128008A1 JP 2012055103 W JP2012055103 W JP 2012055103W WO 2012128008 A1 WO2012128008 A1 WO 2012128008A1
Authority
WO
WIPO (PCT)
Prior art keywords
quality information
weighting function
value
user
function
Prior art date
Application number
PCT/JP2012/055103
Other languages
English (en)
Japanese (ja)
Inventor
徹 内野
石井　啓之
義顕 大藤
アニール ウメシュ
尚人 大久保
耕平 清嶋
幹生 岩村
Original Assignee
株式会社 エヌ・ティ・ティ・ドコモ
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 株式会社 エヌ・ティ・ティ・ドコモ filed Critical 株式会社 エヌ・ティ・ティ・ドコモ
Publication of WO2012128008A1 publication Critical patent/WO2012128008A1/fr

Links

Images

Classifications

    • 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality

Definitions

  • the present invention relates to a base station and a scheduling method in a mobile communication system.
  • frequency scheduling is employed in mobile communication systems such as the Long Term Evolution (LTE) method.
  • LTE Long Term Evolution
  • HSPA High Speed Packet Access
  • W-CDMA Wideband-Code Division Multiple Access
  • the LTE specifications are created by the 3GPP (3rd Generation Partnership Project), a W-CDMA standardization organization.
  • 3GPP 3rd Generation Partnership Project
  • W-CDMA Wideband-Code Division Multiple Access
  • the frequency scheduling is roughly classified into a dynamic scheduling method (Dynamic Scheduling) and a semi-persistent scheduling method (SPS).
  • Dynamic Scheduling Dynamic Scheduling
  • SPS semi-persistent scheduling method
  • radio resources are dynamically allocated to users according to the priority according to the data type and the quality of the radio channel state. For example, which radio resource is allocated to which user is determined for each 1 ms subframe (TTI). Since how to allocate radio resources to users changes frequently, radio resources can be used flexibly.
  • voice packets VoIP
  • voice packets data with a small amount of data is periodically generated. If such a voice packet is scheduled by the above-described dynamic scheduling method, it is necessary to designate a radio resource for each voice packet having a small data amount that is periodically generated. In this case, there is a concern that the proportion of signaling overhead (PDCCH) required for notification of radio resources becomes large with respect to the entire data to be communicated, and the utilization efficiency of radio resources deteriorates.
  • PDCCH signaling overhead
  • the semi-persistent scheduling method is a method that can cope with such concerns.
  • one radio resource allocation is applied not only to one subframe but also to many subsequent subframes. That is, by periodically allocating a certain radio resource, overhead required for radio resource signaling is reduced. Therefore, if all user apparatuses in the mobile communication system support the semi-persistent scheduling method (SPS), the above-mentioned concerns can be solved by using SPS for voice packets.
  • SPS semi-persistent scheduling method
  • One technique for increasing the voice capacity is a delay packing method.
  • the delay packing is described in Non-Patent Document 1.
  • the delay packing method improves the voice capacity by setting the voice packet transmission period longer than the voice packet generation period. In this case, while the voice capacity is improved, the amount of voice packets transmitted at a time is also increased. For example, when a voice packet generated every 20 ms is transmitted every 20 ms, one voice packet is transmitted at a time. However, when transmitted every 60 ms, three voice packets are transmitted at a time. In other words, the longer the cycle for transmitting voice packets, the greater the number of voice packets (data amount) transmitted at one time. A large amount of data transmitted and received at one time is advantageous for users with good radio channel conditions, but is disadvantageous for users with poor radio channel conditions.
  • the conventional delay packing method does not consider the communication status of each user.
  • An object of the present invention is to improve the voice capacity while considering the communication status of individual users.
  • a base station is: A quality information acquisition unit for acquiring quality information indicating a radio channel state of the user apparatus; A function selection unit that selects a weighting function corresponding to the quality information of each user device from a plurality of different weighting functions corresponding to the plurality of quality information; A scheduling unit that calculates a scheduling coefficient that varies according to a weighting function for each of one or more user apparatuses, and that allocates radio resources to the user apparatus according to at least the size of the scheduling coefficient; A notification unit that notifies the user device that radio resources have been allocated, and the weighting function is a function of data residence time of the user device, and a value of the weighting function corresponding to relatively good quality information Is a base station in the mobile communication system in which the data residence time until the value reaches a predetermined value is longer than the data residence time until the weighting function value corresponding to the relatively bad quality information reaches the predetermined value.
  • the voice capacity can be improved while considering the communication status of each user.
  • the functional block diagram of the base station used in an Example The figure which shows the table of correspondence of quality information and a weighting function.
  • the figure which shows an example of a weighting function The flowchart of the scheduling method used in an Example.
  • the figure which shows the other example of a weighting function The figure which shows the other example of a weighting function.
  • the figure which shows the other example of a weighting function The figure which shows the other example of a weighting function.
  • the embodiment described below delays the transmission timing of, for example, a downlink voice packet by devising a calculation method of a scheduling coefficient calculated for each user. Furthermore, by selecting a weighting function according to the user quality information and changing the scheduling coefficient according to the weighting function, it is possible to control the delay amount of the transmission timing according to the user communication status. it can. Thereby, the downlink data of the user whose quality information is good as in the center of the cell is delayed by a long time, and the voice capacity can be increased accordingly. Conversely, downlink data of a user whose quality information is not good, such as at the cell edge, is delayed for a short time, effectively preventing a large amount of data from being transmitted to such a user at one time.
  • FIG. 1 shows a functional block diagram of a base station used in the embodiment.
  • FIG. 1 shows a processing unit particularly related to the embodiment among processing units that realize various functions provided in a base station of a mobile communication system.
  • the illustrated base station is a base station in a long-term evolution (LTE) mobile communication system, but may be a base station in another mobile communication system.
  • FIG. 1 shows a UL signal reception unit 101, a quality information acquisition unit 103, a storage unit 105, a function selection unit 107, a scheduling unit 109, a control channel generation unit 111, a data channel generation unit 113, and a DL signal transmission unit 115. ing.
  • LTE long-term evolution
  • the UL signal receiving unit 101 receives an uplink signal (UL signal) from a user apparatus and converts it into a baseband signal. Therefore, the UL signal receiving unit 101 has a function of filtering a received radio signal, a function of converting an analog signal into a digital signal, a function of demodulating the received signal, a function of channel decoding the received signal, and the like.
  • the uplink signal generally includes a control channel, a pilot channel, a data channel, and the like.
  • the quality information acquisition unit 103 acquires quality information indicating the quality of the radio channel state from the uplink signal (UL signal). Quality information is included in the control channel.
  • the quality information may be information indicating a downlink radio channel state, information indicating an uplink radio channel state, or information including both of them.
  • the downlink radio channel state may be expressed by, for example, a channel state indicator (CQI) derived from the reception level of the pilot signal received by the user apparatus.
  • the uplink radio channel state may be derived from the reception level of the pilot signal received by the base station.
  • the reception level of the pilot signal received by the base station and the user apparatus may be expressed by any appropriate amount known to those skilled in the art.
  • the reception level is broadly defined as an amount representing the quality of the radio channel state regardless of whether it is an instantaneous value or an average value.
  • reception power field strength RSSI, desired wave reception power RSCP, It may be expressed by path loss, SNR, SIR, Ec / N 0 or the like.
  • the storage unit 105 stores correspondences between a plurality of quality information and a plurality of weighting functions.
  • FIG. 2 shows such a correspondence relationship expressed in a table format.
  • the quality information is expressed by CQI.
  • the quality information may be expressed by another amount.
  • CQI is worse in the order of CQI1, CQI2, CQI3,.
  • Each quality information is associated with a weighting function.
  • CQI1 is associated with F 1 (t)
  • CQI2 is associated with F 2 (t)
  • CQI3 is associated with F 3 (t)
  • CQIi is associated with F i ( t) is associated.
  • FIG. 3 shows an example of the weighting functions F 1 (t), F 2 (t), and F 3 (t).
  • the weighting function is for weighting the scheduling coefficient in order to achieve fairness among users from the viewpoint of data residence time.
  • the weighting function is preferably a monotonically increasing function related to the user's data residence time.
  • F (x) of x is a monotonically increasing function, it is assumed that F (x1) ⁇ F (x2) holds for any x1 ⁇ x2.
  • the weighting function is expressed by a step function.
  • the data retention time means a period during which downlink or uplink data waiting for transmission remains in the buffer. As described in “3.
  • the function form of the weighting function may be any appropriate one, but is preferably a monotonically increasing function.
  • the weighting function F i corresponding to the quality information CQIi (t) is up to t i (e.g., 0) takes the data retention time is reached t i After that, it takes a high value (eg 1).
  • i 1, 2, and 3.
  • the data retention time t i until the weighting function value corresponding to the good quality information reaches a predetermined value (for example, 1) is the weighting function value corresponding to the relatively bad quality information. Is longer than the data retention time until it reaches a predetermined value (for example, 1) (t1>t2> t3).
  • the data residence time ti in which the value of the function changes is referred to as “critical data residence time”.
  • one quality information CQIi corresponds to one weighting function F i (t), but such a one-to-one correspondence is not essential.
  • One or more arbitrary numbers of weighting functions may be associated with one or more arbitrary numbers of quality information CQIi. Further, a plurality of critical data residence times may exist in one weighting function.
  • the function selection unit 107 in FIG. 1 selects the weighting function corresponding to the quality information of each user by referring to the correspondence relationship between the quality information stored in the storage unit 105 and the weighting function. For example, when the quality information of a certain user is CQI2, the weighting function corresponding to the user is F 2 (t) (assuming the correspondence as shown in FIG. 2).
  • the quality information is repeatedly obtained from the user device, changing the weighting function every time different quality information is obtained from the user device is not preferable from the viewpoint of operational stability. Therefore, some quality information obtained from the user apparatus may be averaged, and a weighting function corresponding to the average quality information may be selected.
  • the averaging may be an arithmetic average, an average using a forgetting factor, or the like.
  • the weighting function may be updated to one corresponding to the quality information only when the quality information obtained a plurality of times shows the same value.
  • Scheduling section 109 calculates a scheduling coefficient that varies according to the weighting function for each of one or more users, and the value of the scheduling coefficient is relatively large (or it is determined that the priority is hard-decisionally high).
  • a user is selected and radio resources are preferentially allocated to the user.
  • the scheduling factor may be calculated by any suitable method.
  • the scheduling coefficient may be calculated by a MaxC / I method or a proportional fairness method.
  • the scheduling coefficient is proportional to the following factor C.
  • A represents a priority coefficient corresponding to the type of data communicated by the target user.
  • the priority coefficient is determined in advance for each type of data. For example, the priority for voice packets and real-time data is set higher than the priority for data communication and e-mail. Moreover, the priority of the emergency communication and the communication that is not so may be different.
  • R n represents an instantaneous transmission rate that can be transmitted by the target user.
  • Rave represents the average transmission rate of the target user.
  • R target represents a target transmission rate for the target user.
  • F (t) represents the above weighting function.
  • t represents the data residence time of the target user.
  • the weighting function takes a value between 0 and 1.
  • the above-described scheduling coefficient format is merely an example, and may be calculated by any appropriate mathematical formula. However, the scheduling coefficient needs to change according to the weighting function F (t).
  • the control channel generation unit 111 generates a control channel indicating how radio resources are allocated to users.
  • this control channel corresponds to a physical downlink control channel (PDCCH).
  • the control channel includes information such as an identifier of a user to which radio resources are allocated, a resource block allocated in the downlink and / or uplink, a data format (data modulation scheme and channel coding rate), and the like.
  • the data channel generation unit 113 generates a data channel for transmitting user data in the downlink.
  • the user data is generally voice packet (VoIP), real-time data, data for data communication, and the like.
  • VoIP voice packet
  • this data channel corresponds to a physical downlink shared channel (PDSCH).
  • PDSCH physical downlink shared channel
  • the DL signal transmission unit 115 transmits a downlink signal (DL signal) to the user apparatus. Therefore, the DL signal transmission unit 119 has a function of channel-coding transmitted data, a function of modulating data to be transmitted, a function of converting a digital signal into an analog signal, a function of filtering a signal to be transmitted, and amplifying the signal to be transmitted. It has a function to do.
  • DL signal downlink signal
  • FIG. 4 shows a flowchart of the scheduling method used in the embodiment.
  • This scheduling method can be used by a base station as shown in FIG. Prior to the start of the flow, the base station acquires the quality information of the radio channel state from the users residing in the cell. The flow starts from step S401 and proceeds to step S403.
  • the user index parameter n is set to 1 which is an initial value.
  • the parameter n takes a value between 1 and N.
  • N represents the total number of users who have already established bearers in the mobile communication system.
  • the number of users having data to be actually transmitted and received is N or less.
  • step S405 the base station determines whether there is data to be transmitted on the downlink for the user corresponding to the parameter n.
  • the base station performs downlink scheduling, but this is not essential to the present embodiment. It is possible to perform scheduling for the uplink in the same manner. In that case, in step S405, it is determined whether the user has data to transmit on the uplink. If there is data to be transmitted to the user corresponding to the parameter n, the flow proceeds to step S407.
  • step S407 the base station selects a weighting function F (t) corresponding to the user quality information (CQI in the case of downlink) corresponding to the parameter n.
  • the base station calculates a scheduling coefficient for the user corresponding to the parameter n.
  • the scheduling factor may be calculated in any suitable manner, but it needs to change at least according to the weighting function.
  • the scheduling coefficient may be calculated by a MaxC / I method or a proportional fairness method.
  • step S411 the value of parameter n is incremented. Even if there is no data to be transmitted to the user in step S405, the flow reaches step S411, and the value of the parameter n is incremented. Therefore, for users who do not have data to communicate, the scheduling coefficient is not calculated in step S409, and those users are excluded from radio resource allocation candidates.
  • step S413 it is determined whether or not the value of the parameter n of the user index is equal to or less than the total number N of users who have already established bearers.
  • the flow returns to step S405, and the described processing is performed. If the value of the parameter n is larger than the total number N of users who have already established bearers, the flow proceeds to step S415.
  • step S415 the base station selects a user whose scheduling coefficient is relatively large (or determined to be hard-decisionally high priority), and preferentially allocates radio resources to the user.
  • the base station notifies the user that radio resources have been allocated.
  • step S417 the flow of the scheduling method ends. Thereby, the allocation of radio resources in the scheduling target subframe (TTI) is completed. Scheduling for the next subframe starts from step S401.
  • a weighting function F (t) corresponding to the user quality information CQI is selected in step S407.
  • the weighting function F 1 (t) corresponding to the quality information CQI1 of the user # 1 is selected.
  • the scheduling coefficient of user # 1 becomes a smaller value due to the weighting function F 1 (t) before t1 (the scheduling coefficient is only the weighting coefficient).
  • the scheduling coefficient of user # 1 becomes small due to the small weighting function F 1 (t), and it becomes difficult for radio resources to be assigned to user # 1.
  • the weighting function F 1 (t) takes a large value. Therefore, when the data residence time reaches t1, the radio resource is easily assigned to the user # 1. Therefore, by using a weighting function that takes a low value for a long period of time such as F 1 (t) for users with good radio channel conditions (for example, users near the center of the cell), the radio resource allocation period Can be increased and the voice capacity can be increased.
  • the weighting function F 3 (t) corresponding to the quality information CQI3 of the user # 3 is selected.
  • the critical data residence time t3 is shorter than the critical data residence time t1.
  • the weighting function F 3 (t) takes a low value. Even if there is data to be transmitted to the user # 3 within this period, the scheduling coefficient of the user # 3 becomes a small value due to the weighting function F 3 (t) before t3. Therefore, when the data retention time does not reach t3, it is difficult to allocate radio resources to user # 3.
  • the weighting function F 3 (t) takes a large value.
  • the function form of the weighting function is not limited to the step function. Any suitable function that implements a monotonically increasing function may be used. However, from the standpoint that the function can be expressed easily by setting a plurality of function values, the weighting function is preferably expressed by a step function.
  • FIG. 5 exemplarily shows a weighting function F 1 (t) when the value of quality information, for example, CQI is good, and a weighting function F 2 (t) when the value of quality information is bad.
  • F 2 (t) is a step function similar to that shown in FIG. However, F 1 (t) takes a low value (eg, 0) until reaching t1, and increases linearly after t1.
  • FIG. 6 also exemplarily shows the weighting function F 1 (t) when the quality information value is good and the weighting function F 2 (t) when the quality information value is bad.
  • F 2 (t) is a step function similar to that shown in FIG. However, F 1 (t) increases exponentially as, for example, exp (t).
  • FIG. 7 also illustrates the weighting function F 1 (t) when the quality information value is good and the weighting function F 2 (t) when the quality information value is bad.
  • F 2 (t) is a step function similar to that shown in FIG. However, F 1 (t) is a multi-step function having a plurality of critical data residence times and changing stepwise at t11, t12, t3, t14, and T15.
  • Each of F 1 (t) in FIG. 5 to FIG. 7 can take not only a binary value of high and low but also various values, and from the viewpoint of calculating a scheduling coefficient according to the data residence time of the user. preferable.
  • F 2 (t) is shown as a common step function, but the function form of F 2 (t) is also arbitrary.
  • the examples shown in FIGS. 5 to 7 show only two states of weighting functions, for example, whether the quality information, which is CQI, is a good value. Is not required. More than two weighting functions may be represented by any functional form.
  • the base station selects a weighting function F (t) that varies depending on the data residence time for each mobile device based on quality information (for example, CQI) reported from the mobile device, To calculate the scheduling factor.
  • F (t) a weighting function that varies depending on the data residence time for each mobile device based on quality information (for example, CQI) reported from the mobile device.
  • the present invention may be applied to any appropriate mobile communication system that performs scheduling.
  • the present invention includes W-CDMA system, HSDPA / HSUPA W-CDMA system, LTE system, LTE-Advanced system, IMT-Advanced system, WiMAX, Wi-Fi system, etc. May be applied.

Landscapes

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

Abstract

L'invention porte sur une station de base qui comprend les éléments suivants : une unité d'acquisition d'informations de qualité qui acquiert des informations de qualité indiquant des états de canal sans fil pour des dispositifs utilisateur ; une unité de sélection de fonction qui sélectionne respectivement une fonction de pondération correspondant à des informations de qualité pour des dispositifs utilisateur individuels, parmi une pluralité de fonctions de pondération différentes correspondant à une pluralité d'informations de qualité ; une unité de planification qui calcule individuellement, pour un ou plusieurs dispositifs utilisateur, des coefficients de planification qui varient conformément à une fonction de pondération, et qui attribue des ressources sans fil à des dispositifs utilisateur conformément au moins à la taille d'un coefficient de planification ; et une unité de notification qui notifie à un dispositif utilisateur que des ressources sans fil lui ont été attribuées. Les fonctions de pondération sont des fonctions de temps de rétention de données pour des dispositifs utilisateur ; et le temps de rétention de données jusqu'à ce qu'une valeur prescrite soit atteinte par la valeur d'une fonction de pondération correspondant à des informations de qualité ayant une valeur relativement bonne est plus long que le temps de rétention de données jusqu'à ce que la valeur prescrite soit atteinte par la valeur d'une fonction de pondération correspondant à des informations de qualité ayant une valeur relativement mauvaise.
PCT/JP2012/055103 2011-03-18 2012-02-29 Station de base et procédé de planification dans un système de communication mobile WO2012128008A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2011-061200 2011-03-18
JP2011061200A JP5345168B2 (ja) 2011-03-18 2011-03-18 移動通信システムにおける基地局及びスケジューリング方法

Publications (1)

Publication Number Publication Date
WO2012128008A1 true WO2012128008A1 (fr) 2012-09-27

Family

ID=46879166

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/055103 WO2012128008A1 (fr) 2011-03-18 2012-02-29 Station de base et procédé de planification dans un système de communication mobile

Country Status (2)

Country Link
JP (1) JP5345168B2 (fr)
WO (1) WO2012128008A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11178049A (ja) * 1997-12-09 1999-07-02 Mitsubishi Electric Corp 無線回線割当装置及び無線回線割当方法
JP2004312190A (ja) * 2003-04-03 2004-11-04 Ntt Docomo Inc パケット送信制御装置及びパケット送信制御方法
WO2005088917A1 (fr) * 2004-03-11 2005-09-22 Matsushita Electric Industrial Co., Ltd. Appareil de station de contrôle, appareil de station de base, appareil de terminal, système de communcation par paquets et méthode de communication par paquet

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3898965B2 (ja) * 2002-03-06 2007-03-28 株式会社エヌ・ティ・ティ・ドコモ 無線リソース割り当て方法及び基地局
JP4840099B2 (ja) * 2006-11-20 2011-12-21 富士通株式会社 通話サーバ、通話システム、転送処理装置および転送処理プログラム

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11178049A (ja) * 1997-12-09 1999-07-02 Mitsubishi Electric Corp 無線回線割当装置及び無線回線割当方法
JP2004312190A (ja) * 2003-04-03 2004-11-04 Ntt Docomo Inc パケット送信制御装置及びパケット送信制御方法
WO2005088917A1 (fr) * 2004-03-11 2005-09-22 Matsushita Electric Industrial Co., Ltd. Appareil de station de contrôle, appareil de station de base, appareil de terminal, système de communcation par paquets et méthode de communication par paquet

Also Published As

Publication number Publication date
JP5345168B2 (ja) 2013-11-20
JP2012199662A (ja) 2012-10-18

Similar Documents

Publication Publication Date Title
US11076364B2 (en) Power determining method, user equipment, and base station
EP2474192B1 (fr) Procédés et agencements permettant d attribuer des ressources de demande de programmation dans un système de communication sans fil
JP5237468B2 (ja) 無線通信システムにおける方法および構成
JP5204870B2 (ja) 移動通信システムにおける基地局及びリソース割当方法
KR20120127440A (ko) 참조신호 송신방법, 이동국장치 및 기지국장치
JP5138724B2 (ja) 移動通信システムにおける基地局及び方法
US11284390B2 (en) Data communication method, terminal device, and network device
US20160278111A1 (en) Service scheduling method and device
CN104823507A (zh) 通讯方法和设备
JP2019532591A (ja) アップリンクデータの送信順序の設定
JP5651236B2 (ja) 移動通信システムにおける基地局及びリソース割当方法
KR101145489B1 (ko) 무선통신 시스템에서의 하향 링크 패킷 스케쥴링 방법 및 그 장치
JP5314173B1 (ja) 移動通信システムにおける基地局及び制御方法
US10278202B2 (en) Coordinated scheduling in a cellular network
JP5179613B2 (ja) 移動通信システムにおける基地局及びスケジューリング方法
JP5297548B1 (ja) 移動通信システムにおける基地局及び制御方法
JP7250128B2 (ja) 通信方法および装置
EP2912798B1 (fr) Division de file d'attente pour planification d'agrégation de porteuses parallèle
JP5345168B2 (ja) 移動通信システムにおける基地局及びスケジューリング方法
JP5848924B2 (ja) 基地局及び通信制御方法
CN102172092B (zh) 用户关系处理方法及设备
JP2014160940A (ja) 無線通信システムにおける無線通信装置および無線リソース割り当て方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12760287

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12760287

Country of ref document: EP

Kind code of ref document: A1