CN106912111A - A kind of non-orthogonal multiple cut-in method merged with competition fine granularity based on scheduling - Google Patents

Abstract

The present invention provides a non-orthogonal multiple access method based on fine-grained integration of scheduling and competition, which relates to the field of communication technology, calculates the resource area and resource position occupied by the scheduling-competition fusion access mode, and provides the scheduling user To allocate resources, the central node sends a resource allocation instruction frame to the user equipment in the cell, and through scheduling-competition fusion access, the information sent by the final scheduling user and the competing user is superimposed on the time-frequency resource, and the receiving end passes multi-user joint detection The method analyzes the superposition information, and the present invention realizes the fine-grained fusion of the two access methods by adopting the method of scheduling access and competing access to share the same spectrum resource, which is beneficial to the matching of dynamically changing requirements and resources, and is beneficial to Multi-user diversity gain, thereby significantly improving network capacity, spectrum utilization, and service quality.

Description

A non-orthogonal multiple access method based on fine-grained fusion of scheduling and contention

technical field

The invention relates to the technical field of communication, in particular to a non-orthogonal multiple access method.

Background technique

In recent years, with the rapid development of mobile wireless communication technology and computer science, the mobile Internet is profoundly affecting people's work and study, and continues to penetrate into various fields. As the core of mobile wireless communication technology, multiple access technology, also known as Media Access Control (MAC), is responsible for how multiple user equipment (UserEquipment, UE) efficiently share and use the increasingly scarce wireless spectrum resource. Therefore, the efficiency of the MAC technology directly affects key performance indicators (Key Performance Indicator, KPI) of the mobile wireless network: network capacity, number of network connections, and spectrum utilization.

The next-generation mobile wireless network needs to meet the requirements of massive user connections and ultra-large-scale traffic, which poses great challenges to traditional wireless networks. Therefore, the industry is committed to seeking solutions that can significantly increase the number of user connections, network capacity, and spectrum utilization. technology. In recent years, non-orthogonal multiple access technologies represented by sparse code multiple access (SCMA) can enable different user equipments to share the same spectrum resources, that is, the resources are no longer exclusive. Therefore, under the premise of limited spectrum resources, the number of user connections, network capacity, and spectrum utilization can be significantly improved. It is favored by the industry and academia, and is expected to be standardized by the fifth generation mobile communication system (5G). For non-orthogonal multiple access technology, please refer to "Dai L, Wang B, Yuan Y, et al.Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends [J]. IEEECommunications Magazine, 2015, 53 (9):74-81.".

In terms of access subjects and methods, multiple access technologies can generally be divided into two categories: 1) Scheduling-based multiple access technologies are often used in cellular networks. conflicts, resources can be better allocated, and the transmission rate requirements are more likely to be guaranteed; the disadvantage is that the central control node is not flexible enough, the real-time guarantee is poor, and the signaling overhead is large; 2) Multiple networks based on random competition Address access technology, which is often used in wireless local area networks, has the advantages of flexibility and robustness, good real-time guarantee, and simple implementation; its disadvantage is that data packets of multiple users may conflict with each other, and the transmission rate requirements are difficult to obtain. good guarantee. For the convenience of description, the scheduling-based multiple access technology and the random contention-based multiple access technology will be referred to as scheduling access and contention access respectively in the following, so as not to cause ambiguity.

"Au K, Zhang L, Nikopour H, et al. Uplink contention based SCMA for 5Gradio access[C]//Globecom Workshops (GC Wkshps), 2014.IEEE, 2014:900-905." Proposed scheduling-based access The contention-based access method and the contention-based access method are introduced into SCMA uplink multiple access at the same time. However, in this idea, the spectrum resources occupied by scheduling and competition are independent and isolated, that is, part of the spectrum resources is used for scheduling access, and the other part Spectrum resources are used for contention access, and the two parts of resources are strictly separated without any overlap of spectrum resources. This will bring the following defects: 1) The demands of user equipments using scheduled access and contention access are dynamically changing, and strictly dividing the available resources of the two access modes will cause dynamic user demands and the number of available resources to vary. 2) Strictly separating resources for scheduled access and competitive access will reduce the number of resources available to user equipment, that is, users who use scheduled access cannot use competitive access. resources, and vice versa, thus the multi-user diversity capability is affected.

To sum up, the existing non-orthogonal multiple access technology introduces scheduling access and contention access, but the available resource division of the two access methods will limit the network capacity, spectrum utilization and quality of service (Quality of Service, QoS), there is a lack of a more refined and efficient multiple access method that integrates scheduling access and contention access.

Contents of the invention

In order to overcome the deficiencies of the existing technology and solve the problems of the existing technology restricting network capacity, spectrum utilization and service quality, the present invention proposes a non-orthogonal multiple access method based on fine-grained integration of scheduling and competition. The resources used for scheduling access and the resources for users to compete for access are not separated, so that the resources of the two access methods are completely shared. While scheduling some user equipment for transmission, other user equipment is allowed to use the same spectrum resources. Random competition is used to access, which is conducive to the matching of dynamically changing needs and resources, and is conducive to multi-user diversity gain, thereby significantly improving network capacity, spectrum utilization, and service quality.

The detailed steps of the technical solution adopted by the present invention to solve the technical problems are as follows:

Step 1: Resource Allocation Phase

The central node in the wireless network calculates the resource area and resource position occupied by the scheduling-competition integrated access mode, and allocates resources for the scheduling user in the above resource area, and turns to step 2;

The central node refers to a base station (Base Station, BS) in a cellular network, and refers to a wireless access point (Access Point, AP) in a wireless local area network;

The resource refers to a time-frequency two-dimensional resource, the resource size is measured by the number of time-frequency resource blocks, and the resource position is determined by the jth frequency unit of the ith time slot;

Step 2: Resource indication phase

Step 2.1: the central node sends a resource allocation indication frame (ResourceAllocation Indication Frame, RAIF) to the user equipment in the cell;

Step 2.2: The RAIF indicates the resource position of the cell's scheduling-competition integrated access mode. The specific indication method is that the i-th time slot and the jth frequency are used for the scheduling-competition integrated access mode, and the indicated resource position is scheduled by the user shared with competing users;

Step 2.3: RAIF indicates the resource allocation position for the scheduling user in the resource position of the scheduling-competition integrated access mode. The specific indication method is to allocate the jth frequency of the i-th time slot to the user equipment u, and go to step 3 ;

Step 3: Scheduling-competition converged access

Step 3.1: The scheduled user equipment implements uplink access by using non-orthogonal multiple access technology at the scheduled resource location;

Step 3.2: Competing access users perform random competition at the resource location of the scheduling-competition integrated access method. If the competition is successful, non-orthogonal multiple access technology is used to achieve uplink access; if the competition fails, this access is abandoned;

The random competition method includes but not limited to backoff method and p-probability method;

Step 3.3: The scheduling users and competing users in steps 3.1 and 3.2 will share the same time-frequency resources, and the sent information will be superimposed on these shared time-frequency resources, and enter step 4;

Step 4: Receiver User Separation Phase

The receiving end parses the superimposed information of multiple users through the multi-user joint detection method, and the process ends.

If the receiver user separation stage of the non-orthogonal multiple access method based on the fine-grained integration of scheduling and competition adopts the SCMA method, the information analysis steps of the BS receiving end are as follows:

Step a): Construct the original codebooks corresponding to all scheduled user equipments into a deterministic codebook set. The set is not only known codebooks, but also the codebooks must be active. The active means that there must be users using the codebooks to send data, go to step b);

Step b): Add a constellation point (0, 0) to the original codebook corresponding to each competing user, which is called an incremental codebook, and make the incremental codebooks of all competing users into a codebook set whose activity is to be determined, The codebook in the set is known, but the activity is unknown, so go to step c);

Step c): Combine the deterministic codebook set and the codebook set whose activity is to be determined together to form the SCMA receiving codebook set, and then use the message passing algorithm to realize multi-user detection. If the corresponding constellation of the determined codebook is (0, 0) , it is judged as inactive, otherwise, it is judged as active, and the process ends.

The beneficial effect of the present invention is that the fine-grained integration of the two access methods is realized by adopting the method of sharing the same spectrum resources for scheduling access and contention access, which is beneficial to the matching of dynamically changing requirements and resources, and is beneficial to multi-users Diversity gain, thereby significantly improving network capacity, spectrum utilization, and service quality.

Description of drawings

Fig. 1 is a structural diagram of Embodiment 1 of the present invention.

Fig. 2 is a structural diagram of Embodiment 1 of the present invention.

Fig. 3 is a structural diagram of Embodiment 2 of the present invention.

Fig. 4 is a structural diagram of Embodiment 3 of the present invention.

Fig. 5 is a structural diagram of Embodiment 4 of the present invention.

Fig. 6 is a structural diagram of Embodiment 5 of the present invention.

Fig. 7 is a structural diagram of Embodiment 6 of the present invention.

Fig. 8 is a structural diagram of Embodiment 7 of the present invention.

Fig. 9 is a structural diagram of Embodiment 8 of the present invention.

In the figure, STA refers to a station (Station), and IDMA refers to Interleave-Division Multiple Access (Interleave-Division Multiple Access).

detailed description

The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

Specific embodiment one

As shown in Figure 1, the embodiment side focuses on the implementation of the scheduling and competition fine-grained fusion method proposed by the present invention in the SCMA-based cellular network. In order to ensure compatibility, the wireless frame structure of this embodiment follows the fourth generation mobile communication system (4G) specification.

Step 1: At the beginning of each wireless frame scheduling period, the BS first sets the ratio of uplink and downlink time slots, and then proceeds to step 2;

Step 2: The BS calculates the time-frequency resource (Resource Block, RB) position that needs to be occupied by the scheduling-competition integrated access mode in the uplink time slot, and allocates the uplink RB for the scheduled user equipment, and the allocated RB is consistent with the scheduling- The RB overlap occupied by the competitive converged access mode is transferred to step 3;

Step 3: The BS broadcasts the resource allocation result through the Physical Downlink Control Channel (PDCCH), indicates the RB position occupied by the scheduling-competition converged access mode, and indicates the RB resource of the scheduled user equipment, for the scheduled The users of the user turn to step 4, and the user of competing access turns to step 5;

Step 4: The scheduled user equipment sends data through SCMA according to the allocated RB resources, and then proceeds to step 6;

Step 5: The competing access user equipment selects access according to the probability p, selects not to access according to the probability (1-p), if it chooses to access, then randomly selects an SCMA layer composed of several RBs, and sends data through SCMA, And turn to step 6; if you choose not to access, then give up this transmission opportunity, and this process ends;

The probability p is periodically set by the base station through downlink control signaling;

Step 6: The BS separates the information of each uplink user from the superimposed signals of the scheduled user and the competing user by means of multi-user joint detection, and the process ends.

Figure 2 describes the design of the BS receiver in Embodiment 1. In Embodiment 1, the RB resources corresponding to the scheduling-competition integrated access mode are allocated to some scheduling users and some competing users, and the scheduling user codebook is active. The codebook activity of competing users is unknown, so the BS needs to separate the signals of the two types of user equipment from the superimposed signals.

Step a): Construct the original codebooks corresponding to all scheduled user equipments into a deterministic codebook set. The set is not only known codebooks, but also the codebooks must be active. The active means that there must be users using the codebooks to send data, go to step b);

Step b): Add a constellation point (0, 0) to the original codebook corresponding to each competing user, which is called an incremental codebook, and make the incremental codebooks of all competing users into a codebook set whose activity is to be determined, The codebook in the set is known, but the activity is unknown, so go to step c);

Step c): Combine the deterministic codebook set and the active codebook set to be determined together to form the SCMA receiving codebook set, and then use the message passing algorithm to realize multi-user detection. If the determined codebook corresponds to a constellation of (0,0) , it is judged as inactive, otherwise, it is judged as active. The process ends.

Specific embodiment two

As shown in Figure 3, Embodiment 2 is based on the implementation method of Embodiment 1. The difference is that Embodiment 3 introduces uplink and downlink full-duplex technology. Therefore, in Embodiment 3, uplink scheduling, downlink scheduling, and competing users share the same RB resource.

Step 1: At the beginning of each wireless frame scheduling period, the BS first sets the ratio of uplink and downlink time slots, and then proceeds to step 2;

Step 2: The BS calculates the RB positions required by the integrated scheduling-competition access mode in the uplink time slot, and allocates uplink RBs and downlink RBs to the scheduled user equipment, and the allocated RBs are consistent with the integrated scheduling-competition access mode The occupied RBs overlap and go to step 3;

Step 3: The BS broadcasts the resource allocation result through the PDCCH, indicates the RB position occupied by the scheduling-competition integrated access mode, and indicates the RB resource of the scheduled user equipment, and for the scheduled user, go to step 4, and for the contention access The user goes to step 5;

Step 4: The scheduled user equipment transmits and receives data through SCMA according to the allocated RB resources, wherein the scheduled uplink user sends data, and the scheduled downlink user receives data from the BS, and proceeds to step 6;

Step 5: The competing access user equipment selects access according to the probability p, selects not to access according to the probability (1-p), if it chooses to access, then randomly selects an SCMA layer composed of several RBs, and sends data through SCMA, Go to step 6; if you choose not to access, then give up this transmission opportunity, and this process ends;

The probability p is set by the base station through downlink control signaling.

Step 6: The BS uses multi-user joint detection to separate the information of each uplink user from the superimposed scheduling user and competing user signals, and the user equipment uses the multi-user The joint detection method separates the downlink information required by itself, and the process ends.

Specific embodiment three

As shown in FIG. 4 , the third embodiment focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in a cellular network based on power Non-orthogonal Multiple Access (NOMA).

Step 1: For the same time slot, frequency and spatial stream, the BS divides resources into N power layers (Power Layer) from the power domain for multiple user equipments to send uplink data, each power layer corresponds to a different transmission power, Then go to step 2;

Step 2: The BS directly schedules a part of the power layers to corresponding uplink user equipments through downlink control signaling, and proceeds to step 3.

Step 3: The BS assigns the subset power layers of the remaining power layers in step 2 to the competing access uplink user equipment through the downlink control signaling, and proceeds to step 4 for the scheduled users, and transfers to step 5 for the contending access users;

Step 4: The scheduled user equipment transmits uplink data according to the power required by the allocated power layer, and proceeds to step 6;

Step 5: Competing for access User equipment selects access according to probability p, chooses not to access according to (1-p) probability, if chooses to access, randomly selects a power layer that can be used for competition, and selects according to the selected power layer Send uplink data with the required power, and go to step 6; if you choose not to access, give up this transmission opportunity, and this process ends.

The probability p is set by the base station through downlink control signaling;

Step 6: The BS separates the information of each user by means of multi-user joint detection from the superimposed signals of the scheduled user and the contending user, and the process ends.

Specific embodiment four

As shown in Figure 5, Embodiment 4 is based on the implementation method of Embodiment 3. The difference is that Embodiment 5 introduces uplink and downlink full-duplex technology. Therefore, in Embodiment 4, uplink scheduling, downlink scheduling, and competing users share the same RB resource .

Step 1: For the same time slot, frequency and spatial stream, the BS divides resources into N power layers (Power Layer) from the power domain, and proceeds to step 2;

Step 2: The BS directly schedules a part of the power layers to the corresponding uplink user equipment through downlink control signaling, and directly schedules a part of the remaining power layers to the corresponding downlink user equipment, and then proceeds to step 3;

Step 3: The BS allocates the subset power layers allocated to the remaining power layers after the uplink and downlink in step 2 to the contention access user equipment through downlink control signaling. For the scheduled users, go to step 4. For the contention access The user goes to step 5;

Step 4: The scheduled uplink user equipment sends uplink data according to the power required by the allocated power layer; the scheduled downlink user equipment waits to receive the downlink data, and proceeds to step 6;

Step 5: Competing for access The user equipment selects access according to the probability p, chooses not to access according to the probability (1-p), if it chooses to access, randomly selects a power layer that can be used for competition, according to the requirements of the selected power layer power to send uplink data, go to step 6; if you choose not to access, give up this transmission opportunity, and this process ends.

The probability p is set by the base station through downlink control signaling;

Step 6: The BS uses multi-user joint detection to separate the information of each uplink user from the superimposed scheduling user and competing user signals, and the user equipment uses the multi-user The joint detection method separates the downlink information required by itself, and the process ends.

Specific embodiment five

As shown in Figure 6, the fifth embodiment focuses on the implementation of the scheduling and competition fine-grained fusion method proposed by the present invention in the SCMA-based wireless LAN network. In order to ensure compatibility, the wireless frame structure of the sixth embodiment follows the IEEE802.11ax specification .

Step 1: Whenever the AP sends a trigger frame (Trigger Frame, TF), first calculate the time-frequency resource unit (Resource Unit, RU) position that needs to be occupied by the scheduling-competition integrated access method according to the scheduling algorithm, and set it as the scheduled The user equipment allocates uplink RUs, and the allocated RUs overlap with the RUs occupied by the scheduling-competition converged access mode, and go to step 2;

Step 2: The BS sends a TF frame to broadcast the resource allocation result, indicating the RU position occupied by the scheduling-competition integrated access mode, and indicating the RU resource of the scheduled user equipment. For the scheduled user, go to step 3. For the contention access Incoming users go to step 4;

Step 3: The scheduled user equipment sends data through SCMA according to the allocated RU resources, and then proceeds to step 5;

Step 4: The user equipment competing for access determines whether to access the TF this time based on the backoff strategy. If it chooses to access, randomly select an SCMA layer composed of several RUs, send data through SCMA, and go to step 5; if it chooses not to access, the transmission opportunity is given up, and the process ends.

Step 5: The AP uses a multi-user joint detection method to separate the information of each uplink user from the superimposed signals of the scheduled user and the competing user, and the process ends.

Specific embodiment six

As shown in FIG. 7 , the sixth embodiment focuses on implementing the fine-grained fusion method of scheduling and competition proposed by the present invention in a cellular network based on Multi-User Shared Access (MUSA).

Step 1: Each user equipment using the MUSA access method has a corresponding complex domain multi-code sequence corresponding to it, and then proceeds to step 2,

The multi-code sequence in the complex domain corresponding to the user equipment is obtained in one of the following two ways:

Mode 1: The BS assigns the complex domain multi-code sequence to the user equipment through downlink signaling;

Mode 2: The user equipment itself uniquely binds a multi-code sequence in the complex field;

Step 2: The BS schedules some users for uplink transmission through downlink control signaling, the BS goes to step 3, and the scheduled user equipment goes to step 4;

Step 3: The BS triggers the random access user to perform random access through the downlink control signaling, the BS proceeds to step 6, and the random access user equipment proceeds to step 5;

Step 4: The scheduled user equipment uses its corresponding complex domain multi-code to perform spread spectrum modulation and transmit uplink data, and then go to step 6;

Step 5: The competing access user equipment selects access according to the probability p, and selects not to access according to the probability (1-p). If it chooses to access, it uses its corresponding complex domain multi-code to perform spread spectrum modulation and transmit uplink data. The method is well-known in the industry, go to step 6; if you choose not to access, then give up this transmission opportunity, and this process ends.

The probability p is set by the base station through downlink control signaling;

Step 6: The BS separates the information of each user from the superimposed signals of the scheduling user and the competing user by means of serial interference cancellation, and the process ends.

Specific embodiment seven

As shown in FIG. 8 , the seventh embodiment focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in a cellular network based on Pattern-Division Multiple Access (PDMA).

Step 1: The base station pre-configures the PDMA multi-user coding matrix H _PDMA through downlink signaling, multiplies the multi-user coding matrix and the generalized channel matrix H _CH to form an equivalent channel transmission matrix H, and turns to step 2;

The PDMA multi-user encoding matrix _HPDMA is M rows and N columns, wherein the row set of _HPDMA represents a resource dimension, including one or more of the spatial domain dimension, the coding domain dimension and the power domain dimension, and each row pairs It should be a resource unit in the resource dimension. The column set of _HPDMA represents the user equipment, and each column corresponds to a user equipment; the value of each element is 1 or 0, where 1 means that the user corresponding to the column uses the user equipment corresponding to the row. Resource sending data, 0 means that the user corresponding to this column does not use the resource corresponding to this row to send data;

Step 2: The BS schedules some users for uplink transmission through the downlink control signaling, the BS goes to step 3, and the scheduled user equipment goes to step 4;

Step 3: The BS triggers the random access user to perform random access through the downlink control signaling, the BS proceeds to step 6, and the random access user equipment proceeds to step 5;

Step 4: The scheduled user equipment performs uplink data transmission based on the resource unit with a value of 1 in its own column in the PDMA multi-user coding matrix. This method is well known in the industry, and proceeds to step 6;

Step 5: Competing for access The user equipment selects access according to the probability p, and selects not to access according to the probability (1-p). If it chooses to access, the user equipment bases on the resources with a value of 1 in the corresponding column of the PDMA multi-user coding matrix itself Perform uplink data transmission on the unit, which is well known in the industry, and go to step 6; if you choose not to access, give up this transmission opportunity, and this process ends.

The probability p is set by the base station through downlink control signaling;

Step 6: The BS separates the information of each user from the superimposed signals of the scheduling user and the competing user by means of front-end detection and serial interference elimination, and the process ends.

Embodiment 8

As shown in FIG. 9 , the eighth embodiment focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in a cellular network based on Interleave-Division Multiple Access (IDMA).

Step 1: Each user equipment has a unique corresponding interleaving sequence, and the IDMA system distinguishes different user equipments based on the interleaving sequence, and proceeds to step 2;

The interleaving sequence is generated in the following three ways:

Mode 1: the base station assigns a unique interleaving sequence to each user equipment;

Mode 2: Each user equipment uniquely determines a static interleaving sequence;

Mode 3: The interleaving sequence of each user equipment changes randomly over time, but the interleaving sequence of the base station is consistent with the change of the interleaving sequence of the user equipment;

Step 2: The BS schedules a part of users for uplink transmission through downlink control signaling, and proceeds to step 3;

Step 3: The BS triggers the random access user to perform random access through downlink control signaling, and proceeds to step 4.

Step 4: The data of the scheduled user equipment first passes through the universal encoder, then passes through its own interleaver, and then is modulated and sent to the communication channel. This method is well known in the industry, and then go to step 6;

The general encoder has the following three forms:

Form 1: Only one forward error corrector;

Form 2: only one spreader;

Form 3: First pass through the forward error correction, and then pass through the spreader;

Step 5: Competing for access The user equipment selects access according to the probability p, chooses not to access according to the probability (1-p), if it chooses to access, the data of the user equipment first passes through the general encoder, and then passes through its own interleaver, Then it is modulated and sent to the communication channel. This method is well known in the industry, and then go to step 6; if you choose not to access, then give up this transmission opportunity, and this process ends.

The probability p is set by the base station through downlink control signaling;

Step 6: The BS uses a chip-level iterative decoder to separate the information of each user from the superimposed scheduling user and competing user signals, and the process ends.

Claims (2)

1. A non-orthogonal multiple access method based on fine-grained fusion of scheduling and contention, characterized in that it comprises the following steps: Step 1: Resource Allocation Phase The central node in the wireless network calculates the resource area and resource position occupied by the scheduling-competition integrated access mode, and allocates resources for the scheduling user in the above resource area, and turns to step 2; The central node refers to a base station in a cellular network, and refers to a wireless access point in a wireless local area network; The resource refers to a time-frequency two-dimensional resource, the resource size is measured by the number of time-frequency resource blocks, and the resource position is determined by the jth frequency unit of the ith time slot; Step 2: Resource indication phase Step 2.1: the central node sends a resource allocation instruction frame to the user equipment in the cell; Step 2.2: The RAIF indicates the resource position of the cell's scheduling-competition integrated access mode. The specific indication method is that the i-th time slot and the jth frequency are used for the scheduling-competition integrated access mode, and the indicated resource position is scheduled by the user shared with competing users; Step 2.3: RAIF indicates the resource allocation position for the scheduling user in the resource position of the scheduling-competition integrated access mode. The specific indication method is to allocate the jth frequency of the i-th time slot to the user equipment u, and go to step 3 ; Step 3: Scheduling-competition converged access Step 3.1: The scheduled user equipment implements uplink access by using non-orthogonal multiple access technology at the scheduled resource location; Step 3.2: Competing access users perform random competition at the resource location of the scheduling-competition integrated access method. If the competition is successful, non-orthogonal multiple access technology is used to achieve uplink access; if the competition fails, this access is abandoned; The random competition method includes but not limited to backoff method and p-probability method; Step 3.3: The scheduling users and competing users in steps 3.1 and 3.2 will share the same time-frequency resources, and the sent information will be superimposed on these shared time-frequency resources, and enter step 4; Step 4: Receiver user separation phase The receiving end parses the superimposed information of multiple users through the multi-user joint detection method, and the process ends. 2. The non-orthogonal multiple access method based on the fine-grained integration of scheduling and contention according to claim 1, characterized in that the non-orthogonal multiple access method based on the fine-grained integration of scheduling and contention as described If the SCMA method is adopted in the machine-user separation stage, the information analysis at the BS receiving end includes the following steps: Step a): Construct the original codebooks corresponding to all scheduled user equipments into a deterministic codebook set. The set is not only known codebooks, but also the codebooks must be active. The active means that there must be users using the codebooks to send data, go to step b); Step b): Add a constellation point (0, 0) to the original codebook corresponding to each competing user, which is called an incremental codebook, and make the incremental codebooks of all competing users into a codebook set whose activity is to be determined, The codebook in the set is known, but the activity is unknown, so go to step c); Step c): Combine the deterministic codebook set and the codebook set whose activity is to be determined together to form the SCMA receiving codebook set, and then use the message passing algorithm to realize multi-user detection. If the corresponding constellation of the determined codebook is (0, 0) , it is judged as inactive, otherwise, it is judged as active, and the process ends.