CN110139248B - User matching and grouping method for uplink SCMA system - Google Patents

User matching and grouping method for uplink SCMA system Download PDF

Info

Publication number
CN110139248B
CN110139248B CN201910322729.3A CN201910322729A CN110139248B CN 110139248 B CN110139248 B CN 110139248B CN 201910322729 A CN201910322729 A CN 201910322729A CN 110139248 B CN110139248 B CN 110139248B
Authority
CN
China
Prior art keywords
user
group
subcarrier
strategy
users
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.)
Active
Application number
CN201910322729.3A
Other languages
Chinese (zh)
Other versions
CN110139248A (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201910322729.3A priority Critical patent/CN110139248B/en
Publication of CN110139248A publication Critical patent/CN110139248A/en
Application granted granted Critical
Publication of CN110139248B publication Critical patent/CN110139248B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a user matching and grouping method of an uplink SCMA system, which comprises the following steps: all available subcarriers are grouped in sequence and divided into a plurality of subcarrier groups; determining the subcarrier group priority of each user, and grouping the users according to the subcarrier group priority list of the users; and according to the priority of each user group on each subcarrier group, finishing the mutual selection between the user group and the subcarrier group, and carrying out multiple iterative selections to form subcarrier group-user group matching pairs. The scheme of the invention ensures the maximization of the system and the rate, and further optimizes the performance of the uplink SCMA system.

Description

User matching and grouping method for uplink SCMA system
Technical Field
The invention belongs to the field of wireless mobile communication, and particularly relates to a user matching and grouping method for an uplink SCMA system.
Background
An mtc (Massive Machine-Type Communications), that is, a Massive Machine Type communication scenario, is one of three major application scenarios, namely 5G. MTC refers to autonomous communication between machine type devices. In the next few years, as the number of MTC devices will increase exponentially, there will be a great number of MTC devices accessing the network in an MTC application scenario, and therefore, a major challenge in the MTC scenario is how to solve the problem of efficient access of a great number of MTC users. If MTC devices in a cell need to access a cell base station independently, a large burden is imposed on the base station.
The non-orthogonal multiple access technology has become an important candidate technology of a 5G physical layer, which not only can provide higher spectrum efficiency, but also can support a larger number of user connections compared with the existing system. Sparse Code Multiple Access (SCMA) is a non-orthogonal Multiple Access technique that combines low-density spread spectrum techniques with modulation techniques. An SCMA codebook set with optimal performance is designed, then codebooks are distributed to different users, a system sending end sends multidimensional code words carrying different user information through non-orthogonal superposition, and a receiving end executes a low-complexity message transmission algorithm to carry out receiving detection.
Therefore, in an MTC scenario, how to use the SCMA technology to enable a large number of MTC users to access a wireless network to increase the number of user connections of the entire system and ensure maximization of the system and rate becomes a technical problem to be solved by those skilled in the art.
Disclosure of Invention
Aiming at the defects or improvement requirements of the prior art, the invention provides a user matching and grouping method of an uplink SCMA system, which realizes uplink access of a large number of MTC users, ensures maximization of the system and the rate and improves the capacity of the whole system.
In order to achieve the purpose, the invention adopts the following technical scheme:
a user matching grouping method of an uplink SCMA system comprises the following steps:
step S1: all available subcarriers are grouped in sequence and divided into a plurality of subcarrier groups;
step S2: determining the subcarrier group priority of each user, and grouping the users according to the subcarrier group priority list of the users;
and step S3: and according to the priority of each user group on each subcarrier group, finishing the mutual selection between the user group and the subcarrier group, and carrying out multiple iterative selections to form subcarrier group-user group matching pairs.
Further, in step S2, a priority list of subcarrier groups is constructed by channel gains of users on each subcarrier, and the method for constructing channel gains includes the following steps:
step S21: user s gains the sub-carrier channel in the q sub-carrier group
Figure BDA0002035293800000021
Performing descending order arrangement, selecting the first N sub-carrier wave channel gains, and summing to obtain
Figure BDA0002035293800000025
The channel gain of the user s in the q sub-carrier group is taken as;
step S22: the set of channel gains for the subcarrier group of the user S obtained in step S21 is:
Figure BDA0002035293800000022
and all elements in the set are sorted in descending order as a priority list of the subcarrier groups for user s.
Further, in step S3, the method for matching the user group and the subcarrier group includes the following steps:
step S31: initializing a set C of users allocated to groups of subcarriers as an empty set
Figure BDA0002035293800000023
The binary matrixes V and F are all-zero matrixes; constructing a priority list L about subcarrier groups for each user group by using the proposed subcarrier group priority construction list; dividing a resource block into Q subcarrier groups in sequence by taking K subcarriers as a group; inputting a user set S, a subcarrier group set Q, a channel matrix H, user power P, the number of users in a user group J and the number of subcarriers in a subcarrier group K; s q Representing the user set allocated by the q subcarrier group, namely the matched user group; the set C is represented by a binary matrix V, where V = { V = { [ V ] 1 ,v 2 ,…,v S },v 1 ＝{v 1,1 ,v 2,1 ,…,v Q,1 }; when v is q,s If =1, it means that the s-th user is matched to the q-th sub-carrier group, otherwise v q,s When =0, it means that the s-th user does not occupy the q-th subcarrier group; similarly, the matrix F is used to represent the subcarrier allocation scheme for the user set S, which is defined by the set
Figure BDA0002035293800000024
Obtaining a matrix F, and obtaining a matrix V from the set C;
step S32: traversing each element L of the priority list L, namely each element L corresponds to one priority list, and then circularly traversing the subcarrier group set Q and the user set S to form three-level nested circular traversal;
step S33: in the three-level nested loop traversal formed in the step S32, the initialization strategy set M is an empty set, the effective strategy set CM is an empty set, and the system and the rate R are empty sets; if the user s is not matched with the subcarrier group, selecting a subcarrier group q with the highest priority from a subcarrier group priority list of the user s, and judging whether the number of the users distributed on the subcarrier group q is equal to J or not;
step S34: if the number of the users distributed on the subcarrier group q is less than J, the scheme and the set S of the subcarrier occupation of the user S on the subcarrier group q are continuously judged q Whether the subcarrier occupation schemes of the original users s' are completely the same or not; if the two are identical, a replacement strategy m is constructed: i.e. replacing the set S by the user S q Original user s'; if not, constructing an adding strategy m: i.e. adding user S to set S q In (1). If the number of users allocated to the subcarrier group q is equal to J, a replacement strategy m is constructed: i.e. replacing the set S by the user S q And adding the strategy M into the strategy set M.
Step S35: traversing each set in the strategy set M, assuming that the power of the user is evenly divided on the occupied sub-carrier, and solving the system and the rate R after the strategy is applied new The system and rate calculations are as follows:
Figure BDA0002035293800000031
if R is new If the system and the speed R before the strategy m is applied are larger than the system and the speed R before the strategy m is applied, the strategy m is determined to be an effective strategy m, and the strategy m is added into the set CM;
step S36: selecting strategy s in set CM for maximizing system and rate best If s is best Is a replacement policy, i.e. there is an update set C and a set S q Updating the matrix V and F simultaneously, and further updating the userA list of subcarrier group priorities of s and s'; if s best Is an addition policy, i.e. there is an update set C and a set S q Updating the matrixes V and F at the same time, and further updating the subcarrier group priority list of the user s;
step S37: if s best If not, ending the cycle; each traversal of the priority list L is judged as follows: if set
Figure BDA0002035293800000032
If the number of users in the set C is J and the number of users in the set C is | S |, the whole loop is skipped, the whole algorithm is ended, and the set S is output q Set C, matrix V and F.
Compared with the prior art, the invention has the following beneficial effects:
the user matching and grouping method of the uplink SCMA system provided by the invention completes the mutual selection between the user group and the subcarrier group and forms the matching pair, realizes the access of a large number of MTC users to a wireless network, improves the user connection number and capacity of the whole system, ensures the maximization of the system and the speed, and further optimizes the system performance of the uplink SCMA.
Drawings
Fig. 1 is a hierarchical structure diagram of a single-cell mtc network in an embodiment of the present invention;
FIG. 2 is a schematic diagram of a single SCMA system resource allocation in an embodiment of the present invention;
fig. 3 is a schematic diagram of user matching groups in a single MTC user group according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and specific embodiments. Examples of the embodiments illustrated in the accompanying drawings, specific embodiments described in the following embodiments of the present invention are provided as illustrative of the embodiments of the present invention only, and are intended to be used for explaining the present invention, not to be construed as limiting the present invention.
For the network layered architecture of the proposed mtc system, as can be seen from fig. 1, first, in the first layer network model, communication between a base station and an LTE user and communication between a base station and an MTCG user are mainly included; in the second layer network model, communication between the MTC users and MTCG users in one MTC user group is mainly included. Therefore, the user grouping and matching in a single MTC user group mainly includes subdividing a resource block into subcarrier groups, and forming a user group from the MTC users matched with each subcarrier group, that is, completing the matching between the subcarrier groups and the user group. In each MTC user group, MTC users access to MTCG users by using an SCMA technology, and the single MTC user group forms a single SCMA system, at the moment, the resource distribution in each user group is based on subcarrier groups obtained by grouping and matching the users in the MTC user group, and each subcarrier is reasonably distributed to the users according to the design rule of a mapping matrix in the SCMA technology.
The number of subcarriers in an uplink SCMA system is assumed to be K, the number of users accessible to the system is J, that is, J users multiplex K subcarrier resource blocks (J > K), so as not to lose generality, it is assumed here that each user occupies one layer, the dimension of each user codebook is K, the codebook size is M, that is, each codebook has M codewords, and the overload factor μ = J/K. The SCMA encoder may be described as a mapping process, i.e. from
Figure BDA0002035293800000041
Bits are mapped to C, where
Figure BDA0002035293800000042
Is a K-dimensional complex codebook of size M. There are different codewords in the codebook, and these codewords are sparse column vectors containing N<K is a non-zero element. The K dimensions correspond to K different orthogonal subcarriers. The user cannot transmit data through the sub-carriers represented by the K-N zero elements. In the uplink channel, the received signal at the kth subcarrier can be written as:
Figure BDA0002035293800000043
wherein h is k，j Is the channel matrix of the jth user on the kth sub-carrier，x k，j Is the element of the codeword selected by the jth user at the kth subcarrier, which may be 0, determined by the codebook of user j.
Figure RE-GDA0002124908380000044
Additive Gaussian noise on the k-th subcarrier, so that the set of users occupying the subcarrier k is S k Therefore, the received signal on the subcarrier k can be rewritten by equation (1) as:
Figure BDA0002035293800000045
assuming that MTCG is connected to S users in a single MTC user group, a base station allocates L resource blocks to MTCG, subdivides the resource blocks into subcarriers, and groups consecutive subcarriers into a group, i.e., K subcarriers are grouped into a group, i.e., Q =12 × L/K subcarrier groups. And meanwhile, S users are grouped by J user group groups, W = S/J user groups are shared, and one user group can only match one subcarrier group, namely one user group and one subcarrier group form an SCMA system.
The velocity formula known by shannon's formula can be expressed as: r = C/B = log (1 + SINR). Definition index v qs If =1, it means that the q-th subcarrier group is allocated to the s-th user, otherwise v qs If =0, it means that the s-th user does not occupy the q-th subcarrier group. According to the analysis of a single SCMA system and rate, the rate of user j on occupied sub-carrier k is:
Figure BDA0002035293800000051
wherein, I k,j Refers to a user set S occupying subcarrier k in a single user group k The interference caused by the signals of other users to the jth user is defined as follows:
Figure BDA00020352938000000512
i.e. for a single subcarrier group, the rate of user j is:
Figure BDA0002035293800000052
in summary, for a system with Q subcarrier groups and S users, the sum rate of the system is:
Figure BDA0002035293800000053
wherein f is k,s If =1, it means that the s-th user occupies the k-th subcarrier, otherwise, it does not occupy; v. of qs If =1, it means that the qth sub-carrier group is allocated to the s-th user, otherwise v qs When =0, it means that the s-th user does not occupy the q-th subcarrier group, where I k,s And I k,i The definitions of (a) and (b) are consistent. I.e. the optimization problem of the whole system can be expressed as:
Figure BDA0002035293800000054
Figure BDA0002035293800000055
Figure BDA0002035293800000056
Figure BDA0002035293800000057
Figure BDA0002035293800000058
Figure BDA0002035293800000059
Figure BDA00020352938000000510
Figure BDA00020352938000000511
in the above process, formula (7 a) represents that the sum rate of the entire system is maximized; formula (7 b) indicates that the power allocation of the jth user meets the power limit of the jth user, and the power of each user is assumed to be P; formula (7 c) indicates that the power allocated to the occupied sub-carrier of each user is greater than or equal to 0; equation (7 d) indicates that each subcarrier in a single SCMA system is d at most f Occupied by one user; formulas (7 f) and (7 e) show that each user occupies all subcarriers with the number of N; equation (7 g) indicates that each user can occupy only one subcarrier group to mitigate interference. The optimization problem (7) combines the grouping and matching of users in the MTC user group and the resource allocation of the SCMA system in the group, and because the interference suffered by each user only comes from other users in the same group after the subcarrier combination and the mutual matching of the user group are completed, the grouping and matching and the resource allocation of the SCMA system in the group can be separated for the optimization problem (7) and the individual optimization can be carried out.
The invention provides a packet matching scheme for determining v under the condition of equal power distribution of users s And f k,s Maximizing the system and rate. After obtaining the corresponding grouping matching scheme, the single SCMA system optimizes the subcarrier allocation process in the subcarrier group by using the mapping relation of the constellation points in the SCMA. After determining the occupied sub-carriers by the users in the user group, it is necessary to construct a power allocation model according to the user requirements, and optimize the power allocation of a single user on the occupied sub-carriers, as shown in fig. 2.
Assuming that a single subcarrier group has K subcarriers, it can be found that a single subcarrier group can access J (J = K × μ > K) users to transmit information according to the spreading factor μ (always greater than 1) of the SCMA system. As shown in fig. 3, the basic steps of user group matching in a single MTC user group are:
step S1: all available subcarriers are grouped in sequence and divided into a plurality of subcarrier groups.
The mutual matching problem of subcarrier groups and user groups is a many-to-many matching problem in nature, and a many-to-many matching model can be constructed to complete the selection of both parties.
Through analysis of the system and the rate, it can be known that for a user, the fixed parameter is the channel gain, and the factor directly influencing the user rate is the SINR, and the SINR includes a variable, that is, the power p allocated by the user on the occupied sub-carrier k,s . As follows:
Figure BDA0002035293800000061
in the previous paragraph with respect to I k,s In the definition of (1), on the subcarrier, the user with the largest channel gain does not suffer interference from other users, so the subcarrier group priority list is mainly constructed by the channel gain.
Step S2: determining the subcarrier group priority of each user, and then grouping the users according to the subcarrier group priority list of the users.
The specific steps for constructing a priority list of subcarrier groups by the channel gain of the user on each subcarrier are as follows:
step S21: user s gains the sub-carrier channel in the q sub-carrier group
Figure BDA0002035293800000071
Performing descending order arrangement, selecting the first N sub-carrier wave channel gains, and summing to obtain
Figure BDA0002035293800000072
As the channel gain of the user s in the qth sub-carrier group.
Step S22: the set of channel gains for the subcarrier group of the user S obtained through step S21 is:
Figure BDA0002035293800000073
all elements in the set are arranged in a descending order to serve as a priority list of the subcarrier groups of the user s;
and step S3: according to the priority of each user group on each subcarrier group, the mutual selection between the user group and the subcarrier group is completed, and a plurality of iterative selections can be carried out to form a matching pair (subcarrier group-user group).
Step S31: initializing a set C of users allocated to groups of subcarriers as an empty set
Figure BDA0002035293800000074
The binary matrixes V and F are all-zero matrixes; constructing a priority list L about subcarrier groups for each user group by using the proposed subcarrier group priority construction list; dividing a resource block into Q subcarrier groups in sequence by taking K subcarriers as a group; inputting a user set S, a subcarrier group set Q, a channel matrix H, user power P, the number of users in a user group J and the number of subcarriers in a subcarrier group K; s q Representing the user set allocated by the q subcarrier group, namely the matched user group; the set C is represented by a binary matrix V, where V = { V = { [ V ] 1 ,v 2 ,…,v S },v 1 ＝{v 1,1 ,v 2,1 ,…,v Q,1 }; when v is q,s If =1, it means that the s-th user is matched to the q-th sub-carrier group, otherwise v q,s When =0, it means that the s-th user does not occupy the q-th subcarrier group; similarly, the matrix F is used to represent the subcarrier allocation scheme for the user set S, which is defined by the set
Figure BDA0002035293800000075
Obtaining a matrix F, and obtaining a matrix V from the set C;
step S32: and traversing each element L of the priority list L, namely, each element L corresponds to one priority list, and then circularly traversing the subcarrier group set Q and the user set S to form three-level nested circular traversal.
Step S33: in the three-level nested loop traversal formed by the S32, the initialization strategy set M is an empty set, the effective strategy set CM is an empty set, and the system and the rate R are empty sets. If the user s is not matched to the subcarrier group, selecting a subcarrier group q with the highest priority from the subcarrier group priority list of the user s, and judging whether the number of users distributed on the subcarrier group q is equal to J.
Step S34: if the number of the users distributed on the sub-carrier group q is less than J, continuing to judge the sub-carrier occupation scheme and the set S of the user S on the qth sub-carrier group q Whether the subcarrier occupation schemes of the original users s' in the system are completely the same or not. If the two are identical, a replacement strategy m is constructed: i.e. replacing the set S by the user S q Original user s'; if not, an adding strategy m is constructed: i.e. adding user S to set S q In (1). If the number of users allocated on the subcarrier group q is equal to J, then a replacement strategy m is constructed: i.e. replacing the set S by the user S q S' of the original user. Adding the strategy M to the strategy set M.
Step S35: traversing each set in the policy set M: assuming that the power of the user is equally divided on the occupied sub-carrier, the system and the rate R after the strategy is applied are obtained new . If R is new And if the system and the speed R before the strategy m is applied are larger than the system and the speed R before the strategy m is applied, the strategy m is determined to be an effective strategy m, and the strategy m is added into the set CM.
Step S36: selecting strategy s in set CM for maximizing system and rate best . If s is best Is a replacement policy, i.e. there is an update set C and a set S q And simultaneously updating the matrixes V and F, and further updating the subcarrier group priority list of the users s and s'. If s is best Is an addition policy, i.e. there is an update set C and a set S q And simultaneously updating the matrixes V and F, and further updating the subcarrier group priority list of the user s.
Step S37: if s is best If not, the loop is ended. Judging the end of each traversal of the priority list L as follows; if set
Figure BDA0002035293800000081
The number of users in the set C is J, and the number of users in the set C is | S |, the whole loop is jumped out, and the whole algorithm is ended. Set of outputs S q Set C, matrix V and F.
The R calculation in the above user matching scheme defines:
Figure BDA0002035293800000082
determining v according to the constructed subcarrier group priority and power average distribution initialization q,s And pk ,s. Further, f is determined by searching and initializing the subcarrier priority list of each user in the occupied subcarrier group k,s Wherein I is k,s The determination can be initialized by the definition of the interference term I, and further R can be found.
In summary, the uplink SCMA system user matching grouping method of the present invention completes the mutual selection between the user group and the subcarrier group and forms the matching pair, realizes the access of a large number of MTC users to the wireless network, improves the user connection number and capacity of the whole system, ensures the maximization of the system and the rate, and further optimizes the system performance of the uplink SCMA.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, the word "comprising" does not exclude the presence of data or steps not listed in a claim.

Claims (1)

1. A user matching grouping method of an uplink SCMA system is characterized by comprising the following steps:
step S1: all available subcarriers are grouped in sequence and divided into a plurality of subcarrier groups;
step S2: determining the subcarrier group priority of each user, and grouping the users according to the subcarrier group priority list of the users; the method for constructing the channel gain comprises the following steps:
step S21: user s gains the sub-carrier channel in the q sub-carrier group
Figure FDA0003786124790000011
Performing descending order arrangement, selecting the first N sub-carrier wave channel gains, and summing to obtain
Figure FDA0003786124790000012
As the channel gain of user s in the qth sub-carrier group;
step S22: the set of channel gains for the subcarrier group of the user S obtained in step S21 is:
Figure FDA0003786124790000013
Figure FDA0003786124790000014
all elements in the set are arranged in a descending order to serve as a priority list of the subcarrier groups of the user s;
and step S3: according to the priority of each user group on each subcarrier group, the mutual selection between the user group and the subcarrier group is completed, and multiple iterative selections are carried out to form subcarrier group-user group matching pairs, wherein the matching method of the user group and the subcarrier group comprises the following steps:
step S31: initializing a set C of users allocated to groups of subcarriers as an empty set
Figure FDA0003786124790000015
The binary matrixes V and F are all-zero matrixes; constructing a list for each using the proposed subcarrier group prioritiesA user group constructs a priority list L about subcarrier groups; dividing a resource block into Q subcarrier groups in sequence by taking K subcarriers as a group; inputting a user set S, a subcarrier group set Q, a channel matrix H, user power P, the number of users in a user group J and the number of subcarriers in a subcarrier group K; s q Representing the user set allocated by the q subcarrier group, namely the matched user group; the set C is represented by a binary matrix V, where V = { V = { V = 1 ,v 2 ,…,v S },v 1 ＝{v 1,1 ,v 2,1 ,…,v Q,1 }; when v is q,s If =1, it means that the s-th user is matched to the q-th sub-carrier group, otherwise v q,s When =0, it means that the s-th user does not occupy the q-th subcarrier group; similarly, the matrix F is used to represent the subcarrier allocation scheme for the user set S, which is defined by the set
Figure FDA0003786124790000016
Obtaining a matrix F, and obtaining a matrix V from the set C;
step S32: traversing each element L of the priority list L, namely each element L corresponds to one priority list, and then circularly traversing the subcarrier group set Q and the user set S to form three-level nested circular traversal;
step S33: in the three-level nested loop traversal formed in the step S32, initializing a strategy set M as an empty set, initializing an effective strategy set CM as an empty set, and setting a system and a rate R as an empty set; if the user s is not matched with the subcarrier group, selecting a subcarrier group q with the highest priority from a subcarrier group priority list of the user s, and judging whether the number of the users distributed on the subcarrier group q is equal to J or not;
step S34: if the number of the users distributed on the subcarrier group q is less than J, the scheme and the set S of the subcarrier occupation of the user S on the subcarrier group q are continuously judged q Whether the sub-carrier occupation schemes of the original users s' are completely the same or not; if the two are identical, a replacement strategy m is constructed: i.e. replacing the set S by the user S q Original user s'; if not, constructing an adding strategy m: i.e. adding user S to set S q Performing the following steps; if subcarrierAnd if the number of the users distributed on the group q is equal to J, constructing a replacement strategy m: i.e. replacing the set S by the user S q Adding the strategy M to the strategy set M by the original user s';
step S35: traversing each set in the strategy set M, assuming that the power of the user is equally divided on the occupied sub-carrier, and solving the system and the rate R after the strategy is applied new The system and rate calculations are as follows:
Figure FDA0003786124790000021
if R is new If the system and the speed R before the strategy m is applied are larger than the system and the speed R before the strategy m is applied, the strategy m is determined to be an effective strategy m, and the strategy m is added into the set CM;
step S36: selecting strategy s in set CM for maximizing system and rate best If s is best Is a replacement policy, i.e. there is an update set C and a set S q Updating the matrixes V and F at the same time, and further updating the subcarrier group priority list of the users s and s'; if s best Is an addition policy, i.e. there is an update set C and a set S q Updating the matrixes V and F at the same time, and further updating the subcarrier group priority list of the user s;
step S37: if s best If not, ending the cycle; each traversal of the priority list L is judged as follows: if set
Figure FDA0003786124790000022
The number of users in the set C is J, and the number of users in the set C is | S |, jumping out of the whole cycle, ending the whole algorithm, and outputting the set S q Set C, matrix V and F.
CN201910322729.3A 2019-04-22 2019-04-22 User matching and grouping method for uplink SCMA system Active CN110139248B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910322729.3A CN110139248B (en) 2019-04-22 2019-04-22 User matching and grouping method for uplink SCMA system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910322729.3A CN110139248B (en) 2019-04-22 2019-04-22 User matching and grouping method for uplink SCMA system

Publications (2)

Publication Number Publication Date
CN110139248A CN110139248A (en) 2019-08-16
CN110139248B true CN110139248B (en) 2022-10-14

Family

ID=67570561

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910322729.3A Active CN110139248B (en) 2019-04-22 2019-04-22 User matching and grouping method for uplink SCMA system

Country Status (1)

Country Link
CN (1) CN110139248B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112751594B (en) * 2020-12-17 2021-12-14 天地信息网络研究院(安徽)有限公司 Satellite communication user grouping method based on sum rate maximization

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108770054A (en) * 2018-05-08 2018-11-06 南京邮电大学 A kind of SCMA resources dynamic optimization distribution method
CN108848482A (en) * 2018-06-12 2018-11-20 南京邮电大学 Resource allocation methods based on mMTC layer-specific access frame

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100566274B1 (en) * 2003-11-20 2006-03-30 삼성전자주식회사 Apparatus and method for sub-carrier allocation in ofdm system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108770054A (en) * 2018-05-08 2018-11-06 南京邮电大学 A kind of SCMA resources dynamic optimization distribution method
CN108848482A (en) * 2018-06-12 2018-11-20 南京邮电大学 Resource allocation methods based on mMTC layer-specific access frame

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"An Optimal Resource Allocation Algorithm Based on Sum Rate Maximization for";Guan Xiong;《IEEE》;20181011;全文 *
"基于压缩感知的信道互易性补偿方法";孙君;《CNKI》;20151231;全文 *

Also Published As

Publication number Publication date
CN110139248A (en) 2019-08-16

Similar Documents

Publication Publication Date Title
JP6196268B2 (en) UPLINK SIGNAL TRANSFER METHOD AND DEVICE USING MULTIPLE ANTENNA
KR101382556B1 (en) Apparatus and method for allocating resources to nodes in a communication system using an update of iteration resource weights
US11671151B2 (en) Efficient peak-to-average-power reduction for OFDM and MIMO-OFDM
Di et al. Radio resource allocation for uplink sparse code multiple access (SCMA) networks using matching game
CN110214438A (en) The system and method communicated using reduced papr
WO2018206016A1 (en) Codebook configuration method, port configuration method, and device
CN109194453B (en) The sending method and device of Phase Tracking reference signal
CN105721123B (en) A kind of user pairing and power distribution method and device
WO2017198193A1 (en) Adaptively grouped user equipment multicasting and beamforming
CN105873214B (en) A kind of resource allocation methods of the D2D communication system based on genetic algorithm
CN108770054B (en) SCMA resource dynamic optimization allocation method
CN112994850A (en) SCMA coding and decoding method combining transmitting end and receiving end
WO2016173103A1 (en) Resource indication method and apparatus for wlan system
CN107911853B (en) Resource allocation algorithm of SCMA (sparse code multiple access) system based on ant colony algorithm
CN106792451A (en) A kind of D2D communication resource optimization methods based on Multiple-population Genetic Algorithm
CN108366036A (en) A kind of modulation codebook design method towards Sparse Code multiple access system
KR20190140366A (en) Method and apparatus for determining a codebook in non-orthogonal multiple access system
CN108768482A (en) SCMA method for generating codebooks based on genetic algorithm
CN112600569A (en) Coding method
CN110139248B (en) User matching and grouping method for uplink SCMA system
US11963170B2 (en) Resource mapping method and apparatus
Yuan et al. Latency-critical downlink multiple access: A hybrid approach and reliability maximization
CN112469113B (en) Resource allocation method and device of multi-carrier NOMA system
CN106211235A (en) Parcel data transmission method in a kind of wireless network and system
CN106027451A (en) Coding modulation method for multiuser transmission-oriented subcarrier variable system

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