WO2005039209A1 - シグナリング方法、システム、基地局並びに移動局 - Google Patents
シグナリング方法、システム、基地局並びに移動局 Download PDFInfo
- Publication number
- WO2005039209A1 WO2005039209A1 PCT/JP2004/014701 JP2004014701W WO2005039209A1 WO 2005039209 A1 WO2005039209 A1 WO 2005039209A1 JP 2004014701 W JP2004014701 W JP 2004014701W WO 2005039209 A1 WO2005039209 A1 WO 2005039209A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- capacity
- mobile station
- flow
- combination
- base station
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
Definitions
- the present invention relates to data bucket transmission in a mobile communication system, and more particularly, to closed-loop capacity scheduling for transmitting a packet from a mobile station to a base station.
- uplink capacity is moderately managed, and mobile stations can transmit up to the maximum speed controlled by the radio network controller (RNC).
- RNC radio network controller
- statistical multiplexing control is used, and the fluctuation of noise rise is large, so a large noise rise margin is required, resulting in a loss of uplink capacity.
- Non-Patent Document 1 3GPP TR25.896 vl. 0.0 "Feasibi Iity Study for Enhanced Uplink for UTRA FDD" (2003-9)).
- the base station controls the maximum capacity of the mobile station instead of the RNC so that the noise rise fluctuation of the cell becomes smaller.
- the base station can respond to the rapid change of the radio channel condition faster than the RNC. Therefore, capacity scheduling at the base station is more effective than capacity scheduling at the RNC.
- priority processing in uplink bucket data transmission is performed in such a manner that a higher priority data bucket is transmitted before a lower priority data bucket. Therefore, the data with the highest priority The data packet is allowed to use the mobile station's maximum available transmission rate, and if there is remaining power, the next higher priority data bucket is transmitted.
- QoS processing or Compensated Bit Rate (GBR) was introduced in HSDP A. This is a type of wireless capacity scheduling in downlink packet transmission in consideration of QoS, and the bucket scheduler has sufficient wireless capacity to satisfy the data packet request QoS in addition to the priority. It takes into account the required QoS of data packets to provide capacity.
- the mobile station allocates uplink capacity to multiple data flows using a 'set' of capacity combinations (CC).
- CC capacity combinations
- Each CC in the set indicates how the total capacity is divided into multiple flows, while the total capacity TC of each CC may have different values.
- the RNC can therefore limit the total uplink transmission capacity by restricting the mobile station to use only a "subset" of the allowed CCs. Therefore, the required signaling is signaling to notify the subset from the RNC to the mobile station.
- the base station can limit the total uplink transmission capacity by restricting the mobile station to use only a "subset" of the authorized CCs.
- Pointer handling has been proposed to reduce signaling overhead to indicate a subset of CCs. This method requires that the set of CCs be ordered by total capacity. For example, if the CCs in Fig. 1 are arranged in order of total capacity, the result is as shown in Fig. 2.
- the base station When reporting the subset of allowed CCs, the base station first sends differential signaling to all mobile stations in the cell, eg, at each capacity scheduling interval. Furthermore, if the mobile station cannot meet the required priority or required QoS of the data flow, it can request a change of the subset within the permitted CC.
- differential signaling also requires that the mobile station change its subset of allowed CCs by sending +1 or 11 if the mobile station requires higher or lower capacity. It is possible to do. Differential signaling is used for uplink and downlink keys. Reduce overhead as much as possible to signal the set of allowed ccs to ensure capacity for data transmission.
- differential signaling has good bandwidth utilization, but has potential problems when applied to multiple data flows.
- one or more differential signaling messages are needed if the mobile station wants to reduce or increase the capacity allocated to a particular flow. For example, if the pointer is currently pointing to CC 3 and the mobile station wants to increase the flow capacity of flow 2 to 64 kbps, then two consecutive +1 signalings will be required and the waiting for capacity scheduling Time increases. By making the resolution of the capacity of each flow more detailed, when the total number of CC sets becomes larger, the waiting time further increases and the efficiency of capacity scheduling decreases.
- differential signaling has additional problems.
- the current pointer points to CC 3 and the mobile station reduces the capacity of flow 1 to 1 2 8 even though the capacity of flow 3 remains at 8 kbps. If we want to increase to kbps, we need two consecutive +1 signalings. After the first +1 signaling, if the pointer points to C C 2, Flow 3 will be unable to send any data. This problem is further complicated when finer resolution is used for multiple flows.
- the handling of multiple priorities and QoS of multiple flows also has differential signaling problems. If one flow has a higher priority and the other flow has a lower priority, the latency of changing the capacity of the higher priority flow increases with the resolution of the lower priority flow I do. In the example of FIG. 2, if flow 1 is a high priority flow, two consecutive differential signalings are required. This problem becomes more complicated when the resolution of low priority flows is increased or the total amount of multiplexed flows is increased. Therefore, it is necessary that the device can be applied quickly based on the flow priority and the related QoS.
- FIG. 3 a case is considered where mobile station 1 and mobile station 2 each have a plurality of flows with different priorities.
- high priority flow 1a increases capacity
- the low priority flow 1b requests a capacity reduction
- the mobile station 2 requests the high priority flow 2a to decrease the capacity and the low priority flow 2b requests the capacity increase.
- each mobile station combines capacity requests for multiple flows and notifies the base station as one capacity request. Therefore, in FIG. 3, mobile station 1 and mobile station 2 both transmit one capacity increase request. Since the base station cannot determine which flow of each mobile station requires a capacity increase, priority is given when only one capacity increase request is available due to insufficient remaining capacity. Capacity cannot be allocated preferentially to high flow. Therefore, there is a problem that the QoS achievement rate of the entire system is reduced. Disclosure of the invention
- a system or method is for use in uplink signaling to support closed loop capacity scheduling between a base station and a mobile station, the method comprising: Both mobile stations execute multiple data flows with different priorities and QoS.
- the mobile station has several steps:
- the step of changing includes:
- the mobile station has different priority and QoS from each other. Send multiple data flows.
- the mobile station comprises:
- a base station is in communication with the mobile station.
- the base station is in communication with the mobile station.
- the first advantage of the above "improved differential signaling" is that it has the same overhead as the conventional differential signaling. This can save both downlink and uplink capacity for data transmission.
- the second advantage of the "improved differential signaling" described above is separation capacity control between multiple flows.
- Conventional differential signaling provides joint capacity control.
- changes in the flow capacity will cause undesirable changes in the flow capacity of other flows. This concatenation can be resolved by introducing multiple subpointers.
- a third advantage of the "improved differential signaling" described above is that it allows for unbalanced bandwidth allocation, with higher priority over lower priority and less stringent QoS requirements. And a higher signaling bandwidth can be allocated to the flow set with more stringent QoS requirements.
- the fourth advantage of the above-mentioned "improved differential signaling" is that by introducing this in the uplink, the base station can consider the priority and QoS even among multiple mobile stations with multiple flows. Capacity scheduling. Therefore, as a whole system
- FIG. 1 is a diagram showing an example of a capacity combination when three data flows are multiplexed with each other.
- FIG. 2 is a diagram showing conventional differential signaling applied when three data flows are multiplexed with each other.
- FIG. 3 is a system diagram used to explain the problem of the conventional differential signaling.
- FIG. 4 is a diagram used for describing the first embodiment of the present invention, in which the uplink capacity is controlled by a scheduler in consideration of the QoS of the data flow. It is a figure which shows the communication between.
- FIG. 5 is a system diagram used for explaining the first embodiment of the present invention, and is a schematic diagram of capacity scheduling for enabling multiple QoS traffic classes and priority processing.
- FIG. 6 is a flowchart used in the description of the first embodiment of the present invention, and is a flowchart illustrating a front-end capacity control device.
- FIG. 7 is a flowchart used for explaining the first embodiment of the present invention, which is a flow chart of the flow capacity control device for the GBR traffic class.
- FIG. 8 is a flowchart used for explaining the first embodiment of the present invention, which is a flow chart of a flow capacity control device for a TBR traffic class.
- FIG. 9 is a flow chart used to explain the first embodiment of the present invention, in which hierarchical capacity allocation is described to enable multiple QoS and multiple priority flows. It is a flow chart of the capacity scheduler.
- FIG. 10 is a flowchart used to describe the first embodiment of the present invention, and is a capacity request uplink control channel that supports multiple flows and a plurality of mobile stations. It is the schematic of a flannel.
- FIG. 11 is a diagram used to explain the first embodiment of the present invention, and shows an example of improved differential signaling applied when three data flows are multiplexed with each other. is there.
- FIG. 12 is a diagram used for describing the first embodiment of the present invention, and is a diagram illustrating a frame format of a capacity request message in uplink signaling.
- FIG. 13 is a diagram used for describing the first embodiment of the present invention, and is a diagram illustrating a lapse of time of uplink signaling using the CRM frame formats A and B.
- FIG. 14 is a flowchart used to explain the first embodiment of the present invention, and is a flowchart used to explain a CR selection procedure for the CRM frame format B.
- FIG. 15 is a system diagram used for describing the second embodiment of the present invention, and is similar to FIG. BEST MODE FOR CARRYING OUT THE INVENTION
- the present invention provides a bucket scheduling system that supports multiple QoS and multiple priorities in uplink bucket data transmission.
- the base station 13 of FIG. 4 communicates with the mobile station of FIG. 4 in the cell by exchanging the capacity request 110 of FIG. 4 on the uplink.
- the uplink transmission capacity of 11 and 12 is controlled in the downlink, and the capacity allocation 120 of FIG. 4 is controlled.
- the capacity scheduling 13 in FIG. 4 is used to efficiently share the uplink capacity (as shown at 14 in FIG.
- the transmission speed and transmission time of the bucket are controlled.
- the scheduling timing or interval (140 in Fig. 4) is the timing when the capacity scheduling decision is made, and this decision is valid until the next scheduling timing.
- the mobile station transmits at the permitted transmission rate within the scheduling interval.
- each mobile station has a plurality of uplink data flows, and each flow has a traffic class specified by QoS request and priority.
- the traffic classes shown in FIG. 4 are, for example, compensation bit rate (GBR), target bit rate (TBR), and available bit rate (ABR).
- GRR compensation bit rate
- TBR target bit rate
- ABR available bit rate
- 68 and 81 are examples of traffic classes for stream types in data services, while ABR stands for best effort service.
- Flow priorities should be used to differentiate users (eg, business or home users) or differentiate data services (eg, specially paid services or financial services). Is possible.
- Multiple streams are multiplexed to provide one or more data flows to provide data services simultaneously (eg, simultaneous video stream and file transmission).
- FIG. 5 shows details of the system structure of the present invention having a plurality of mobile stations and base stations.
- the mobile station includes a flow capacity controller (FCC), a capacity request controller (CRC), a flow queue (flow queue), a transport format combination controller (TFCC), and a flow multiplexer. (FMUX), and the encoder (Enc).
- FCC flow capacity controller
- CRC capacity request controller
- TFCC transport format combination controller
- FMUX the encoder
- Enc the encoder
- CS capacity scheduler
- DEC decoder
- FDEMUX flow decomposer
- RET TX retransmission controller
- the uplink data flow queue (211 in FIG. 5) stores the data bucket transmitted on the uplink.
- the flow queue enters the flow capacity controller (212 in Figure 5).
- the radio network controller (RNC) sends a signal to the flow capacity controller about the QoS parameters, unique flow ID number, and initial capacity.
- the FCC calculates the required uplink capacity of the data flow based on the required QoS of the flow and the flow buffer size.
- the FCC calculates the retransmission capacity, minimum QoS, and additional QoS capacity required for the next scheduling interval.
- the minimum QoS capacity is the capacity required to meet the minimum QoS criteria, and the additional QoS capacity is the excess capacity beyond the minimum QoS criteria.
- the CRC calculates the capacity request as the sum of the retransmission capacity, the minimum QoS capacity and the additional QoS capacity.
- the capacity request calculated by the FCC for all flows at the mobile station is sent to the capacity request controller (213 in Fig. 5).
- the CRC calculates the remaining available transmit power (2130 in Fig. 5) and calculates the total capacity of the uplink capacity that can be accommodated. If the sum of the capacity requests of all the flows is greater than the capacity of the uplink capacity that can be accommodated, the CRC evaluates the capacity requests in order from the lowest priority flow to the highest priority flow. Add Q o Reduce the S part.
- the CRC will request the capacity requests in order from the lowest priority flow to the highest priority flow. Reduce the minimum QoS capacity part. If that is not enough, the CRC will reduce the retransmission capacity portion of the capacity request in order from the lowest priority flow to the highest priority flow.
- the CRC multiplexes the capacity request as a capacity request message and sends it to the base station via the uplink control channel.
- the base station capacity scheduler calculates both non-schedulable and schedulable uplink capacity using the total received power on the uplink. I do.
- the capacity scheduler also uses the reported transmit power remaining and the total received power at the uplink to calculate the minimum transmit power remaining for each mobile station in the cell. Calculate. The minimum remaining transmission power indicates the maximum transmission power of the mobile station in the next scheduling interval.
- the base station calculates the maximum storable capacity of each mobile station in the remaining amount of allocated transmission power.
- the capacity scheduler compares the maximum storable capacity with the sum of the capacity requests.If the former is smaller than the latter, the additional QoS part of the capacity request is the flow with the lowest priority.
- the schedulable capacity is distributed to all mobile station flows using flow information and capacity requests.
- the allocated capacity for each flow includes retransmission capacity, minimum QoS capacity, and additional QoS capacity.
- the base station multiplexes capacity allocation for each flow and sends it to the corresponding mobile station.
- the capacity allocation control device (214 in FIG. 5) in the mobile station receives the capacity allocation (CA) for the flow from the base station via the downlink control channel. It also uses the maximum available transmit power to calculate the available uplink capacity. If the sum of the received CAs is larger than the available uplink capacity, the CAC reduces the additional QoS part of the CAs in order of the lowest priority flows and the highest priority flows. I will do it. If this is not enough, CAC will reduce the minimum QoS part of the CA in order of lowest priority flow to highest priority flow. If that is still not enough, CAC will reduce the retransmitted portion of the CA from the lowest priority flow to the highest priority flow.
- CA capacity allocation
- uplink data transmission is performed in the following manner:
- the transport format combination controller (TFCC) (215 in Fig. 5) collects the allocated capacity for each data flow, and Transports data packets up to the allowed flow capacity. Calculate one mat combination. Prior to the new data transmission, a retransmission is allocated for each flow, and the rest of the allocated capacity is used for the new data transmission.
- TFCC transport format combination controller
- the data bucket from the flow queue is encoded by the encoder 216 of FIG. 5 and multiplexed by the FMUX 217 of FIG.
- uplink data reception is performed in the following manner:
- the flow decomposer (FDEMUX) 221 separates the received bit stream into separate sub-bit streams, which are decoded in FIG. (DEC) 222.
- the successfully decoded data buckets are then stored in the respective flow queues 223.
- the DEC 222 transmits the decoding status of each data bucket to the retransmission control device (224 in FIG. 5), and the retransmission control device transmits the status to the uplink capacity scheduler (CS) 225.
- the base station informs the corresponding mobile station of the detection status, and the mobile station receives the transmission status.
- a capacity request (CR) from the mobile station is received (226 in FIG. 5) and given to the capacity scheduler (CS) 225. Thereafter, a capacity assignment (CA) is generated by the CS 225 and transmitted to the mobile station (227 in FIG. 5).
- the CR is transmitted from the mobile station to the base station.
- Each CR contains the required capacity and FID for the flow. It is desirable that the CR be encoded at the mobile station and decoded at the base station.
- the CA On the downlink air interface (242 in Fig. 5), the CA is transmitted from the base station to the mobile station.
- Each CA contains the allowed capacity for the flow and the mobile station FID.
- FIG. 6 shows one structure of the flow capacity control device.
- the FCC is performed at least within the same time as the scheduling interval (31 in Fig. 6).
- the input parameters of the FCC are the current allocated capacity (AC) for the flow, the requested retransmission capacity (RCR), and the The QoS parameter associated with the row.
- Each traffic class preferably has its own set of QoS parameters.
- the output parameters of the FCC are the allocated capacity for retransmission (ACRT), the allocated capacity for new transmission (ACNT), and the capacity request (CR).
- the FCC calculates the retransmission request capacity to satisfy the packet data request delay (32 and 33 in Fig.
- the request delay is preferably accurate so that the FCC is allocated as much of the capacity required for retransmission as possible.
- the FCC calculates the required capacity for new data transmission, including both the minimum and additional QoS capacity of the flow (340, 341, 35 in Figure 6).
- the remaining capacity (LOL) (360 in Figure 6) is the difference between AC and the sum of ACRT and ACNT.
- a CR is calculated for the next scheduling interval to see if more capacity is needed.
- GBR is a traffic class, which means that the capacity is compensated to a predetermined level by the scheduler.
- the QoS parameters for the GBR traffic class are maximum capacity (MC) and compensation capacity (GC).
- MC is the upper limit of allowable capacity
- GC is the minimum compensation capacity.
- the scheduler may allocate more capacity than the GC depending on the availability of uplink capacity.
- FIG. 7 illustrates the implementation of the FCC for the GBR traffic class. Since retransmission data has a higher priority than new transmission data, the allocated capacity is first allocated to retransmission data, and the remaining capacity is then allocated to new transmission data (step in FIG. 7). 41 and 42). For allocation to new transmission data, the QoS parameter of the maximum capacity (MC) is used as the upper limit, and the lower limit is the current flow queue size (QC) or the allocation for the new transmission (NDC). Capacity (AC).
- MC QoS parameter of the maximum capacity
- QC current flow queue size
- NDC allocation for the new transmission
- LOC remaining capacity
- MC maximum capacity
- QC remaining flow queue size
- the maximum QoS capacity is equal to GC, while the additional QoS is 1 QoS1 ⁇ 6 different from 6 ⁇ .
- ABR is a traffic class to which capacity is assigned based on its availability in unused and schedulable capacity of base stations.
- the QoS parameters for the ABR traffic class are maximum capacity (MC) and minimum capacity (M NC).
- MC is the upper limit of the allowed capacity
- MNC is a selectable parameter that specifies the minimum capacity, sending small data packets, such as TCP ACKs, at any time.
- the implementation of the ABR FCC is the same as the GBR FCC when the QoS parameter of the compensation capacity (GC) is set to zero.
- the minimum QoS capacity is therefore zero, and the total capacity allocated to this traffic class belongs to the additional QoS capacity.
- the base station preferably allocates at least an MNC to transmit a small data bucket at any time.
- TBR is a traffic class whose capacity is maintained at the target level.
- the QoS parameters for the TBR traffic class are maximum capacity (MC) and target capacity (TC).
- MC is the upper limit of the allowed capacity
- FCC controls the instantaneous capacity so that the average capacity is the same as TC.
- Fig. 8 shows the implementation of TBR FCC. Since retransmitted data has a higher priority than newly transmitted data, the allocated capacity is allocated first to retransmitted data, and the remaining allocated capacity is then allocated to newly transmitted data. (Step 51 in FIG. 8). In order to allocate to new data, first calculate the difference between the current moving average (MAAC) of the allocated capacity and the TC (step 52 in Fig. 8). Then the required capacity meeting the TC criteria is calculated (steps 53 and 530 in Figure 8). The capacity allocation is then performed in such a way that the allocated capacity (ACNT) does not exceed the MC and queue size (QC) (step 54 in Fig. 8).
- MAAC current moving average
- QC queue size
- M A AC is updated by a moving average, using the newly calculated ACNT, and finally, a capacity request (CR) is calculated to asymptotically achieve TC (step in FIG. 8). 56).
- a capacity request (CR) is calculated to asymptotically achieve TC (step in FIG. 8).
- CR capacity request
- an exponential type adjustment function is used (indicated by 530 in FIG. 8).
- the minimum QoS capacity is the same as the new transmission request capacity (ACNT), and the FCC does not require additional QoS.
- the minimum QoS capacity of GBR, ABR, and TBR is GC, 0, and the required capacity for new data transmission (ACNT), respectively.
- the additional QoS capacity of GBR, ABR, and TBR is ACNT-GC, ACNT, and 0, respectively. Comparing these, it can be said that ABR almost represents a traffic class requiring additional QoS capacity, and TBR almost represents a traffic class requiring minimum QoS capacity.
- GBR represents a traffic class that requires both minimum and additional QoS capacity.
- FIG. 9 shows an implementation of an uplink capacity scheduler.
- the base station measures non-schedulable uplink capacity including thermal noise, inter-cell interference and non-schedulable data transmission (601 in FIG. 9).
- Non-schedulable data transmission is a potential load that the scheduler does not control.
- CS calculates available and schedulable capacity as the difference between maximum capacity and non-schedulable capacity.
- the base station Upon receiving the capacity request from the mobile station, the base station adjusts the capacity request as follows (620 in Fig. 9): The base station transmits the minimum allowed transmission power to each mobile station. After allocating the remaining capacity, calculate the maximum capacity that can be accommodated for each mobile station. The minimum remaining transmission controls the amount of interference with other cells in the network. The maximum capacity that can be accommodated at a given minimum remaining transmission capacity is compared to the total capacity of the required capacity. The maximum capacity that can be accommodated is larger than the total capacity. In order to satisfy the requirement, the additional QoS part of the capacity request is reduced in order from the lowest priority flow to the highest priority flow. If not, the minimum QoS part of the capacity request is reduced from the lowest priority flow to the highest priority flow.
- the base station requests the retransmission capacity (RCRTX) for all mobile stations, the minimum QoS capacity for each priority level (RCMQ (1), RCMQ (N)), and the additional QoS capacity ( RC
- the base station calculates the total capacity of EQ (1), ⁇ ⁇ , RCEQ (N)).
- the base station also uses the flow information and the reported capacity request to calculate the retransmission capacity, minimum QoS capacity, and additional QoS capacity for each flow for each mobile station.
- the base station first allocates schedulable capacity to retransmission capacity (61 in Figure 9). If the required capacity for the retransmission capacity is not sufficient, the base station allocates the retransmission capacity in order from the highest priority flow to the lowest priority flow. If sufficient, the base station minimizes the remaining schedulable capacity from the highest priority flow (62 in Figure 9) to the lowest priority flow (63 in Figure 9).
- Q o S Allocate to capacity is the base station.
- the base station may order the remaining schedulable capacity from the highest priority flow (64 in Figure 9) to the lowest priority flow (65 in Figure 9). Is assigned to the additional QoS capacity. If the flows are at the same priority level, the capacity is preferably distributed in a fair scheduling manner. Finally, the base station calculates the total capacity of the assigned capacity as the sum of the assigned retransmission capacity, the assigned minimum QoS capacity, and the assigned additional QoS capacity for each flow of each mobile station.
- FIG. 10 shows a schematic diagram of "different signaling of extended uplink" in the uplink.
- M mobile stations (92 in Fig. 10) And establishes a connection with the base station, and the ith mobile station has N (i) flows.
- the j-th flow of the i-th mobile station sends a capacity request CR (and j), and there are N (i) CRs for the i-th mobile station (the 910 in Figure 10).
- the N (i) CRs are then sent to a Capacity Request Message Transmitter (CRMTX) 91 (FIG. 10), which forms a Capacity Request Message (CRM) and performs uplink control.
- CRMTX Capacity Request Message Transmitter
- CCM Capacity Request Message
- Each mobile station transmits one UL-CCH, and the base station receives M UL-CCHs (93 in Fig. 10).
- the capacity request message receiver (CRMRX) calculates the CR of the mobile station's multiplex flow (94 in Fig. 10).
- the capacity request of the flow is examined, and the closest combination (CC) of capacity is selected from the set of CC.
- the data flow is divided into groups.
- the CC set is then divided into a number of CC subsets corresponding to each code division multiple access loop in the data flow.
- Each subset has its own CC for the corresponding group's data flow.
- Figure 11 shows a case in the middle of which three flows are divided into two groups.
- the set of CCs is also divided into two subsets of CCs whose set sizes are 3 and 5, respectively.
- sub-pointers corresponding to each CC subset are provided.
- the subpointer is controlled by a capacity assignment message (GAM) transmitted by the base station.
- GAM capacity assignment message
- differential signaling is sent based on sub-pointers.
- differential signaling of multiple sub-pointers is transmitted in a time division manner.
- FIG. 11 shows how the differential signaling of the first and second sub-bointers is transmitted twice and once every three time slots.
- Flow grouping is performed by separating high and low priorities in order to break the interaction of the capacity combinations described above. For example, in the example shown in FIG. 11, changing the capacity of the first flow has no effect on the capacity of the second and third flows. Therefore low with less stringent QoS requirements Changing the capacity of a priority flow does not interfere with higher priority flows that have more stringent QoS requirements.
- the differential signaling of the multiple flows is mapped to the uplink control channel (UL-CCH).
- UL-CCH uplink control channel
- This is based on the periodic transmission of differential signaling, by associating frame numbers with groups of flows.
- One example given in Figure 11 is where three flows share one UL-CCH channel, where two of the three frames are in the first group of flows. , And the second group flow is allocated once every three frames.
- the general principle is that a frame is divided into multiple frequency slots, which are assigned to multiple groups of flows. By allocating more time slots to flows with high priority and strict QoS, unbalanced signaling bandwidth distribution among multiple flows with well-defined priority and QoS becomes possible.
- subpointer 1 always points to one of the first group, 128, 64, and 0, and the subpointer points to any one of the five CCs.
- CRM Capacity Request Message
- Flow 1 with high priority and QoS criteria is allocated to 66% of the bandwidth, and Flows 2 and 3 are allocated to 33% of the bandwidth due to low priority and poor QoS.
- the general approach to CRM time slot allocation is shown in Figure 12.
- the first approach is a periodic (periodic) approach (frame format A), where each CRM frame contains L capacity request (CR) slots and defines the periodicity of P frames. Have. Therefore, it is possible to assign L * PCR channels to multiple groups of data flows as a whole. Then, one or more CR channels can be assigned to a group of data flows.
- the second approach is irregular (frame format B).
- Each CRM frame has L CR slots, but the CRM frame has no periodicity. Due to this aperiodicity, there is no predefined mapping between the CR channel and the group of data flows. Therefore, it is necessary to transmit the group ID in addition to the differential signaling.
- T XPHR transmit power
- FIG. 12 shows a two frame structure of CRM, that is, CRM frame formats A and B.
- CRM frame formats A and B With both frame structures, CR slot multiplexing becomes possible with a frame having the remaining amount of transmission power provided at the end of the frame.
- Frame format A has only a CR
- frame format B has a "flow group" ID number (GID) added.
- GID flow group ID number
- CRM Frame Format A allows periodic transmission of CRs by associating frame numbers with GIDs.
- An example is shown at c1 in FIG.
- four flow groups (numbers 1 to 4) share two slots (first and second slots). This is done in such a way that the even and odd frame numbers of the first slot are assigned to GIDs 1 and 2, respectively, and the second slot is assigned to GIDs 3 and 4.
- GIDs 3 and 4 are allocated to three slots and one slot, respectively, every four frames.
- a set of flows is assigned to a slot, and the CRs of a set of flows are multiplexed into the slots in a regular manner.
- CRM frame format A In order to improve the CRM frame format A, it is possible to repeatedly transmit CRs and combine them at the base station. The number of repetitions may be unique for each mopile.
- the advantage of CRM frame format A is that the GID does not need to be transmitted because the relationship between the frame number and the GID has been determined in advance. This is effective in reducing the capacity overhead when transmitting CRM from multiple mobile stations.
- CRM frame format B allows the transmission of GID in addition to CR.
- four flows share two slots.
- the basic principle is that the mobile station determines L flows to send in the next CR from all CRMs. Therefore, unlike frame format A, there is no fixed flow allocation.
- the advantage of frame format B is that the transmission delay of CR is reduced by effective slot allocation.
- the CR selection scheme for frame format B is shown in FIG. If there is a set of N flows for which you want to send CRs, each CR will be tested for a set of conditions and ordered and placed in the set. From the ordered set of CRs, the L CRs with the highest priority are selected for inclusion in the CRM. The first criterion for ordering is whether the CR returns the assigned capacity to the capacity scheduler ('d in Figure 14).
- the second highest priority condition in the ordering is whether the CR requires a retransmission. This is to prevent bucket transmission delays from increasing due to shortage of CRM slots.
- the last conditions in the ordering are the flow priority and whether the minimum QoS is satisfied. This is to transmit the CR of the higher priority flow before the lower priority flow. Also, lower priority flows that do not meet the minimum QoS have higher priority that satisfy the minimum QoS. CR can be sent before the flow.
- FIG. 15 shows a system configuration including a plurality of mobile stations and one base station, including the uplink and downlink channels used in the second embodiment.
- FIG. 15 differs from FIG. 5 which shows the system configuration in the first embodiment, in that CAC in FIG. 5 is not provided. Instead, in the system configuration according to the second embodiment, the CAM transmitted by the base station is received by TFGG “2 15”.
- CA indicates the total allocated capacity assigned to each mobile station
- TFGG indicates a combination of transport formats that is less than the total allocated capacity and less than the maximum power of the mobile station. select.
- the TFGG determines the combination of transport formats so that the required quality of the high priority flow is satisfied before the required quality of the low priority flow.
- the TFGG sends a TFG I indicating the combination of the selected transport formats to the base station, and sends information on the selected combination of the transport formats to the FGG.
- the FCC extracts the capacity information allocated to each data flow from the information on the selected transport format combination, and based on the flow request QoS, requests the data flow uplink. Calculate capacity and generate capacity request (GR). Thereafter, the GR is sent to the GRG, multiplexed in the same procedure as in the first embodiment, and sent as a capacity request message (CRM) to the capacity scheduler 1 (CS) in the base station.
- CRM capacity request message
- the GS in the second embodiment calculates the allocation capacity of each flow in the same procedure as the GS in the first embodiment described with reference to FIG. After that, the GS in this embodiment calculates the total allocated capacity (total allocated capacity) for each calculated flow, and moves the capacity allocation message (GAM) indicating the total allocated capacity on the downlink. Send to the station.
- GAM capacity allocation message
- ACRT allocation capacity for retransmission
- ACNT allocation capacity for new transmission
- QC current queue buffer size
- MC maximum capacity
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005514743A JP4748313B2 (ja) | 2003-10-17 | 2004-09-29 | シグナリング方法、システム、基地局並びに移動局 |
EP04773625A EP1679910A4 (en) | 2003-10-17 | 2004-09-29 | SIGNALING METHOD, SYSTEM, BASE STATION AND MOBILE STATION |
CN2004800304035A CN1868227B (zh) | 2003-10-17 | 2004-09-29 | 信令方法、系统、基站以及移动台 |
US10/576,252 US7746840B2 (en) | 2003-10-17 | 2004-09-29 | Signaling method, system, base station and mobile station |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003-358461 | 2003-10-17 | ||
JP2003358461 | 2003-10-17 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005039209A1 true WO2005039209A1 (ja) | 2005-04-28 |
Family
ID=34463302
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2004/014701 WO2005039209A1 (ja) | 2003-10-17 | 2004-09-29 | シグナリング方法、システム、基地局並びに移動局 |
Country Status (6)
Country | Link |
---|---|
US (1) | US7746840B2 (ja) |
EP (1) | EP1679910A4 (ja) |
JP (1) | JP4748313B2 (ja) |
KR (1) | KR100816598B1 (ja) |
CN (1) | CN1868227B (ja) |
WO (1) | WO2005039209A1 (ja) |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007091571A1 (ja) * | 2006-02-07 | 2007-08-16 | Ntt Docomo, Inc. | 上位局、基地局および移動局並びに送信制御方法 |
JP2009539333A (ja) * | 2006-05-31 | 2009-11-12 | クゥアルコム・インコーポレイテッド | リバース・リンク状態に対するビデオ・レート適応化 |
JP2009543436A (ja) * | 2006-06-30 | 2009-12-03 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 高速ダウンリンクパケットアクセス(hsdpa)チャネルのカバレージ向上 |
JP2010525757A (ja) * | 2007-04-23 | 2010-07-22 | クゥアルコム・インコーポレイテッド | 無線通信システムにおけるデータ送信を制御するための方法および装置 |
JP2010212753A (ja) * | 2009-03-06 | 2010-09-24 | Nec Corp | 移動通信システム、基地局、上りスケジューリング方法及びプログラム |
WO2011037088A1 (ja) * | 2009-09-28 | 2011-03-31 | 京セラ株式会社 | 無線端末、および無線通信方法 |
JP2013102435A (ja) * | 2006-04-14 | 2013-05-23 | Qualcomm Inc | 通信システムにおけるサービス品質をサポートする方法および装置 |
US8514711B2 (en) | 2005-10-21 | 2013-08-20 | Qualcomm Incorporated | Reverse link lower layer assisted video error control |
US8537197B2 (en) | 2007-01-10 | 2013-09-17 | Qualcomm Incorporated | Content- and link-dependent coding adaptation for multimedia telephony |
US8548048B2 (en) | 2005-10-27 | 2013-10-01 | Qualcomm Incorporated | Video source rate control for video telephony |
JP2014042251A (ja) * | 2006-07-14 | 2014-03-06 | Qualcomm Incorporated | 無線ネットワークにおける呼の確立と維持 |
US8797850B2 (en) | 2008-01-10 | 2014-08-05 | Qualcomm Incorporated | System and method to adapt to network congestion |
US8842555B2 (en) | 2005-10-21 | 2014-09-23 | Qualcomm Incorporated | Methods and systems for adaptive encoding of real-time information in packet-switched wireless communication systems |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4826122B2 (ja) * | 2005-04-14 | 2011-11-30 | 日本電気株式会社 | Cdma移動通信システムの受信電力測定方法およびcdma移動通信システム |
KR100735241B1 (ko) * | 2005-07-19 | 2007-07-03 | 삼성전자주식회사 | 통신 시스템에서 업링크 스케쥴링 시스템 및 방법 |
JP4699887B2 (ja) * | 2005-12-08 | 2011-06-15 | 株式会社エヌ・ティ・ティ・ドコモ | 呼受付制御装置、呼受付制御方法 |
KR100934656B1 (ko) * | 2006-02-06 | 2009-12-31 | 엘지전자 주식회사 | 다중 반송파 시스템에서의 무선 자원 할당 방법 |
NZ577640A (en) * | 2007-02-05 | 2012-05-25 | Ericsson Telefon Ab L M | Adjustments of iub load measurements |
CN101584247A (zh) * | 2007-03-16 | 2009-11-18 | 富士通株式会社 | 基站、无线控制装置以及无线装置 |
ES2381443T3 (es) * | 2008-02-12 | 2012-05-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Asignación y manejo de prioridad de recursos de enlace ascendente y enlace descendente |
KR20110016907A (ko) * | 2008-06-17 | 2011-02-18 | 파나소닉 주식회사 | 무선 송신 장치 및 무선 송신 방법 |
KR100968020B1 (ko) | 2008-06-18 | 2010-07-08 | 엘지전자 주식회사 | 랜덤 액세스 절차를 수행하는 방법 및 그 단말 |
WO2009154403A2 (en) * | 2008-06-18 | 2009-12-23 | Lg Electronics Inc. | Method of transmitting power headroom reporting in wireless communication system |
GB2461158B (en) | 2008-06-18 | 2011-03-02 | Lg Electronics Inc | Method for performing random access procedures and terminal therof |
GB2461159B (en) | 2008-06-18 | 2012-01-04 | Lg Electronics Inc | Method for transmitting Mac PDUs |
US11272449B2 (en) | 2008-06-18 | 2022-03-08 | Optis Cellular Technology, Llc | Method and mobile terminal for performing random access |
GB2461780B (en) | 2008-06-18 | 2011-01-05 | Lg Electronics Inc | Method for detecting failures of random access procedures |
US7957298B2 (en) | 2008-06-18 | 2011-06-07 | Lg Electronics Inc. | Method for detecting failures of random access procedures |
KR100949972B1 (ko) * | 2009-01-02 | 2010-03-29 | 엘지전자 주식회사 | 단말의 임의접속 수행 기법 |
KR101122095B1 (ko) | 2009-01-05 | 2012-03-19 | 엘지전자 주식회사 | 불필요한 재전송 방지를 위한 임의접속 기법 및 이를 위한 단말 |
US9521632B2 (en) * | 2011-08-15 | 2016-12-13 | Google Technology Holdings LLC | Power allocation for overlapping transmission when multiple timing advances are used |
US9485061B2 (en) * | 2012-10-12 | 2016-11-01 | Samsung Electronics Co., Ltd. | Communication system with flexible repeat-response mechanism and method of operation thereof |
EP2949148A4 (en) * | 2013-01-25 | 2016-08-31 | Ericsson Telefon Ab L M | METHOD AND DEVICE FOR CAPACITY MANAGEMENT |
US9973438B2 (en) * | 2013-10-07 | 2018-05-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Downlink flow management |
EP3244682B1 (en) * | 2016-05-12 | 2020-08-19 | ASUSTek Computer Inc. | Uplink transmission in shortened transmission time intervals in a wireless communication system |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000244521A (ja) * | 1999-02-22 | 2000-09-08 | Sumitomo Electric Ind Ltd | 通信方法及び通信装置 |
JP2001156784A (ja) * | 1999-11-26 | 2001-06-08 | Nippon Telegr & Teleph Corp <Ntt> | 帯域共用回路 |
JP2002520939A (ja) * | 1998-07-10 | 2002-07-09 | モトローラ・インコーポレイテッド | 無線通信システムにおいて送信電力を加入者ユニットに配分する方法およびシステム |
JP2002281545A (ja) * | 2001-03-19 | 2002-09-27 | Matsushita Electric Ind Co Ltd | 通信装置、通信方法、通信プログラム、記録媒体、移動局、基地局および通信システム |
JP2003008635A (ja) * | 2001-04-02 | 2003-01-10 | Lucent Technol Inc | 複数のデータフローをスケジューリングする方法およびそのためのソフトウエアおよびcdmaシステムおよびベーストランシーバステーションおよび移動体局 |
JP2003163687A (ja) * | 2001-11-26 | 2003-06-06 | Nippon Telegr & Teleph Corp <Ntt> | 経路制御方法および装置 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6452915B1 (en) * | 1998-07-10 | 2002-09-17 | Malibu Networks, Inc. | IP-flow classification in a wireless point to multi-point (PTMP) transmission system |
EP1154663B1 (en) * | 2000-05-09 | 2008-09-24 | Lucent Technologies Inc. | Improved quality of service control in a mobile telecommunications network |
US20020075805A1 (en) * | 2000-09-22 | 2002-06-20 | Narad Networks, Inc. | Broadband system with QOS based packet handling |
EP1209936A1 (en) * | 2000-11-22 | 2002-05-29 | Lucent Technologies Inc. | Method and system for UMTS packet transmission scheduling on shared downlink channels |
CN1868233B (zh) * | 2003-10-16 | 2010-06-16 | 日本电气株式会社 | 容量调度的方法和系统 |
KR100772129B1 (ko) * | 2004-05-04 | 2007-11-01 | 삼성전자주식회사 | 역방향 패킷 전송 시스템에 있어서 소프트 핸드오버 단말들의 스케줄링을 위한 최적 셀 선정 방법 및 장치 |
-
2004
- 2004-09-29 KR KR20067009474A patent/KR100816598B1/ko not_active IP Right Cessation
- 2004-09-29 WO PCT/JP2004/014701 patent/WO2005039209A1/ja active Search and Examination
- 2004-09-29 EP EP04773625A patent/EP1679910A4/en not_active Withdrawn
- 2004-09-29 US US10/576,252 patent/US7746840B2/en not_active Expired - Fee Related
- 2004-09-29 CN CN2004800304035A patent/CN1868227B/zh not_active Expired - Fee Related
- 2004-09-29 JP JP2005514743A patent/JP4748313B2/ja not_active Expired - Fee Related
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002520939A (ja) * | 1998-07-10 | 2002-07-09 | モトローラ・インコーポレイテッド | 無線通信システムにおいて送信電力を加入者ユニットに配分する方法およびシステム |
JP2000244521A (ja) * | 1999-02-22 | 2000-09-08 | Sumitomo Electric Ind Ltd | 通信方法及び通信装置 |
JP2001156784A (ja) * | 1999-11-26 | 2001-06-08 | Nippon Telegr & Teleph Corp <Ntt> | 帯域共用回路 |
JP2002281545A (ja) * | 2001-03-19 | 2002-09-27 | Matsushita Electric Ind Co Ltd | 通信装置、通信方法、通信プログラム、記録媒体、移動局、基地局および通信システム |
JP2003008635A (ja) * | 2001-04-02 | 2003-01-10 | Lucent Technol Inc | 複数のデータフローをスケジューリングする方法およびそのためのソフトウエアおよびcdmaシステムおよびベーストランシーバステーションおよび移動体局 |
JP2003163687A (ja) * | 2001-11-26 | 2003-06-06 | Nippon Telegr & Teleph Corp <Ntt> | 経路制御方法および装置 |
Cited By (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8842555B2 (en) | 2005-10-21 | 2014-09-23 | Qualcomm Incorporated | Methods and systems for adaptive encoding of real-time information in packet-switched wireless communication systems |
US8406309B2 (en) | 2005-10-21 | 2013-03-26 | Qualcomm Incorporated | Video rate adaptation to reverse link conditions |
US8514711B2 (en) | 2005-10-21 | 2013-08-20 | Qualcomm Incorporated | Reverse link lower layer assisted video error control |
US8548048B2 (en) | 2005-10-27 | 2013-10-01 | Qualcomm Incorporated | Video source rate control for video telephony |
WO2007091571A1 (ja) * | 2006-02-07 | 2007-08-16 | Ntt Docomo, Inc. | 上位局、基地局および移動局並びに送信制御方法 |
JP2013102435A (ja) * | 2006-04-14 | 2013-05-23 | Qualcomm Inc | 通信システムにおけるサービス品質をサポートする方法および装置 |
JP2009539333A (ja) * | 2006-05-31 | 2009-11-12 | クゥアルコム・インコーポレイテッド | リバース・リンク状態に対するビデオ・レート適応化 |
JP2009543436A (ja) * | 2006-06-30 | 2009-12-03 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 高速ダウンリンクパケットアクセス(hsdpa)チャネルのカバレージ向上 |
US10447557B2 (en) | 2006-07-14 | 2019-10-15 | Qualcomm Incorporated | Call establishment and maintenance in a wireless network |
US9781014B2 (en) | 2006-07-14 | 2017-10-03 | Qualcomm Incorporated | Call establishment and maintenance in a wireless network |
JP2014042251A (ja) * | 2006-07-14 | 2014-03-06 | Qualcomm Incorporated | 無線ネットワークにおける呼の確立と維持 |
US8537197B2 (en) | 2007-01-10 | 2013-09-17 | Qualcomm Incorporated | Content- and link-dependent coding adaptation for multimedia telephony |
US8406255B2 (en) | 2007-04-23 | 2013-03-26 | Qualcomm Incorporated | Method and apparatus for controlling data transmission in a wireless communication system |
JP2010525757A (ja) * | 2007-04-23 | 2010-07-22 | クゥアルコム・インコーポレイテッド | 無線通信システムにおけるデータ送信を制御するための方法および装置 |
US8797850B2 (en) | 2008-01-10 | 2014-08-05 | Qualcomm Incorporated | System and method to adapt to network congestion |
JP2010212753A (ja) * | 2009-03-06 | 2010-09-24 | Nec Corp | 移動通信システム、基地局、上りスケジューリング方法及びプログラム |
JP2011071899A (ja) * | 2009-09-28 | 2011-04-07 | Kyocera Corp | 無線端末、および無線通信方法 |
WO2011037088A1 (ja) * | 2009-09-28 | 2011-03-31 | 京セラ株式会社 | 無線端末、および無線通信方法 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2005039209A1 (ja) | 2007-02-08 |
US7746840B2 (en) | 2010-06-29 |
JP4748313B2 (ja) | 2011-08-17 |
US20070076679A1 (en) | 2007-04-05 |
EP1679910A4 (en) | 2011-09-14 |
EP1679910A1 (en) | 2006-07-12 |
CN1868227A (zh) | 2006-11-22 |
KR100816598B1 (ko) | 2008-03-24 |
KR20060120115A (ko) | 2006-11-24 |
CN1868227B (zh) | 2013-06-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4748313B2 (ja) | シグナリング方法、システム、基地局並びに移動局 | |
JP4335619B2 (ja) | パケット優先制御装置及びその方法 | |
JP4513980B2 (ja) | キャパシティスケジューリングの方法及びシステム | |
US9456451B2 (en) | Method and system for managing radio resources in a time-slotted communication system | |
KR101013350B1 (ko) | 복수의 사전들 사이에서 선택하는 방법 및 장치 | |
KR101177136B1 (ko) | 기지국에서 전송 리소스를 할당하기 위한 방법 | |
JP4853732B2 (ja) | 移動体通信システム及びその通信制御方法 | |
EP2097990B1 (en) | Power overload control method useful with enhanced dedicated channel traffic | |
CN112637911B (zh) | 一种5G系统中eMMB和urllc并存时资源分配方法及系统 | |
GB2418105A (en) | Relative indicators used for scheduling of uplink transmissions | |
JP2003521182A (ja) | 無線通信システムにおけるチャネル割り当てのシグナリング方法 | |
KR100582902B1 (ko) | 이동통신 시스템의 전력 할당 장치 및 전력 할당 방법 | |
Lee et al. | Power efficient frequency domain packet scheduling for OFDMA systems | |
JP2009273135A (ja) | パケット優先制御装置及びその方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200480030403.5 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2005514743 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007076679 Country of ref document: US Ref document number: 10576252 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2004773625 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067009474 Country of ref document: KR |
|
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWP | Wipo information: published in national office |
Ref document number: 2004773625 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020067009474 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 10576252 Country of ref document: US |