[go: up one dir, main page]

CN111385902B - Data scheduling method and device - Google Patents

Data scheduling method and device Download PDF

Info

Publication number
CN111385902B
CN111385902B CN201811643755.8A CN201811643755A CN111385902B CN 111385902 B CN111385902 B CN 111385902B CN 201811643755 A CN201811643755 A CN 201811643755A CN 111385902 B CN111385902 B CN 111385902B
Authority
CN
China
Prior art keywords
mcs
physical resource
scheduling
prb
info
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
CN201811643755.8A
Other languages
Chinese (zh)
Other versions
CN111385902A (en
Inventor
张景林
吴昊
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201811643755.8A priority Critical patent/CN111385902B/en
Priority to PCT/CN2019/115777 priority patent/WO2020134610A1/en
Publication of CN111385902A publication Critical patent/CN111385902A/en
Application granted granted Critical
Publication of CN111385902B publication Critical patent/CN111385902B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling

Landscapes

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

Abstract

The invention provides a data scheduling method and a device, the method comprises the steps of obtaining a modulation and coding Mode (MCS) table used by scheduling current UE, the number of layers, the number of effective resource units in each physical resource block in the current time slot and the number of available physical resource blocks remained in the current time slot; calculating critical quantization information bits of a data block to be scheduled; calculating the dispatching MCS of the data block to be dispatched according to the critical quantization information bit, the MCS table, the layer number, the number of effective resource units and the number of available physical resource blocks; and calculating the number of physical resource blocks required by scheduling according to the scheduling MCS of the data block to be scheduled. In the invention, the critical quantization information bits of the data block to be scheduled are calculated first, and then the scheduled MCS and PRB number are calculated based on the critical quantization information bits, so that the scheduling calculation amount of the MAC layer is greatly reduced.

Description

Data scheduling method and device
Technical Field
The present invention relates to the field of communications, and in particular, to a method and apparatus for scheduling media access control layer data.
Background
In a wireless communication system, a primary task of the MAC (Medium Access Control ) layer is to schedule logical channel data to be transmitted on a physical channel. In 4G LTE (Long Term Evolution ), a protocol defines a plurality of TBSize (Transport Block Size, transmission resource block size) tables, and after the MAC layer acquires a logical channel BSR (Buffer Status Report ), the MAC layer can acquire the finally scheduled MCS (Modulation and Coding Scheme, modulation and coding strategy), the number of PRBs (Physical Resource Block, physical resource blocks), and the number of layers based on the table look-up.
In a 5G NR (New Radio) system, the determination of TBSize is obtained by calculation, and for a given MCS, number of PRBs, and number of layers v, the number of valid REs (Resource elements) in one PRB is first obtained, and the number of PRBs is multiplied by the number of valid REs to obtain the total number of REs. Then, based on the total RE number, MCS, v, the intermediate number of information bits Ninfo is calculated. Finally, ninfo is quantized to obtain the final TBSize. If the TBSize meeting the size of the BSR is searched based on the MCS and PRB number polling mode, the calculated amount required by the MAC layer is too large, and the scheduling performance of the base station side is affected.
Disclosure of Invention
The embodiment of the invention provides a method and a device for scheduling media access control layer data, which at least solve the problem that the scheduling performance of a base station side is affected due to overlarge calculation amount required by an MAC layer in the related technology.
According to an embodiment of the present invention, there is provided a data scheduling method including: acquiring a modulation and coding Mode (MCS) table, an air interface transmission layer number v and an effective resource unit number N in each physical resource block in a current time slot used for scheduling the current UE RE The number of available physical resource blocks remaining in the current slot, N PRB A_domain; calculating critical quantization information bits C of a data block to be scheduled info The method comprises the steps of carrying out a first treatment on the surface of the Quantizing information bits C according to the threshold info The MSC table, the layer number v, the effective resource unit number N RE And the number of available physical resource blocks N PRB Calculating the dispatching MCS of the data block to be dispatched; and calculating the number of physical resource blocks required by scheduling according to the scheduling MCS of the data block to be scheduled.
According to another embodiment of the present invention, there is provided a data scheduling apparatus including: an acquisition module for acquiring a Modulation and Coding Scheme (MCS) table, an air interface transmission layer number v, and an effective resource unit number N in each physical resource block in a current time slot used for scheduling a current UE RE The number of available physical resource blocks remaining in the current slot, N PRB A_domain; a critical quantization information bit calculation module for calculating critical quantization information bit C of the data block to be scheduled info The method comprises the steps of carrying out a first treatment on the surface of the An MCS calculation module for quantizing information bit C according to the critical value info The MSC table, the layer number v, the effective resource unit number N RE And the number of available physical resource blocks N PRB Calculating the dispatching MCS of the data block to be dispatched; and the physical resource block calculation module is used for calculating the number of physical resource blocks required by scheduling according to the scheduling MCS.
According to a further embodiment of the invention, there is also provided a storage medium having stored therein a computer program, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
According to a further embodiment of the invention, there is also provided an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
In the above embodiment of the present invention, the critical quantization information bits of the data block to be scheduled are calculated first, and then the MCS and the PRB number to be scheduled are back calculated based on the critical quantization information bits, so that the scheduling calculation amount of the MAC layer is greatly reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
FIG. 1 is a block diagram of a base station operating in accordance with an embodiment of the method of the present invention;
FIG. 2 is a flow chart of a data scheduling method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a critical quantization information bit according to an embodiment of the present invention;
fig. 4 is a flowchart of a 5G medium access control layer data scheduling method according to an embodiment of the present invention;
FIG. 5 is a flowchart of critical quantization information bit calculation steps according to an alternative embodiment of the present invention;
fig. 6 is a flowchart of an MCS calculation method according to an embodiment of the present invention;
fig. 7 is a flowchart of a PRB calculation method according to an embodiment of the present invention;
FIG. 8 is a block diagram of a data scheduler according to an embodiment of the present invention;
fig. 9 is a block diagram of a data scheduling apparatus according to another embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the drawings in conjunction with embodiments. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.
The method embodiments provided by the invention can be executed in a base station or similar computing device. Taking the operation on a base station as an example, fig. 1 is a block diagram of a hardware structure of a base station in a data scheduling method according to an embodiment of the present invention. As shown in fig. 1, the base station may include one or more (only one is shown in fig. 1) processors 102 (the processors 102 may include, but are not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA) and a memory 104 for storing data, and optionally, a transmission device 106 for communication functions and a transmission device 108 for wireless signal transmission and reception. It will be appreciated by those skilled in the art that the structure shown in fig. 1 is merely illustrative and not limiting of the structure of the mobile terminal described above. For example, the base station may also include more or fewer components than shown in fig. 1, or have a different configuration than shown in fig. 1.
The memory 104 may be used to store a computer program, for example, a software program of application software and a module, such as a computer program corresponding to a data scheduling method in an embodiment of the present invention, and the processor 102 executes the computer program stored in the memory 104 to perform various functional applications and data processing, that is, implement the above-mentioned method. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory remotely located relative to the processor 102, which may be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 106 is arranged to receive or transmit data via a network. For example, the base station may access the operator's core network through the transmission device 106.
The transmitting device 108 may be an antenna system including a Radio Frequency (RF) module for communicating with the mobile terminal wirelessly.
In this embodiment, a data scheduling method running in the base station is provided, fig. 1 is a flowchart of data scheduling according to an embodiment of the present invention, and as shown in fig. 2, the flowchart includes the following steps:
step S202, the MAC layer acquires the scheduling BSR and determines the MCS table, the layer number v, and the effective RE number N in each PRB in the current time slot (slot) used by the scheduling current UE RE The number N of available PRBs remaining in the current slot PRB_remain
Step S204, calculating critical quantization information bit C info
For tbsize1<BSR is less than or equal to tbsize2, and critical quantization information bits C of tbsize1 and tbsize2 can be calculated according to a quantization formula given by a protocol info Based on C info -1 quantizing the calculated tbsize=tbsize 1, based on C info The calculated tbsize=tbsize 2 is quantized, as shown in fig. 3, TBSize1 is shown in fig. 3<Critical quantization information bit C in the case of BSR less than or equal to tbsize2 info A schematic calculation is performed.
Thus only need to be based on C info Back-calculating MCS and PRB to make intermediate information bit quantity Ninfo greater than or equal to C obtained by calculating MCS and PRB info The TBSize of the MCS and PRB schedule can be ensured to meet the BSR calculation requirement.
Step S206, based on critical quantization information bit C info MCS table, layer v, effective RE number N RE And available N remaining in the current slot PRB_remian Computing scheduled I MCS
Step S208, based on critical quantization information bit C info MCS table, layer v, valid RE number N RE Usable N PRB_remian Back-calculating the number of PRBs N required for scheduling with the MCS of the schedule PRB . Thus, the base station can obtain the PRB number N needed for scheduling PRB And scheduling the data.
In this embodiment, the critical quantization information bits of the data block to be scheduled are calculated first, and then the MCS and the PRB number of the scheduling are calculated back based on the critical quantization information bits, so that the scheduling calculation amount of the MAC layer at the base station side is greatly reduced.
The embodiment of the invention also provides a 5G media access control layer data scheduling method, as shown in fig. 4, which specifically comprises the following steps:
step S401, determining an MCS table, a layer number v, and an effective RE number N in each PRB in the current slot used for scheduling the current UE RE The number N of available PRBs remaining in the current slot PRB_remain
The MCS table used by the UE may be determined according to the 38.214 protocol. The effective RE number in each PRB in the current slot is calculated according to 38.214 protocol. The layer number v can be obtained through channel quality information, because after layer mapping is performed on a TB block, the TB block is mapped to one or more transport layers, and each layer corresponds to a valid data stream. This layer number v is the number of air interface transmission layers of the TB block. The number of available PRBs remaining in the current slot is the total number of PRBs minus the number of PRBs allocated to be scheduled, and in 5G, the PRB is scheduled based on a partial Bandwidth (BWP), so the total PRB is the total number of PRBs of the BWP currently scheduled for the UE.
Step S402, calculating critical quantization information bit C info
For one bsr, tbsize1 is satisfied<bsr is less than or equal to tbsize2, as shown in FIG. 3, which corresponds to critical quantization information bit C info Satisfaction based on C info Calculated after quantization to have tbsize equal to tbsize2, C info -1 the tbsize is calculated to be equal to tbsize1 after quantization. As shown in fig. 5, the critical quantization information bit C info The calculation of (1) specifically comprises the following steps:
step S402-1: judging whether bsr is less than or equal to 3824, if so, executing step S402-2; if not, go to step S402-3.
In the 5G 38.214 protocol, there are two calculation modes for the quantization of the intermediate number Ninfo of information bits, which correspond to Ninfo not more than 3824 and Ninfo respectively>3824, thus pair C info It is also necessary to give different calculation formulas based on different quantization processes.
Step S402-2: bsr C is not more than 3824 info The calculation process of (1) is as follows:
1) Finding the maximum TBS less than bsr in the TBS table, and recording as TBS, wherein TBS is tbsize1 described above;
2) Calculation of
Figure GDA0004052389610000061
n is a factorization of the quantization rounding factor, and the power n of 2 is an integer multiple of 8, thereby ensuring quantized C info Is an integer number of bytes;
3) In the calculation
Figure GDA0004052389610000062
Step S402-3: bsr C is not less than 3824 info The calculation process of (1) is as follows:
1) Calculation of
Figure GDA0004052389610000063
n is a factorization of the quantization rounding factor, and the power n of 2 is an integer multiple of 8, thereby ensuring that the quantized Cinfo is an integer number of bytes;
2) Calculation of
Figure GDA0004052389610000064
3) If it is
Figure GDA0004052389610000065
Then C info =C info +2 n-1 Otherwise Cinfo remains unchanged.
Step S403, based on C info MCS table, v, NRE, N PRB_remian The scheduled MCS is calculated.
In order to more clearly describe the calculation process of the scheduled MCS, the step flowchart of the calculation method of the scheduled MCS according to an embodiment of the present invention, as shown in fig. 6, includes the following steps:
step S403-1: whether the scheduled MCS has been determined or not is judged, and if not, step S403-2 is performed.
Firstly, whether the channel quality information of the current scheduling UE is acquired or not needs to be judged, and if the base station has the channel quality information of the UE, the scheduling MCS can be calculated based on the channel quality information of the UE. Furthermore, even if the base station does not have channel quality information of the terminal, the MCS of the current schedule may be set in other manners, such as based on a conservative schedule.
Step S403-2: calculate Q m R,Q m R=C info /N RE /N PRB_remain /v。
Step S403-3: from I in a determined MCS table MCS Start looking for first Q =0 m X R is greater than or equal to Q m I of R MCS ,Q m Is I MCS Corresponding modulation order, R is I MCS Corresponding to the code rate. I MCS The minimum MCS required to schedule bsr-sized data blocks for the current UE for the current slot.
Step S403-4: judgment of I MCS If the MCS range allowed to be used is exceeded, step S403-5 is executed, and if not, step S403-6 is executed.
This is because the protocol has a limit on the MCS used by certain types of data blocks, e.g., system information, when the modulation order Q m Must be less than or equal to 2 if I MCS Corresponding Q m Beyond 2, the current slot is not schedulable for the data block. In addition, the MCS range may be set autonomously in implementation, for example, the MCS range is 4-10, or the MCS range is 10-20, etc., and configured based on specific scene requirements.
Step S403-5: the current slot does not schedule the data block;
step S403-6: selecting one of the MCS ranges greater than or equal to I MCS The MCS is the MCS value of the schedule.
Step S404, based on C info MCS table, number of layers v, N RE 、N PRB_remian Back-calculating the number N of PRBs required for scheduling by the MCS for the scheduling PRB
Fig. 7 is a flowchart illustrating steps of a PRB calculation method according to an embodiment of the present invention, and as shown in fig. 7, the method includes the following steps:
step S404-1: firstly, looking up an MCS table according to a scheduled MCS to obtain a corresponding modulation order Q m And a code rate R.
Step S404-2: calculate N PRB =ceil(C info /N RE /R/Qm/v)。
Step S404-3: judging N PRB Whether or not it is smaller than N PRB_remain If yes, executing step S404-4, if not, executing step S404-5;
step S404-4: the number of the scheduled PRBs is N PRB
Step S404-5: judging whether the current data block can be partitioned, if so, the number of the scheduled PRB is N PRB The method comprises the steps of carrying out a first treatment on the surface of the If not, executing step S404-6;
step S404-6: the current slot does not schedule the current data block.
In the above embodiment of the present invention, the critical quantization information bits of the data block to be scheduled are calculated first, and then the MCS and the PRB number for scheduling are calculated back based on the critical quantization information bits, so that the scheduling calculation amount of the MAC layer at the base station side is greatly reduced.
From the description of the above embodiments, it will be clear to a person skilled in the art that the method according to the above embodiments may be implemented by means of software plus the necessary general hardware platform, but of course also by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising several instructions for causing a communication device (which may be a base station, a server, or a network device, etc.) to perform the method according to the embodiments of the present invention.
In this embodiment, a device for scheduling media access layer data is further provided, and the device is used to implement the foregoing embodiments and preferred embodiments, and will not be described in detail. As used below, the term "module" or "unit" may be a combination of software and/or hardware that implements the predetermined functionality. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Fig. 8 is a block diagram of a data scheduling apparatus according to an embodiment of the present invention, which includes an acquisition module 10, a critical quantization information bit calculation module 20, an MCS calculation module 30, and a physical resource block calculation module 40, as shown in fig. 8.
The acquisition module 10 is configured to acquire a modulation and coding scheme MCS table, a layer number v, and an effective resource unit number N in each physical resource block in the current slot used by the scheduled current UE RE The number of available physical resource blocks remaining in the current slot, N PRB _remain。
The critical quantization information bit calculation module 20 is used for calculating critical quantization information bits C of the data block to be scheduled info
The MCS calculation module 30 is used for quantizing the information bit C according to the critical value info The MSC table, the layer number v, the effective resource unit number N RE And the number of available physical resource blocks N PRB And (2) calculating the dispatching MCS of the data block to be dispatched.
The physical resource block calculation module 40 is configured to calculate the number of physical resource blocks required for scheduling according to the scheduling MCS.
Fig. 9 is a block diagram of a data scheduling apparatus according to another embodiment of the present invention, which includes a first calculation unit 201 and a second calculation unit 202 in addition to all the blocks shown in fig. 8, as shown in fig. 9, and the critical quantization information bit calculation module 20
The first calculating unit 201 is configured to determine whether the size of the scheduled buffer status report is less than or equal to a set threshold, if so, search the TBS table for a maximum TBS less than the buffer status report, and calculate the critical quantization information bit C according to the following formula info
Figure GDA0004052389610000091
Figure GDA0004052389610000092
The second calculation unit 202 is configured to calculate the critical quantization information bit C according to the following formula in case the buffer status report is greater than the set threshold info
Figure GDA0004052389610000093
Figure GDA0004052389610000094
Wherein bsr is the size of the buffer status report.
In the case where the buffer status report is greater than the set threshold, the second calculation unit 201 further determines after calculating the critical quantization information bit if
Figure GDA0004052389610000095
Then press C info =C info +2 n-1 And adjusting the calculated critical quantization information bits, otherwise, keeping the calculated critical quantization information bits unchanged.
In the above embodiment, the MCS calculation module 30 may further include a third calculation unit 301 and a first determination unit 302.
The third calculation unit 301 is used for calculating Q m R=C info /N RE /N PRB _remain/v and from I in the MCS table MCS Start looking for first Q =0 m X R is greater than or equal to Q m I of R MCS ,Q m Is I MCS Corresponding modulation order, R is I MCS Corresponding code rate, I MCS Scheduling buffer status report of current UE for current time slotThe minimum MCS required for the data block of the size is reported.
A first judging unit 302 for judging I MCS Whether the allowable MCS range is exceeded, if so, the current slot does not schedule the data block, and if not, one of the slots is selected to be greater than or equal to I MCS As the MCS value of the schedule.
In the above embodiment, the physical resource block calculation module 40 may further include:
a searching unit 401 for searching the MCS table according to the scheduled MCS to obtain the corresponding modulation order Q m And a code rate R.
A fourth calculation unit 402 for calculating a physical resource block N required for scheduling according to the following formula PRB :N PRB =ceil(C info /N RE /R/Qm/v)。
In the above embodiment, the physical resource block calculation module 40 may further include a second judgment unit 403 and a third judgment unit 404.
The second judging unit 403 is configured to judge N after calculating the physical resource block required for scheduling PRB Whether the number of the available physical resource blocks is smaller than the number of the remaining available physical resource blocks in the current time slot, if yes, the number of the physical resource blocks required by scheduling is N PRB
The third judging unit 404 is configured to, at N PRB If the number of the available physical resource blocks remaining in the current time slot is greater than or equal to the number of the available physical resource blocks remaining in the current time slot, further judging whether the current data block can be segmented, and if yes, determining that the number of the physical resource blocks required by scheduling is N PRB The method comprises the steps of carrying out a first treatment on the surface of the If not, the current time slot does not schedule the current data block.
It should be noted that each of the above modules may be implemented by software or hardware, and for the latter, it may be implemented by, but not limited to: the modules are all located in the same processor; alternatively, the above modules may be located in different processors in any combination.
An embodiment of the invention also provides a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
Alternatively, in the present embodiment, the storage medium may include, but is not limited to: a usb disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing a computer program.
An embodiment of the invention also provides an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
Optionally, the electronic apparatus may further include a transmission device and an input/output device, where the transmission device is connected to the processor, and the input/output device is connected to the processor.
It will be appreciated by those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a memory device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps within them may be fabricated into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention should be included in the protection scope of the present invention.

Claims (8)

1. A method for scheduling data, comprising:
acquiring a modulation and coding Mode (MCS) table, an air interface transmission layer number v and an effective resource unit number N in each physical resource block in a current time slot used for scheduling the current UE RE The number of available physical resource blocks remaining in the current slot, N PRB _remain;
Calculating critical quantization information bits C of a data block to be scheduled info Comprising: judging whether the size of the scheduled buffer status report is smaller than or equal to a set threshold value, if so, searching a TBS table for a maximum TBS smaller than the buffer status report, and calculating the critical quantization information bit C according to the following formula info
Figure FDA0004052389600000011
Figure FDA0004052389600000012
If the buffer status report is greater than the set threshold, the critical quantization information bit C is calculated according to the following formula info
Figure FDA0004052389600000013
Figure FDA0004052389600000014
Wherein bsr is the size of the buffer status report;
calculating the critical quantization information bit C in case the buffer status report is greater than the set threshold info : thereafter, the method further comprises: if it is
Figure FDA0004052389600000015
Then press C info =C info +2 n-1 Adjusting the calculated critical quantization information bits, otherwiseKeeping the calculated critical quantization information bits unchanged;
quantizing information bits C according to the threshold info The MCS table, the layer number v, the number N of effective resource units RE And the number of available physical resource blocks N PRB And (2) calculating the dispatching MCS of the data block to be dispatched by the_domain, which comprises the following steps:
calculate Q m R=C info /(N RE *N PRB _domain v) and is selected from I in the MCS table MCS Start looking for first Q =0 m X R is greater than or equal to Q m I of R MCS ,Q m Is I MCS Corresponding modulation order, R is I MCS Corresponding code rate, I MCS Scheduling a minimum MCS required for a data block of a buffer status report size of a current UE for a current slot;
judgment of I MCS Whether the allowable MCS range is exceeded, if so, the current slot does not schedule the data block, and if not, one of the slots is selected to be greater than or equal to I MCS As a scheduled MCS value;
quantizing information bits C according to the threshold info The MCS table, the layer number v, the number N of effective resource units RE The number N of the available physical resource blocks PRB And (2) reversely calculating the number of the physical resource blocks required by scheduling by the scheduling MCS of the data block to be scheduled.
2. The method of claim 1, wherein acquiring the physical resource blocks required for scheduling comprises:
searching the MCS table according to the scheduled MCS to obtain a corresponding modulation order Q m And a code rate R;
the physical resource block N required for scheduling is calculated according to the following formula PRB :
N PRB =ceil(C info /(N RE *Q m * R v)), wherein Ceil () is a valued function;
after calculating the physical resource blocks required for scheduling, the method further comprises:
judging N PRB Whether or not less than the remaining available physical resource blocks in the current slotIf yes, the number of physical resource blocks required for scheduling is N PRB
If N PRB If the number of the available physical resource blocks remaining in the current time slot is greater than or equal to the number of the available physical resource blocks remaining in the current time slot, further judging whether the current data block can be segmented, and if so, determining that the number of the physical resource blocks required by scheduling is N PRB The method comprises the steps of carrying out a first treatment on the surface of the If not, the current time slot does not schedule the current data block.
3. The method of claim 1, wherein the set threshold is 3824 bits.
4. A data scheduling apparatus, comprising:
an acquisition module for acquiring a Modulation and Coding Scheme (MCS) table, an air interface transmission layer number v, and an effective resource unit number N in each physical resource block in a current time slot used for scheduling a current UE RE The number of available physical resource blocks remaining in the current slot, N PRB _remain;
A critical quantization information bit calculation module for calculating critical quantization information bit C of the data block to be scheduled info
An MCS calculation module for quantizing information bit C according to the critical value info The MCS table, the layer number v, the number N of effective resource units RE And the number of available physical resource blocks N PRB Calculating the dispatching MCS of the data block to be dispatched;
a physical resource block calculation module for quantizing the information bit C according to the critical quantization info The MCS table, the layer number v, the number N of effective resource units RE The number N of the available physical resource blocks PRB The number of the physical resource blocks required by the dispatching MCS back-calculation dispatching;
wherein the critical quantization information bit calculation module includes:
a first calculation unit for determining whether the size of the scheduled buffer status report is smaller than or equal to a set threshold, if so, searching the TBS table for a maximum TBS smaller than the buffer status report, and calculating the maximum TBS according to the following formulaCritical quantized information bit C info
Figure FDA0004052389600000031
Figure FDA0004052389600000032
A second calculation unit for calculating the critical quantization information bit C according to the following formula in case that the buffer status report is greater than the set threshold info
Figure FDA0004052389600000033
Figure FDA0004052389600000034
Wherein bsr is the size of the buffer status report;
when the buffer status report is greater than the set threshold, after calculating the critical quantization information bit, the method further includes: if it is
Figure FDA0004052389600000035
Then press C info =C info +2 n-1 Adjusting the calculated critical quantization information bits, otherwise, keeping the calculated critical quantization information bits unchanged;
wherein, the MCS calculation module comprises:
a third calculation unit for calculating Q m R=C info /(N RE *N PRB _domain v) and is selected from I in the MCS table MCS Start looking for first Q =0 m X R is greater than or equal to Q m I of R MCS ,Q m Is I MCS Corresponding modulation order, R is I MCS Corresponding code rate,I MCS Scheduling a minimum MCS required for a data block of a buffer status report size of a current UE for a current slot;
a first judging unit for judging I MCS Whether the allowable MCS range is exceeded, if so, the current slot does not schedule the data block, and if not, one of the slots is selected to be greater than or equal to I MCS As the MCS value of the schedule.
5. The data scheduling apparatus of claim 4, wherein the physical resource block calculation module comprises:
a searching unit for searching the MCS table according to the scheduled MCS to obtain a corresponding modulation order Q m And a code rate R;
a fourth calculation unit for calculating the physical resource block N required for scheduling according to the following formula PRB :N PRB =ceil(C info /(N RE *Q m *R*v));
A second judging unit for judging N after calculating the physical resource block required for scheduling PRB Whether the number of the available physical resource blocks is smaller than the number of the remaining available physical resource blocks in the current time slot, if yes, the number of the physical resource blocks required by scheduling is N PRB
A third judging unit for judging whether the first and second data are identical or not in N PRB If the number of the available physical resource blocks remaining in the current time slot is greater than or equal to the number of the available physical resource blocks remaining in the current time slot, further judging whether the current data block can be segmented, and if yes, determining that the number of the physical resource blocks required by scheduling is N PRB The method comprises the steps of carrying out a first treatment on the surface of the If not, the current time slot does not schedule the current data block.
6. The data scheduling apparatus of claim 4, wherein the set threshold is 3824 bits.
7. A computer-readable storage medium, characterized in that the storage medium has stored therein a computer program, wherein the computer program is arranged to perform the method of any of claims 1 to 3 when run.
8. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to run the computer program to perform the method of any of the claims 1 to 3.
CN201811643755.8A 2018-12-29 2018-12-29 Data scheduling method and device Active CN111385902B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201811643755.8A CN111385902B (en) 2018-12-29 2018-12-29 Data scheduling method and device
PCT/CN2019/115777 WO2020134610A1 (en) 2018-12-29 2019-11-05 Data scheduling method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811643755.8A CN111385902B (en) 2018-12-29 2018-12-29 Data scheduling method and device

Publications (2)

Publication Number Publication Date
CN111385902A CN111385902A (en) 2020-07-07
CN111385902B true CN111385902B (en) 2023-05-02

Family

ID=71126184

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811643755.8A Active CN111385902B (en) 2018-12-29 2018-12-29 Data scheduling method and device

Country Status (2)

Country Link
CN (1) CN111385902B (en)
WO (1) WO2020134610A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113923687B (en) * 2020-07-10 2023-08-22 大唐移动通信设备有限公司 Modulation and coding strategy MCS value adjustment method and device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0675492A1 (en) * 1994-04-01 1995-10-04 Sony Corporation Method and apparatus for data encoding and data recording medium
CN102752874A (en) * 2011-04-22 2012-10-24 中兴通讯股份有限公司 Physical downlink shared channel (PDSCH) scheduling method and device
WO2016138822A1 (en) * 2015-03-02 2016-09-09 中兴通讯股份有限公司 Method and device for processing resources
WO2018021853A1 (en) * 2016-07-27 2018-02-01 Samsung Electronics Co., Ltd. Method and apparatus for selecting and determining modulation coding mode in wireless communication system
CN108023666A (en) * 2016-11-03 2018-05-11 华为技术有限公司 The method and apparatus of wireless communication
WO2018174564A1 (en) * 2017-03-23 2018-09-27 엘지전자 주식회사 Method for determining transport block size and wireless device
WO2018203818A1 (en) * 2017-05-05 2018-11-08 Telefonaktiebolaget Lm Ericsson (Publ) Transmission block size determination
CN108833050A (en) * 2017-03-24 2018-11-16 华为技术有限公司 Encoding method, decoding method, device and equipment

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8441999B2 (en) * 2008-07-30 2013-05-14 China Academy Of Telecommunications Technology Method, system and device for adaptive modulation and coding

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0675492A1 (en) * 1994-04-01 1995-10-04 Sony Corporation Method and apparatus for data encoding and data recording medium
CN102752874A (en) * 2011-04-22 2012-10-24 中兴通讯股份有限公司 Physical downlink shared channel (PDSCH) scheduling method and device
WO2016138822A1 (en) * 2015-03-02 2016-09-09 中兴通讯股份有限公司 Method and device for processing resources
WO2018021853A1 (en) * 2016-07-27 2018-02-01 Samsung Electronics Co., Ltd. Method and apparatus for selecting and determining modulation coding mode in wireless communication system
CN108023666A (en) * 2016-11-03 2018-05-11 华为技术有限公司 The method and apparatus of wireless communication
WO2018174564A1 (en) * 2017-03-23 2018-09-27 엘지전자 주식회사 Method for determining transport block size and wireless device
CN108833050A (en) * 2017-03-24 2018-11-16 华为技术有限公司 Encoding method, decoding method, device and equipment
WO2018203818A1 (en) * 2017-05-05 2018-11-08 Telefonaktiebolaget Lm Ericsson (Publ) Transmission block size determination

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"R1-1720762 Discussion on TBS and MCS designs";Huawei, HiSilicon;《3GPP tsg_ran\WG1_RL1》;20171118;全文 *
"R1-1804082_ Remaining Issues on DL UL Resource Allocation final";MediaTek Inc.;《3GPP tsg_ran\WG1_RL1》;20180407;全文 *
R5-182424 "Editorial updates to 38.523-1";Samsung;《3GPP tsg_ran\WG5_Test_ex-T1》;20180510;第7节 *

Also Published As

Publication number Publication date
CN111385902A (en) 2020-07-07
WO2020134610A1 (en) 2020-07-02

Similar Documents

Publication Publication Date Title
CN110505653B (en) Method, equipment and computer storage medium for controlling service quality
EP2858443A1 (en) Data transmission method, base station, and user equipment
US8446827B2 (en) Radio communication terminal
US9801181B2 (en) Frequency band resource scheduling method and apparatus
TWI746708B (en) Method for transmitting information, network equipment, and terminal equipment
CN109644071B (en) Method and apparatus for communication in URLLC
CN110324897A (en) The instruction method for sending information and device, method of reseptance and device, storage medium, base station, user terminal of frequency domain resource distribution
EP3143804B1 (en) Discontinuous transmission for a mobile phone network node
CN110351768A (en) CSI report transmission method, terminal equipment and network equipment
CN109314973B (en) Base station device, terminal device, wireless communication system, and control method therefor
CN113518428A (en) Resource determination method and equipment
EP3528568A1 (en) Method and apparatus for allocating channel resources, and computer storage medium
EP2608476B1 (en) Method, device and system for encoding and modulating data
CN111385902B (en) Data scheduling method and device
CN110351849B (en) Resource allocation method and device, base station and terminal
CN105850211B (en) Method and apparatus for simultaneous downlink transmission
CN109391437A (en) Communication means and equipment
EP3145231B1 (en) Data transmission method, base station and user equipment
EP3592060B1 (en) Resource allocation method, determination method and apparatus
CN107371263B (en) Method and device for scheduling uplink resources
CN105991273B (en) Method and device for distributing data to be scheduled
WO2015172275A1 (en) Downlink signal transmission method, base station and user equipment
KR102230142B1 (en) Base station and operating method thereof
US12294434B2 (en) CSI feedback for multi-PDSCH transmission
CN105706499B (en) A spectrum resource scheduling device, method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant