CN114698134A - Data transmission method and device, storage medium and electronic device - Google Patents

Data transmission method and device, storage medium and electronic device Download PDF

Info

Publication number
CN114698134A
CN114698134A CN202011639509.2A CN202011639509A CN114698134A CN 114698134 A CN114698134 A CN 114698134A CN 202011639509 A CN202011639509 A CN 202011639509A CN 114698134 A CN114698134 A CN 114698134A
Authority
CN
China
Prior art keywords
scheduled
space division
ues
resource block
physical resource
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.)
Pending
Application number
CN202011639509.2A
Other languages
Chinese (zh)
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 CN202011639509.2A priority Critical patent/CN114698134A/en
Priority to PCT/CN2021/139773 priority patent/WO2022143269A1/en
Publication of CN114698134A publication Critical patent/CN114698134A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • 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

Abstract

The embodiment of the invention provides a data transmission method and device, a storage medium and an electronic device, wherein the method comprises the following steps: acquiring a plurality of UE to be scheduled; under the condition that the number of the occupied spaces of the plurality of UE to be scheduled is larger than L, M UE to be scheduled is determined from the plurality of UE to be scheduled; determining each layer of space division in the L layers of space division of the base station as the current layer of space division, and executing the following operations: the method and the device solve the problem of low data transmission efficiency and further achieve the effect of improving the data transmission efficiency.

Description

Data transmission method and device, storage medium and electronic device
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a data transmission method and device, a storage medium and an electronic device.
Background
A Multiple-Input Multiple-Output (MIMO) technology is a technology used for a multi-antenna communication system, and specifically, a transmitting end and a receiving end both use Multiple antennas (or array antennas) and Multiple channels to effectively suppress channel fading. Meanwhile, compared with the conventional single-antenna communication system, the multi-antenna communication system adopting MIMO can multiply the system capacity, improve the reliability of a channel and reduce the error rate.
In a 5G NR system, transmission bandwidth is greatly increased compared to 4G communication, capacity of a single carrier network access terminal is multiplied compared to 4G, how to improve system throughput by using limited system bandwidth, and how to improve spectrum efficiency by space division multiplexing (spatial division multiplexing) for more user terminals is a technical problem to be solved in the art. In the traditional space division multiplexing technology, the same time-frequency resources are allocated to the services of successfully paired user terminals, but in most cases, the sizes of the service data of the terminal users are not consistent, and if some terminal user participating in the pairing has smaller service data, certain resource waste is caused in a frequency domain.
That is, the conventional spatial multiplexing technique has a problem of low transmission resource efficiency in the process of transmitting resources.
Disclosure of Invention
The embodiment of the invention provides a data transmission method and device, a storage medium and an electronic device, and aims to at least solve the problem of low data transmission efficiency in the related art.
According to an embodiment of the present invention, there is provided a data transmission method including: acquiring a plurality of UE to be scheduled; determining M UE to be scheduled from the plurality of UE to be scheduled under the condition that the number of space division occupied by the plurality of UE to be scheduled is larger than L, wherein L is the number of space division layers of a base station, and M is a positive integer smaller than or equal to L; determining each layer of space division in the L layers of space division of the base station as the current layer of space division, and executing the following operations: under the condition that a target physical resource block value of current UE to be scheduled in a current layer space division is smaller than a first threshold value, the first UE to be scheduled is supplemented into the current layer space division, wherein the first UE to be scheduled is UE except M UE to be scheduled in a plurality of UE to be scheduled, the target physical resource block value is the number of resource blocks required to be used for scheduling the UE to be scheduled, the first threshold value is the largest target physical resource block value of the M UE to be scheduled, and the current layer space division is one layer space division in an L layer space division of a base station.
According to another embodiment of the present invention, there is provided a data transmission apparatus including: a first obtaining unit, configured to obtain a plurality of UEs to be scheduled; a first determining unit, configured to determine M UEs to be scheduled from the multiple UEs to be scheduled when the number of space divisions occupied by the multiple UEs to be scheduled is greater than L, where L is the number of space division layers of a base station, and M is a positive integer less than or equal to L; an execution unit, configured to determine each of the L-layered space divisions of the base station as a current-layered space division, and perform the following operations: and under the condition that a target physical resource block value of the current UE to be scheduled in the current layer space division is smaller than a first threshold value, supplementing the first UE to be scheduled to the current layer space division, wherein the first UE to be scheduled is UE except the M UEs to be scheduled in the plurality of UEs to be scheduled, the target physical resource block value is the number of resource blocks which need to be used for scheduling the UEs to be scheduled, the first threshold value is the maximum target physical resource block value in the M UEs to be scheduled, and the current layer space division is one layer space division in an L layer space division of the base station.
According to a further embodiment of the present invention, there is also provided a computer-readable storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the steps in any of the above method embodiments when executed.
According to yet another embodiment of the present invention, there is also provided an electronic device, including a memory and a processor, the memory having a computer program stored therein, the processor being configured to execute the computer program to perform the steps in any of the method embodiments.
According to the invention, in the process of scheduling the UE to be scheduled, one transmission resource can be used for scheduling at least two UEs according to the target physical resource block value of the UE to be scheduled, so that the problem of low data transmission efficiency can be solved, and the effect of improving the data transmission efficiency is achieved.
Drawings
FIG. 1 is a hardware environment diagram of a data transmission method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method of data transmission according to an embodiment of the present invention;
FIG. 3 is a flow chart of a method of data transmission according to an embodiment of the present invention;
fig. 4 is a queue of UEs to be scheduled for a data transmission method according to an embodiment of the present invention;
fig. 5 is a UE merging diagram of a data transmission method according to an embodiment of the present invention;
fig. 6 is a schematic diagram of an enhanced spatial division reassembly matrix of a data transmission method according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a plurality of matrices on space division of a data transmission method according to an embodiment of the present invention;
FIG. 8 is a general space division scheme of the prior art;
fig. 9 is an enhanced space division scheme of a data transmission method according to an embodiment of the present invention;
fig. 10 is another enhanced space division scheme of a data transmission method according to an embodiment of the present invention;
fig. 11 is still another enhanced space division scheme of a data transmission method according to an embodiment of the present invention;
fig. 12 is a diagram of null packet traffic simulation of a data transmission method according to an embodiment of the present invention;
fig. 13 is a diagram of simulation of the number of air division users of the data transmission method according to the embodiment of the present invention;
fig. 14 is a schematic diagram of a UE occupying space division in a data transmission method according to an embodiment of the present invention;
fig. 15 is a block diagram of a data transmission apparatus according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
The method embodiments provided in the embodiments of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Taking the mobile terminal as an example, fig. 1 is a block diagram of a hardware structure of the mobile terminal of a data transmission method according to an embodiment of the present invention. As shown in fig. 1, the mobile terminal may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA), and a memory 104 for storing data, wherein the mobile terminal may further include a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration, and does not limit the structure of the mobile terminal. For example, the mobile terminal 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 computer programs, for example, software programs and modules of application software, such as computer programs corresponding to the data transmission method in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the computer programs stored in the memory 104, so as to implement the method described above. The 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 located remotely from the processor 102, which may be connected to the mobile terminal over 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 device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a Network adapter (NIC), which can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.
An embodiment of the present application provides a data transmission method, as shown in fig. 2, the method includes the following steps:
step S202, obtaining a plurality of UE to be scheduled;
step S204, under the condition that the number of the space divisions occupied by the UE to be scheduled is larger than L, M UE to be scheduled is determined from the UE to be scheduled, wherein L is the number of the space divisions of the base station, and M is a positive integer less than or equal to L;
step S206, determining each layer of space division in the L layers of space division of the base station as the current layer space division, and executing the following operations: under the condition that a target physical resource block value of current UE to be scheduled in a current layer space division is smaller than a first threshold value, the first UE to be scheduled is supplemented into the current layer space division, wherein the first UE to be scheduled is UE except M UE to be scheduled in a plurality of UE to be scheduled, the target physical resource block value is the number of resource blocks required to be used for scheduling the UE to be scheduled, the first threshold value is the maximum target physical resource block value of the M UE to be scheduled, and the current layer space division is one layer space division in an L layer space division of a base station.
Optionally, L in this embodiment of the present application is a maximum scheduling capability of the base station, that is, the number of spatial division layers of the base station, where each layer of spatial division includes a physical resource block, and may be used to schedule the UE.
In the embodiment of the present application, when scheduling a UE, more than one UE may be scheduled using a layer of space division. As long as the sum of the target physical resource block values of the UEs is less than or equal to the first threshold, a layer of space division can be used for scheduling, and one UE may occupy more than one layer of space division.
The first threshold is the maximum target physical resource block number in the M UEs scheduled by the base station.
That is to say, taking 15 UEs to be scheduled as an example, and the scheduling capability of the base station is 10, first, 10 or less UEs to be scheduled are determined from the 15 UEs to be scheduled, and the determined UEs occupy 10 layers of space division. Then, the maximum value of the target physical resource block number of 10 or less UEs to be scheduled is determined as the first threshold. Next, of the UEs to be scheduled below 10 or 10, the UE with the largest target physical resource block value is scheduled by one or more layers of space division, and other UEs to be scheduled with space division may be complemented, for example, the remaining UEs in the 15 UEs to be scheduled, because the target physical resource block is smaller than the first threshold. And the condition of the supplementing is that after the UE is supplemented, the sum of the target physical resource block values is less than or equal to a first threshold value. Therefore, 15 UEs to be scheduled are scheduled by using 10 layers of space division. Of course, if the sum of the target physical resource block values is greater than the first threshold, no padding is possible. When at least two UEs to be scheduled are included in one layer of space division, different UE can be scheduled using different resource blocks of space division. For example, 1-60 resource blocks schedule UE1, 1-100 resource blocks schedule UE2, and there is no conflict between the UEs to be scheduled. The above numerical values are merely examples and do not constitute limitations of the present application.
It can be understood that the "padding" in this embodiment is actually to use a layer of spatially separated different resource blocks to simultaneously schedule a plurality of UEs to be scheduled.
As an alternative example, in a case that a target physical resource block value of a current UE to be scheduled in a current overlaid space division is smaller than a first threshold, the supplementing a first UE to be scheduled into the current overlaid space division includes:
acquiring a target physical resource block value of current UE to be scheduled and a target physical resource block value of each UE to be scheduled in a plurality of UEs to be scheduled except M UEs to be scheduled;
according to the target physical resource block value, one or more first UE to be scheduled are determined from the plurality of UE to be scheduled, except M UE to be scheduled, wherein the sum of the target physical resource block value of the current UE to be scheduled and the target physical resource block value of the one or more first UE to be scheduled is less than or equal to a first threshold value;
and filling the determined one or more first UE to be scheduled into the current space division.
That is, the condition of determining whether to supplement the UE to be scheduled to the space division of the one layer is whether the sum of the target physical resource block values is still less than or equal to the first threshold after the UE to be scheduled is supplemented. If greater than the first threshold, no padding is allowed. And if the sum of the target physical resource block values is still smaller than the first threshold value after the UE to be scheduled is supplemented, continuing to supplement the UE to be scheduled. In one-layer space division, a plurality of UEs to be scheduled may be padded, for example, if the target physical resource block value of the UEs to be scheduled in one-layer space division is 30, and the first threshold value is 100, if there are a plurality of UEs to be scheduled whose target physical resource block values are 60, 20, 10, and 30, respectively, then the UEs with target physical resource block values of 20, 10, and 30 may all be padded in space division whose target physical resource block value is 30.
As an optional example, after padding the determined one or more first UEs to be scheduled into the current layer space division, the method further includes:
in the L-layer space division of the base station, when the sum of target physical resource block values of the UE to be scheduled in any two-layer space division is smaller than a first threshold value, the UE to be scheduled in one-layer space division in any two-layer space division is added into the other-layer space division.
Optionally, if in the L-layer space division, after the UE to be scheduled is complemented, the UE to be scheduled is complemented in some space divisions, the UE to be scheduled is not complemented in some space divisions, and all space divisions are also complemented with the UE. Then, after the UE is complemented, in the L-layer space division, some space divisions schedule 1 UE to be scheduled, and some space divisions schedule a plurality of UEs to be scheduled. And if the sum of the target physical resource block values of the UE to be scheduled in the two space divisions is less than or equal to the first threshold value, the UE to be scheduled in the two space divisions is scheduled by a layer of space division, and the remaining layer of space division can be continuously supplemented into the UE to be scheduled.
As an optional example, after padding the UE to be scheduled in one of the two layers of space division into the other layer of space division, the method further includes:
and in the L-layer space division, supplementing a padding field into any layer space division until the sum of the target physical resource block values of the UE to be scheduled in any layer space division is equal to the first threshold value when the sum of the target physical resource block values of the UE to be scheduled in any layer space division is smaller than the first threshold value.
Optionally, after the UE to be scheduled is complemented in the L-layer space division, if the UE to be scheduled cannot be complemented continuously, and the sum of the target physical resource block values of the UE to be scheduled in the space division is smaller than the first threshold, padding data needs to be complemented until the sum of the target physical resource block values of the space division is equal to the first threshold. padding data is a kind of padding data, which may be zero. For example, the first threshold is 100, the sum of the target physical resource block values of a plurality of UEs to be scheduled that are spatially separated in one layer is 90, and the UEs to be scheduled cannot be supplemented any more, then 10 padding data is supplemented.
As an optional example, before determining each of the L-layered space division of the base station as the current-layered space division, the method further includes:
acquiring a modulation and coding scheme, a rank and a buffer status report size of each UE to be scheduled in a plurality of UEs to be scheduled;
and determining the target physical resource block value of each UE to be scheduled according to the modulation and coding scheme, the rank and the buffer status report size of each UE to be scheduled.
That is, in this embodiment, the target physical resource block value of each UE to be scheduled needs to be determined, and subsequent scheduling processing is performed.
This is explained with reference to a specific example.
Acquiring a UE queue to be scheduled of a current cell;
acquiring MCS (Modulation and coding scheme) of all UE to be scheduled in a cell, RI (Rank indicator), BSR (Buffer Status Report) size, the number of PRBs (Physical Resource blocks) required during scheduling calculated according to the current BSR, namely a target Physical Resource Block value, and the detection Reference Signal (Sounding Reference Signal) strength and the Interference Noise Ratio (Signal to Interference Noise Ratio, SINR for short) measured by the UE, and expressing the values by the SRS SINR;
then, selecting users meeting space correlation to perform space division pairing under a certain channel condition, and forming a matrix with a row vector as the number of users and a column vector as the number of PRBs; in this step, a UE capable of performing combined scheduling is selected from all UEs in the cell. It should be noted that, in this embodiment, UE which can be subjected to merged scheduling, that is, multiple UEs to be scheduled mentioned in this embodiment, are selected from all UEs in a cell, and then, when selecting a user which meets space correlation to perform space allocation pair, L UEs to be scheduled need to be selected from the multiple UEs to be scheduled according to scheduling capability of a base station, that is, the size of L, and perform space division pair on the L UEs to be scheduled. The space division pairing process is a process of selecting L UEs to be scheduled from a plurality of UEs to be scheduled. The matrix is obtained, and the number of PRBs is the target physical resource block value.
Further, reordering the PRBs required by the UE in the paired matrix from large to small; that is, the L UEs to be scheduled are sorted according to the size of the target physical resource block value, and the largest target physical resource block value is used as the first threshold.
And then, further, more importantly, continuously selecting the users meeting the space division pairing condition to add to the idle PRB position in the user pairing matrix, and performing spectrum resource alignment. That is to say, after L UEs to be scheduled are selected from the multiple UEs to be scheduled, the remaining UEs to be scheduled are padded in the L-layer space division where the L UEs to be scheduled are located. The current premise is that after the UE to be scheduled is supplemented, the sum of the target physical resource block values of the UE to be scheduled in the space division is less than or equal to a first threshold value, otherwise, the UE is not supplemented. The resource alignment means that after the UE to be scheduled is supplemented into the space division, the sum of the target physical resource block values can reach the first threshold, and if the first threshold is not reached, padding data is supplemented.
And finally, traversing the UE queue to be scheduled to obtain an enhanced space division pairing matrix. The enhanced space division pairing matrix is a matrix for supplementing the UE to be scheduled into the space division. Through the self-adaptive pairing algorithm, as many UEs as possible are subjected to space division multiplexing, the frequency spectrum utilization rate is improved, resources are saved, and better network experience is brought. By enhancing the space division pairing algorithm, space division users are continuously added to the idle frequency domain resources in the space division matrix, and the problem of asymmetric scheduling of the spectrum resources in space division multiplexing caused by the difference of the service volumes of the terminal users is solved. The method has the advantages that the demodulation reliability is guaranteed, the number of the space division multiplexing UE is increased, resources are saved, the frequency spectrum efficiency is improved, better network experience is brought, and the effects of optimal system capacity and user scheduling data volume are achieved.
Specifically, fig. 3 is a flow chart of the present application. As shown in fig. 3.
Step S301: acquiring a UE queue to be scheduled, which is sequenced according to user priorities in a current cell; in this step, for a plurality of UEs to be scheduled, L UEs to be scheduled are selected according to the scheduling capability of the base station. Fig. 4 is an alternative UE queue to be scheduled. n is the number of UEs to be scheduled. n is greater than or equal to L. If n is smaller than L, one UE to be scheduled is scheduled in some space division modes, or a plurality of UEs to be scheduled are scheduled in some space division modes, and the remaining one or more space division modes do not need to schedule the UEs to be scheduled.
Step S302: and acquiring BSR, SRS SINR, MCS and RI of all UE to be scheduled in the cell.
And according to the current BSR and MCS of the UE, calculating the number of the resource blocks needing to be scheduled, and expressing the number of the resource blocks by using the PRB num. In this step, the target physical resource block value of each UE to be scheduled can be calculated. Step S303: under certain channel conditions, selecting users meeting spatial correlation to perform space division pairing, and forming a matrix with a row vector as the number of users and a column vector as PRB num. In this step, L UEs to be scheduled are selected from n UEs to be scheduled, and the selection may be performed according to the priority of the UEs.
And selecting the UE of which the SINR is greater than the SINR threshold and the spatial correlation is less than the correlation threshold to perform space division pairing, and finally forming a user pairing matrix of which the row vector is the number of the UE and the column vector is the PRB num of the UE. It should be noted here that, for a UE to be scheduled with weak channel correlation, interference is weak, and confusion is not easy to occur, so that a layer of space division may be used for scheduling. If the correlation between the UE to be scheduled is strong, data confusion is easy to occur, and a layer of space division is not used for scheduling.
And sequencing the needed PRB num of the UE in the user pairing matrix from large to small for the subsequent steps.
Step S304: more importantly, according to the user pairing matrix in the previous step, self-adaptive enhanced space division pairing is carried out. Continuously selecting users meeting space division pairing conditions to add to the idle PRB positions in the user pairing matrix, and performing spectrum resource alignment; that is, the data in one space division is supplemented to the size of the first threshold value by means of supplementing the UE to be scheduled or supplementing padding data.
And scheduling PRB num, the size of the idle PRB in the user pairing matrix and the spatial correlation of the user according to the requirement of the UE to be paired, and continuously adding the idle PRB position in the user pairing matrix to the UE meeting the space division pairing condition for frequency domain compensation. For example, in fig. 5, when there are 10 UEs in total from 1 to 10, and 10 layers of space division, the UE11 is added to the space division where the UE2 is located. After the UE11 is supplemented, the data of the second layer of space division still does not reach the first threshold, that is, the target material resource value of the UE1 in the first layer of space division, and the UE to be scheduled may be further supplemented, or padding data may be supplemented. The embodiment effectively solves the problem of asymmetric frequency spectrum resource scheduling.
It should be noted that, this step may also be performed to recombine the pairing matrix.
And further recombining the space division paired matrix. Moving users meeting the recombination condition in the pairing matrix to an idle PRB position in the matrix, performing frequency domain alignment, and reducing the number of users of the matrix row vector;
namely, according to the PRB of the user in the pairing matrix and the size of the idle PRB in the pairing matrix, the user in the matrix is moved to the idle PRB position in the user matrix, frequency domain completion is continuously carried out, and the number of rows in the matrix is reduced. For example, in fig. 6, the UE3 is moved to the free PRB position of the UE2 and the frequency domain padding is continued. The row vectors in the whole matrix are reduced from 10 users to 8, and the mutual interference of the users in the spatial multiplexing is reduced. That is to say, in this embodiment, when performing space division multiplexing, a UE to be scheduled, that is, a user, may be supplemented into an L-layer space division, or a user and a user may be merged, that is, the UE3 is supplemented into a space division where the UE2 is located. Or the two complementary modes are used in combination, as long as after the UE to be scheduled, that is, the user, is complemented, the total target physical resource block value, that is, the value of the PRB is less than or equal to the first threshold.
Optionally, in this embodiment, the number of the matrices may be multiple. For example, as shown in fig. 7, the UEs 1-19 form one matrix, and on the same space division, there may be a second matrix, which includes a plurality of matrices to be scheduled. Then for the second layer of spatial division, the simultaneously scheduled UEs include UE8, UE11, and UE 21.
Step S305: and traversing the UE in the queue to be scheduled to obtain one or more enhanced space division pairing matrixes.
Step S306: and allocating time domain and frequency domain resources for the UE meeting space division multiplexing.
The enhanced space division pairing matrix obtained by the method solves the problem of asymmetric frequency spectrum resource scheduling caused by the difference of terminal traffic. On the premise of ensuring the demodulation capability, the UE is enabled to be subjected to space division as much as possible, and filling of a large amount of padding is avoided. Not only is RB resource saved, but also the space division performance is improved, the data transmission efficiency is enhanced, and better network experience is brought.
The general space division and the enhanced space division in the scheme are simulated, and the overall effect is compared.
The current cell has 19 UEs 1-19 respectively, and the required PRB num is as follows. Assuming that the UE MCS are 20, RI is 1 single stream transmission mode. It is assumed that the maximum number of supported streams of null packets is 10 streams. And, assume that the UEs both satisfy the SRS SINR threshold and the correlation threshold.
Figure BDA0002879587990000071
A general space division scheme is shown in fig. 8.
The UE 1-10 meets space division pairing conditions and is successfully paired, and a matrix with 10 user 10 streams as row vectors and 244 PRBs as column vectors is formed. And adding padding to the insufficient PRBs of the UE 2-10 to perform frequency domain compensation. The number of the final space division users is 10, and the space division packet flow is 2.08 Gbps.
Enhanced spatial division scheme, as shown in fig. 9.
In the space division matrix of 10 users 244PRB, the frequency domain complementing is carried out by continuously adding UE11, 12, 13, 14, 15, 16, 17, 18, 19 to the idle PRBs of the UE 2-10. The number of the final empty users is 19, and the empty packet flow is about 3.45 Gbps. Compared with the common air separation scheme, the overall flow is improved by about (3.45-2.08)/2.08-65.9%. Of course. Fig. 10 and 11 are also alternative embodiments. In fig. 10, after the UE7 is complemented into the free PRB of the UE2, the UE3 may be complemented into the free PRB of the UE2, as long as the free PRB of the UE2 can carry the complemented UE3 and UE 7. In fig. 11, for example, after the UE3 is complemented into the idle PRB of the UE4, Padding may be complemented into the remaining PRBs of the UE 4. Supplementing the padding field, the PRB of UE4 should not exceed the PRB of UE 1.
And finally, improving the overall flow:
Figure BDA0002879587990000072
fig. 12 and 13 are a null packet traffic simulation diagram and a null user number simulation diagram comparing a normal null division scheme and an enhanced null division scheme when the number of null layers is 3 to 10, respectively. As can be seen from the simulation diagram, the number of the scheduling users of the enhanced space division scheme and the overall flow of the space division packet are improved compared with the common space division scheme, the maximum flow is improved by about 65.9 percent, and the effect of improving the transmission efficiency of a wireless system is achieved.
The present embodiment also provides an example, where one UE may occupy at least two layers of space division. As shown in fig. 14, the UE10 therein occupies two layers of space. The enhanced spatial division scheme in the present application may also be used. The UE10 is supplemented with other UEs in the two-layer space division occupied by the UE, or is also supplemented with a UE occupying the two-layer space division.
By enhancing the space division pairing algorithm, space division users are continuously added to the idle frequency domain resources in the space division matrix, and the problem of asymmetric frequency spectrum resource scheduling is effectively solved. The scheme realizes the increase of the number of the space division multiplexing users, greatly improves the system data transmission efficiency, and achieves the effects of optimal system capacity and consideration of the scheduling data volume of the users.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
In this embodiment, a data transmission device is further provided, and the data transmission device is used to implement the foregoing embodiments and preferred embodiments, which have already been described and are not described again. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 15 is a block diagram of a data transmission apparatus according to an embodiment of the present invention, as shown in fig. 15, the apparatus including:
a first obtaining unit 1502, configured to obtain multiple UEs to be scheduled;
a first determining unit 1504, configured to determine M UEs to be scheduled from the multiple UEs to be scheduled when the number of space divisions occupied by the multiple UEs to be scheduled is greater than L, where L is the number of space division layers of a base station, and M is a positive integer less than or equal to L;
an executing unit 1506, configured to determine each of the L-layered space divisions of the base station as a current-layered space division, and perform the following operations: and under the condition that a target physical resource block value of the current UE to be scheduled in the current layer space division is smaller than a first threshold value, supplementing the first UE to be scheduled to the current layer space division, wherein the first UE to be scheduled is UE except the M UEs to be scheduled in the plurality of UEs to be scheduled, the target physical resource block value is the number of resource blocks which need to be used for scheduling the UEs to be scheduled, the first threshold value is the maximum target physical resource block value in the M UEs to be scheduled, and the current layer space division is one layer space division in an L layer space division of the base station.
As an optional implementation, the execution unit includes:
an obtaining module, configured to obtain the target physical resource block value of the current UE to be scheduled and the target physical resource block value of each UE to be scheduled in the UEs to be scheduled except the M UEs to be scheduled;
a determining module, configured to determine one or more first UEs to be scheduled from the UEs to be scheduled, except the M UEs to be scheduled, according to the target physical resource block value, where a sum of the target physical resource block value of the current UE to be scheduled and the target physical resource block value of the one or more first UEs to be scheduled is less than or equal to the first threshold;
a first supplementing module, configured to supplement the determined one or more first UEs to be scheduled into the current-layer space division.
As an optional implementation manner, the execution unit further includes:
and the second supplementing module is used for supplementing the determined one or more first UEs to be scheduled into the current layer of space division, and supplementing the UEs to be scheduled in one layer of space division into the other layer of space division in the L layer of space division of the base station under the condition that the sum of target physical resource block values of the UEs to be scheduled in any two layers of space division is smaller than the first threshold value.
As an optional implementation manner, the execution unit further includes:
and a third supplementing module, configured to, after the UE to be scheduled in one of the two arbitrary layers of space divisions is supplemented into the other layer of space division, supplement the padding field into the arbitrary layer of space division until the sum of the target physical resource block values of the UE to be scheduled in the arbitrary layer of space division is equal to the first threshold in a case where the sum of the target physical resource block values of the UE to be scheduled in the arbitrary layer of space division in the L layer of space division is smaller than the first threshold.
As an optional implementation, the apparatus further comprises:
a second obtaining unit, configured to obtain a modulation and coding scheme, a rank, and a buffer status report size of each to-be-scheduled UE in the multiple to-be-scheduled UEs before determining each of the L-layer space divisions of the base station as a current-layer space division;
and the second determining unit is used for determining the target physical resource block value of each UE to be scheduled according to the modulation and coding scheme, the rank and the buffer status report size of each UE to be scheduled.
For other examples of this embodiment, please refer to the above examples, which are not described herein again.
It should be noted that, the above-mentioned each unit module may be implemented by software or hardware, and for the latter, the following may be implemented, but is not limited to this: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
Embodiments of the present invention also provide a computer-readable storage medium having a computer program stored thereon, wherein the computer program is arranged to perform the steps of any of the above-mentioned method embodiments when executed.
In an exemplary embodiment, the computer readable storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Embodiments of the present invention further provide an electronic device, comprising a memory in which a computer program is stored and a processor configured to execute the computer program to perform the steps in any of the above method embodiments.
In an exemplary embodiment, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary embodiments, and details of this embodiment are not repeated herein.
It will be apparent to those skilled in the art that the various modules or steps of the invention described above may be implemented using a general purpose computing device, they may be centralized on a single computing device or distributed across a network of computing devices, and they may be implemented using program code executable by the computing devices, such that they may be stored in a memory device and executed by the computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into various integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the principle of the present invention shall be included in the protection scope of the present invention.

Claims (10)

1. A method of data transmission, comprising:
acquiring a plurality of UE to be scheduled;
determining M UE to be scheduled from the plurality of UE to be scheduled under the condition that the number of space divisions occupied by the plurality of UE to be scheduled is greater than L, wherein L is the number of space division layers of a base station, and M is a positive integer less than or equal to L;
determining each layer of space division in the L layers of space division of the base station as a current layer of space division, and executing the following operations: and under the condition that a target physical resource block value of the current UE to be scheduled in the current layer space division is smaller than a first threshold value, supplementing the first UE to be scheduled to the current layer space division, wherein the first UE to be scheduled is UE except the M UEs to be scheduled in the plurality of UEs to be scheduled, the target physical resource block value is the number of resource blocks which need to be used for scheduling the UEs to be scheduled, the first threshold value is the maximum target physical resource block value in the M UEs to be scheduled, and the current layer space division is one layer space division in an L layer space division of the base station.
2. The method of claim 1, wherein the complementing the first UE to be scheduled in the current overlaid space division in the case that a target physical resource block value of the current UE to be scheduled in the current overlaid space division is smaller than a first threshold value comprises:
acquiring the target physical resource block value of the current UE to be scheduled and the target physical resource block value of each UE to be scheduled in the UEs except the M UEs to be scheduled in the plurality of UEs to be scheduled;
determining one or more first UEs to be scheduled from the UEs to be scheduled except the M UEs to be scheduled, wherein the sum of the target physical resource block value of the current UE to be scheduled and the target physical resource block value of the one or more first UEs to be scheduled is less than or equal to the first threshold value;
and supplementing the determined one or more first UE to be scheduled into the current-layer space division.
3. The method of claim 2, wherein after padding the determined one or more first UEs to be scheduled into the current layer space division, the method further comprises:
in the L-layer space division of the base station, under the condition that the sum of the target physical resource block values of the UE to be scheduled in any two-layer space division is smaller than the first threshold value, the UE to be scheduled in one-layer space division in any two-layer space division is added into the other-layer space division.
4. The method according to claim 3, wherein after padding the UE to be scheduled in one of the two layers of space division into another layer of space division, the method further comprises:
and supplementing a padding field into any layer space division when the sum of the target physical resource block values of the UE to be scheduled in any layer space division in the L layer space division is smaller than the first threshold value until the sum of the target physical resource block values of the UE to be scheduled in any layer space division is equal to the first threshold value.
5. The method of any of claims 1 to 4, wherein before determining each of the L-level spatial partitions of the base station as a current-level spatial partition, the method further comprises:
acquiring a modulation and coding scheme, a rank and a cache status report size of each UE to be scheduled in the plurality of UEs to be scheduled;
and determining the target physical resource block value of each UE to be scheduled according to the modulation and coding scheme, the rank and the buffer status report size of each UE to be scheduled.
6. A data transmission apparatus, comprising:
a first obtaining unit, configured to obtain a plurality of UEs to be scheduled;
a first determining unit, configured to determine M UEs to be scheduled from the multiple UEs to be scheduled when the number of space divisions occupied by the multiple UEs to be scheduled is greater than L, where L is the number of space division layers of a base station, and M is a positive integer less than or equal to L;
an execution unit, configured to determine each of the L-layered space divisions of the base station as a current-layered space division, and perform the following operations: and under the condition that a target physical resource block value of the current UE to be scheduled in the current layer space division is smaller than a first threshold value, supplementing the first UE to be scheduled to the current layer space division, wherein the first UE to be scheduled is UE except the M UEs to be scheduled in the plurality of UEs to be scheduled, the target physical resource block value is the number of resource blocks which need to be used for scheduling the UEs to be scheduled, the first threshold value is the maximum target physical resource block value in the M UEs to be scheduled, and the current layer space division is one layer space division in an L layer space division of the base station.
7. The apparatus of claim 6, wherein the execution unit comprises:
an obtaining module, configured to obtain the target physical resource block value of the current UE to be scheduled and the target physical resource block value of each UE to be scheduled in the UEs to be scheduled except the M UEs to be scheduled;
a determining module, configured to determine one or more first UEs to be scheduled from the UEs to be scheduled, except the M UEs to be scheduled, according to the target physical resource block value, where a sum of the target physical resource block value of the current UE to be scheduled and the target physical resource block value of the one or more first UEs to be scheduled is less than or equal to the first threshold;
a first supplementing module, configured to supplement the determined one or more first UEs to be scheduled into the current-layer space division.
8. The apparatus of claim 6, wherein the execution unit further comprises:
and a second supplementing module, configured to, after supplementing the determined one or more UEs to be scheduled into the current hierarchical space division, in an L-level space division of the base station, and under a condition that a sum of the target physical resource block values of the UEs to be scheduled in any two-level space division is smaller than the first threshold, supplement the UEs to be scheduled in one-level space division of the any two-level space division into the other-level space division.
9. A computer-readable storage medium, in which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 5.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method as claimed in any one of claims 1 to 5 when executing the computer program.
CN202011639509.2A 2020-12-31 2020-12-31 Data transmission method and device, storage medium and electronic device Pending CN114698134A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202011639509.2A CN114698134A (en) 2020-12-31 2020-12-31 Data transmission method and device, storage medium and electronic device
PCT/CN2021/139773 WO2022143269A1 (en) 2020-12-31 2021-12-20 Data transmission method and device, storage medium and electronic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011639509.2A CN114698134A (en) 2020-12-31 2020-12-31 Data transmission method and device, storage medium and electronic device

Publications (1)

Publication Number Publication Date
CN114698134A true CN114698134A (en) 2022-07-01

Family

ID=82135612

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011639509.2A Pending CN114698134A (en) 2020-12-31 2020-12-31 Data transmission method and device, storage medium and electronic device

Country Status (2)

Country Link
CN (1) CN114698134A (en)
WO (1) WO2022143269A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115038188A (en) * 2022-07-13 2022-09-09 中国联合网络通信集团有限公司 Resource scheduling method, base station device and storage medium
CN115119282A (en) * 2022-07-13 2022-09-27 中国联合网络通信集团有限公司 UE pairing method, device and storage medium

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102781045B (en) * 2012-07-17 2015-08-26 大唐移动通信设备有限公司 Space division multiplexing method and device
CN108880641B (en) * 2017-05-16 2022-02-25 中兴通讯股份有限公司 Resource allocation method and device for wireless mobile communication system
CN111357348B (en) * 2017-12-27 2022-03-29 华为技术有限公司 Scheduling method, device and system
US10439681B1 (en) * 2018-09-20 2019-10-08 Verizon Patent And Licensing Inc. Systems and methods for dynamic inter-sector MIMO transmission
KR20200122147A (en) * 2019-04-17 2020-10-27 삼성전자주식회사 Method and apparatus for full duplex operation in wirelss communication system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115038188A (en) * 2022-07-13 2022-09-09 中国联合网络通信集团有限公司 Resource scheduling method, base station device and storage medium
CN115119282A (en) * 2022-07-13 2022-09-27 中国联合网络通信集团有限公司 UE pairing method, device and storage medium
CN115119282B (en) * 2022-07-13 2024-04-19 中国联合网络通信集团有限公司 UE pairing method, device and storage medium

Also Published As

Publication number Publication date
WO2022143269A1 (en) 2022-07-07

Similar Documents

Publication Publication Date Title
US9167571B2 (en) Base station and method for resource allocation using localized and distributed resource blocks
CN106685494B (en) Packet scheduling method and device in MU-MIMO system
KR101731479B1 (en) Scheduling transmission for multi-user, multiple-input, multiple-output data
WO2022143269A1 (en) Data transmission method and device, storage medium and electronic device
WO2023005448A1 (en) Wireless resource utilization rate determination method and apparatus, electronic device and storage medium
WO2016033953A1 (en) Resource allocation method and device
EP3193463B1 (en) User pairing processing method, device and base station
CN102300326A (en) Scheduling method of multi-user multi-input multi-output (MIMO) communication system and base station
CN109150269B (en) Signaling receiving method, indication method, terminal, network equipment and storage medium
CN114125896B (en) Radio resource load evaluation method, device and computer readable storage medium
CN109716846A (en) It is that the radio channel estimation updated distributes resource according to the validity currently estimated
CN106507461B (en) Power adjustment method and device in uplink multi-user system
CN115037342B (en) UE pairing method, device and storage medium
CN112399595A (en) Communication method and device
CN108880641B (en) Resource allocation method and device for wireless mobile communication system
CN108207033A (en) Signal transmission control method and device
CN112602269B (en) Precoding indication method for uplink data transmission and related equipment
CN111357348B (en) Scheduling method, device and system
CN115399007A (en) Method, device and system for transmitting resource indication information
CN113286373A (en) Uplink multi-user-multi-input multi-output scheduling method and device
CN116133000B (en) Space division multiplexing method, apparatus, computer device and storage medium
CN113170437A (en) Method and base station for multi-user multiple-input multiple-output
WO2023198032A1 (en) Channel state information reporting method and apparatus
CN115119282B (en) UE pairing method, device and storage medium
CN113382475B (en) Resource scheduling method and device based on MUMIMO

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