User combination pairing method and device for rate splitting multiple access

Abstract

The invention relates to a rate splitting multiple access-oriented user combination pairing method and device, and the method comprises the steps: obtaining a plurality of user sets through sequentially determining the preference sorting of each paired service user for all carrier bands of a base station, obtaining the optimal user set of each carrier band of the base station according to a resource utilization optimization method, and obtaining the optimal user set of each carrier band of the base station according to the optimal user set. And finally, user data transmission is performed according to the optimal user set of each carrier band of the base station, so that paired users are prevented from having relatively high similarity in channel conditions to ensure the stability of downlink transmission, and the method can adapt to the diversity of the channel conditions among the users, can flexibly deal with similar or obviously different environments, and can improve the user experience. And basic communication requirements are ensured.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a method and device for user combination pairing for rate split multiple access. Background Art

[0002] The Rate-Splitting Multiple Access (RSMA) architecture is particularly suitable for multi-user or multi-antenna systems. It works as follows: at the transmitting end, first, the transmitting end splits the user's demand signal into two parts: a public signal and a private signal; then, the public signal of all users is encoded into a unified public information stream, and each user's private signal is independently encoded into a private information stream; finally, the public information stream is superimposed on the private information stream and sent, thereby achieving efficient signal transmission. At the receiving end, the receiving end first decodes the public information stream and applies interference cancellation (SIC) technology to remove the interference caused by the public signal. After that, the receiving end decodes each user's private information stream.

[0003] The rate-splitting multiple access architecture can achieve a smooth transition between the space-division multiple access (SDMA) architecture and the non-orthogonal multiple access (NOMA) architecture by flexibly adjusting the transmission power and corresponding transmission rate of the public information flow, thereby demonstrating higher performance in transmission rate.

[0004] However, in the rate split multiple access architecture, user pairing is a key step, which involves how to match users with subcarriers to optimize system communication performance. A reasonable and accurate user pairing scheme can avoid high similarity in channel conditions, thereby ensuring the stability of downlink transmission. The rate split multiple access architecture in the prior art is difficult to effectively implement user pairing, making it difficult to optimize the communication performance of the system. Summary of the invention

[0005] The technical problem to be solved by the present invention is how to accurately realize user pairing in a rate splitting multiple access architecture. In order to overcome the defects of the above-mentioned prior art, the present invention provides a user combination pairing method and device for rate splitting multiple access, including a user combination pairing method for rate splitting multiple access and a user combination pairing device for rate splitting multiple access.

[0006] The present invention provides a user combination pairing method for rate splitting multiple access, comprising the following steps:

[0007] S1: Determine the preference ranking of each pairable service user for all the carriers of this base station by calculating the channel state estimation value of each service user of the base station for each carrier of this base station;

[0008] S2: obtaining a user set for each carrier of the base station by performing a game between the preference ranking of each pairable service user on all carriers of the base station and the accommodated users of each carrier of the base station, thereby obtaining multiple user sets;

[0009] S3: performing multiple rotation transformations on the plurality of user sets, and obtaining an optimized user set for each carrier of the base station according to a resource utilization optimization method;

[0010] S4: Transmit user data according to the optimized user set of each carrier of this base station in the rate split multiple access architecture where this base station is located.

[0011] The user combination pairing method for rate split multiple access disclosed in the present invention determines the preference ranking of each pairable service user for all carriers of the base station in turn, obtains multiple user sets, obtains the optimized user set for each carrier of this base station according to the resource utilization optimization method, and finally transmits user data according to the optimized user set for each carrier of the base station, thereby enabling paired users to avoid high similarity in channel conditions to ensure the stability of downlink transmission, and can adapt to the diversity of channel conditions between users, whether it is a similar or significantly different environment, and can respond flexibly to ensure basic communication needs. In addition, this method fully considers the game optimization of resource utilization and user same carrier accommodation, and can show good performance in situations where the network load is insufficient or excessive, and has excellent adaptability to load fluctuations in the downlink. Even under the challenge of only being able to obtain partial channel state information, this method can still maintain a low performance loss, showing its high robustness.

[0012] In a possible implementation, step S1 includes the following steps:

[0013] S11: dividing the bandwidth of the base station into multiple carriers, calculating the channel state estimation value of each service user of the base station for each carrier of the base station, and taking the service users that do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set;

[0014] S12: randomly assigning pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining an initial user set for each carrier;

[0015] S13: sorting the current channel state estimation values ​​of all carriers of the base station by each service user in each initial user set, and obtaining the preference sorting of all carriers of the base station by each pairable service user;

[0016] This solution determines the prohibited pairing users and the pairing users in advance based on whether the downlink serial interference elimination conditions are met, obtains the prohibited pairing user set, and after random pairing, generates the service user's preference ranking for all carriers of this base station, and then can determine the preference ranking of each pairable service user for all carriers of this base station, providing guarantee for subsequent pairing.

[0017] In a possible implementation manner, step S2 includes the following steps:

[0018] S21: taking the first service user that can be paired as the current service user that can be paired, and determining the carrier that the service user currently prefers most according to the preference ranking of all carriers of this base station by the current service user that can be paired;

[0019] S22: determining whether the service user's currently most preferred carrier has reached the user upper limit and the carrier is the prohibited pairing carrier; if so, listing the service user as a candidate user of the currently most preferred carrier, and then executing the next step; if not, merging the service user into a user set matched with the currently most preferred carrier, and then executing the next step;

[0020] S23: comparing resource utilization of a user set currently matched by the carrier currently most preferred by the service user with a current candidate user set of the carrier currently most preferred by the service user, and taking the set with the smallest resource utilization as a new user set matched by the carrier currently most preferred by the service user;

[0021] S24: obtaining the carrier rejection user currently most preferred by the service user according to the comparison between the carrier user set currently most preferred by the service user and the newly matched user set, and adding the rejection user to the to-be-matched set;

[0022] S25: Determine whether all the pairable service users are currently traversed. If yes, execute the next step; if no, take the next pairable service user as the current pairable service user, and determine the most preferred carrier of the service user according to the preference ranking of the current pairable service user for all carriers of this base station, and return to execute step S22;

[0023] S26: Determine whether the to-be-matched set is empty. If so, take the newly matched user set of each carrier of the base station as the user set of the carrier, thereby obtaining a cluster of multiple user sets; if not, return to execute step S21;

[0024] This solution fully considers the game optimization between resource utilization and user bandwidth capacity, and allocates users according to the bandwidth capacity. It can demonstrate good performance in situations where the network is underloaded or overloaded, and has excellent adaptability to load fluctuations in the downlink.

[0025] In a possible implementation manner, step S3 includes the following steps:

[0026] S31: defining a plurality of rotation transformations from the set obtained in step S26 to the set obtained in step S2 to obtain a rotation transformation sequence, and taking the first rotation transformation in the rotation transformation sequence as the current rotation transformation;

[0027] S32: transforming the user sets of each pairable carrier in sequence through the current rotation transformation to obtain rotation transformation results of the user sets of each pairable carrier;

[0028] S33: Determine whether the rotation transformation result of a user set of each pairable carrier is a prohibited pairing set. If so, take the next rotation transformation of the rotation transformation sequence as the current rotation transformation and return to execute step S32; if not, execute the next step;

[0029] S34: obtaining the user set of each pairable carrier and the resource utilization cost of the rotation transformation result of the set respectively through the resource utilization cost calculation formula, and taking the set with the smaller resource utilization cost as the optimized user set of the carrier;

[0030] S35: Determine whether to traverse the rotation transformation sequence. If yes, the process ends. If no, take the next rotation transformation in the rotation transformation sequence as the current rotation transformation and return to execute step S32.

[0031] This solution performs multiple rotation transformations on the user set, and obtains the user set of each pairable carrier and the resource utilization cost of the set rotation transformation result through the resource utilization cost calculation formula, and then obtains the optimized user set for each carrier of the base station by optimizing resource utilization.

[0032] In a possible implementation, the mathematical form of the rotation transformation sequence is expressed as follows:

[0033]

[0034] in,

[0035] ξ s represents the sth rotation transformation of the rotation transformation sequence;

[0036] The index in the cluster obtained in step S26 is K r,iA collection of users;

[0037] Representative Set The rotation transformation result is to transform the set Transform to a set

[0038] S represents the number of the rotation transformation sequences, which is preset.

[0039] In a possible implementation manner, the resource utilization cost calculation formula is:

[0040]

[0041] In the formula,

[0042] represents the resource utilization cost of the kth user in the user set of the mth carrier;

[0043] ρ 1 The coefficient representing the consumption cost of the spatial domain;

[0044] ρ 2 A coefficient representing the cost of power domain consumption;

[0045] U m / {k} represents the set of users of the mth carrier after removing the kth user;

[0046] represents the channel state estimation value of the k-th user for the m-th carrier;

[0047] PL() represents large-scale fading;

[0048] d k represents the distance between the kth user and the base station;

[0049] α(θ k ) represents the sight distance component;

[0050] z k,m Satisfies complex Gaussian distribution;

[0051] K represents the user set;

[0052] This solution can obtain the user set of each pairable carrier and the resource utilization cost of the rotation transformation result of this set, ensuring optimal resource utilization.

[0053] Another technical solution of the present invention is to provide a user combination pairing device for rate splitting multiple access, based on the user combination pairing method for rate splitting multiple access described in the present invention, including:

[0054] An initialization module, which determines the preference ranking of each pairable service user for all the carriers of the base station by calculating the channel state estimation value of each service user of the base station for each carrier of the base station;

[0055] The initial allocation module obtains a user set of each carrier of the base station by performing a game between the preference ranking of each pairable service user on all carriers of the base station and the accommodated users of each carrier of the base station, thereby obtaining multiple user sets;

[0056] An allocation module, performing multiple rotation transformations on the plurality of user sets, and obtaining an optimized user set for each carrier of the base station according to a resource utilization optimization method;

[0057] An execution module, performing user data transmission according to an optimized user set of each carrier of the base station in a rate split multiple access architecture where the base station is located;

[0058] in,

[0059] The initial allocation module is electrically connected to the initialization module, the allocation module is electrically connected to the initial allocation module, and the execution module is electrically connected to the allocation module.

[0060] The user combination pairing device for rate splitting multiple access provided by the present invention can sequentially determine the preference ranking of each pairable service user for all carriers of the base station, obtain multiple user sets, obtain the optimized user set for each carrier of this base station according to the resource utilization optimization method, and finally transmit user data according to the optimized user set for each carrier of the base station, thereby enabling paired users to avoid high similarity in channel conditions to ensure stable downlink transmission, and can adapt to the diversity of channel conditions between users, whether it is a similar environment or an environment with significant differences, and can flexibly respond to ensure basic communication needs.

[0061] In a possible implementation, the initialization module includes:

[0062] a calculation unit, which divides the bandwidth of the base station into a plurality of carrier bands, calculates a channel state estimation value of each service user of the base station for each carrier band of the base station, and takes service users that do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set;

[0063] An initialization unit randomly assigns pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining an initial user set for each carrier;

[0064] A sorting unit is configured to sort the current channel state estimation values ​​of all carriers of the base station by each service user in each initial user set except the prohibited pairing set, so as to obtain the preference sorting of each pairable service user for all carriers of the base station;

[0065] in,

[0066] The initial unit is electrically connected to the calculation unit, and the sorting unit is electrically connected to the initial unit. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] Figure 1 This is a flow chart of the user combination pairing method for rate split multiple access disclosed in Embodiment 1 of the present application;

[0068] Figure 2 This is a flowchart corresponding to step S1 disclosed in Embodiment 1 of the present application;

[0069] Figure 3 This is a flowchart corresponding to step S2 disclosed in Embodiment 1 of the present application;

[0070] Figure 4 This is a flowchart corresponding to step S3 disclosed in Embodiment 1 of the present application;

[0071] Figure 5 This is a comparison result diagram of Example 1 of the present application;

[0072] Figure 6 This is a schematic diagram of the structure of a user combination pairing device for rate splitting multiple access disclosed in Example 2 of the present application;

[0073] Figure 7 This is a schematic diagram of the initialization module structure disclosed in Example 2 of the present application. DETAILED DESCRIPTION

[0074] First, those skilled in the art should understand that these implementations are only used to explain the technical principles of the embodiments of the present application, and are not intended to limit the protection scope of the embodiments of the present application. Those skilled in the art can make adjustments to them as needed to adapt to specific application scenarios.

[0075] In the description of the embodiments of the present application, it should be noted that, unless otherwise clearly specified and limited, the terms "electrical connection" and "electrical connection relationship" should be understood in a broad sense, that is, referring to a connection method with an electrical relationship, for example, it can be a circuit connection through a wire, or it can be an electrical connection through a radio signal channel (channel), or a combination of the two. In addition, "electrical connection" and "electrical connection relationship" can be based on mechanical connection (such as a wire set in a connection key); it can be a direct connection or an indirect connection through an intermediate medium. For ordinary technicians in this field, the specific meanings of the above terms in the embodiments of the present application can be understood according to specific circumstances.

[0076] Two embodiments will be used below, and the present application will be further described in detail in conjunction with the accompanying drawings and specific embodiments.

[0077] Embodiment 1:

[0078] See also Figure 1 to Figure 5 As shown, the embodiment of the present application discloses a user combination pairing method for rate split multiple access, and the flowchart of the method is as follows Figure 1 As shown, the following steps are included:

[0079] S1: Determine the preference ranking of each pairable service user for all the carriers of the base station by calculating the channel state estimation value of each service user of the base station for each carrier of the base station.

[0080] See also Figure 2 As shown, in this embodiment, step S1 includes the following steps:

[0081] S11: Divide the bandwidth of the base station into multiple carriers, calculate the channel state estimation value of each service user of the base station for each carrier of the base station, and set the service users that do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set.

[0082] The so-called failure to meet the downlink serial interference elimination condition means that the average of the channel state estimation values ​​of all carriers of the service user for this base station is greater than the set threshold. Users that meet the downlink serial interference elimination condition are pairable users.

[0083] S12: Randomly assign the pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining an initial user set of each carrier.

[0084] S13: sorting the current channel state estimation values ​​of all carriers of the base station by each service user in each initial user set, and obtaining the preference sorting of all carriers of the base station by each pairable service user.

[0085] The specific ranking is: when the estimated value of user k for sub-carrier i is better than that of carrier j, user k selects carrier i.

[0086] S2: The user set of each carrier of this base station is obtained by performing a game between the preference ranking of each pairable service user on all carriers of this base station and the accommodated users of each carrier of this base station, thereby obtaining multiple user sets.

[0087] See also Figure 3 As shown, in this embodiment, step S2 includes the following steps:

[0088] S21: taking the first service user that can be paired as the current service user that can be paired, and determining the carrier that the service user currently prefers most according to the preference ranking of all carriers of this base station by the current service user that can be paired.

[0089] S22: Determine whether the service user's current most preferred carrier has reached the user upper limit and the carrier is a prohibited pairing carrier. If so, list the service user as a candidate user of the current most preferred carrier, and then execute the next step; if not, incorporate the service user into the user set that matches the current most preferred carrier, and then execute the next step.

[0090] S23: Compare the resource utilization of the user set currently matching the carrier currently most preferred by the service user with the current candidate user set for the carrier currently most preferred by the service user, and use the set with the minimum resource utilization as the new user set matching the carrier currently most preferred by the service user.

[0091] S24: Obtain the carrier rejection user that the service user currently prefers the most based on the comparison between the carrier user set that the service user currently prefers and the newly matched user set, and add the rejection user to the set to be paired.

[0092] S25: Determine whether all pairable service users are currently traversed. If so, execute the next step; if not, take the next pairable service user as the current pairable service user, and determine the service user's most preferred carrier according to the preference ranking of the current pairable service user for all carriers of this base station, and return to execute step S22.

[0093] S26: Determine whether the to-be-matched set is empty. If so, take the newly matched user set of each carrier of this base station as the user set of the carrier, thereby obtaining a cluster of multiple user sets; if not, return to execute step S21.

[0094] S3: Perform multiple rotation transformations on the multiple user sets, and obtain the optimized user set for each carrier of the base station according to the resource utilization optimization method.

[0095] See also Figure 4 As shown, in this embodiment, step S3 includes the following steps:

[0096] S31: define multiple rotation transformations from the set obtained in step S26 to the set obtained in step S2 to obtain a rotation transformation sequence, and use the first rotation transformation in the rotation transformation sequence as the current rotation transformation.

[0097] In this embodiment, the mathematical form of the rotation transformation sequence is expressed as follows:

[0098]

[0099] in,

[0100] ξ s Represents the sth rotation transformation in the rotation transformation sequence;

[0101] The index in the cluster obtained in step S26 is K r,i A collection of users;

[0102] Representative Set The rotation transformation result is to transform the set Transform to a set

[0103] S represents the number of rotation transformation sequences, which is preset.

[0104] S32: Transform the user sets of each pairable carrier in sequence through the current rotation transformation to obtain the rotation transformation results of the user sets of each pairable carrier.

[0105] S33: Determine whether the rotation transformation result of a user set of pairable carriers is a prohibited pairing set. If so, take the next rotation transformation in the rotation transformation sequence as the current rotation transformation and return to step S32; if not, execute the next step.

[0106] S34: Obtain the user set of each pairable carrier and the resource utilization cost of the rotation transformation result of this set respectively through the resource utilization cost calculation formula, and take the set with the smaller resource utilization cost as the optimized user set of this carrier.

[0107] In this embodiment, the resource utilization cost calculation formula is:

[0108]

[0109] In the formula,

[0110] represents the resource utilization cost of the kth user in the user set of the mth carrier;

[0111] ρ 1 The coefficient representing the consumption cost of the spatial domain;

[0112] ρ 2 A coefficient representing the cost of power domain consumption;

[0113] U m / {k} represents the set of users of the mth carrier after removing the kth user;

[0114] represents the channel state estimation value of the k-th user for the m-th carrier;

[0115] PL() represents large-scale fading;

[0116] d k represents the distance between the kth user and the base station;

[0117] α(θ k ) represents the sight distance component;

[0118] z k,m Satisfies complex Gaussian distribution;

[0119] K represents the set of users.

[0120] S35: Determine whether to traverse the rotation transformation sequence. If so, the process ends. If not, take the next rotation transformation in the rotation transformation sequence as the current rotation transformation and return to execute step S32.

[0121] S4: Transmit user data according to the optimized user set of each carrier of this base station in the rate split multiple access architecture where this base station is located.

[0122] For the sending end, the main steps are as follows:

[0123] (1) Two users are selected as the set to which the base station sends data, denoted as user 1 and user 2.

[0124] (2) Combining public information The public information and private information are encoded to obtain the encoded information S.

[0125] (3) The encoded information S is passed through the linear precoder to obtain the transmitted data stream W, W = S T *P. The precoder P is a matrix containing the precoding vector {P 1 ,P 2 ,P 3}. The precoding process is generally intended to optimize the transmission of the signal, reduce interference between users, and improve the power efficiency of the signal.

[0126] Decoding is performed at the receiving end, and the decoding order for user k is public information-private information. At this time, the SINR value of the public information stream (assuming that the noise is Gaussian white noise and the variance is 1) is:

[0127]

[0128] Where p is the power of the base station to send information, so the SINR value of k's private flow is:

[0129]

[0130] At this time, calculate the data rate R of user k k,tot :

[0131]

[0132] So for user K, the total data rate of the information sent by the base station is:

[0133]

[0134] The following provides simulation results using a specific example to evaluate the user combination pairing method for rate split multiple access (RSMA in the figure). For simulation parameters and deployment, this specific example uses a single cell, sets the number of terminals to 20, and the maximum transmission power of the base station to 33dBm. For detailed parameters, see the table below. In order to further evaluate the performance of the algorithm, this specific example is simulated and compared with the MIMO-NOMA solution. The comparison results are shown in the following table. Figure 5 shown.

[0135] Number of terminals 20 Maximum transmit power of the base station 33dBm Noise variance -140dBm / Hz User collection sharing number 3 <![CDATA[ρ 1 ]]> 0.24 <![CDATA[ρ 2 ]]> 0.5 bandwidth 2MHz Number of tapes 12 Number of transmission antennas 64

[0136] Through comparison with this specific example, the overall utility function of the method of this embodiment is greater than that of the MIMO-NOMA technology.

[0137] Embodiment 2:

[0138] See also Figure 6 and Figure 7 As shown, this embodiment further provides a user combination pairing device for rate splitting multiple access, see Figure 6 As shown, the device includes an initialization module, an initial allocation module, an allocation module and an execution module, wherein the initial allocation module is electrically connected to the initialization module, the allocation module is electrically connected to the initial allocation module, and the execution module is electrically connected to the allocation module.

[0139] In the device, an initialization module is configured to determine the preference ranking of each pairable service user for all carriers of this base station by calculating the channel state estimation value of each service user of the base station for each carrier of this base station; an initial allocation module is configured to obtain the user set of each carrier of this base station by conducting a game between the preference ranking of each pairable service user for all carriers of this base station and the accommodated users of each carrier of this base station, thereby obtaining multiple user sets; an allocation module is configured to perform multiple rotation transformations on the multiple user sets, and obtain the optimized user set of each carrier of this base station according to a resource utilization optimization method; an execution module is configured to transmit user data according to the optimized user set of each carrier of this base station in the rate split multiple access architecture where this base station is located.

[0140] See also Figure 7 As shown, in this embodiment, the initialization module includes a calculation unit, an initialization unit and a sorting unit, wherein the initialization unit is electrically connected to the calculation unit, and the sorting unit is electrically connected to the initialization unit. The calculation unit is configured to divide the bandwidth of the base station into multiple carriers, calculate the channel state estimation value of each service user of the base station for each carrier of the base station, and use the service users who do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set; the initialization unit is configured to randomly assign the pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining the initial user set of each carrier; the sorting unit is configured to sort the current channel state estimation value of each service user in each initial user set except the prohibited pairing set for all carriers of the base station, and obtain the preference sorting of each pairable service user for all carriers of the base station.

[0141] The user combination pairing device for rate splitting multiple access disclosed in this embodiment, by setting an initialization module, an initial allocation module, an allocation module and an execution module, can sequentially determine the preference ranking of each pairable service user for all carriers of the base station, obtain multiple user sets, obtain the optimized user set for each carrier of this base station according to the resource utilization optimization method, and finally transmit user data according to the optimized user set for each carrier of the base station, so as to avoid high similarity of channel conditions for paired users to ensure stable downlink transmission, and can adapt to the diversity of channel conditions between users, whether it is similar or significantly different environments, and can respond flexibly to ensure basic communication needs.

[0142] In the description of the embodiments of the present application, it should be noted that in the description of the present application, terms such as "inside" and "outside" indicating directions or positional relationships are based on the directions or positional relationships shown in the drawings. This is only for the convenience of description, and does not indicate or imply that the device or component must have a specific orientation, be constructed and operated in a specific orientation. Therefore, it cannot be understood as a limitation on the present application.

[0143] In the description of the present application, the description with reference to the terms "one embodiment", "some embodiments", "in the present embodiment", "specific example", or "some examples" etc. means that the specific features, mechanisms, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, mechanisms, materials or characteristics described may be combined in a suitable manner in any one or more embodiments or examples. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0144] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A user combination pairing method for rate splitting multiple access, characterized in that: The steps include: S1: Determine the preference ranking of each pairable service user for all the carriers of this base station by calculating the channel state estimation value of each service user of the base station for each carrier of this base station; S2: obtaining a user set for each carrier of the base station by performing a game between the preference ranking of each pairable service user on all carriers of the base station and the accommodated users of each carrier of the base station, thereby obtaining multiple user sets; S3: performing multiple rotation transformations on the plurality of user sets, and obtaining an optimized user set for each carrier of the base station according to a resource utilization optimization method; S4: Transmit user data according to the optimized user set of each carrier of this base station in the rate split multiple access architecture where this base station is located.

2. The user combination pairing method for rate splitting multiple access according to claim 1, characterized in that: The step S1 comprises the following steps: S11: dividing the bandwidth of the base station into multiple carriers, calculating the channel state estimation value of each service user of the base station for each carrier of the base station, and taking the service users that do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set; S12: randomly assigning pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining an initial user set for each carrier; S13: sorting the current channel state estimation values ​​of all carriers of the base station by each service user in each initial user set, and obtaining the preference sorting of all carriers of the base station by each pairable service user.

3. The user combination pairing method for rate splitting multiple access according to claim 2, characterized in that: The step S2 comprises the following steps: S21: taking the first service user that can be paired as the current service user that can be paired, and determining the carrier that the service user currently prefers most according to the preference ranking of all carriers of this base station by the current service user that can be paired; S22: determining whether the service user's currently most preferred carrier has reached the user upper limit and the carrier is the prohibited pairing carrier; if so, listing the service user as a candidate user of the currently most preferred carrier, and then executing the next step; if not, merging the service user into a user set matched with the currently most preferred carrier, and then executing the next step; S23: comparing resource utilization of a user set currently matched by the carrier currently most preferred by the service user with a current candidate user set of the carrier currently most preferred by the service user, and taking the set with the smallest resource utilization as a new user set matched by the carrier currently most preferred by the service user; S24: obtaining the carrier rejection user currently most preferred by the service user according to the comparison between the carrier user set currently most preferred by the service user and the newly matched user set, and adding the rejection user to the to-be-matched set; S25: Determine whether all the pairable service users are currently traversed. If yes, execute the next step; if no, take the next pairable service user as the current pairable service user, and determine the most preferred carrier of the service user according to the preference ranking of the current pairable service user for all carriers of this base station, and return to execute step S22; S26: Determine whether the to-be-matched set is empty. If so, take the newly matched user set of each carrier of this base station as the user set of the carrier, thereby obtaining a cluster of multiple user sets; if not, return to execute step S21.

4. The user combination pairing method for rate splitting multiple access according to claim 3, characterized in that: The step S3 comprises the following steps: S31: defining a plurality of rotation transformations from the set obtained in step S26 to the set obtained in step S2 to obtain a rotation transformation sequence, and taking the first rotation transformation in the rotation transformation sequence as the current rotation transformation; S32: transforming the user sets of each pairable carrier in sequence through the current rotation transformation to obtain rotation transformation results of the user sets of each pairable carrier; S33: Determine whether the rotation transformation result of a user set of each pairable carrier is a prohibited pairing set. If so, take the next rotation transformation of the rotation transformation sequence as the current rotation transformation and return to execute step S32; if not, execute the next step; S34: obtaining the user set of each pairable carrier and the resource utilization cost of the rotation transformation result of the set respectively through the resource utilization cost calculation formula, and taking the set with the smaller resource utilization cost as the optimized user set of the carrier; S35: Determine whether to traverse the rotation transformation sequence. If so, the process ends. If not, take the next rotation transformation in the rotation transformation sequence as the current rotation transformation and return to execute step S32.

5. The user combination pairing method for rate splitting multiple access according to claim 4, characterized in that: The mathematical form of the rotation transformation sequence is as follows: 1≤s<S, in, ξ s represents the sth rotation transformation of the rotation transformation sequence; The index in the cluster obtained in step S26 is K r,i A collection of users; Representative Set The rotation transformation result is to transform the set Transform to a set S represents the number of the rotation transformation sequences, which is preset.

6. The user combination pairing method for rate splitting multiple access according to claim 5, characterized in that: The resource utilization cost calculation formula is: In the formula, represents the resource utilization cost of the kth user in the user set of the mth carrier; ρ1 represents the coefficient of the spatial domain consumption cost; ρ2 represents the coefficient of power domain consumption cost; U m / {k} represents the set of users of the mth carrier after removing the kth user; represents the channel state estimation value of the k-th user for the m-th carrier; PL() represents large-scale fading; d k represents the distance between the kth user and the base station; α(θ k ) represents the sight distance component; z k,m Satisfies complex Gaussian distribution; K represents the set of users.

7. A user combination pairing device for rate splitting multiple access, characterized in that: The user combination pairing method for rate splitting multiple access according to any one of claims 1 to 6 comprises: An initialization module is configured to determine a preference ranking of each pairable service user for all carriers of the base station by calculating a channel state estimation value of each service user of the base station for each carrier of the base station; The initial allocation module obtains a user set of each carrier of the base station by performing a game between the preference ranking of each pairable service user on all carriers of the base station and the accommodated users of each carrier of the base station, thereby obtaining multiple user sets; An allocation module, performing multiple rotation transformations on the plurality of user sets, and obtaining an optimized user set for each carrier of the base station according to a resource utilization optimization method; An execution module, performing user data transmission according to an optimized user set of each carrier of the base station in a rate split multiple access architecture where the base station is located; in, The initial allocation module is electrically connected to the initialization module, the allocation module is electrically connected to the initial allocation module, and the execution module is electrically connected to the allocation module.

8. The user combination pairing device for rate splitting multiple access according to claim 7, characterized in that: The initialization module includes: a calculation unit, which divides the bandwidth of the base station into a plurality of carrier bands, calculates a channel state estimation value of each service user of the base station for each carrier band of the base station, and takes service users that do not meet the downlink serial interference elimination condition as prohibited pairing users to obtain a prohibited pairing set; An initialization unit randomly assigns pairable service users to each carrier so that each carrier has a matching user set, thereby obtaining an initial user set for each carrier; A sorting unit is configured to sort the current channel state estimation values ​​of all carriers of the base station by each service user in each initial user set except the prohibited pairing set, so as to obtain the preference sorting of each pairable service user for all carriers of the base station; in, The initial unit is electrically connected to the calculation unit, and the sorting unit is electrically connected to the initial unit.

Images