CN114124254A - Method and system for selecting NOMA downlink user with maximized total rate - Google Patents

Method and system for selecting NOMA downlink user with maximized total rate Download PDF

Info

Publication number
CN114124254A
CN114124254A CN202111406920.XA CN202111406920A CN114124254A CN 114124254 A CN114124254 A CN 114124254A CN 202111406920 A CN202111406920 A CN 202111406920A CN 114124254 A CN114124254 A CN 114124254A
Authority
CN
China
Prior art keywords
subset
user
total
users
noma
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111406920.XA
Other languages
Chinese (zh)
Other versions
CN114124254B (en
Inventor
张足生
邹金妤
周坤晓
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dongguan University of Technology
Original Assignee
Dongguan University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Dongguan University of Technology filed Critical Dongguan University of Technology
Priority to CN202111406920.XA priority Critical patent/CN114124254B/en
Publication of CN114124254A publication Critical patent/CN114124254A/en
Application granted granted Critical
Publication of CN114124254B publication Critical patent/CN114124254B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides a method and a system for selecting NOMA downlink users with maximized total rate, wherein the method comprises the following steps: searching a subset S which maximizes rho (S) under the condition that | S | is less than or equal to M +1 in the total set U, wherein | S | is the number of users of the subset S, M is a preset threshold value of the maximum superposable number of users of a single channel, and ρ (S) is a subset S-related relaxation function of an approximate set of downlink users for maximizing the total rate of the NOMA of the single channel; searching the subset S for a subset that satisfies the condition | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, wherein P (F) is the total power requirement of the subset F, P is a preset power budget value, and r (F) is the total rate requirement of the subset F. By using the classic Lagrange relaxation idea, an approximate user set of NOMA downlink which maximizes the total rate is firstly obtained, so that an optimal user set is further obtained, and the optimal user set which maximizes the single channel rate during NOMA downlink can be obtained under the condition that the number of access users is limited and a single channel has power budget limit.

Description

Method and system for selecting NOMA downlink user with maximized total rate
Technical Field
The embodiment of the invention relates to the technical field of wireless communication, in particular to a method and a system for selecting NOMA downlink users with maximized total rate.
Background
NOMA (non-orthogonal multiple access) has been incorporated into the fifth generation mobile communication technology (5G), which is expected to provide very high data rate and low delay, NOMA achieves high frequency spectrum and power efficiency, allows some interference among users in frequency or time domain, and can distinguish signals at a receiving end through different powers, thereby achieving simultaneous co-frequency transmission of multiple signals and greatly increasing the capacity of the NOMA system. The idea of NOMA is: the method includes that SC (superposition coding) is adopted at a transmitting end to superpose signals of a plurality of users on the same time-frequency resource, and SIC (successive interference cancellation) is adopted at a receiving end to reduce interference among the users.
At present, in a downlink of the NOMA system, a base station allocates a transmission power to a user according to different SNR (SIGNAL-to-NOISE RATIO) values and a correlation algorithm, that is, the weaker a channel of the user is, the stronger the transmission power of a downlink SIGNAL provided by the base station is. The receiving end adopts a multi-level layered step-by-step detection mechanism to gradually subtract the MAI (multiple access interference) in the user signal with the maximum power, the SIC receiver firstly operates the received multiple user signals according to the power sequence, carries out data judgment one by one, and judges the MAI which is subtracted by the user signal with the higher power, carries out amplitude recovery, and judges the rest users again, and the operation is circulated until the MAI in all the signals is eliminated.
Because the user is mobile, when the base station side knows the channel condition of each user, the base station must continuously detect the user channel, and further reasonably distributes the transmitting power of the downlink channel according to the channel quality, and the continuous detection, analysis and distribution of transmitting work not only increases the burden of the base station, but also prolongs the system time delay; on the other hand, in the terminal side, the user signal is decoded by correctly evaluating the SNR value of the channel, and since the channel quality between the terminal side and the base station side is also continuously changed, the complexity of the SIC technique performed by the terminal side increases as the number of superimposed users increases.
Disclosure of Invention
The embodiment of the invention provides a method and a system for selecting NOMA downlink users with maximized total rate, which are used for solving the problems of reducing system time delay and reducing system complexity by selecting users on a Gaussian downlink under the joint influence of power budget and access constraint.
In a first aspect, an embodiment of the present invention provides a method for selecting a NOMA downlink user with a maximized total rate, including:
searching a subset S which maximizes rho (S) under the condition that | S | ≦ M +1 in a total set U, wherein the subset S is a downlink user approximate set with maximized single-channel NOMA total rate, | S | is the user number of the subset S, M is a preset threshold of maximum superposable user number of single channel, and rho (S) is a subset S-related relaxation function of the downlink user approximate set subset S for maximizing the single-channel NOMA total rate;
searching the subset S for a subset satisfying the condition | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, wherein the feasible subset F is an optimal set of downlink users whose total rate of a single channel NOMA is maximized, P (F) is a total power requirement of the subset F, P is a preset power budget value, and r (F) is a total rate requirement of the subset F;
and outputting the feasible subset F.
In a second aspect, an embodiment of the present invention further provides a NOMA downlink user selection apparatus with a maximized total rate, including:
a first searching module, configured to search, in a total set U, a subset S that maximizes ρ (S) under a condition of | S | ≦ M +1, where the subset S is a downlink user approximation set that maximizes a total rate of a single channel NOMA, | S | is a number of users of the subset S, M is a preset threshold of a maximum number of superposable users of the single channel, and ρ (S) is a related subset S relaxation function of the downlink user approximation set subset S that maximizes the total rate of the single channel NOMA;
a second searching module, configured to search, in the subset S, a subset that satisfies conditions | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, where the feasible subset F is an optimal set of downlink users whose total rate of a single channel NOMA is maximized, P (F) is a total power requirement of the subset F, P is a preset power budget value, and r (F) is a total rate requirement of the subset F;
and the output module is used for outputting the feasible subset F.
In a third aspect, an embodiment of the present invention further provides a computer device, where the computer device includes:
one or more processors;
a memory for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the NOMA downstream user selection method of maximising total rate as described in the first aspect.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when executed by a processor, the method for NOMA downlink user selection with total rate maximization according to the first aspect is implemented.
Searching a subset S which maximizes rho (S) under the condition that | S | is less than or equal to M +1 in a total set U, wherein the subset S is a downlink user approximate set with maximized NOMA total rate of a single channel, | S | is the user number of the subset S, M is a preset user number threshold value with which the single channel can be superposed at most, and ρ (S) is a subset S related relaxation function of the downlink user approximate set subset S used for maximizing the NOMA total rate of the single channel; searching the subset S for the subset satisfying the condition | F | < M and P (F) ≦ P, such that r (F) is maximized as a feasible subset F, wherein the feasible subset F is the optimal set of downlink users with maximized total rate of the single channel NOMA, P (F) is the total power requirement of the subset F, P is a preset power budget value, and r (F) is the total rate requirement of the subset F. By using the classic Lagrange relaxation idea, an approximate user set of NOMA downlink which maximizes the total rate is firstly obtained, so that an optimal user set is further obtained, and the optimal user set which maximizes the single channel rate during NOMA downlink can be obtained under the condition that the number of access users is limited and a single channel has power budget limit.
Drawings
Fig. 1 is a flowchart of a total rate maximized NOMA downlink user selection method according to an embodiment of the present invention;
fig. 2 is a flowchart of a total rate maximized NOMA downlink user selection method according to an embodiment of the present invention;
fig. 3 is a flowchart of a NOMA downlink signal transmission and reception process applicable to the embodiment of the present invention;
fig. 4 is a schematic structural diagram of a total rate maximized NOMA downlink user selection apparatus according to a second embodiment of the present invention;
fig. 5 is a schematic structural diagram of a computer device according to a fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Example one
Fig. 1 is a flowchart of a total rate maximized NOMA downlink user selection method provided in an embodiment of the present invention, and fig. 2 is a flowchart of a total rate maximized NOMA downlink user selection method applicable in an embodiment of the present invention; the present embodiment may be adapted to solve the problem of user selection on the gaussian downlink under the combined influence of power budget and access constraint to reduce system latency and system complexity, where the method may be performed by a total rate maximized NOMA downlink user selection apparatus, where the total rate maximized NOMA downlink user selection apparatus may be implemented by software and/or hardware, and may be configured in a computer device, and specifically includes the following steps:
step 101, searching a subset S which maximizes ρ (S) under the condition of | S | ≦ M +1 in the total set U, where the subset S is a downlink user approximate set that maximizes the total rate of the single channel NOMA, | S | is the number of users of the subset S, M is a preset threshold for the maximum number of users that can be superimposed on the single channel, and ρ (S) is a subset S-related relaxation function of the downlink user approximate set subset S for maximizing the total rate of the single channel NOMA.
Fig. 3 is a flowchart of a NOMA downlink signal transceiving process applicable to an embodiment of the present invention, as shown in fig. 3, in the NOMA downlink, a transmitter of a base station performs transmission power multiplexing allocation for a plurality of users in a cell. The system allocates the transmission power to the user according to different SNR (SIGNAL-to-NOISE RATIO) values and a correlation algorithm, that is, the weaker the channel of the user is, the stronger the transmission power of the downlink SIGNAL provided by the base station is. Before the first-stage detection, the SIC receiver sorts all user signals transmitted from the transmitter and received by the SIC receiver according to the magnitude of the signal power, and estimates the amplitude of each signal. The system firstly carries out matched filtering and judgment on the user signal with the maximum power, carries out equivalent processing operation with the estimated amplitude ratio, finds the user signal with the maximum power and outputs the rest signals to the next stage, and the SIC receiver continuously carries out the same operation in sequence according to the sequence of the power from large to small, completes the detection of all the user signals and sends all the user signals to the user.
The embodiment of the invention applies the classic Lagrange relaxation idea, and the problem idea of solving the maximum value by the classic Lagrange relaxation idea is as follows: and the objective function of the objective problem is relaxed and converted into an approximate function with a better solution, and a feasible set of the objective function is obtained by solving the approximate set of the approximate function with the better solution, wherein the feasible set of the objective function is included in the approximate set.
The total set U is the set of all candidate users. The invention firstly relaxes the optimal set of the downlink users for solving the maximization of the total NOMA rate of the single channel into the approximate set of the downlink users for solving the maximization of the total NOMA rate of the single channel. The subset S is a downlink user approximate set with the maximum total rate of the NOMA of the single channel selected from the total set U, and the user number of the subset S is used as | S |; ρ (S) is a subset S-dependent relaxation function of the subset S of the approximate set of downlink users used to maximize the total rate of the single channel NOMA, the subset S-dependent relaxation function ρ (S) being an optimized version of the objective function r (S) of the total rate requirement of the subset S.
In a group of gaussian downlinks between users specified by effective noise and rate requirements of the users, in order to control complexity and error propagation of decoding, access limitation needs to be imposed on the number of users superimposed in a single channel, a preset threshold value of the maximum number of users that can be superimposed in the single channel is M, M can be adjusted and changed according to the requirements of the users, and the total number of selected NOMA downlink users with the maximum total rate cannot exceed M.
Under the condition of | S | ≦ M +1, the subset S capable of maximizing the subset S-dependent relaxation function ρ (S) is found to obtain an approximate set of downlink users with maximized total rate of the single channel NOMA.
For example, if the preset threshold M for the number of users that can be superimposed by a single channel is 20 at most, the subset S that maximizes ρ (S) is found under the limiting condition that the number of users in the subset S cannot exceed 21.
It should be noted that, in the above embodiment, the preset threshold M of the maximum number of users that can be superimposed on a single channel is an exemplary illustration of the embodiment of the present invention, and in other embodiments of the present invention, the preset threshold M of the maximum number of users that can be superimposed on a single channel may also reach other values, which is not limited herein.
In some embodiments of the present invention, step 101 is preceded by the steps of:
step 100, judging whether N is less than M +1, wherein N is the number of candidate users of a total set U; if yes, go to step 1001; if not, go to step 101.
And N is the total number of the candidate users of the total set U, if N satisfies N < M +1, the total set U is the NOMA downlink user approximate set with the maximum total speed of a single channel, which indicates that all the candidate users do not exceed the limited threshold value M + 1. If N does not satisfy N < M +1, it means that some users need to be screened from all candidate users as the approximate set subset S, so as to further find the optimal set with the maximum total rate under a certain limit.
For example, the preset threshold M of the number of users that can be superimposed by a single channel at most is 20, and the number N of candidate users in the total set U is 18, where N < M +1 is satisfied, then the total set U may be output as the approximate set subset S, and awaits further operation.
It should be noted that, in the above embodiment, the preset maximum superposable user number threshold M of a single channel and the preset number N of candidate users in the total set U are exemplary illustrations of the embodiment of the present invention, and in other embodiments of the present invention, the preset maximum superposable user number threshold M of a single channel and the preset number N of candidate users in the total set U may also reach other values, which is not limited herein.
Step 1001, subset S equals the total set U, and subset S is output.
And when N < M +1 is met, outputting the total set U as an approximate set subset S to directly obtain the subset S so as to further obtain the optimal set of the downlink users with the single-channel NOMA maximum total rate.
This embodiment is merely exemplary and not limiting.
In some embodiments of the invention, step 101 comprises the steps of:
step 1011, substituting the set S { i } as a subset Z into the following formula, where i is any user in the subset T, and the subset T is a set of users that belong to the total set U and do not belong to the subset S:
Figure BDA0003373106150000081
where ρ (Z) is the subset Z dependent relaxation function, r (Z)＜i) Is the total rate requirement of subset S in subset Z, P is a predetermined power budget value, aiIs the noise value corresponding to the first user i in the subset T, which makes P (Z) ≧ P＜i) Is the total power requirement of subset S in subset Z, Z＜iIs subset S of subset Z.
The subset T is a set of users belonging to the total set U and not to the subset S, and among the subset T are candidate users that have not yet been selected into the approximate set subset S.
Any user i in the subset T and the subset S are combined into a new set, which is called subset Z, and each user in the subset T and the subset S are combined into several subsets Z.
Calculating a relaxation function ρ (Z) of the subset Z corresponding to each user i by the following formula:
Figure BDA0003373106150000082
r(Z＜i) Is the total rate requirement of all users in front of user i in subset Z, i.e. the total rate requirement of subset S, is equal to the sum of the total rate requirements of all users in subset S. P is a preset power budget value, and the sum of the power requirements of all users in the subset Z cannot be larger than P; p (Z)＜i) Is the total power requirement of all users in front of user i in subset Z, i.e. the total power requirement of subset S, is equal to the sum of the total power requirements of all users in subset S, p (Z)＜i) Does not include the power requirement of user i; a isiIs the noise value of the first user in the subset T for which P (Z) ≧ P holds.
The relaxation function ρ (Z) of the above formula has a submodular property, and the set function has a property of monotonically decreasing, with a difference in function increment resulting from adding a single element to the input set decreasing as the number of elements in the input set increases. In the present invention's problem of maximizing the total rate, the relaxation function ρ (Z) shapes the concept of diversity, information and coverage.
Illustratively, there are user 1, user 3, and user 5 in the current subset S, and P (S) < P, when the 4 th user is added, there are user 1, user 3, user 4, and user 5 in the composed subset Z, and P (Z) ≧ P is satisfied for the first time, then aiEqual to the user noise value a corresponding to the user 44. A is to4Substituting the value of (2) and a preset power precalculated value into a formula for calculating rho (Z), and solving the rho (Z) values corresponding to all candidate users in the subset T.
It should be noted that the subset S and the users in the subset T and their noise values and power requirement values in the foregoing embodiments are exemplary illustrations of the embodiments of the present invention, and in other embodiments of the present invention, the users in the subset S and the subset T and their noise values and power requirement values may also reach other values, which is not limited herein.
And 1012, arranging the candidate users in the subset T in a descending order according to the rho (i).
ρ (i) is a relaxation function related to any candidate user i in the subset T, and when the power requirement P (i) of the candidate user i is smaller than a preset power budget value P, ρ (i) ═ r (i); when the power requirement P (i) of the candidate user i is greater than or equal to the preset power requirement P, then
Figure BDA0003373106150000091
Where a isiIs the noise value of the candidate user i. Wherein the power requirement of candidate user i
Figure BDA0003373106150000092
riIs the rate requirement corresponding to the candidate user i.
And according to the relaxation function values rho (i) of all the users in the subset T, the candidate users in the subset T are arranged in descending order from large to small.
This embodiment is merely an example, and the analysis process of any candidate user i on the relaxation function ρ (i) is not limited.
Step 1013, a target user j is found in the subset T, wherein ρ (Z) of the target user j is maximized.
According to the ρ (Z) value calculated in step 1012 for each candidate user in the subset T, when ρ (Z) of one candidate user in the subset T is the maximum, the user is determined as the target user j.
Illustratively, there are user 1, user 3, and user 5 in the current subset S, ρ (Z) values corresponding to user 2, user 4, and user 6 in the subset T are sequentially calculated, and the ρ (Z) value of user 6 is obtained through comparison and is the maximum, and user 6 is taken as target user j.
In this embodiment, the user and the ρ (Z) value obtained by the user are only examples and are not limited.
Step 1014, determining whether ρ (S { j }) is equal to ρ (S), where ρ (S { j }) is a set S { j } related relaxation function; if yes, go to step 1014; if not, go to step 1015.
The set S U { j } is a set formed by combining the subset S and the target user j, whether rho (S U { j }) is equal to rho (S) or not is judged, namely whether the values of relaxation functions of the target user j before and after the target user j joins the subset S are the same or not is judged, if rho (S U { j }) is equal to rho (S), the current subset S is a downlink user approximate set with the maximum total rate of the single channel NOMA, and the step 1014 is directly executed to output the subset S; if ρ (S { U { j }) is not equal to ρ (S), then step 1015 is performed to add the target user j to the subset S as the updated subset S, and returning to step 1012 to find the target user j in the subset T that maximizes ρ (Z).
Exemplarily, there are user 1, user 3, and user 5 in the current subset S, the target user is user 6, and if the relaxation function value ρ (S { j }) of the set S { user 6} is equal to ρ (S), the subset S is directly output; if the relaxation function value ρ (S { users { j }) of the set S } U { users 6} is not equal to ρ (S), the subset S is updated, users 6 are added to the subset S, and the value of the relaxation function of each user in the subset T is solved again.
In this embodiment, the judgment condition is only an example, and is not limited, and the judgment condition may be adjusted according to the actual situation.
And step 1015, outputting the subset S.
And outputting the current subset S as an approximate set of downlink users with the single channel NOMA maximum total rate. The approximation ratio of the optimal set to the subset S of the approximation set obtained by applying the relaxation function rho (Z)
Figure BDA0003373106150000101
Step 1016, add target user j to subset S, and return to performing the search for target user j that maximizes ρ (Z) in subset T.
And adding the target user j into the subset S, and updating the subset S, wherein the updated subset S comprises the target user j.
Returning to step 1013 again, the target user j that maximizes ρ (Z) is found in the subset T, and it is determined whether ρ (S { j }) ═ ρ (S) is satisfied, and it is determined whether the target user j is added to the subset S, so as to form an iteration until ρ (S { j }) } ρ (S) is satisfied.
In some embodiments of the present invention, step 101 further comprises:
step 1017, determining whether | S | ═ M +1 is satisfied; if so, step 1018 is performed.
After adding the target user j, it is determined whether | S | ≦ M +1, that is, it is determined whether the current subset S has reached the critical point of | S ≦ M + 1.
Illustratively, the preset M is 20, the number | S | of the subsets S after the target user j is added reaches 21, and when | S | ═ M +1 is satisfied, that is, a critical point of | S | ≦ M +1 is reached, step 1018 may be executed, and the subsets S are directly output.
In the present embodiment, the values of M and | S | are merely examples and are not limited.
And step 1018, directly outputting the S subset.
If yes, the subset S reaches the critical point of | S | ≦ M +1 at this time, which easily causes high complexity of decoding or information error propagation, so that the current subset S is output as the approximate set of downlink users with maximized total rate of single channel NOMA, and the iteration operations of steps 1013-1016 are no longer performed.
Step 102, searching the subset S for the subset that satisfies the condition | F | < M and P (F) ≦ P, such that r (F) is maximized as a feasible subset F, where feasible subset F is the optimal set of downlink users whose total rate of the single channel NOMA is maximized, P (F) is the total power requirement of subset F, P is a preset power budget value, r (F) is the total rate requirement of subset F, and | F | is the number of users of the feasible subset F.
In step 101, the problem of solving the optimal set that maximizes the total rate is converted into the problem of solving the approximate set of the relaxation function ρ, and the obtained subset S is the approximate set of the downlink users whose total rate of the single channel NOMA is maximized. The subset S is a relatively large user range, and a stricter constraint condition is needed for determining the optimal set of downlink users with the maximum total NOMA rate of a single channel, specifically, F is less than M and P (F) is less than or equal to P, and F is the optimal set of downlink users with the maximum total NOMA rate of a single channel and is called as a feasible subset F; if is the number of users of the feasible subset; p (F) is the total power requirement of subset F; r (F) is the total rate requirement of subset F, which is the sum of the rate requirements of all users in subset F.
Wherein p (F) is obtained by the following formula:
Figure BDA0003373106150000121
m refers to any user in the feasible subset F, amIs the noise value corresponding to user m, r (m) is the speed requirement corresponding to user m, r (F)＞m) Is the total rate requirement for a number of users in the feasible subset ranked after user m.
In some embodiments of the present invention, step 102 comprises:
and step 1021, determining active members and inactive members of the subset S.
The active members are users whose total power requirement of all users in the subset S before the user is less than the preset power budget value P, and the inactive members are users whose total power requirement of all users in the subset S before the user is greater than or equal to the preset power budget value P.
Illustratively, there are user 1, user 2, user 3, user 4, and user 5 in the current subset S. If the total power requirement of all users including user 1, user 2 and user 3 in front of user 4 is less than the preset power budget value P, user 4 can be regarded as an active member; if the total power requirement of all users including user 1, user 2, user 3, and user 4 in front of user 5 is greater than or equal to the preset power budget value P, user 5 may be considered as an inactive member.
It should be noted that, the conditions for determining the active members and the inactive members of the subset S in the foregoing embodiments are exemplary illustrations of embodiments of the present invention, and in other embodiments of the present invention, the conditions for the active members and the inactive members of the subset S may also be other conditions, and the present invention is not limited herein.
In some embodiments of the present invention, step 1021 comprises the steps of:
step 10211, determine if any user k in subset S satisfies p (S)＜k) < P, wherein P (S)＜k) Refers to the total power requirement of all users in front of user k in subset S; if yes, go to step 10212; if not, go to step 10213.
Determining whether each user k in the subset S satisfies p (S)＜k) < P, that is to say the total power requirement P (S) of all users in front of user k in subset S is determined＜k) Whether it is less than a preset power demand value to determine whether user k can still satisfy the constraint p (S) when waiting in the active state＜k) < P, if applicable, an active member; if not, the member is not active. Satisfying p (S) before adding user k＜k-1) < P, increasing user k, just let P (S)＜k) If P is not satisfied, then the user k has the last active member in the subset S.
Step 10212, define user k as an active member.
Step 10213, define user k as an inactive member.
This embodiment is merely exemplary and not limiting.
Step 1022, delete the inactive member and the last active member in the subset S to obtain the feasible subset F.
And deleting the inactive member and the last active member in the subset S to obtain a new subset, namely a feasible subset F, so that the feasible subset F meets the constraint conditions that | F | < M and P (F) ≦ P, and the feasible subset F is the optimal set of downlink users with the maximum total rate of the single-channel NOMA.
Step 1023, find r (b) the largest user n with the largest rate in the total set U*Where b is any user in the total set and r (b) is the rate requirement of user b.
Searching a user b in a total set U comprising all candidate users, and determining the user as a user with the maximum rate requirement when the rate requirement r (b) of the user b is the maximum rate requirement in the total set U, which is called as a user with the maximum rate requirement n*。
Step 1024, judge r (n)*) Whether or not r (n) is satisfied*) R (F), where r (F) is the total rate requirement of the feasible subset F; if yes, go to step 1025.
Maximizing rate user n*Is required r (n)*) Comparing with the rate requirement r (F) of the feasible subset F obtained in step 1023, if r (n)*) R (F), it means that the rate requirement of the user in the total set U is greater than that of the feasible subset F, so that the user n*Is a more preferable single channel NOMA total rate maximization downlink user set solution than feasible subset F, step 1025 is executed to maximize the rate of the user n*Returning as feasible subset F; if r (n)*) R (F) is less than or equal to r, the feasible subset F obtained currently is the optimal set solution of the downlink users which enables the total rate requirement of a single channel to be maximum.
Step 1025, selecting the user n with the maximum rate*Returned as feasible subset F.
User n with the highest rate*Is the optimal set of downlink users with maximized total NOMA rate of single channel, which is more preferable than feasible subset F found in step 1023, therefore, the user n with the maximum rate is selected*Returned as feasible subset F.
And step 103, outputting the feasible subset F.
And outputting the obtained feasible subset F, wherein the user of the feasible subset F can maximize the total rate of the single channel NOMA under the constraint conditions that | F | < M and P (F) < P, can control the decoding complexity, the signaling overhead and the error propagation range, and can enable the single channel to issue information as fast as possible and reduce the signal processing delay.
In the embodiment, searching a subset S which maximizes ρ (S) under the condition of | S | ≦ M +1 in a total set U, where the subset S is a downlink user approximate set that maximizes a total rate of a single channel NOMA, | S | is a user number of the subset S, M is a preset threshold of a maximum superposable user number of the single channel, and ρ (S) is a subset S-related relaxation function of the downlink user approximate set subset S for maximizing the total rate of the single channel NOMA; searching the subset S for the subset satisfying the condition | F | < M and P (F) ≦ P such that r (F) is maximized as feasible subset F, wherein feasible subset F is the optimal set of downlink users with maximized total rate of single channel NOMA, P (F) is the total power requirement of subset F, P is the preset power budget value, and r (F) is the total rate requirement output feasible subset F of subset F. By using the classic Lagrange relaxation idea, an approximate user set of NOMA downlink which maximizes the total rate is firstly obtained, so that an optimal user set is further obtained, and the optimal user set which maximizes the single channel rate during NOMA downlink can be obtained under the condition that the number of access users is limited and a single channel has power budget limit.
It should be noted that, for simplicity of description, the method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the illustrated order of acts, as some steps may occur in other orders or concurrently in accordance with the embodiments of the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.
Example two
Fig. 4 is a block diagram of a structure of a total rate maximized NOMA downlink user selection apparatus according to a second embodiment of the present invention, which may specifically include the following modules:
a first searching module 201, configured to search, in the total set U, a subset S that maximizes ρ (S) under a condition of | S | ≦ M +1, where the subset S is a downlink user approximation set that maximizes a total rate of a single channel NOMA, | S | is a user number of the subset S, M is a preset threshold of a maximum superposable user number of a single channel, and ρ (S) is a related subset S relaxation function of the downlink user approximation set subset S for maximizing the total rate of the single channel NOMA;
a second searching module 202, configured to search, in the subset S, a subset that satisfies conditions | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, where the feasible subset F is an optimal set of downlink users whose total rate of a single channel NOMA is maximized, P (F) is a total power requirement of the subset F, P is a preset power budget value, and r (F) is a total rate requirement of the subset F;
an output module 203, configured to output the feasible subset F.
In some embodiments of the present invention, the NOMA downlink user selection apparatus with maximum total rate further comprises:
the preliminary screening judging module is used for judging whether N < M +1 is met, wherein N is the number of candidate users of the total set U;
a direct output module, configured to output the subset S, where the subset S is equal to the total set U;
a search approximation set execution module for executing the step of searching the subset S in the total set U, which maximizes the parameter ρ (S) under a condition of | S | < M + 1.
In some embodiments of the present invention, the first searching module 201 comprises:
a relaxation function calculation sub-module, configured to substitute a set S { i } as a subset Z into the following formula, where i is any user in the subset T, and the subset T is a set of users that belongs to the total set U and does not belong to the subset S:
Figure BDA0003373106150000161
where ρ (Z) is the subset Z dependent relaxation function, r (Z)＜i) Is the total rate requirement of said subset S in subset Z, P is a predetermined power budget value, aiIs the noise value corresponding to the first user i in the subset T, P (Z) is such that P (Z) is ≧ P＜i) Is the total power requirement of said subset S in the subset Z, Z＜iIs the subset S in subset Z;
a user ordering submodule for sorting the candidate users in the subset T in descending order according to p (i), where p (i) is the user i dependent relaxation function;
a target user finding submodule for finding a target user j in the subset T, wherein the p (Z) of the target user j is maximized;
a relaxation function judgment sub-module, configured to judge whether ρ (S ueq { j }) is equal to ρ (S), where ρ (S ueq { j }) is a set S ueq { j } related relaxation function;
an approximate subset output submodule for outputting the subset S;
and the target user adding submodule is used for adding the target user j into the subset S and returning to the step of searching the target user j which maximizes rho (Z) in the subset T.
In some embodiments of the present invention, the adding the sub-module by the target user further includes:
an approximate set user judgment unit for judging whether | S | ═ M +1 is satisfied;
and the approximate subset output unit is used for directly outputting the S subset.
In some embodiments of the present invention, the second searching module 202 further includes:
a user distinguishing sub-module, configured to determine an active member and an inactive member of the subset S, where the active member is a user that can meet a condition that a total power requirement of all users in the subset S before the user is less than the preset power budget value P, and the inactive member is a user that the total power requirement of all users in the subset S before the user is greater than or equal to the preset power budget value P;
a user updating submodule, configured to delete the inactive member and the last active member in the subset S to obtain the feasible subset F;
a maximum rate user searching submodule for searching r (b) the maximum rate maximum user n in the total set U*Wherein b is any user in the total set, and r (b) is the rate requirement of user b;
a rate requirement comparison submodule for judging r (n)*) Whether or not r (n) is satisfied*) R (F), wherein r (F) is the total rate requirement of the feasible subset F;
an optimal set replacement output submodule for replacing the systemThe user n with the highest rate*Returned as the feasible subset F.
In some embodiments of the present invention, the user distinguishing sub-module includes:
a total power requirement judging unit for judging whether any user k in the subset S satisfies p (S)＜k) < P, wherein P (S)＜k) Refers to the total power requirement of all users in front of user k in the subset S;
an active member determination unit configured to define the user k as the active member;
an inactive member determining unit, configured to define the user k as the inactive member.
The NOMA downlink user selection device with the maximized total rate provided by the embodiment of the invention can execute the NOMA downlink user selection method with the maximized total rate provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method.
EXAMPLE III
Fig. 5 is a schematic structural diagram of a computer device according to a third embodiment of the present invention. FIG. 5 illustrates a block diagram of an exemplary computer device 12 suitable for use in implementing embodiments of the present invention. The computer device 12 shown in FIG. 5 is only an example and should not bring any limitations to the functionality or scope of use of embodiments of the present invention.
As shown in FIG. 5, computer device 12 is in the form of a general purpose computing device. The components of computer device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that couples various system components including the system memory 28 and the processing unit 16.
Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, micro-channel architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Computer device 12 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer device 12 and includes both volatile and nonvolatile media, removable and non-removable media.
The system memory 28 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM)30 and/or cache memory 32. Computer device 12 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 34 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 5, and commonly referred to as a "hard drive"). Although not shown in FIG. 5, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 18 by one or more data media interfaces. Memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
A program/utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 42 generally carry out the functions and/or methodologies of the described embodiments of the invention.
Computer device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), with one or more devices that enable a user to interact with computer device 12, and/or with any devices (e.g., network card, modem, etc.) that enable computer device 12 to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface 22. Also, computer device 12 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via network adapter 20. As shown, network adapter 20 communicates with the other modules of computer device 12 via bus 18. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with computer device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
The processing unit 16 executes programs stored in the system memory 28 to perform various functional applications and data processing, such as implementing the NOMA downstream user selection method for maximizing overall rate provided by embodiments of the present invention.
Example four
A fourth embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the NOMA downlink user selection method with maximized total rate, and can achieve the same technical effect, and is not described herein again to avoid repetition.
A computer readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (9)

1. A NOMA downlink user selection method with maximized total rate is characterized by comprising the following steps:
searching a subset S which maximizes rho (S) under the condition that | S | ≦ M +1 in a total set U, wherein the total set U is a set of all candidate users, the subset S is a downlink user approximate set with maximized total rate of the single channel NOMA, | S | is the number of users of the subset S, M is a preset threshold of maximum superposable number of users of the single channel, and rho (S) is a subset S-related relaxation function of the downlink user approximate set subset S for maximizing the total rate of the single channel NOMA;
searching the subset S for a subset satisfying the condition | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, wherein the feasible subset F is an optimal set of downlink users whose total rate of a single channel NOMA is maximized, P (F) is a total power requirement of the subset F, P is a preset power budget value, and r (F) is a total rate requirement of the subset F;
and outputting the feasible subset F.
2. The method of claim 1, further comprising:
judging whether N < M +1 is met, wherein N is the number of candidate users of the total set U;
if yes, the subset S is equal to the total set U, and the subset S is output;
if not, the step of searching the subset S in the total set U that maximizes the parameter ρ (S) under the condition of | S | < M +1 is performed.
3. The method of claim 1, wherein searching the total set U for a subset S that maximizes the parameter p (S) under the condition of | S | ≦ M +1 comprises:
substituting a set S { [ i ] as a subset Z into the following formula, wherein i is any user in the subset T, and the subset T is a set of users belonging to the total set U and not belonging to the subset S:
Figure FDA0003373106140000011
where ρ (Z) is the subset Z dependent relaxation function, r (Z)＜i) Is the total rate requirement of said subset S in subset Z, P is a predetermined power budget value, aiIs the noise value corresponding to the first user i in the subset T, P (Z) is such that P (Z) is ≧ P＜i) Is the total power requirement of said subset S in the subset Z, Z＜iIs the subset S in subset Z;
sorting the candidate users in the subset T in descending order according to p (i), wherein p (i) is the user i dependent relaxation function;
finding a target user j in a subset T, wherein the target user j maximizes the ρ (Z);
determining whether the ρ (S { j }) is equal to ρ (S), wherein ρ (S { j }) is a set S { j } related relaxation function;
if yes, outputting the subset S;
and if not, adding the target user j into the subset S, and returning to the step of searching the target user j which maximizes rho (Z) in the subset T.
4. The method of claim 3, wherein the adding the target user j to the subset S and returning to the performing the finding the target user j in the subset T that maximizes ρ (Z) further comprises:
judging whether | S | ═ M +1 is met;
if yes, directly outputting the S subset.
5. The method of claim 1, wherein searching the subset S for a subset that satisfies the condition | S | < M and P (S) ≦ P such that r (S) is maximized as a feasible subset F comprises:
determining an active member and an inactive member of the subset S, wherein the active member is a user that can satisfy that the total power requirement of all users in the subset S before the user is less than the preset power budget value P, and the inactive member is a user that the total power requirement of all users in the subset S before the user is greater than or equal to the preset power budget value P;
deleting the inactive member and the last active member in the subset S to obtain the feasible subset F;
finding the maximum rate user n with r (b) maximum in the total set U*Wherein b is any user in the total set, and r (b) is the rate requirement of user b;
judgment of r (n)*) Whether or not r (n) is satisfied*) R (F), wherein r (F) is the total rate requirement of the feasible subset F;
if yes, the user n with the maximum rate is used*Returned as the feasible subset F.
6. The method of claim 5, wherein the determining active members and inactive members of the subset S comprises:
determining whether any user k in the subset S satisfies p (S)＜k) < P, wherein P (S)＜k) Refers to the total power requirement of all users in front of user k in the subset S;
if yes, defining the user k as the active member;
if not, defining the user k as the inactive member.
7. A total rate maximized NOMA downlink user selection apparatus, comprising:
a first searching module, configured to search, in a total set U, a subset S that maximizes ρ (S) under a condition of | S | ≦ M +1, where the subset S is a downlink user approximation set that maximizes a total rate of a single channel NOMA, | S | is a number of users of the subset S, M is a preset threshold of a maximum number of superposable users of the single channel, and ρ (S) is a related subset S relaxation function of the downlink user approximation set subset S that maximizes the total rate of the single channel NOMA;
a second searching module, configured to search, in the subset S, a subset that satisfies conditions | F | < M and P (F) ≦ P such that r (F) is maximized as a feasible subset F, where the feasible subset F is an optimal set of downlink users whose total rate of a single channel NOMA is maximized, P (F) is a total power requirement of the subset F, P is a preset power budget value, and r (F) is a total rate requirement of the subset F;
and the output module is used for outputting the feasible subset F.
8. A computer device, characterized in that the computer device comprises:
one or more processors;
a memory for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of total rate maximized NOMA downlink user selection as recited in any of claims 1-6.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the total rate maximised NOMA downlink user selection method according to any of claims 1-6.
CN202111406920.XA 2021-11-24 2021-11-24 NOMA downlink user selection method and system with maximized total rate Active CN114124254B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111406920.XA CN114124254B (en) 2021-11-24 2021-11-24 NOMA downlink user selection method and system with maximized total rate

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111406920.XA CN114124254B (en) 2021-11-24 2021-11-24 NOMA downlink user selection method and system with maximized total rate

Publications (2)

Publication Number Publication Date
CN114124254A true CN114124254A (en) 2022-03-01
CN114124254B CN114124254B (en) 2024-03-29

Family

ID=80372246

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111406920.XA Active CN114124254B (en) 2021-11-24 2021-11-24 NOMA downlink user selection method and system with maximized total rate

Country Status (1)

Country Link
CN (1) CN114124254B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107528624A (en) * 2017-03-30 2017-12-29 中国矿业大学 A kind of design method of the sane beam forming based on non-orthogonal multiple access technology
US20180027507A1 (en) * 2016-07-19 2018-01-25 Institut Mines-Telecom / Telecom Bretagne Method and apparatus for power and user distribution to sub-bands in noma systems
CN109088682A (en) * 2018-07-05 2018-12-25 安徽师范大学 Safe rate and maximization approach under a kind of MISO network based on NOMA
CN109905918A (en) * 2019-02-25 2019-06-18 重庆邮电大学 A kind of NOMA honeycomb car networking dynamic resource scheduling method based on efficiency
US20190356364A1 (en) * 2018-05-18 2019-11-21 Futurewei Technologies, Inc. System and Method for Communications System Training
CN110944378A (en) * 2019-11-13 2020-03-31 中通服咨询设计研究院有限公司 NOMA power distribution method for D2D communication in 5G mobile communication scene
WO2020091560A1 (en) * 2018-11-02 2020-05-07 엘지전자 주식회사 Method for transmitting and receiving signals in wireless communication system and device therefor
US20210022088A1 (en) * 2018-03-28 2021-01-21 Institut Mines-Telecom Method and apparatus for power distribution to sub-bands in multiple access communications systems
CN112333813A (en) * 2020-11-03 2021-02-05 重庆邮电大学 Cooperative NOMA network maximization and rate power distribution method under hardware damage
CN113473388A (en) * 2021-06-30 2021-10-01 河南大学 NOMA full-duplex user cooperation secret transmission method based on artificial noise

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180027507A1 (en) * 2016-07-19 2018-01-25 Institut Mines-Telecom / Telecom Bretagne Method and apparatus for power and user distribution to sub-bands in noma systems
CN107528624A (en) * 2017-03-30 2017-12-29 中国矿业大学 A kind of design method of the sane beam forming based on non-orthogonal multiple access technology
US20210022088A1 (en) * 2018-03-28 2021-01-21 Institut Mines-Telecom Method and apparatus for power distribution to sub-bands in multiple access communications systems
US20190356364A1 (en) * 2018-05-18 2019-11-21 Futurewei Technologies, Inc. System and Method for Communications System Training
CN109088682A (en) * 2018-07-05 2018-12-25 安徽师范大学 Safe rate and maximization approach under a kind of MISO network based on NOMA
WO2020091560A1 (en) * 2018-11-02 2020-05-07 엘지전자 주식회사 Method for transmitting and receiving signals in wireless communication system and device therefor
CN109905918A (en) * 2019-02-25 2019-06-18 重庆邮电大学 A kind of NOMA honeycomb car networking dynamic resource scheduling method based on efficiency
CN110944378A (en) * 2019-11-13 2020-03-31 中通服咨询设计研究院有限公司 NOMA power distribution method for D2D communication in 5G mobile communication scene
CN112333813A (en) * 2020-11-03 2021-02-05 重庆邮电大学 Cooperative NOMA network maximization and rate power distribution method under hardware damage
CN113473388A (en) * 2021-06-30 2021-10-01 河南大学 NOMA full-duplex user cooperation secret transmission method based on artificial noise

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NGUYEN, KH (NGUYEN, KHA-HUNG).ETC: "Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks", IEEE ICCE 2020: 2020 IEEE EIGHTH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND ELECTRONICS (ICCE) *
李晴;宋荣方;: "多载波NOMA下行链路系统和速率最大化研究", 南京邮电大学学报(自然科学版), no. 06 *
陈帅帅: "5G-V2X系统中基于功率域非正交多址的关键技术研究", 中国优秀硕士学位论文全文数据库 *

Also Published As

Publication number Publication date
CN114124254B (en) 2024-03-29

Similar Documents

Publication Publication Date Title
US8761677B2 (en) Multiple stage hybrid spectrum sensing methods and systems for cognitive radio
CN111294959B (en) Optimization method and optimization device for joint user grouping and power distribution
CN113965233B (en) Multi-user broadband millimeter wave communication resource allocation method based on deep learning
CN103141067A (en) A method, apparatus and computer program product for identifying frequency bands, and a method, apparatus and computer program product for evaluating performance
US10925063B2 (en) User selection method for non-orthogonal multiple access system and base station thereof
CN111310834B (en) Data processing method and device, processor, electronic equipment and storage medium
US20230068304A1 (en) Data Transmission Method and Apparatus, First Communication Node, and Second Communication Node
CN111614373B (en) Spread spectrum signal transmission method, spread spectrum signal reception method, spread spectrum signal transmission device, spread spectrum signal reception device, and spread spectrum signal reception medium
US8767866B2 (en) Method and apparatus for weight factor matrix determination for beam forming
CN114124254A (en) Method and system for selecting NOMA downlink user with maximized total rate
US9271229B2 (en) Methods, systems, and media for partial downloading in wireless distributed networks
CN112671430A (en) Code division multiplexing spread spectrum index modulation and demodulation communication method, transmitter and receiver
CN115987454A (en) Demodulation decoding method, demodulation decoding device, storage medium and electronic equipment
KR20100046755A (en) Wireless communication system in multi-cell and multi-antenna environments and method thereof
Astaiza et al. Compressive local wideband spectrum sensing algorithm for multiantenna cognitive radios
CN113612710B (en) Channel prediction method, device, equipment and medium
US9479372B2 (en) Methods, systems, and media for determining whether a signal of interest is present
CN111510942B (en) Wireless communication noise testing method, device, computer equipment and storage medium
US20180145711A1 (en) Dual Receive Processing In Wireless Communications
CN113300728B (en) Self-adaptive interference elimination method based on non-orthogonal multiple access uplink
JP5770861B2 (en) Power allocation in a wireless system where the base station has an antenna array
CN115087011B (en) Method and device for detecting downlink signal of flexible frame structure simulation system
CN118250127A (en) Signal-to-interference-and-noise ratio determining method and device, electronic equipment and storage medium
CN102334305B (en) Method and apparatus for allocating processing delays in multi-carrier systems
CN107888332B (en) A kind of user&#39;s detection method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant