CN108207035B

CN108207035B - SDMA scheduling flow optimization method, device and cell

Info

Publication number: CN108207035B
Application number: CN201611180829.XA
Authority: CN
Inventors: 蔡超
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2016-12-20
Filing date: 2016-12-20
Publication date: 2022-12-06
Anticipated expiration: 2036-12-20
Also published as: CN108207035A

Abstract

The invention provides an SDMA scheduling flow optimization method, a device and a cell. The SDMA scheduling flow optimizing method comprises the following steps: taking a CP set of a cell receiving UE signals as an active set of the UE; taking a CP set in the cell which is not intersected with the active set as the active set of the UE; generating an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; and based on the non-intersection matrix of the active set, SDMA pairing is performed on the main dispatching UE and the auxiliary dispatching UE, so that the time consumption of SDMA processing is reduced.

Description

SDMA scheduling flow optimization method, device and cell

Technical Field

The invention relates to the technical field of LTE (Long term evolution) communication equipment, in particular to an SDMA (space division multiple Access) scheduling flow optimization method, device and cell.

Background

The generation of super-cell not only solves the problem that the common cell is difficult to solve, such as frequent switching of signaling, wide coverage of region, etc., but also ensures that the flow of super-cell is infinitely close to the sum of the flows of multiple common cells. The Space Division Multiple Access (SDMA) technology is used for multiplexing frequency domain and time domain resources in a space, and centrally scheduling UE accessed by each CP set in a super cell, thereby solving the congenital flow defect generated by centralized scheduling of the super cell. However, the software algorithm of the known SDMA processing has more loop traversals and low processing efficiency, so that the traffic gain brought by SDMA to the super cell is also bad. Therefore, a SDMA scheduling flow optimization method, apparatus and cell are needed to solve the above technical problems in the prior art.

Disclosure of Invention

The invention provides a method and a device for optimizing an SDMA (space division multiple access) scheduling process and a cell, which improve the performance of uplink and downlink SDMA (space division multiple access) of the cell and reduce the time consumption of SDMA processing.

The technical scheme adopted by the invention is as follows: an SDMA scheduling flow optimization method comprises the following steps: taking a CP set of a cell receiving UE signals as an active set of the UE; taking a CP set in the cell which is not intersected with the active set as the active set of the UE; generating an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; and performing SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active set.

Preferably, the generating the non-intersection matrix of the active set of the UE specifically includes: taking the active set as the first element of a row in the active set non-intersection matrix; taking the activation set intersection-free as the other elements of the row except the first element; and setting elements except the intersection of the active set and the active set in the non-intersection matrix of the active set as 0.

Preferably, before the SDMA pairing is performed for the primary scheduling UE and the secondary scheduling UE, the method further includes: and forming a master UE bidirectional queue by the active set from large to small according to the RB of the master UE.

Preferably, before the SDMA pairing is performed for the primary scheduling UE and the secondary scheduling UE, the method further includes: generating an array of head nodes of the auxiliary tuning UE based on the number of the active sets, wherein subscripts of the array are numerical values of no intersection of the active sets; and forming an auxiliary dispatching UE bidirectional queue by the aid of the non-intersection of the active sets according to the RB of the auxiliary dispatching UE from large to small, and hanging the auxiliary dispatching UE bidirectional queue under the element corresponding to the subscript in the array.

Preferably, the SDMA pairing is performed on the master scheduling UE and the auxiliary scheduling UE based on the non-intersection matrix of the active set, and specifically includes: selecting the master UE from the master UE bidirectional queue; taking out the active set intersection-free set of the calling UE from the active set intersection-free matrix; searching whether the auxiliary dispatching UE bidirectional queue exists under the element corresponding to the subscript in the array according to the numerical value of the non-intersection of the active set; if the auxiliary dispatching UE bidirectional queue exists, taking out the auxiliary dispatching UE and the main dispatching UE from the auxiliary dispatching UE bidirectional queue for SDMA pairing; and if the auxiliary dispatching UE and the main dispatching UE complete SDMA pairing, returning to execute the step of taking out the next main dispatching UE from the bidirectional queue of the main dispatching UE for SDMA pairing.

Preferably, after searching whether the auxiliary tuning UE bidirectional queue exists under an element corresponding to the subscript in the array according to the value of the null intersection of the active set, the method further includes: and if the auxiliary dispatching UE bidirectional queue does not exist, returning to execute to take out the next active set intersection-free set of the main dispatching UE from the active set intersection-free matrix.

Preferably, before the CP set of the UE signal received by the cell is used as the active set of the UE, the method further includes: applying for resource nodes from a resource pool in a memory to form an idle node queue according to the number of the CP sets and the number of the UE allowed to be accessed by the cell; correspondingly, performing SDMA pairing on the UE specifically includes: calling an idle node in the idle node queue as a using node; and storing the scheduling information of the main dispatching UE and the auxiliary dispatching UE into the using node.

Preferably, after the scheduling information of the master UE and the slave UE is stored in the using node, the method further includes: and releasing the resource pool from the using node to the idle node queue under the condition that the main scheduling UE and the auxiliary scheduling UE finish SDMA pairing and scheduling.

The invention also provides an SDMA scheduling flow optimizing device, which comprises: an active set generating module, configured to use a CP set of a cell receiving a UE signal as an active set of the UE; an intersection-free generating module, configured to use a CP set in the cell that is not intersected with the active set as an active set intersection-free set of the UE; a matrix generating module, configured to generate an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; and the pairing module is used for carrying out SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active set.

Preferably, the matrix generation module is specifically configured to: taking the active set as the first element of a row in the active set non-intersection matrix; taking the activation set intersection-free as the other elements of the row except the first element; and setting elements except the intersection of the active set and the active set in the non-intersection matrix of the active set as 0.

Preferably, the matrix generating module further includes a master UE bidirectional queue forming module, configured to: and forming a master UE bidirectional queue by the active set from large to small according to the RB of the master UE.

Preferably, the matrix generating module further includes an auxiliary scheduling UE bidirectional queue forming module, configured to: generating an array of head nodes of the auxiliary tuning UE based on the number of the active sets, wherein subscripts of the array are numerical values of no intersection of the active sets; and forming an auxiliary dispatching UE bidirectional queue by the aid of the non-intersection of the active sets according to the RB of the auxiliary dispatching UE from large to small, and hanging the auxiliary dispatching UE bidirectional queue under the element corresponding to the subscript in the array.

Preferably, the pairing module is specifically configured to: selecting the master UE from the master UE bidirectional queue; based on the value of the active set intersection-free set of the calling UE taken from the active set intersection-free matrix; searching whether the auxiliary dispatching UE bidirectional queue exists under the element corresponding to the subscript in the array according to the numerical value of the non-intersection of the active set; if the auxiliary dispatching UE bidirectional queue exists, taking out the auxiliary dispatching UE and the main dispatching UE from the auxiliary dispatching UE bidirectional queue for SDMA pairing; and if the auxiliary dispatching UE and the main dispatching UE complete SDMA pairing, returning to execute the step of taking out the next main dispatching UE from the main dispatching UE bidirectional queue for SDMA pairing.

Preferably, the apparatus further includes a node application-ahead module, configured to: applying for resource nodes from a resource pool in a memory to form an idle node queue according to the number of the CP sets and the number of the UE allowed to be accessed by the cell; accordingly, the pairing module is further configured to: calling an idle node in the idle node queue as a using node; and storing the scheduling information of the main dispatching UE and the auxiliary dispatching UE into the using node.

Preferably, the apparatus further includes a node releasing module, configured to: and releasing the resource pool from the using node to the idle node queue under the condition that the main dispatching and the auxiliary dispatching UE finish SDMA pairing and dispatching.

The invention also provides a cell which is characterized by comprising an SDMA scheduling flow optimizing device.

By adopting the technical scheme, the invention at least has the following effects:

by adopting the SDMA scheduling flow optimizing method provided by the application, the time consumption of memory operation and the time complexity of SDMA scheduling by multiple UEs are reduced, the scheduling capability of an LTE wireless system and the utilization rate of time-frequency domain resources are improved, and the uplink and downlink flow of a cell are greatly improved.

Drawings

Fig. 1 is a flowchart of an SDMA scheduling flow optimization method according to a first embodiment of the present invention;

fig. 2 is a schematic diagram of an active set intersection-free matrix generated in an SDMA scheduling flow optimization method according to a second embodiment of the present invention;

fig. 3 is a schematic diagram of an array generated according to the number of active sets and an auxiliary scheduling UE bidirectional queue hung under an element corresponding to a subscript in the same array in the SDMA scheduling flow optimization method according to the second embodiment of the present invention;

fig. 4 is a schematic diagram of a bidirectional queue of a master UE and a paired slave UE in a SDMA scheduling flow optimization method according to a third embodiment of the present invention;

fig. 5 is a block diagram of an SDMA scheduling flow optimizing apparatus according to a fourth embodiment of the present invention;

fig. 6 is a block diagram of SDMA scheduling flow optimizing apparatuses according to fifth, sixth and seventh embodiments of the present invention;

fig. 7 is a block diagram of an SDMA scheduling flow optimizing apparatus according to an eighth embodiment of the present invention.

Detailed Description

To further explain the technical means and effects of the present invention adopted to achieve the intended purpose, the present invention will be described in detail with reference to the accompanying drawings and preferred embodiments.

The SDMA scheduling flow optimizing method provided by the invention reduces the SDMA processing time consumption, and the SDMA scheduling flow optimizing method and each step thereof are described in detail below.

First embodiment

As shown in fig. 1, the SDMA scheduling flow optimizing method provided in this embodiment includes: step S10: taking a CP set of a cell receiving UE signals as an active set of the UE; step S20: taking a CP set which does not intersect with the active set in a cell as the active set of the UE, wherein the CP set does not intersect with the active set, and the CP set is represented by a bitmap, and each bit represents whether a CP set is activated or not, and the CP set is activated at 0-inactive state or 1-active state; step S30: generating an active set non-intersection matrix of the UE according to the active set non-intersection; step S40: and performing SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active sets, wherein each main dispatching UE can be paired with a plurality of auxiliary dispatching UEs, and the requirement is that the intersection of the active sets does not exist between the main dispatching UE and the auxiliary dispatching UEs and between the auxiliary dispatching UEs.

After the non-intersection matrixes of the active sets are generated, when a certain master UE performs SDMA pairing, the non-intersection matrixes of the active sets of the master UE are inquired, and the auxiliary UE queues of the active sets of the master UE, which are not intersected, are quickly found to perform SDMA pairing, so that a redundant cycle pairing process is omitted.

Wherein, the master UE refers to the UE which has allocated RB resources and has been successfully scheduled before the SDMA process is started. The auxiliary scheduling UE refers to a UE to be scheduled, which does not allocate RB resources, but can also participate in an SDMA process and can be paired with the main scheduling UE. The paired auxiliary dispatching UE refers to the auxiliary dispatching UE which is successfully paired with the main dispatching UE, and the auxiliary dispatching UE to be paired refers to the auxiliary dispatching UE which is not paired with the main dispatching UE. An active set refers to a CP set of UE signals that can be received in a cell, and is generally represented by a bit bitmap, for example, 8 bits are used to represent 8 CP sets, if a UE signal is received by some 3CP sets of the above 8 CP sets of a cell, the active set of the UE can be represented as bit map = bit '00001011, and then the bitmap of a cell set that is not intersected with the active set has bit '00010000,bit '00010100, and the like. And a matrix formed by arranging the non-intersection of the active set and the active set according to a preset rule is a non-intersection matrix of the active set of the UE. The purpose of expressing the CP set which receives a certain UE signal in a cell by adopting an active set is to mark that the same wireless resource data information is sent in different space regions, and the wireless resource data of other UE can be sent on the CP set without intersection with the active set, and the CP set and the active set can send different wireless signals on different CP sets without interference, and the expression of bitmap is adopted to express the active set, so that the ' AND ' or ' operation efficiency on a software program is high.

By adopting the SDMA scheduling flow optimizing method, the uplink and downlink SDMA pairing probability of the super cell in the LTE system is improved, and the time consumption of SDMA processing is greatly reduced.

Second embodiment

On the basis of the first embodiment, step S30: generating an intersection-free matrix of an active set of the major key UE, specifically comprising: taking the active set as the first element of a row in the non-intersection matrix of the active set; taking the activation set intersection-free as the other elements of the row except the first element; and setting elements except the non-intersection of the active set and the active set in the non-intersection matrix of the active set as 0.

As shown in fig. 2, the 3CP set active set non-intersection matrix is a 3CP set active set non-intersection matrix, where the first element (b '001 represents a bitmap with a decimal value of 1, and the like) of each row is the active set of the UE, and the first element and all the following elements are non-intersection on each bit of the bitmap, for example, 1 (b' 001) and 2 (b '010), 4 (b' 100), 6 (b '110) are respectively bitwise and calculated by a program, and the result is 0 (b' 000). The active set can occupy a position with 8 bits of one byte according to the maximum 8 bits (or 16 bits/32 bits/64 bits, specifically, the length is applied according to the number of the CP sets under the cell), that is, each cell configures 8 CP sets at the maximum to generate an active set non-intersection matrix.

Further, before SDMA pairing is performed on the master scheduling UE and the slave scheduling UE, the SDMA flow optimization method of this embodiment further includes: and forming a master UE bidirectional queue by the active set from large to small according to the RB of the master UE. And forming a bidirectional queue of the master UE according to the RB occupied by the master UE participating in the scheduling from large to small, and enabling the first column of the non-intersection matrix of the active set.

And the master UE bidirectional queues are sorted according to the size of RB (Resource Block) of the master UE, the number of wireless resources which can be distributed by one terminal, and the Resource Block. Preferably, the activation set disjoint sets are taken as other elements of the row than the first element; and setting elements except the non-intersection of the active set and the active set in the non-intersection matrix of the active set as 0.

Preferably, before SDMA pairing is performed on the master scheduling UE and the slave scheduling UE, the SDMA scheduling procedure optimization method of this embodiment further includes: generating an array of head nodes of the auxiliary tuning UE based on the number of the active sets, wherein subscripts of the array are numerical values of the active sets without intersection; and forming an auxiliary dispatching UE bidirectional queue by the aid of the non-intersection of the active sets according to the RB of the auxiliary dispatching UE from large to small, and hanging the auxiliary dispatching UE bidirectional queue under the corresponding subscript element in the array.

The auxiliary modulation UE may allocate RB resources with the same size or smaller than the same time-frequency domain position used by the main modulation UE, and the active sets of the auxiliary modulation UE and the main modulation UE do not intersect with each other, for example, the active set of the main modulation UE is b '00000011, occupies 50 RBs, the active set of the auxiliary modulation UE is b'00000100, the number of occupied RBs can only be less than or equal to 50, and is the same as the time-frequency domain position of the RB of the main modulation UE. The aforementioned secondary UE bidirectional queue pairs the primary UE bidirectional queue, and for detailed pairing, refer to the third embodiment. Different master UEs are paired with different auxiliary UEs, and the same auxiliary UE can only participate in one pairing, and after successful pairing with a certain master UE, the same auxiliary UE cannot participate in pairing with other master UEs, as shown in fig. 4.

As shown in fig. 3, the auxiliary modulation UE to be paired is inserted into the head node array with the decimal value of the active set as the subscript according to the active set of the auxiliary modulation UE (the arrays mentioned in the present invention all refer to this array), the subscript of the array is the decimal value of the active set bitmap of the auxiliary modulation UE, for example, the active set b'00000100 (decimal value of 4) of one auxiliary modulation UE, then this auxiliary modulation UE is inserted into the auxiliary modulation UE bidirectional queue with the fourth element as the head node of this array, and is inserted according to the RB size of the auxiliary modulation UE, so that when pairing with the main modulation UE, the active set of the auxiliary modulation UE with a large RB is first taken out.

Therefore, the main dispatching UE bidirectional queue and the auxiliary dispatching UE bidirectional queue are respectively sequenced according to the RB size, and the main dispatching UE with the large RB and the auxiliary dispatching UE with the large RB are taken out firstly when SDMA (space division multiple access) pairing is carried out, so that the pairing probability among the large RBs, the advanced application of nodes and the operation of the bidirectional queues are ensured, the software processing efficiency is improved, and a large amount of circular pairing and memory moving operation are omitted.

It can be seen that, at the beginning of cell establishment, an active set non-intersection matrix is generated, specifically, a CP set in which a cell receives a UE signal is used as an active set of the UE, and is represented by a bitmap, where each bit represents whether a CP set is activated, 0-inactive, 1-active. Then, the main dispatching UEs are sorted according to the RB size, then the auxiliary dispatching UEs with the same active set are inserted into the bidirectional queues under the array elements corresponding to the subscripts, and the auxiliary dispatching UEs are sorted according to the RB size. And finally, performing SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active set. For each master-dispatching UE, pairing can be performed with a plurality of auxiliary-dispatching UEs, and it is ensured that no active set intersection exists between the master-dispatching UE and the auxiliary-dispatching UEs.

Third embodiment

As shown in fig. 4, step S40: based on the activation set non-intersection matrix, performing SDMA pairing on the master UE, specifically comprising: selecting a master UE from a master UE bidirectional queue; selecting an active set of the major dispatching UE from the active set non-intersection matrix, namely an active set of the minor dispatching UE; searching whether the elements of the subscript corresponding to the head node array of the auxiliary dispatching UE exist in an auxiliary dispatching UE bidirectional queue or not according to the decimal value of the active set of the auxiliary dispatching UE; if the auxiliary dispatching UE bidirectional queue exists, taking out the auxiliary dispatching UE and the main dispatching UE from the auxiliary dispatching UE bidirectional queue for SDMA pairing; and if the auxiliary dispatching UE and the main dispatching UE complete SDMA pairing, returning to execute the step of taking out the next main dispatching UE from the bidirectional queue of the main dispatching UE for SDMA pairing.

Preferably, after searching whether there is a secondary scheduling UE bidirectional queue under an element serving as a corresponding subscript in the array according to a value of an intersection-free active set, the SDMA scheduling flow optimization method of this embodiment further includes: and if the bidirectional queue of the auxiliary dispatching UE does not exist, returning to execute to take out the next active set intersection-free set of the main dispatching UE from the active set intersection-free matrix.

The first row in fig. 4 is a bidirectional master UE queue, which is sorted according to the size of RB, and the node of each master UE is also the head node of the bidirectional (longitudinal) auxiliary UE queue, and the active set of the auxiliary UE to be paired has no intersection with the active set of the current master UE in the master UE queue and the active sets of all the paired auxiliary UEs of the current master UE.

As shown in fig. 4, the master UE inserts into the bidirectional queue of the master UE according to the RB size, and when SDMA is performed to pair the slave UE, SDMA is performed to the master UE with the largest RB first, thereby ensuring that the master UE with the large RB and the slave UE with the large RB perform SDMA pairing. By adopting the SDMA optimization method of the embodiment, the primary dispatching UE with a large RB and the secondary dispatching UEs with the same active set but a small RB are not paired first, and the same primary dispatching UE and the multiple UEs without intersection in the active set are supported to perform SDMA pairing, provided that the secondary dispatching UEs to be paired and the primary dispatching UEs and the paired secondary dispatching UEs with the primary dispatching UEs are all active set without intersection.

In the figure, SDMA Layer I is used for performing first pairing on the current master UE, SDMA Layer II is used for performing second pairing on the current master UE, and SDMA Layer III is used for performing third pairing on the current master UE. It should be noted that, in SDMA pairing, it is required to ensure that active set intersections exist between the secondary scheduling UE to be paired and the current primary scheduling UE as well as between the secondary scheduling UEs successfully paired with the current primary scheduling UE.

Through the implementation of the SDMA scheduling flow optimization method in this embodiment, the time complexity of the optimized SDMA pairing software algorithm is only O (n × m), n < = the number of primary scheduling UEs to be scheduled, and m < = the number of active sets without intersection in the active sets (in practice, the number of CP sets is limited, and the value of m is basically equivalent to the number of CP sets, for example, the active sets of 3CP sets do not have an intersection matrix, the maximum number of the active sets without intersection is 3, the larger the number of CP sets is, the more the number of the active sets without intersection is), when the number of the scheduled primary scheduling UEs is < < the number of secondary scheduling UEs to be scheduled, on the premise that the total consumption of the system is not considered, the more the primary scheduling UEs and the secondary scheduling UEs are, the higher the RB utilization rate is, and the more the improvement of cell traffic is significant.

Fourth embodiment

As shown in fig. 5, on the basis of the first embodiment, step S10: before the CP set of the UE signal received by the cell is taken as the active set of the master UE, the SDMA scheduling flow optimizing method of this embodiment further includes: step S50: applying resource nodes to a resource pool in a memory to form an idle node queue according to the number of the CP sets and the number of UE allowed to be accessed by the cell; accordingly, step S40: before SDMA pairing is performed on the master UE, the method further includes: step S700: calling idle nodes in the idle node queue as using nodes; step S701: and storing the scheduling information (including the active set bitmap) of the main dispatching UE and the auxiliary dispatching UE into the using node.

The memory resource application is that at the beginning of building a cell, according to the total number of CP sets configured in the cell and the number of UE allowed to be accessed maximally in the cell, an idle node queue is formed by applying the memory resource in advance, in the scheduling process, before SDMA pairing, idle nodes are taken from the idle node queue as using nodes for main scheduling UE and auxiliary scheduling UE needing resource allocation, and relevant scheduling information of the main scheduling UE and the auxiliary scheduling UE is stored. The SDMA scheduling flow optimization method of the embodiment applies for the resource pool in advance, and saves time consumed by memory application as the resource pool is taken and used at the scheduling stage.

As shown in fig. 5, preferably, step S401: after the scheduling information of the master scheduling UE and the slave scheduling UE is stored in the using node, the SDMA scheduling flow optimization method of this embodiment further includes: step S60: and releasing the resource pool from the using node to the idle node queue under the condition that the master scheduling UE successfully performs SDMA pairing and completes scheduling. After SDMA pairing is successful and scheduling is completed, the main scheduling UE and the auxiliary scheduling UE release the resource pool from the node to the idle queue, and normal use of next scheduling is guaranteed.

Fifth embodiment

As shown in fig. 6, the present embodiment provides an SDMA scheduling flow optimizing apparatus, including: an active set generating module 10, configured to use a CP set in which a cell receives a UE signal as an active set of the UE; an intersection-free generating module 20, configured to use a CP set that is in a cell and is not intersected with an active set as an active set of the UE; a matrix generating module 30, configured to generate an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; and the pairing module 40 is configured to perform SDMA pairing on the dominant modulation UE and the subordinate modulation UE based on the non-intersection matrix of the active set.

Sixth embodiment

As shown in fig. 6 and 7, on the basis of the fifth embodiment, the matrix generating module 30 is specifically configured to: taking the active set as the first element of a row in the non-intersection matrix of the active set; taking the activation set intersection-free as the other elements of the row except the first element; and setting elements except the non-intersection of the active set and the active set in the non-intersection matrix of the active set as 0.

Preferably, the SDMA scheduling flow optimizing apparatus of this embodiment further includes a sorting module 50, which is specifically configured to: and forming a master UE bidirectional queue by the active set from large to small according to the RB of the master UE.

Further, the sorting module 30 is further configured to: generating an array of head nodes of the auxiliary tuning UE based on the number of the active sets, wherein subscripts of the array are numerical values of the active sets without intersection; and forming an auxiliary dispatching UE bidirectional queue by the aid of the non-intersection of the active sets according to the RB of the auxiliary dispatching UE from large to small, and hanging the auxiliary dispatching UE bidirectional queue under the corresponding subscript element in the array.

Seventh embodiment

As shown in fig. 6, on the basis of the sixth embodiment, in the SDMA scheduling flow optimizing apparatus according to the present embodiment, the pairing module 40 is specifically configured to: selecting a master UE from a master UE bidirectional queue; selecting an active set of the major dispatching UE from the active set non-intersection matrix, namely an active set of the minor dispatching UE; searching whether the elements of the subscript corresponding to the head node array of the auxiliary dispatching UE exist in the bidirectional queue of the auxiliary dispatching UE or not according to the decimal value of the active set of the auxiliary dispatching UE; if the auxiliary dispatching UE bidirectional queue exists, taking out the auxiliary dispatching UE and the main dispatching UE from the auxiliary dispatching UE bidirectional queue for SDMA pairing; and if the auxiliary dispatching UE and the main dispatching UE complete SDMA pairing, returning to execute the step of taking out the next main dispatching UE from the bidirectional queue of the main dispatching UE for SDMA pairing.

As shown in fig. 4, for the first master slave UE of the master slave UE queue, its active set is b '1000011, rb =60, assuming a cell of the 7CP set, then the active set of the query 7CP set does not have an intersection matrix (generated like fig. 2), the decimal value of bitmap of the master slave UE is 67, then the set of active sets of secondary slave UEs that do not intersect with the active set of the first master slave UE (b ' 1000011) is { b '0000100, b '0001000, b '0010000, b '0100000, b '0001100, b '0010100, b '0011000, b '0110000, b ' 0010101100, b ' 1100 ', 0100100100100100, b ' 0100101100, b ' 1100, b ' 0110101100, b ' 1100, b ' 01101062, b ' 525262 is { 52zzf } value, then the decimal value is taken as the two secondary UE pairing of the secondary UE's active set (b) as the decimal value of the secondary slave UE's index set is directly viewable from the secondary UE ' 374 and the secondary slave UE is paired with the two secondary UE's active set (c) and the binary index set can be retrieved. The specific operation is that the UE4 is taken out from a bidirectional queue of the auxiliary dispatching UE to be dispatched, the active set of which is b'0000100, and whether an active set intersection exists with the paired auxiliary dispatching UE of the main dispatching UE is judged, if so, the auxiliary dispatching UE cannot be used as the paired auxiliary dispatching UE of the main dispatching UE, and if no other paired auxiliary dispatching UE exists in the graph, the auxiliary dispatching UE4 is inserted into the paired auxiliary dispatching UE queue of the main dispatching UE, so that SDMA pairing of the auxiliary dispatching UE4 and the main dispatching UE is completed. And then taking the decimal value 8 as a subscript of the head node array, directly indexing to an auxiliary dispatching UE queue with an active set of 8 (b' 0001000), checking to obtain that a bidirectional queue under an element of the subscript corresponding to the array is empty, indexing the auxiliary dispatching UE queue to be dispatched by using the decimal value of the active set of the next auxiliary dispatching UE, and repeating the steps until all the rows have no intersection with the active set of the main dispatching UE.

After traversing the non-intersection of the active set for the first master UE of the master UE queue, only one auxiliary UE4 capable of performing SDMA pairing is found out from all the auxiliary UE queues to be scheduled shown in fig. 3, and the RB occupied by the auxiliary UE is reduced to 60 relative to the RB occupied by the master UE.

As shown in fig. 4, SDMA pairing is then started for the second dominant tone UE, the active set of which is b '00000001, RB =20, the active set disjoint matrix corresponding to the 7CP is queried, the decimal value of bitmap of the dominant tone UE is 1, then the active set of the secondary tone UE that is disjoint from the active set of the dominant tone UE may be any combination of bits 1 to 7 except bit0, expressed as {2,4,8,16,32,64,6,10, … }, and then the active set disjoint from bitmap as b '0000 is sequentially used as the subscript of the secondary tone UE head node array, and directly indexed to the secondary tone UE3 (b '0000010, RB = 8), UE5 (b '0000100, RB = 15), UE6 (b '1000000, RB = 50), where RB of UE6 should finally be 20, because it needs to be small relative to the active set RB, and when the active set inserted into the current dominant tone UE5 is inserted into the active set, it is determined whether there is a bidirectional paired active set that the active set can be inserted into the active set, and the active set can be paired UE 001, if there is not inserted into the active set, and the paired UE can be paired with the active set paired UE3, and the active set can be inserted into the bidirectional paired UE3, if there is a bidirectional paired UE3, the bidirectional paired UE3, and the bidirectional paired UE can be a bidirectional paired UE can be inserted into the bidirectional paired UE3, and the paired UE can be a bidirectional paired UE can be paired UE3, and the active set.

After querying the non-intersection matrix of the active set, the third UE (active set b'1000111, rb = 10) in the master UE queue does not find a pairable secondary UE, so its paired secondary UE queue is empty, which indicates that there is no pairable secondary UE.

After querying the non-intersection matrix of the active sets, the fourth UE (active set b '0001000, RB = 10) of the master UE queue, only one UE1 (active set b'0000001, RB = 40) that can be paired with the current master UE remains, and the RB of the last secondary UE is taken to be small relative to the RB of the master UE, that is, the RB =10 finally scheduled by the secondary UE 1.

So far, all the master UEs in the master UE bidirectional queue have been traversed, and there still remain the to-be-scheduled auxiliary UEs 2 with active sets b'0000001 and rb =24 in the auxiliary UE queue, because there is no master UE that can be paired with the master UE, the UEs 2 are not scheduled finally, and can only participate in the next scheduling process.

As shown in fig. 4, SDMA pairing is performed in turn on the master UE in the master UE queue, and after SDMA Layer I pairing is completed, SDMA Layer II and SDMA Layer III pairing can also be performed, so that it is ensured that the master UE and the paired slave UEs, and each paired slave UE of the master UE are all an inactive set intersection, so as to ensure that radio signals do not interfere with each other.

By the method, the main and auxiliary scheduling UEs can be paired in SDMA to the maximum extent, the pairing probability is improved, the time consumption of memory operation (moving, assignment and the like) is reduced, the time complexity in software processing is reduced, and the scheduling capability and the resource utilization rate of the LTE wireless system are greatly improved.

Eighth embodiment

As shown in fig. 7, on the basis of the fifth embodiment, the SDMA scheduling flow optimizing apparatus of the present embodiment further includes a node management module 60, configured to: applying resource nodes to a resource pool in a memory to form an idle node queue according to the number of the CP sets and the number of UE allowed to be accessed by the cell; the retrieving module 70 is further configured to: calling idle nodes in the idle node queue as using nodes; and storing the scheduling information of the main scheduling UE and the auxiliary scheduling UE into the use node.

Preferably, the SDMA scheduling procedure optimizing apparatus of this embodiment further includes a node management module 60, configured to: and releasing the used node to the resource pool under the condition that the master scheduling UE completes SDMA pairing and scheduling.

Ninth embodiment

In addition, the invention also provides a cell which comprises the SDMA scheduling flow optimizing device.

While the invention has been described in connection with specific embodiments thereof, it is to be understood that it is intended by the appended drawings and description that the invention may be embodied in other specific forms without departing from the spirit or scope of the invention.

Claims

1. An SDMA scheduling flow optimization method is characterized by comprising the following steps:

taking a CP set of a cell receiving UE signals as an active set of the UE;

taking a CP set in the cell which is not intersected with the active set as the active set of the UE;

generating an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; wherein elements in the activation set non-intersection matrix except the activation set and the activation set non-intersection are 0;

and performing SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active set, wherein the auxiliary dispatching UE queue of the non-intersection of the active set of the main dispatching UE is found by inquiring the non-intersection matrix of the active set.

2. The SDMA scheduling flow optimization method of claim 1, wherein the generating an disjoint matrix of the active sets of the UEs comprises:

taking the active set as the first element of a row in the active set non-intersection matrix;

and taking the activation set intersection-free as other elements of the row except the first element.

3. The SDMA scheduling flow optimization method of claim 2, wherein before SDMA pairing is performed on the master UE and the slave UE, the method further comprises:

and forming a master UE bidirectional queue by the active set from large to small according to the RB of the master UE.

4. The SDMA scheduling flow optimization method of claim 3, wherein before SDMA pairing is performed on the master UE and the slave UE, the method further comprises:

generating an array of head nodes of the auxiliary tuning UE based on the number of the active sets, wherein subscripts of the array are numerical values of no intersection of the active sets;

and forming an auxiliary dispatching UE bidirectional queue by the aid of the non-intersection of the active sets according to the RB of the auxiliary dispatching UE from large to small, and hanging the auxiliary dispatching UE bidirectional queue under the element corresponding to the subscript in the array.

5. The SDMA scheduling flow optimization method of claim 4, wherein the SDMA pairing is performed for a master UE and a slave UE based on the active set disjoint matrix, and specifically comprises:

selecting the master UE from the master UE bidirectional queue;

taking out the active set intersection-free set of the calling UE from the active set intersection-free matrix;

searching whether the auxiliary dispatching UE bidirectional queue exists under the element corresponding to the subscript in the array according to the numerical value of the non-intersection of the active set;

if the auxiliary dispatching UE bidirectional queue exists, taking out the auxiliary dispatching UE and the main dispatching UE from the auxiliary dispatching UE bidirectional queue for SDMA pairing;

and if the auxiliary dispatching UE and the main dispatching UE complete SDMA pairing, returning to execute the step of taking out the next main dispatching UE from the bidirectional queue of the main dispatching UE for SDMA pairing.

6. The SDMA dispatch flow optimization method of claim 5, wherein after finding whether the secondary UE bidirectional queue exists under the element in the array corresponding to the subscript according to the value of the null intersection of the active sets, the method further comprises:

and if the auxiliary dispatching UE bidirectional queue does not exist, returning to execute to take out the next active set intersection-free set of the main dispatching UE from the active set intersection-free matrix.

7. The SDMA scheduling flow optimization method of claim 1, wherein before the CP set of the UE signals received by the cell is used as the active set of the UE, the method further comprises:

applying for resource nodes from a resource pool in a memory to form an idle node queue according to the number of the CP sets and the number of the UE allowed to be accessed by the cell;

correspondingly, performing SDMA pairing on the UE specifically includes:

calling an idle node in the idle node queue as a using node;

and storing the scheduling information of the main scheduling UE and the auxiliary scheduling UE into the using node.

8. The SDMA scheduling flow optimization method of claim 7, wherein after the storing the scheduling information of the master scheduling UE and the slave scheduling UE in the user node, the method further comprises:

and releasing the resource pool from the using node to the idle node queue under the condition that the main scheduling UE and the auxiliary scheduling UE finish SDMA pairing and scheduling.

9. An SDMA scheduling flow optimization apparatus, comprising:

an active set generating module, configured to use a CP set in which a cell receives a UE signal as an active set of the UE;

an intersection-free generating module, configured to use a CP set in the cell that is not intersected with the active set as an active set intersection-free set of the UE;

a matrix generating module, configured to generate an intersection-free matrix of the active set of the UE according to the intersection-free matrix of the active set and the active set; wherein elements in the activation set non-intersection matrix except the activation set and the activation set non-intersection are 0;

and the pairing module is used for carrying out SDMA pairing on the main dispatching UE and the auxiliary dispatching UE based on the non-intersection matrix of the active set, wherein the auxiliary dispatching UE queue without intersection of the active set of the main dispatching UE is found by inquiring the non-intersection matrix of the active set.

10. The SDMA scheduling flow optimization device of claim 9, wherein the matrix generation module is specifically configured to:

11. The SDMA scheduling flow optimization apparatus of claim 10, wherein the matrix generation module further comprises an autonomous UE bidirectional queue formation module configured to:

12. The SDMA scheduling flow optimization apparatus of claim 11, wherein the matrix generation module further comprises a secondary scheduling UE bidirectional queue formation module configured to:

13. The SDMA scheduling flow optimization device of claim 12, wherein the pairing module is specifically configured to:

selecting the master UE from the master UE bidirectional queue;

based on the value of the active set intersection-free set of the calling UE taken from the active set intersection-free matrix;

14. The apparatus of claim 9, further comprising a node pre-application module configured to:

accordingly, the pairing module is further configured to:

calling an idle node in the idle node queue as a using node;

and storing the scheduling information of the main dispatching UE and the auxiliary dispatching UE into the using node.

15. The apparatus of claim 14, further comprising a node release module configured to:

and releasing the resource pool from the using node to the idle node queue under the condition that the main dispatching and the auxiliary dispatching UE finish SDMA pairing and dispatching.

16. A cell comprising the SDMA scheduling flow optimizing apparatus as claimed in any one of claims 9 to 15.