A user combination pairing method and device for rate-splitting multiple access

Abstract

The application relates to a user combination pairing method and device for rate splitting multiple access, which sequentially determines the preference order of each pairable service user to all the carriers of a base station, obtains a plurality of user sets, obtains the optimal user set of each carrier of the base station according to a resource utilization optimization method, and finally performs user data transmission according to the optimal user set of each carrier of the base station, so that the paired users avoid high similarity of channel conditions, ensure the stability of downlink transmission, and can adapt to the diversity of channel conditions among users, flexibly cope with similar or significantly different environments, and ensure basic communication requirements.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a user combination pairing method and device for rate-splitting multiple access. BACKGROUND

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

[0003] Rate-Splitting Multiple Access architecture can realize smooth transition between Space-division Multiple Access (SDMA) architecture and Non-Orthogonal Multiple Access (NOMA) architecture by flexibly adjusting the transmission power and corresponding transmission rate of the public information stream, thereby exhibiting higher performance in transmission rate.

[0004] However, in the Rate-Splitting Multiple Access architecture, user pairing is a key step, which involves how to match users with subcarriers to optimize system communication performance. Reasonable and accurate user pairing scheme can avoid high similarity of channel conditions, thereby ensuring stable downlink transmission. The existing Rate-Splitting Multiple Access architecture is difficult to effectively realize user pairing, thereby difficult to optimize the communication performance of the system. SUMMARY

[0005] The technical problem to be solved by the present application is how to accurately realize user pairing in the Rate-Splitting Multiple Access architecture. In order to overcome the defects of the above prior art, the present application 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 user combination pairing method for rate-splitting multiple access provided by the present application comprises the following steps:

[0007] S1: determining a preference order of each pairable service user of the base station for all carriers of the base station by calculating channel state estimation values of each service user of the base station for each carrier of the base station;

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

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

[0010] S4: performing user data transmission according to the optimized user set of each carrier of the base station in a rate-splitting multiple access architecture in which the base station is located.

[0011] The user combination pairing method for rate-splitting multiple access disclosed in the present application sequentially determines a preference order of each pairable service user of the base station for all carriers of the base station, obtains a plurality of user sets, obtains an optimized user set of each carrier of the base station according to a resource utilization optimization method, and finally performs user data transmission according to the optimized user set of each carrier of the base station, thereby avoiding high similarity in channel conditions of paired users, ensuring stable downlink transmission, and being able to adapt to the diversity of channel conditions among users, whether in similar or significantly different environments, and being able to flexibly respond to ensure basic communication needs. In addition, the method fully considers the game optimization of resource utilization and user accommodation in the same carrier, and can exhibit 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 being able to obtain only part of the channel state information, the method can still maintain a low performance loss, showing its high robustness.

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

[0013] S11: dividing the bandwidth of the base station into a plurality of carriers, calculating channel state estimation values of each service user of the base station for each carrier of the base station, and regarding a service user who does not meet a downlink successive interference cancellation condition as a forbidden pairing user to obtain a forbidden pairing set;

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

[0015] S13: sorting current channel state estimation values of each service user in each initial user set for all carriers of the base station to obtain a preference order of each pairable service user of the base station for all carriers of the base station.

[0016] The scheme determines the forbidden pairing users and the pairable users according to whether the downlink serial interference cancellation condition is met, obtains the forbidden pairing user set, and generates the preference order of the service users for all the carriers of the base station after random pairing, thereby determining the preference order of each pairable service user for all the carriers of the base station, and providing guarantee for later pairing.

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

[0018] S21: taking the first pairable service user as the current pairable service user, and determining the carrier currently most preferred by the service user according to the preference order of the current pairable service user for all the carriers of the base station;

[0019] S22: determining whether the carrier currently most preferred by the service user reaches the user upper limit and is the forbidden pairing carrier, if yes, adding the service user to the candidate user set of the carrier currently most preferred by the service user, and then performing the next step; if no, adding the service user to the user set matched with the carrier currently most preferred by the service user, and then performing the next step;

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

[0021] S24: obtaining the rejected user of the carrier currently most preferred by the service user according to the comparison between the user set of the carrier currently most preferred by the service user and the new user set matched with the carrier, and adding the rejected user to the pairing set;

[0022] S25: determining whether all the pairable service users are currently traversed, if yes, performing the next step; if no, taking the next pairable service user as the current pairable service user, determining the carrier currently most preferred by the service user according to the preference order of the current pairable service user for all the carriers of the base station, and returning to perform the step S22;

[0023] S26: determining whether the pairing set is empty, if yes, taking the new user set matched with the carrier of each carrier of the base station as the user set of the carrier, and obtaining the set family of multiple user sets according to the new user set; if no, returning to perform the step S21;

[0024] The scheme fully considers the game optimization of resource utilization and user same-band accommodation, allocates users according to the accommodation of the bands, and can exhibit good performance in the situation of insufficient or excessive network load, and has excellent adaptability to load fluctuation in the downlink.

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

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

[0027] S32: sequentially transforming the user set of each pairable band by the current rotation transformation to obtain the rotation transformation result of the user set of each pairable band;

[0028] S33: judging whether the rotation transformation result of the user set of each pairable band is a prohibited pairing set, if yes, taking the next rotation transformation of the rotation transformation sequence as the current rotation transformation, and executing the step S32 again; if no, executing the next step;

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

[0030] S35: judging whether the rotation transformation sequence is traversed, if yes, ending the process, if no, taking the next rotation transformation of the rotation transformation sequence as the current rotation transformation, and executing the step S32 again;

[0031] The scheme obtains the optimized user set of each band of the base station by rotating the user set multiple times, obtaining the resource utilization cost of the user set of each pairable band and the rotation transformation result of the set by a resource utilization cost calculation formula respectively, and then optimizing the resource utilization.

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

[0033]

[0034] wherein,

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

[0036] represents the index K r,ia user set of the mth carrier;

[0037] a representative set a rotation transformation result of the representative set to a representative set

[0038] S represents the number of the rotation transformation sequence, which is set in advance.

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

[0040]

[0041] wherein,

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

[0043] ρ1 represents a coefficient of the spatial domain consumption cost;

[0044] ρ2 represents a coefficient of the power domain consumption cost;

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

[0046] hkm represents the channel state estimation value of the kth user to the mth carrier;

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

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

[0049] α(θ k ) represents a line-of-sight component;

[0050] z k,m satisfies a complex Gaussian distribution;

[0051] K represents a user set;

[0052] The scheme can obtain the resource utilization cost of the user set of each pairable carrier and the rotation transformation result of the set, and ensure resource utilization optimization.

[0053] Another technical solution of the present application 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 application, comprising:

[0054] The initialization module determines the preference order of each pairable service user to all the carriers of the base station by calculating the channel state estimation value of each service user of the base station to each carrier of the base station.

[0055] The initial allocation module obtains the user set of each carrier of the base station by performing the game of the preference order of each pairable service user to all the carriers of the base station and the accommodated users of each carrier of the base station, and obtains a plurality of user sets in this way.

[0056] The allocation module performs a plurality of rotation transformations on the plurality of user sets, and obtains the optimal user set of each carrier of the base station according to a resource utilization optimization method.

[0057] The execution module performs user data transmission according to the optimal user set of each carrier of the base station in the rate split multiple access architecture in which the base station is located.

[0058] The initialization module, the initial allocation module, the allocation module and the execution module are electrically connected.

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

[0060] The user combination pairing device for rate split multiple access provided by the application can sequentially determine the preference order of each pairable service user to all the carriers of the base station, obtain a plurality of user sets, obtain the optimal user set of each carrier of the base station according to a resource utilization optimization method, and finally perform user data transmission according to the optimal user set of each carrier of the base station, so that the paired users can avoid high similarity in channel conditions, ensure the stability of downlink transmission, and adapt to the diversity of channel conditions between users, whether the environment is similar or significantly different, and can be flexibly coped with to ensure basic communication needs.

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

[0062] The calculation unit divides the bandwidth of the base station into a plurality of carriers, calculates the channel state estimation value of each service user of the base station to each carrier of the base station, and regards the service user who does not meet the downlink serial interference cancellation condition as a forbidden pairing user to obtain a forbidden pairing set.

[0063] The initial unit randomly allocates the pairable service users to each carrier so that each carrier has a matched user set, and further obtains the initial user set of each carrier.

[0064] a sorting unit, which sorts the current channel state estimation values of each service user in each initial user set except the forbidden pairing set for all the carrier bands of the base station, and obtains the preference order of each pairable service user for all the carrier bands of the base station;

[0065] wherein,

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

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

[0068] Figure 2 a flow chart corresponding to step S1 disclosed in Embodiment One of the present application;

[0069] Figure 3 a flow chart corresponding to step S2 disclosed in Embodiment One of the present application;

[0070] Figure 4 a flow chart corresponding to step S3 disclosed in Embodiment One of the present application;

[0071] Figure 5 a comparison result chart of Embodiment One of the present application;

[0072] Figure 6 a structural schematic diagram of a user combination pairing device for rate-splitting multiple access disclosed in Embodiment Two of the present application;

[0073] Figure 7 a structural schematic diagram of an initialization module disclosed in Embodiment Two of the present application. DETAILED DESCRIPTION

[0074] First of all, those skilled in the art should understand that these embodiments 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 adjust them as needed in order to adapt to specific application occasions.

[0075] In the description of the embodiments of the present application, unless otherwise explicitly specified and limited, the terms "electrical connection", "electrical connection relationship" should be understood in a broad sense, i.e. to mean a connection mode with electrical relationship, for example, the electrical connection can be realized by a wire, or the electrical connection can be realized by a wireless signal channel (channel), or a combination of both. In addition, the "electrical connection" and "electrical connection relationship" can be established on the basis of mechanical connection (such as the wire arranged in the connection key); it can be directly connected, or indirectly connected through an intermediate medium. For those skilled in the art, the specific meaning of the above terms in the embodiments of the present application can be understood according to the specific circumstances.

[0076] The present application will be further described in detail below by adopting two embodiments, combined with the drawings and specific embodiments.

[0077] Embodiment one:

[0078] Referring to Figures 1-5 The present embodiment discloses a user combination pairing method for rate-splitting multiple access, and a flow chart of the method is as shown in Figure 1 The method comprises the following steps:

[0079] S1: The preference order of each pairable service user to all the carriers of the base station is determined by calculating the channel state estimation value of each service user of the base station to each carrier of the base station.

[0080] Referring to Figure 2 In the present embodiment, step S1 comprises the following steps:

[0081] S11: The bandwidth of the base station is divided into multiple carriers, the channel state estimation value of each service user of the base station to each carrier of the base station is calculated, and the service user who does not meet the downlink serial interference cancellation condition is taken as a forbidden pairing user to obtain a forbidden pairing set.

[0082] The so-called user who does not meet the downlink serial interference cancellation condition refers to the user whose average value of the channel state estimation value to all the carriers of the base station is greater than a set threshold. The user who meets the downlink serial interference cancellation condition is a pairable user.

[0083] S12: The pairable service users are randomly assigned to each carrier so that each carrier has a matched user set, and then the initial user set of each carrier is obtained.

[0084] S13: The current channel state estimation value of each service user in each initial user set to all the carriers of the base station is sorted to obtain the preference order of each pairable service user to all the carriers of the base station.

[0085] The specific sorting is as follows: when the estimation value of user k to sub-carrier i is better than that to carrier j, user k selects carrier i.

[0086] S2: obtaining the user set of each carrier of the base station by performing the game between the preference order of each pairable service user to all carriers of the base station and the user accommodated in each carrier of the base station, and obtaining the multiple user sets according to the user sets.

[0087] Referring to Figure 3 As shown in the embodiment, the step S2 comprises the following steps:

[0088] S21: taking the first pairable service user as the current pairable service user, and determining the carrier currently most preferred by the service user according to the preference order of the current pairable service user to all carriers of the base station.

[0089] S22: judging whether the carrier currently most preferred by the service user reaches the user upper limit and the carrier is the forbidden pairing carrier, if yes, listing the service user as the candidate user of the carrier currently most preferred by the service user, and then performing the next step; if no, integrating the service user into the user set matched by the carrier currently most preferred by the service user, and then performing the next step.

[0090] S23: comparing the resource utilization of the user set currently matched by the carrier currently most preferred by the service user and the candidate user set of the carrier currently most preferred by the service user, and taking the set with the minimum resource utilization as the new user set matched by the carrier currently most preferred by the service user.

[0091] S24: obtaining the rejected user of the carrier currently most preferred by the service user according to the comparison of the user set of the carrier currently most preferred by the service user and the new user set matched by the carrier, and listing the rejected user into the pairing set.

[0092] S25: judging whether all pairable service users are currently traversed, if yes, performing the next step; if no, taking the next pairable service user as the current pairable service user, and determining the carrier currently most preferred by the service user according to the preference order of the current pairable service user to all carriers of the base station, and then performing the step S22.

[0093] S26: judging whether the pairing set is empty, if yes, taking the new user set matched by the carrier of the base station as the user set of the carrier, and obtaining the set family of the multiple user sets according to the user sets; if no, performing the step S21.

[0094] S3: performing multiple rotation transformations on the multiple user sets, and obtaining the optimal user set of each carrier of the base station according to the resource utilization optimization method.

[0095] Referring to Figure 4 As shown in the embodiment, the step S3 comprises the following steps:

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

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

[0098]

[0099] wherein,

[0100] ξ s represents the s-th rotation transformation of the rotation transformation sequence;

[0101] represents the user set with index K r,i in the set family obtained in step S26;

[0102] represents the rotation transformation result of the set , which is the transformation of the set to the set

[0103] S represents the number of the rotation transformation sequence, which is set in advance.

[0104] S32: transform the user set of each pairable carrier in turn by the current rotation transformation to obtain the rotation transformation result of the user set of each pairable carrier.

[0105] S33: determine whether the rotation transformation result of the user set of each pairable carrier is a forbidden pairing set, if yes, 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.

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

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

[0108]

[0109] wherein,

[0110] represents the resource utilization cost of the k-th user in the user set of the m-th carrier;

[0111] represents the coefficient of the spatial domain consumption cost;

[0112] P2 represents the coefficient of power domain consumption cost;

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

[0114] hkm represents the channel state estimation value of the kth user to the mth carrier;

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

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

[0117] α(θ k ) represents the line-of-sight component;

[0118] z k,m satisfies the complex Gaussian distribution;

[0119] K represents the user set.

[0120] S35: Determine whether to traverse the rotation transformation sequence. If yes, the process ends. If no, the next rotation transformation of the rotation transformation sequence is taken as the current rotation transformation, and the step S32 is executed again.

[0121] S4: In the rate-splitting multiple access architecture in which the base station is located, user data transmission is performed according to the optimized user set of each carrier of the base station.

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

[0123] (1) Select two users as the set of the base station to send data, denoted as user 1 and user 2.

[0124] (2) Combine the common information and encode the common information and the private information to obtain the encoded information S.

[0125] (3) The encoded information S is processed through a linear precoder to obtain the transmitted data stream W, W=S T *P. The precoder P is a matrix that contains the precoding vectors {P1, P2, P3} for each information part. The precoding process is usually designed to optimize signal transmission, reduce interference between users, and improve the power efficiency of the signal.

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

[0127]

[0128] where p is the power of the information sent by the base station, so the SINR value of the private stream of user k is:

[0129]

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

[0131]

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

[0133]

[0134] The following provides simulation results to evaluate the user combination pairing method for rate-splitting multiple access (abbreviated as RSMA in the figure) proposed in the embodiment with a specific example. For simulation parameters and deployment, the specific example adopts a single cell, sets the number of terminals to 20, and sets the maximum transmission power of the base station to 33dBm. For further evaluation of the performance of the algorithm, the specific example simulates a comparison with the MIMO-NOMA scheme, and the comparison results are as shown in Figure 5 .

[0135] Number of terminals 20 Maximum transmission power of base station 33 dBm Noise variance -140 dBm / Hz Number of user sets shared 3 ​ 0.24 p2 0.5 Bandwidth 2 MHz Number of carriers 12 Number of transmission antennas 64

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

[0137] Embodiment Two:

[0138] Referring to Figure 6 and Figure 7 , the embodiment further provides a user combination pairing device for rate-splitting multiple access, referring to Figure 6 , 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 with the initialization module, the allocation module is electrically connected with the initial allocation module, and the execution module is electrically connected with the allocation module.

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

[0140] Referring to Figure 7 In the embodiment, the initialization module includes a calculation unit, an initial unit and an ordering unit, wherein the initial unit is electrically connected with the calculation unit, and the ordering unit is electrically connected with the initial unit. The calculation unit is configured to divide the bandwidth of the base station into a plurality of carriers, calculate the channel state estimation value of each service user of the base station to each carrier of the base station, and regard the service user who does not meet the downlink successive interference cancellation condition as a forbidden pairing user to obtain a forbidden pairing set; the initial unit is configured to randomly allocate the pairable service users to each carrier so that each carrier has a matched user set, thereby obtaining the initial user set of each carrier; and the ordering unit is configured to sort the current channel state estimation value of each service user in each initial user set except the forbidden pairing set to all the carriers of the base station, and obtain the preference order of each pairable service user to all the carriers of the base station.

[0141] The user combination pairing device for rate split multiple access disclosed in the embodiment can sequentially determine the preference order of each pairable service user to all the carriers of the base station, obtain a plurality of user sets, obtain the optimized user set of each carrier of the base station according to a resource utilization optimization method, and finally perform user data transmission according to the optimized user set of each carrier of the base station, thereby avoiding the high similarity of the channel conditions of the paired users, ensuring the stability of the downlink transmission, and adapting to the diversity of the channel conditions among users, whether the environment is similar or significantly different, and flexibly coping with it to ensure the basic communication demand.

[0142] In the description of the embodiments of the present application, it should be noted that the terms indicating the direction or position relationship in the description of the present application are based on the direction or position relationship shown in the drawings, which is only for the convenience of description, and does not indicate or imply that the device or member must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present application.

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

[0144] The above description is merely specific embodiments of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A user combination pairing method for rate-split multiple access, characterized in that, Includes the following steps: S1: Determine the preference ranking of each pairable serving user for all carriers of this base station by calculating the channel state estimate of each serving user for each carrier of this base station. S2: By performing a game between the preference ranking of each pairable service user for all carriers of this base station and the user capacity of each carrier of this base station, the user set of each carrier of this base station is obtained, and multiple user sets are obtained accordingly. S3: Gradually perform user swaps between the two user sets until all possible user pairings are traversed. The user swap operation between the two user sets is defined as a rotation transformation. Subsequently, based on the resource utilization optimization method, determine the optimal user set of the base station on each carrier. S4: In the rate split multiple access architecture where this base station is located, user data is transmitted according to the optimal user set for each carrier of this base station.

2. The user combination pairing method for rate-oriented split multiple access according to claim 1, characterized in that, Step S1 includes the following steps: S11: Divide the bandwidth of the base station into multiple carriers, calculate the channel state estimate of each serving user of this base station for each carrier of this base station, and take the serving users that do not meet the downlink serial interference cancellation conditions as prohibited pairing users to obtain the prohibited pairing set. S12: Randomly assign the matchable service users to each carrier so that each carrier has a matching user set, thereby obtaining the initial user set for each carrier. S13: Sort the current channel state estimates of each serving user in each initial user set for all carriers of this base station to obtain the preference sort of each pairable serving user for all carriers of this base station.

3. The user combination pairing method for rate-oriented split multiple access according to claim 2, characterized in that, Step S2 includes the following steps: S21: Take the first pairable service user as the current pairable service user, and determine the service user's most preferred carrier based on the preference ranking of all carriers of this base station for the current pairable service user; S22: Determine whether the service user's current preferred carrier has reached the user limit and the preferred carrier is a prohibited pairing carrier. If yes, add the service user to the candidate users of the current preferred carrier and then proceed to the next step; if no, add the service user to the user set matched by the current preferred carrier and then proceed to the next step. S23: Compare the resource utilization of the current set of users currently matched by the carrier most preferred by the service user with the current set of candidate users by the carrier most preferred by the service user, and take the set with the minimum resource utilization as the new set of users matched by the carrier most preferred by the service user. S24: Based on the comparison between the current most preferred carrier user set of the service user and the newly matched user set, obtain the current most preferred carrier rejection user of the service user, and add this rejection user to the pairing set; S25: Determine whether all the available service users have been traversed. If yes, proceed to the next step. If no, take the next available service user as the current available service user, and determine the service user's most preferred carrier based on the preference ranking of all carriers of this base station. Then, return to step S22. S26: Determine whether the set to be paired is empty. If so, take the newly matched user set of each carrier of this base station as the user set of that carrier, and obtain a family of multiple user sets accordingly. If not, return to step S21.

4. The user combination pairing method for rate-oriented split multiple access according to claim 3, characterized in that, Step S3 includes the following steps: S31: Define multiple rotation transformations from the set family obtained in step S26 to the set family obtained in step S2 to obtain a rotation transformation sequence, and take the first rotation transformation of the rotation transformation sequence as the current rotation transformation; S32: The user sets of each pairable carrier are transformed sequentially through the current rotation transformation to obtain the rotation transformation results of the user sets of each pairable carrier; S33: Determine whether the rotation transformation result of a certain set of users with matching carriers is a prohibited pairing set. If yes, take the next rotation transformation of the rotation transformation sequence as the current rotation transformation and execute step S32 in reverse order. If no, proceed to the next step. S34: Obtain the user set of each pairable carrier and the resource utilization cost of the rotation transformation result of this set by the resource utilization cost calculation formula, and take the set with the smaller resource utilization cost as the optimal user set of this carrier. S35: Determine whether the rotation transformation sequence has been traversed. If yes, the process ends. If no, the next rotation transformation of the rotation transformation sequence is taken as the current rotation transformation, and step S32 is executed in reverse order.

5. The user combination pairing method for rate-oriented split 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 This represents the s-th rotation transformation in the rotation transformation sequence; K r ={K r,1 ,K r,2 ,K r,3 ,…,K r,S Let} represent the r-th user set, which has S users in total; K r,s Describe the user set K r The s-th user in the list; The index K represents the family obtained in step S26. r,s The user set; Representative set The result of the rotation transformation is to transform the set Transform into a set 6. The user combination pairing method for rate-oriented split multiple access according to claim 5, characterized in that, The formula for calculating resource utilization costs is as follows: In the formula, This represents the resource utilization cost of the k-th user in the user set of the m-th carrier. ρ1 represents the coefficient of spatial domain consumption cost; ρ2 represents the coefficient of power domain consumption cost; U m / {k} represents the set of users in the m-th carrier after removing the k-th user; This represents the channel state estimate of the k-th user for the m-th carrier. PL() represents large-scale fading; d k This represents the distance between the k-th user and the base station; α(θ k () represents the line-of-sight component; z k,m It satisfies a complex Gaussian distribution; K represents the user set; σ 2 The noise power on each sub-carrier.

7. A user pairing device for rate-split multiple access, characterized in that, The user pairing method based on any one of claims 1-6 for rate-oriented split multiple access includes: The initialization module calculates the channel state estimates of each serving user of the base station for each carrier of the base station to determine the preference ranking of each pairable serving user for all carriers of the base station. The initial allocation module obtains the user set for each carrier of the base station by performing a game between the preference ranking of each pairable service user for all carriers of the base station and the user capacity of each carrier of the base station, thereby obtaining multiple user sets. The allocation module progressively swaps users between two user sets until all possible user pairings are traversed. The user swapping operation between two user sets is defined as a rotation transformation. Subsequently, based on the resource utilization optimization method, the optimal user set of the base station on each carrier is determined. The execution module performs user data transmission based on the optimal user set for each carrier of this base station in the rate split multiple access architecture where this 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 pairing apparatus for rate-split multiple access according to claim 7, characterized in that, The initialization module includes: The calculation unit divides the bandwidth of the base station into multiple carriers, calculates the channel state estimate of each serving user of the base station for each carrier of the base station, and identifies serving users that do not meet the downlink serial interference cancellation conditions as prohibited pairing users to obtain a prohibited pairing set. The initial unit randomly assigns the matchable service users to each carrier so that each carrier has a matching user set, thereby obtaining the initial user set for each carrier. The sorting unit sorts the current channel state estimates of each serving user in each initial user set other than the prohibited pairing set for this base station, and obtains the preference sort of each pairable serving user for all carriers of this 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