Signal receiving method network equipment

Abstract

The present application discloses a signal receiving method and network device. Wherein, the method includes: receiving a signal, the signal including information of at least two user nodes; determining a factor graph of the signal according to the resources multiplexed by each user node; determining to delete on each resource of the factor graph At least one subgraph obtained from m branches; wherein m is less than the number of user nodes corresponding to one resource, and the user nodes corresponding to all branches deleted on the at least one subgraph include all of the at least two user nodes. user node; iteratively update the at least one subgraph respectively to determine the codeword corresponding to the information of each user node; and obtain the codeword from the signal by parsing according to the codeword corresponding to the information of each user node Information of at least two user nodes. The application of the present invention helps to improve the iterative update efficiency of the factor graph, improve the performance of the MPA algorithm, and enhance the user experience.

Description

technical field [0001] The present application relates to the field of communication technologies, and in particular to a signal receiving method and network equipment. Background technique [0002] Sparse Code Multiple Access (abbreviation: SCMA) is a non-orthogonal multiple access (abbreviation: NOMA) technology in the code domain. Mapped to high-dimensional complex symbols, multiple users multiplex their own data on the same time-frequency resource to obtain a signal including the data of multiple users, and send the signal. When receiving a signal, the receiving end can perform multi-user detection on the signal through a message passing algorithm (Message Passing Algorithm, abbreviation: MPA), so as to obtain the data of the multiple users. However, the complexity of the MPA algorithm for multi-user detection is relatively high. [0003] At present, the complexity of the MPA algorithm can be reduced through the CMPA (Clustered MPA) algorithm. The main idea of ​​the C...

AI Technical Summary

Problems solved by technology

However, for the subgraph obtained by CMPA by deleting the branch of the factor graph, when performing the MPA algorithm iterative calculation on the subgraph, it is necessary to update a CMPA subgraph first, and then use the confidence information obtained by the updated CMPA subgraph as a priori Information, to update another CMPA subgraph, and iterate repeatedly in this way, which will inevitably lead to the iterative update of the two subgraphs in sequence, resulting in low iterative update efficiency

Moreover, in the subgraph of the CMPA algorithm, some users are deleted, and some users are not deleted, resulting in differences between users, which makes the performance of the algorithm poor

Images