CN113194481B - Uplink resource allocation and scheduling method, device and system - Google Patents
Uplink resource allocation and scheduling method, device and system Download PDFInfo
- Publication number
- CN113194481B CN113194481B CN202110449574.7A CN202110449574A CN113194481B CN 113194481 B CN113194481 B CN 113194481B CN 202110449574 A CN202110449574 A CN 202110449574A CN 113194481 B CN113194481 B CN 113194481B
- Authority
- CN
- China
- Prior art keywords
- mcs
- rep
- index
- combining
- new
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The application discloses a method, a device and a system for uplink resource allocation and scheduling, wherein the method comprises the steps of aiming at the size of a data block to be transmitted, acquiring indexes I of different repetition times of a current bandwidth index C Rep A demodulation threshold of the receiver is a curve which changes along with a Modulation Coding Strategy (MCS); based on the curve of the demodulation threshold changing along with the modulation and coding strategy, finding out all (I) meeting the preset condition Rep ,I MCS ) A combination, wherein I Rep Index of repetition number, I MCS Coding a strategy index for modulation; combining modulation and coding strategy index and resource unit index I in TBS RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining; selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result. The application carries out compromise optimization scheduling on the uplink transmission time-frequency resources, reduces the transmission time and the transmission power consumption on the premise of meeting the coverage performance requirement, and improves the frequency band utilization rate.
Description
Technical Field
The application belongs to the technical field of narrowband Internet of things, and particularly relates to an uplink resource allocation and scheduling method, device and system.
Background
With the upgrade of the information technology industry, the internet of things technology is rapidly developed, and the support of hardware interaction equipment and the bearing of high-speed internet enable the internet of everything to be possible. The technology of the internet of things at the present stage is mainly divided into two large plates: firstly, the internet of things technology based on non-cellular network technology, such as Bluetooth, zigbee, wi-Fi and the like; secondly, the technology of the internet of things carried by a cellular network such as 2/3/4G is adopted, and the narrowband internet of things (Narrow Band Internet of Things, NB-IoT) is a novel technology of the internet of things with wide prospect based on the cellular network, and has the characteristics of wide coverage, large capacity and low power consumption. According to the 3GPP standardized protocol, with narrowband spectrum and repeat transmission techniques, NB-IoT may achieve approximately 20dB coverage enhancement over traditional GSM communications.
NB-IoT uplink traffic data is carried primarily over the uplink physical shared channel (NPUSCH). In uplink transmission, transmission resources such as bandwidth, modulation Coding Scheme (MCS), number of Resource Units (RU), and Repetition (Repetition) are configured by the base station. For example, in the case of limited transmit power, reducing the signal bandwidth helps to increase the signal-to-noise ratio, thereby increasing coverage, but at the same time increases data transmission delay and reduces data rate. In addition, in the third generation partnership project (3 GPP), the NB-IoT physical layer defines a data structure that is indexed by a modulation coding strategy (I MCS ) And resource unit index (I RU ) A Transport Block Size (TBS) table comprising a plurality of different (I MCS ,I RU ) The tuples correspond to the maximum size of the data block that can be transmitted each time. Thus, there may be a plurality of data blocks of known size (I MCS ,I RU ) The combination is matched with the combination: when I MCS Larger and I RU When the number of the occupied resource units is smaller, the requirement on the channel environment is higher, but the occupied resource units and the channel time are less; when I MCS Smaller and I RU When the demodulation threshold is larger, the demodulation threshold is lower, but the number of the resource units and the channel time are occupied more. When the bandwidth BW index C and (I MCS ,I RU ) Combining a set of timings, increasing the number of repeated transmissions can directly reduce the demodulation threshold of the receiving end, but can bring about the problems of long transmission time and low frequency band utilization.
Disclosure of Invention
Aiming at the problems, the application provides a method, a device and a system for uplink resource allocation and scheduling, which realize the optimal allocation of uplink resources based on four parameters of bandwidth, repetition times, resource units and modulation and coding strategies so as to optimize the overall performance of the system in a compromise way on the premise of meeting the coverage performance.
In order to achieve the technical purpose and achieve the technical effect, the application is realized by the following technical scheme:
in a first aspect, the present application provides an uplink resource allocation and scheduling method, including:
aiming at the size of a data block to be transmitted, acquiring indexes I of different repetition times of a current bandwidth index C Rep A demodulation threshold of the receiver is changed along with a modulation coding strategy;
based on the curve of the demodulation threshold changing along with the modulation and coding strategy, finding out all (I) meeting the preset condition Rep ,I MCS ) A combination, wherein I Rep Index of repetition number, I MCS Coding a strategy index for modulation;
modulation coding strategy index I in combination with transport block size table TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form a plurality of (C, I Rep ,I MCS ,I RU ) Combining;
selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result.
Optionally, the uplink resource allocation and scheduling method further includes:
if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining maximum value I of repetition index in new search Rep_C_new ；
Obtaining new bandwidth index C at different repetition index I Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；
Based on the curve of the demodulation threshold changing along with the modulation and coding strategy, finding out all (I) meeting the preset condition Rep ,I MCS ) Combining;
modulation coding strategy index I in combination with transport block size table TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result.
Optionally, the maximum value I of the repetition number Rep_C_new The setting method comprises the following steps:
(1) Let c=c max ，C max Is the maximum value of the bandwidth index;
(2) Judging the maximum repetition number I of the previous round search of C Rep_C_new If the number of the repeated times is the maximum, indicating that all the repeated times under the current C are searched, turning to the step (4) and going to the next C; otherwise, turning to the step (3);
(3) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new ++；
(4) Executing C-;
(5) Judging whether C is greater than or equal to 1, if so, turning to the step (2), and setting the maximum value of the repetition times of a new round of searching; otherwise, turning to the step (6);
(6) And (5) setting the maximum value of the repetition times of all C.
Optionally, the size of the data block to be transmitted is smaller than or equal to the maximum value of the transport block size specified by the transport block size table; and if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, dividing the data block to be transmitted into blocks so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table.
Optionally, all (I Rep ,I MCS ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, wherein SNR Req For the receiver demodulation threshold, SNR Env Is the ambient signal to noise ratio of the terminal to be transmitted.
Optionally, defining all (I Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
according to I MCS Taking (I) in G in order from small to large Rep ,I MCS ) In combination, the following steps are respectively performed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) Rep ,I MCS ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU ++, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max The maximum value is indexed for the resource unit.
In a second aspect, the present application provides an uplink resource allocation and scheduling apparatus, including:
an acquisition module for acquiring the index I of the current bandwidth index C at different repetition times according to the size of the data block to be transmitted Rep A demodulation threshold of the receiver is changed along with a modulation coding strategy;
a first search module, configured to find out (I) that satisfies a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) A combination, wherein I Rep Index of repetition number, I MCS Coding a strategy index for modulation;
a second lookup module for combining the modulation and coding strategy index I in the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form a plurality of (C, I Rep ,I MCS ,I RU ) Combining;
a first output module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result.
Optionally, the uplink resource allocation and scheduling device further includes a second output module, where the second output module includes:
a parameter determining module for determining if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining repetition index in new searchMaximum value I Rep_C_new ；；
The acquisition submodule acquires the index I of the new bandwidth index C at different repetition times Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；
A first sub-search module, configured to find out (I) all satisfying a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) Combining;
a second sub-search module for combining the modulation coding strategy index I of the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
an output sub-module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result.
Optionally, the maximum value I of the repetition number Rep_C_new The acquisition method comprises the following steps:
(1) Let c=c max ，C max Is the maximum value of the bandwidth index;
(2) Judging the maximum repetition number I of the previous round search of C Rep_C_new If the number of the repeated times is the maximum, indicating that all the repeated times under the current C are searched, turning to the step (4) and going to the next C; otherwise, turning to the step (3);
(3) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new ++；
(4) Executing C-;
(5) Judging whether C is greater than or equal to 1, if so, turning to the step (2), and setting the maximum value of the repetition times of a new round of searching; otherwise, turning to the step (6);
(6) And (5) setting the maximum value of the repetition times of all C.
Optionally, the size of the data block to be transmitted is smaller than or equal to the maximum value of the transport block size specified by the transport block size table; and if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, dividing the data block to be transmitted into blocks so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table.
Optionally, all (I Rep ,I MCS ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, wherein SNR Req For the receiver demodulation threshold, SNR Env Is the ambient signal to noise ratio of the terminal to be transmitted.
Optionally, defining all (I Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
according to I MCS Taking (I) in G in order from small to large Rep ,I MCS ) In combination, the following steps are respectively performed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) Rep ,I MCS ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU ++, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max The maximum value is indexed for the resource unit.
In a third aspect, the present application provides an uplink resource allocation and scheduling system, comprising a storage medium and a processor;
the storage medium is used for storing instructions;
the processor is operative according to the instructions to perform the steps of the method according to any one of the first aspects.
Compared with the prior art, the application has the beneficial effects that:
the application optimizes and schedules the uplink transmission time-frequency resource, and preferably adopts the MCS and bandwidth adjustment mode to realize coverage on the premise of meeting the requirement of coverage performance, and only when the channel environment of the terminal is poor, the repeated transmission is considered, thereby reducing the transmission time and the transmission power consumption and improving the frequency band utilization rate.
The application can obtain the optimal configuration through the operation algorithm, can also quickly generate the configuration result according to the default or experience value, and has the characteristics of flexibility and high efficiency.
Drawings
In order that the application may be more readily understood, a more particular description of the application will be rendered by reference to specific embodiments that are illustrated in the appended drawings, in which:
fig. 1 is a flow chart illustrating an uplink resource allocation and scheduling method according to an embodiment of the present application;
FIG. 2 is a block error rate simulation result at different MCS;
FIG. 3 is a SNR obtained from simulation results similar to FIG. 2 req A plot of MCS change;
FIG. 4 is a TBS chart;
fig. 5 is a correspondence of MCS and TBS;
fig. 6 shows different resource units N in uplink transmission RU Corresponding time slot number N slots ；
FIG. 7 is a graph of uplink resource allocation results obtained by the method of the present application;
fig. 8 is a graph of retransmission times, bandwidth index versus L.
Detailed Description
The present application will be described in further detail with reference to the following examples in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the detailed description and specific examples are intended for purposes of illustration only and are not intended to limit the scope of the application.
The principle of application of the application is described in detail below with reference to the accompanying drawings.
The application first gives the parameter names, definitions and initial values (or default values) used in the application via table 1.
TABLE 1
Example 1
The embodiment of the application provides an uplink resource allocation and scheduling method, which specifically comprises the following steps:
step (1) obtaining indexes I of different repetition times of a current bandwidth index C according to the size b of a data block to be transmitted Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS The method comprises the steps of carrying out a first treatment on the surface of the In the implementation and use process, the size of the data block to be transmitted is preferably required to be smaller than or equal to the maximum value of the transport block size specified by the transport block size table; and if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, dividing the data block to be transmitted into blocks so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table.
Step (2) is based on a demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all the components (I) Rep ,I MCS ) Combinations (i.e. binary combinations), where I Rep Index of repetition number, I MCS Coding a strategy index for modulation; the curve SNR Req -I MCS The method can be obtained through simulation, test and other methods;
step (3) combining the modulation and coding strategy index and the resource unit index in the TBS to find out all (I) meeting the size requirement of the data block to be transmitted MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
step (4) selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result.
In one embodiment of the present application, all the components (I Rep ,I MCS ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, SNR env For the environmental signal-to-noise ratio of the position of the terminal (UE) to be transmitted, the calculation formula is as follows:
wherein the variable L is the path loss caused by considering only distance; f is the noise factor of the receiver, generally 3dB; n (N) 0 For the thermal noise power spectrum density, the default value is-174 dBm/Hz, BW is bandwidth, the maximum value is 180KHz, P tx For the transmit power of the terminal (UE) to be transmitted, the default value is 23dBm of its maximum transmit power.
In one embodiment of the present application, all the components (I Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
taking two of G in order from small to largeI of the meta-combination MCS The following steps are respectively executed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU ++, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Value, combined with current bandwidth index C, I MCS Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max Indexing the maximum value for the resource unit; as shown in FIG. 1, the (C, I) Rep ,I MCS ,I RU ) The combined acquisition method specifically comprises the following detailed steps:
step 501: taking one binary combination (I) of G at a time in order from small to large Rep ,I MCS ) I of (2) MCS And let I RU ＝0；
Step 502: determination of TBS (I) MCS ,I RU ) If the number is less than b, turning to step 503 to continue searching; otherwise, indicating that a solution meeting the condition has been found, recording the corresponding I RU Value, search end, go to step 505;
step 503: execution I RU ++；
Step 504: judgment of I RU Whether or not it is less than I RU_max If yes, at the current I MCS Continuing searching in a row; otherwise, indicate that at the current I MCS The solution meeting the condition is not found in the row, and the step 506 is shifted to delete the corresponding tuple from G;
step 505: c, two-tuple (I) Rep ,I MCS ) Step 502 finds the I RU Forming a quadruple (C, I) Rep ,I MCS ,I RU ) It is saved to the collection H,turning to step 506;
step 506: deleting combinations from collection G (I Rep ,I MCS ) To avoid repeated searches during the next round of searches.
In a specific implementation manner of the embodiment of the present application, as shown in fig. 1, the maximum value I of the repetition number in the new search is Rep_C_new The acquisition method comprises the following steps:
(801) Let c=c max ；
(802) Judging the maximum repetition number I of the previous round search of the corresponding C Rep_C_new If the number of repetition is the maximum, indicating that all the repetition numbers under the current C are found, turning to the step (804) and going to the next C; otherwise, go to step (803);
(803) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new ++；
(804)C--；
(805) Judging whether C is greater than or equal to 1, if so, turning to the step (802), and setting the maximum value of the repetition times of a new round of searching; otherwise, go to step (806);
(806) Setting the maximum value of the repetition times of all C to make C=C max 。
Example 2
The difference between the embodiment of the present application and embodiment 1 is that:
if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining maximum value I of repetition index in new search Rep_C_new ；
Obtaining new bandwidth index C at different repetition index I Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；
Based on the curve of the demodulation threshold changing along with the modulation and coding strategy, finding out all (I) meeting the preset condition Rep ,I MCS ) Combining;
indexing from maximum bandwidth and minimumStarting from the repetition index, the modulation coding strategy index and the resource unit index of the TBS are respectively adopted from top to bottom and from left to right to find out all (I) meeting the size requirement of the data block to be transmitted MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result.
Example 3
Embodiments of the present application differ from embodiments 1 and 2 in that the method further comprises:
calculating the transmission time of a default configuration, wherein the default configuration can be set according to the actual situation, or can be obtained by the configuration result similar to the current condition before and is compared with each (C, I) Rep ,I MCS ,I RU ) The combined transmission times are compared, and the transmission time with the smallest transmission time is selected to be output as a result.
Examples 1-3 are described in detail below in connection with FIG. 1 in one embodiment. The present embodiment is a resource allocation for uplink data transmission by a base station of a narrowband internet of things system.
In step 100, an ambient signal-to-noise ratio SNR of a location where a terminal (UE) to be transmitted is located is first obtained env The environmental signal-to-noise ratio SNR env The calculation formula of (2) is as follows:
wherein the variable L is the path loss caused by considering only distance; f is the noise factor of the receiver, generally 3dB; n (N) 0 For the thermal noise power spectrum density, the default value is-174 dBm/Hz, BW is bandwidth, the maximum value is 180KHz, P tx For the transmit power of the terminal (UE) to be transmitted, the default value is 23dBm of its maximum transmit power.
Meanwhile, the size b of the data block to be transmitted is input, assuming b=200 bits. Other parameter initialization values are shown in table 1, where the bandwidth index c=5, corresponding to 3.75kHz.
In step 200, judging whether C is not less than 1, if so, turning to step 300; otherwise, go to step 800.
In step 300, all the data satisfying the system error requirements (assumed to be BLER) are extracted from the simulation results of the relation between the uplink channel block error rate BLER and the signal-to-noise ratio SNR similar to that of fig. 2<10%) SNR as SNR Req Thereby obtaining SNR Req Relation SNR with modulation coding strategy MCS Req -I MCS As shown in FIG. 3, the SNR is then filtered out Req ≤SNR Env Of (I) Rep ,I MCS ) Combination, where N Rep_C_old ≤N Rep ≤N Rep_C_new ，N Rep_C_old And N Rep_C_new The maximum number of repetition times of the last time and the current time corresponding to C are respectively stored in the set G. For example, SNR in FIG. 3 Req Maximum 4dB, if the current search is set with I Rep =0, the point on the uppermost curve satisfies the SNR Req ≤SNR Env There are a total of 7 combinations, namely (1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 6), (1, 8).
In step 400, it is determined whether G is empty, if so, indicating that the four-tuple search for the current C has ended, and step 600 is performed; otherwise, go to step 500 to continue searching for the four-tuple that satisfies the condition.
In step 500, each I in G is fetched from small to large MCS For example I MCS =0, then in the TBS table shown in fig. 4 (I TBS And I MCS The corresponding relationship of (a) is shown in FIG. 5), from I RU Starting with =0, look up each value in the table from small to large until the table value is found to satisfy TBS (I MCS ,I RU ) And (5) until the temperature is more than or equal to b. For example, for I MCS =0, when I RU When=7, the transport block size is 256, which is larger than b, and the condition is satisfied. In a similar way, the next tuple I in G is taken MCS Still from I RU =0 starts the search until all the tuples in G are traversed. All (C, I) that will satisfy the condition Rep ,I MCS ,I RU ) Save to set H, at the same time, delete the traversed tuple from G, so G is empty, i.e., tableAll the tuples are traversed.
In step 600, if H is null, indicating that C and I are currently present Rep_C_max The time-frequency resource meeting the condition is not found under the configuration, and the bandwidth index is reduced at the moment, namely, the bandwidth is increased to obtain the feasible time-frequency resource configuration; if H is not null, indicating that the configurations in the current set are all feasible time-frequency resource configurations, and obtaining the optimized result output only by selecting the time delay with the minimum time delay.
In step 700, each time the bandwidth index is decremented by 1, i.e. the bandwidth is increased in exchange for available time-frequency resources, successful transmission of the signal is guaranteed.
In step 800, starting from the maximum bandwidth index, for each bandwidth index, the maximum value of the repetition number of the next round of searching is increased based on the original repetition number, and the increase value of the repetition number index may be 1 or greater than 1. When the maximum value of the repetition times of all the bandwidth indexes is updated, returning to step 200, and starting to search for valid time-frequency resources from the maximum bandwidth index.
In step 900, the total number of timeslots N corresponding to all the available time-frequency resources in H is calculated slot (see fig. 6), the combination with the smallest transmission time is selected, and when the number of slots is the same, the combination with the lower repetition number is preferentially selected. Comparing the optimal configuration in H with the default configuration, if the optimal configuration is superior to the default configuration, selecting the former, otherwise, selecting the default configuration.
FIG. 7 shows a bandwidth of 180kHz, a subcarrier spacing of 15kHz, a number of subcarriers of 12, an SNR env Is [ -28dB,4dB]Simulation results of signal transmission time in the range revealed that the SNR was dependent on the 10% bler Env And the channel transmission time increases. When SNR is Env At the worst-28 dB, 128 retransmissions are used, with a transmission time of about 1.3s.
FIG. 8 illustrates C, I during the resource optimization allocation process Rep The application can be seen that the scheduling strategy of reducing the bandwidth index and increasing the repetition number is adopted for the data blocks with different sizes, so that the resources can be successfully allocated. For example, for a 20Bytes transport block, when l=150In dB, the current coverage requirement can be satisfied by lowering the channel bandwidth index, but when l=158 dB, the requirement cannot be satisfied by lowering the bandwidth index, i.e., increasing the bandwidth, and in the case where the repetition transmission is allowed, the coverage target is achieved by increasing the number of repetition transmissions. For a 200Bytes transport block, when l=140 dB, the resource can be successfully allocated only by adopting a method of reducing the channel bandwidth index, and when l=148 dB, the number of repetitions needs to be increased to meet the coverage requirement.
Example 4
The embodiment of the application provides an uplink resource allocation and scheduling device, which comprises the following components:
an acquisition module for acquiring the index I of the current bandwidth index C at different repetition times according to the size of the data block to be transmitted Rep A demodulation threshold of the receiver is changed along with a modulation coding strategy; in the implementation process, the size of the data block to be transmitted is preferentially smaller than or equal to the maximum value of the transport block size specified by the transport block size table; if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, the data block to be transmitted is segmented, so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table;
a first search module, configured to find out (I) that satisfies a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) A combination, wherein I Rep Index of repetition number, I MCS Coding a strategy index for modulation;
a second lookup module for combining the modulation and coding strategy index I in the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form a plurality of (C, I Rep ,I MCS ,I RU ) Combining;
a first output module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result.
In a specific implementation manner of the embodiment of the present application, the uplink resource allocation and scheduling device further includes a second output module, where the second output module includes:
a parameter determining module for determining if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining maximum value I of repetition index in new search Rep_C_new ；
An acquisition sub-module for acquiring the new bandwidth index C at different repetition index I Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；；
A first sub-search module, configured to find out (I) all satisfying a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) Combining;
a second sub-search module for combining the modulation coding strategy index I of the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
an output sub-module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result.
In one embodiment of the present application, all the components (I MCS ,I RU ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, wherein SNR Req For the receiver demodulation threshold, SNR Env Is the ambient signal to noise ratio of the terminal to be transmitted.
In one embodiment of the present application, all the components (I Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
according to I MCS Taking (I) in G in order from small to large Rep ,I MCS ) In combination, the following steps are respectively performed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU ++, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max Indexing maximum values for resource units
In a specific implementation manner of the embodiment of the present application, the maximum value I of the repetition number in the new search Rep_C_new The acquisition method comprises the following steps:
(1) Let c=c max ；
(2) Judging the maximum repetition number I of the previous round search of the corresponding C Rep_C_new If the number of the repeated times is the maximum, indicating that all the repeated times under the current C are searched, turning to the step (4) and going to the next C; otherwise, turning to the step (3);
(3) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new ++；
(4) Executing C-;
(5) Judging whether C is greater than or equal to 1, if so, turning to the step (2), and setting the maximum value of the repetition times of a new round of searching; otherwise, turning to the step (6);
(6) Setting the maximum value of the repetition times of all C to make C=C max 。
Example 5
The embodiment of the application provides an uplink resource allocation and scheduling system, which comprises a storage medium and a processor;
the storage medium is used for storing instructions;
the processor is operative according to the instructions to perform the method according to any one of embodiments 1-3.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those having ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are all within the protection of the present application.
The foregoing has shown and described the basic principles and main features of the present application and the advantages of the present application. It will be understood by those skilled in the art that the present application is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present application, and various changes and modifications may be made without departing from the spirit and scope of the application, which is defined in the appended claims. The scope of the application is defined by the appended claims and equivalents thereof.
Claims (11)
1. An uplink resource allocation and scheduling method, comprising:
aiming at the size of a data block to be transmitted, acquiring indexes I of different repetition times of a current bandwidth index C Rep A demodulation threshold of the receiver is changed along with a modulation coding strategy;
based on the demodulation gateFinding out all curves (I) meeting preset conditions Rep ,I MCS ) A combination, wherein I Rep Index of repetition number, I MCS Coding a strategy index for modulation;
modulation coding strategy index I in combination with transport block size table TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form a plurality of (C, I Rep ,I MCS ,I RU ) Combining;
selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result;
the uplink resource allocation and scheduling method further comprises the following steps:
if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining maximum value I of repetition index in new search Rep_C_new ；
Obtaining new bandwidth index C at different repetition index I Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；
Based on the curve of the demodulation threshold changing along with the modulation and coding strategy, finding out all (I) meeting the preset condition Rep ,I MCS ) Combining;
modulation coding strategy index I in combination with transport block size table TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
selecting (C, I) with the shortest transmission time Rep ,I MCS ,I RU ) The combination is output as a result.
2. The uplink resource allocation and scheduling method according to claim 1, wherein the maximum number of repetitions isValue I Rep_C_new The setting method comprises the following steps:
(1) Let c=c max ，C max Is the maximum value of the bandwidth index;
(2) Judging the maximum repetition number I of the previous round search of C Rep_C_new If the number of the repeated times is the maximum, indicating that all the repeated times under the current C are searched, turning to the step (4) and going to the next C; otherwise, turning to the step (3);
(3) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new +1；
(4) Executing C-1;
(5) Judging whether C is greater than or equal to 1, if so, turning to the step (2), and setting the maximum value of the repetition times of a new round of searching; otherwise, turning to the step (6);
(6) And (5) setting the maximum value of the repetition times of all C.
3. The uplink resource allocation and scheduling method according to claim 1, wherein: the size of the data block to be transmitted is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table; and if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, dividing the data block to be transmitted into blocks so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table.
4. The uplink resource allocation and scheduling method according to claim 1, wherein (I Rep ,I MCS ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, wherein SNR Req For the receiver demodulation threshold, SNR Env Is the ambient signal to noise ratio of the terminal to be transmitted.
5. The method for uplink resource allocation and scheduling according to claim 1, wherein all (I Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
according to I MCS Taking (I) in G in order from small to large Rep ,I MCS ) In combination, the following steps are respectively performed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) Rep ,I MCS ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU +1, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max The maximum value is indexed for the resource unit.
6. An uplink resource allocation and scheduling apparatus, comprising:
an acquisition module for acquiring the index I of the current bandwidth index C at different repetition times according to the size of the data block to be transmitted Rep A demodulation threshold of the receiver is changed along with a modulation coding strategy;
a first search module, configured to find out (I) that satisfies a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) Combination of whichIn, I Rep Index of repetition number, I MCS Coding a strategy index for modulation;
a second lookup module for combining the modulation and coding strategy index I in the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form a plurality of (C, I Rep ,I MCS ,I RU ) Combining;
a first output module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result;
the uplink resource allocation and scheduling device further includes a second output module, where the second output module includes:
a parameter determining module for determining if the (I) meeting the size requirement of the data block to be transmitted cannot be found under the current set condition MCS ,I RU ) Combining, reducing bandwidth index C, and determining maximum value I of repetition index in new search Rep_C_new ；
The acquisition submodule acquires the index I of the new bandwidth index C at different repetition times Rep The demodulation threshold of the receiver is changed along with the modulation and coding strategy, I Rep ≤I Rep_C_new ；
A first sub-search module, configured to find out (I) all satisfying a preset condition based on a curve of the demodulation threshold changing with a modulation and coding strategy Rep ,I MCS ) Combining;
a second sub-search module for combining the modulation coding strategy index I of the TBS MCS And resource unit index I RU Find out all the data blocks meeting the size requirement (I MCS ,I RU ) Combining to form (C, I) Rep ,I MCS ,I RU ) Combining;
an output sub-module for selecting the one of the shortest transmission time (C, I Rep ,I MCS ,I RU ) The combination is output as a result.
7. According to the weightsAn uplink resource allocation and scheduling apparatus according to claim 6 wherein: maximum value I of the repetition number Rep_C_new The acquisition method comprises the following steps:
(1) Let c=c max ，C max Is the maximum value of the bandwidth index;
(2) Judging the maximum repetition number I of the previous round search of C Rep_C_new If the number of the repeated times is the maximum, indicating that all the repeated times under the current C are searched, turning to the step (4) and going to the next C; otherwise, turning to the step (3);
(3) Will be original I Rep_C_new Reserved to I Rep_C_old In the meantime, let I Rep_C_new ＝I Rep_C_new +1；
(4) Executing C-1;
(5) Judging whether C is greater than or equal to 1, if so, turning to the step (2), and setting the maximum value of the repetition times of a new round of searching; otherwise, turning to the step (6);
(6) And (5) setting the maximum value of the repetition times of all C.
8. An uplink resource allocation and scheduling apparatus according to claim 6 wherein: the size of the data block to be transmitted is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table; and if the size of the data block to be transmitted is larger than the maximum value of the transmission block size specified by the transmission block size table, dividing the data block to be transmitted into blocks so that the size of each block of data is smaller than or equal to the maximum value of the transmission block size specified by the transmission block size table.
9. An uplink resource allocation and scheduling apparatus according to claim 6 wherein: all meeting the preset conditions (I Rep ,I MCS ) The combined acquisition method comprises the following steps:
obtaining index I of current bandwidth index C at different repetition times Rep Down to the demodulation threshold SNR of the receiver Req Curve SNR as a function of modulation coding strategy MCS Req -I MCS Find out all satisfying SNR Req ≤SNR Env Of (I) Rep ,I MCS ) Combining, wherein SNR Req For the receiver demodulation threshold, SNR Env Is the ambient signal to noise ratio of the terminal to be transmitted.
10. An uplink resource allocation and scheduling apparatus according to claim 6 wherein: defining all the components (I) meeting the preset condition Rep ,I MCS ) The combinations are all stored in a set G, and the size of a data block to be transmitted is b;
said (C, I) Rep ,I MCS ,I RU ) The combined acquisition method comprises the following steps:
according to I MCS Taking (I) in G in order from small to large Rep ,I MCS ) In combination, the following steps are respectively performed:
let I RU ＝0；
If TBS (I) MCS ,I RU ) B is greater than or equal to b, recording the corresponding I RU Values combined with current bandwidth index C, (I) Rep ,I MCS ) Are combined to form (C, I) Rep ,I MCS ,I RU ) Combining;
if TBS (I) MCS ,I RU ) Less than b, then execute I RU +1, if I RU Less than or equal to I RU_max Then at the current I MCS The row continues the lookup until TBS (I MCS ,I RU ) B is greater than or equal to b, record corresponding I RU Values combined with current bandwidth index C, (I) MCS ,I RU ) Are combined to form (C, I) Rep ,I MCS ,I RU ) A combination, wherein I RU_max The maximum value is indexed for the resource unit.
11. An uplink resource allocation and scheduling system comprising a storage medium and a processor;
the storage medium is used for storing instructions;
the processor is operative according to the instructions to perform the steps of the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110449574.7A CN113194481B (en) | 2021-04-25 | 2021-04-25 | Uplink resource allocation and scheduling method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110449574.7A CN113194481B (en) | 2021-04-25 | 2021-04-25 | Uplink resource allocation and scheduling method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113194481A CN113194481A (en) | 2021-07-30 |
| CN113194481B true CN113194481B (en) | 2023-08-11 |
Family
ID=76978749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110449574.7A Active CN113194481B (en) | 2021-04-25 | 2021-04-25 | Uplink resource allocation and scheduling method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113194481B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20170054201A (en) * | 2015-11-06 | 2017-05-17 | 주식회사 케이티 | Methods for determining modulation order and transport block size in a physical downlink shared channel and apparatuses thereof |
| CN109640337A (en) * | 2018-12-07 | 2019-04-16 | 华南理工大学 | A kind of NB-IoT system self-adaption dispatching method |
| CN109687937A (en) * | 2017-10-19 | 2019-04-26 | 普天信息技术有限公司 | Modulation coding scheme and number of repetition selection method and device |
| CN110149701A (en) * | 2018-02-12 | 2019-08-20 | 中国信息通信研究院 | A kind of uplink information transmission and equipment |
| CN110602788A (en) * | 2019-08-27 | 2019-12-20 | 国网重庆市电力公司电力科学研究院 | Narrowband Internet of things uplink time-frequency resource optimization method and readable storage medium |
| CN112511268A (en) * | 2020-10-16 | 2021-03-16 | 中兴通讯股份有限公司 | Method, device and medium for policy configuration, power configuration and quality reporting |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107046453B (en) * | 2016-02-05 | 2021-02-12 | 中兴通讯股份有限公司 | Method, device and system for determining transmission parameters of data sharing channel |
-
2021
- 2021-04-25 CN CN202110449574.7A patent/CN113194481B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20170054201A (en) * | 2015-11-06 | 2017-05-17 | 주식회사 케이티 | Methods for determining modulation order and transport block size in a physical downlink shared channel and apparatuses thereof |
| CN109687937A (en) * | 2017-10-19 | 2019-04-26 | 普天信息技术有限公司 | Modulation coding scheme and number of repetition selection method and device |
| CN110149701A (en) * | 2018-02-12 | 2019-08-20 | 中国信息通信研究院 | A kind of uplink information transmission and equipment |
| CN109640337A (en) * | 2018-12-07 | 2019-04-16 | 华南理工大学 | A kind of NB-IoT system self-adaption dispatching method |
| CN110602788A (en) * | 2019-08-27 | 2019-12-20 | 国网重庆市电力公司电力科学研究院 | Narrowband Internet of things uplink time-frequency resource optimization method and readable storage medium |
| CN112511268A (en) * | 2020-10-16 | 2021-03-16 | 中兴通讯股份有限公司 | Method, device and medium for policy configuration, power configuration and quality reporting |
Non-Patent Citations (1)
| Title |
|---|
| 陈发堂 ; 邢苹苹 ; 杨艳娟 ; .窄带蜂窝物联网终端上行资源调度的分析与设计.计算机应用.2018,(第11期),224-228. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113194481A (en) | 2021-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109151970B (en) | Method for determining transmission power, processing chip and communication equipment | |
| RU2439854C2 (en) | Methods and systems for adaptive transmission of control information in wireless communication system | |
| CA2710535C (en) | Sounding reference signal arrangement | |
| JP4933634B2 (en) | COMMUNICATION SYSTEM, TERMINAL, AND RADIO COMMUNICATION DEVICE | |
| AU2005234350B2 (en) | Apparatus and method for controlling transmission power in communication systems using orthogonal frequency division multiple access scheme | |
| RU2289210C2 (en) | Device and method for transferring/receiving data in communication system, using multi-access layout | |
| JP5680750B2 (en) | Interaction between maximum power reduction and power scaling in wireless networks | |
| US8526511B2 (en) | Base station, mobile station and method | |
| TWI390883B (en) | Method and apparatus to support sdma transmission in a ofdma based network | |
| RU2472292C2 (en) | Apparatus and method for allocation of subcarriers in clustered orthogonal frequency-division multiplexing and discrete fourier transform | |
| CN1812353A (en) | Method for sending channel quality information in a multi-carrier radio communication system, corresponding mobile terminal and base station | |
| JP2010016881A (en) | Radio communication apparatus and subcarrier assignment method | |
| US20090005049A1 (en) | Base Station Apparatus And Wireless Transmission Method | |
| KR20120026137A (en) | Allocation of preamble sequences | |
| CN113194481B (en) | Uplink resource allocation and scheduling method, device and system | |
| KR101108504B1 (en) | A method for improving the reverse gain | |
| US20130136070A1 (en) | Terminal and Grant Processing Method Thereof | |
| US9008017B2 (en) | Wireless communication device and wireless communication system | |
| WO2018228465A1 (en) | Determination method for sending power, processing chip and communication device | |
| JP2014150566A (en) | Methods and systems for reducing fast power control message overhead by grouping mobile stations in wimax systems | |
| CN113796127B (en) | Cell selection in a multi-frequency communication network | |
| CN109286480B (en) | Subcarrier distribution method for orthogonal frequency division multiple access system based on candidate channel matching method | |
| US20220263698A1 (en) | Terminal | |
| CN116114228A (en) | Communication method and device | |
| CN105874836A (en) | Control information processing method, apparatus 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 |