Serial rearrangement receiving method based on sparse code multiple access and receiver

Abstract

The invention discloses a serial rearrangement receiving method and receiver based on sparse code multiple access, and relates to the technical field of communication, and the method comprises the steps: carrying out serial external iteration according to an initial confidence sequence based on received signals of a plurality of users and an initialized posterior log-likelihood ratio, and updating an external iteration round and carrying out decoding verification on the output first posterior log-likelihood ratio, and if there are unsuccessful decoding users and the external iteration round does not reach a threshold value, carrying out serial next round of external iteration according to the received signal and the first prior log-likelihood ratio of each unsuccessful decoding user. And updating an external iteration round and carrying out decoding verification based on the output second posterior log-likelihood ratio, and outputting a decoding bit sequence when an unsuccessful decoding user does not exist or the external iteration round reaches a threshold value. According to the scheme, the receiver performance of the sparse code multiple access system can be improved under the limited complexity.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a serial rearrangement receiving method and receiver based on sparse code multiple access. BACKGROUND

[0002] With the rapid development of mobile communication technology, users have increasing demand for high-speed, large connection and low-latency wireless communication. Non-orthogonal multiple access (NOMA) technology gradually becomes a key support for the future sixth generation mobile communication system due to its advantage of carrying higher throughput, and sparse code multiple access (SCMA) technology allows multiple users to share limited frequency domain or time domain resources. Due to its high spectral efficiency, higher channel capacity and good error correction performance, it has attracted widespread attention.

[0003] The existing sparse code multiple access technology usually uses an iterative detection and decoding (IDD) receiver. IDD allows the detector to use the soft information output from the decoder, thereby effectively eliminating inter-user interference. The existing IDD receiver usually completes decoding through multiple rounds of outer iteration based on the combination of a sparse code multiple access detector and a channel decoder. However, the parallel deployment of the channel decoder causes users to be unable to share soft information in the current iteration round, so that users with poor channel quality cannot efficiently use the decoding output soft information of other users to improve decoding. At the same time, all users need to complete the detection and decoding operation once in each iteration, and users who have been successfully decoded in the previous rounds still need to repeat the operation, which causes waste of computing resources and increases system complexity and power consumption. In addition, the required number of decoders is an integer multiple of the number of users, which limits the flexible deployment of the receiver in specific hardware implementation. Therefore, it is urgent to improve the receiver performance of the sparse code multiple access system under the existing limited complexity. SUMMARY

[0004] The present application provides a serial rearrangement receiving method and receiver based on sparse code multiple access, which is used to improve the receiver performance of the sparse code multiple access system under the existing limited complexity.

[0005] The first aspect of the present application provides a serial rearrangement receiving method based on sparse code multiple access, comprising:

[0006] determining the first a posteriori log likelihood ratio of each user and updating as a successfully decoded user or a unsuccessfully decoded user, and updating the external iteration round;

[0007] determining whether there is a unsuccessfully decoded user and whether the external iteration round reaches an external round threshold;

[0008] if there is and the external round threshold is not reached, performing external iteration of each unsuccessfully decoded user using the received signal and the first a posteriori log likelihood ratio of each user, determining the second a posteriori log likelihood ratio of each unsuccessfully decoded user and updating as a successfully decoded user or a unsuccessfully decoded user, and updating the external iteration round;

[0009] when it is determined that there is no unsuccessfully decoded user or the external iteration round reaches the external round threshold, outputting a decoded bit sequence composed of decoded bits of each user.

[0010] Further, the step of, when receiving the received signal of the superposition transmission of multiple users, determining the first a posteriori log likelihood ratio of each user and updating as a successfully decoded user or a unsuccessfully decoded user, and updating the external iteration round, comprises:

[0011] when receiving the received signal of the superposition transmission of multiple users, determining the first a posteriori log likelihood ratio of each user and updating as a successfully decoded user or a unsuccessfully decoded user, and updating the external iteration round, comprises:

[0012] performing message passing iterative detection using the received signal and the first a posteriori log likelihood ratio of each user, and outputting the first a posteriori log likelihood ratio of each user;

[0013] calculating real-time confidence degrees according to the first a posteriori log likelihood ratio of each user, and determining the order of the real-time confidence degrees;

[0014] selecting the user with the highest confidence degree as a to-be-decoded user according to the order of the real-time confidence degrees;

[0015] performing decoding based on the first a posteriori log likelihood ratio of the to-be-decoded user, and determining the corresponding first a posteriori log likelihood ratio;

[0016] performing decoding check using the first a posteriori log likelihood ratio, and determining the to-be-decoded user as a successfully decoded user or a unsuccessfully decoded user according to the determination result of whether decoding is successful;

[0017] The current first posterior log-likelihood ratio is used to update the initialized posterior log-likelihood ratio of each user to perform message passing iterative detection, and a new real-time confidence order is determined;

[0018] According to the real-time confidence order, the user with the highest confidence is selected as a new user to be decoded for decoding until the first posterior log-likelihood ratio of each user is determined and the user is updated to a successfully decoded user or a unsuccessfully decoded user, and the external iteration round is updated.

[0019] Further, the initialized posterior log-likelihood ratio is used for message passing iterative detection, and the first prior log-likelihood ratio of each user is output, including:

[0020] Based on the initialized posterior log-likelihood ratio, the prior log-likelihood ratio of any user at any current passing round is determined;

[0021] If the current passing round is 1, the average absolute value change is calculated using the initialized posterior log-likelihood ratio of any user and the prior log-likelihood ratio of the current passing round;

[0022] If the current passing round is greater than 1, the average absolute value change is calculated using the prior log-likelihood ratio of any user at the last passing round and the prior log-likelihood ratio of the current passing round;

[0023] When the average absolute value change is less than the change threshold or the current passing round reaches the passing round threshold, the prior log-likelihood ratio of the current passing round is output as the first prior log-likelihood ratio of any user.

[0024] Further, the decoding check is performed using the first posterior log-likelihood ratio, and the user to be decoded is determined to be a successfully decoded user or a unsuccessfully decoded user according to the determination result of the decoding success or failure, including:

[0025] The hard decision result of the first posterior log-likelihood ratio of the user to be decoded is used for decoding check;

[0026] If the decoding check is passed, it is determined to be a successfully decoded user, and the corresponding hard decision result is used as a decoded bit;

[0027] If there is a hard decision result that fails the decoding check, it is determined to be a unsuccessfully decoded user.

[0028] Further, the real-time confidence is the average mutual information based on the prior log-likelihood ratio.

[0029] The second aspect of the application provides a serial rearrangement receiver based on sparse code multiple access, including: a sparse code multiple access detector, a channel decoder and a decoding order controller;

[0030] The sparse code multiple access detector is used for: based on the received signal of the superposition transmission of multiple users, and the message passing iterative detection of each user or each unsuccessfully decoded user of the initialized a posteriori log likelihood ratio or the first a posteriori log likelihood ratio of each user, corresponding to determine the first a priori log likelihood ratio of each user or the second a priori log likelihood ratio of each unsuccessfully decoded user;

[0031] The channel decoder is used for: based on the first a priori log likelihood ratio or the second a priori log likelihood ratio, the decoding and decoding check are carried out, the first a posteriori log likelihood ratio of each user or the second a posteriori log likelihood ratio of each unsuccessfully decoded user is determined, the successfully decoded user or the unsuccessfully decoded user is updated and determined according to the first a posteriori log likelihood ratio or the second a posteriori log likelihood ratio, and the external iteration round is updated, and it is judged whether there is an unsuccessfully decoded user and whether the external iteration round reaches the external round threshold value, when it is determined that there is no unsuccessfully decoded user or the external iteration round reaches the external round threshold value, the decoding bit sequence composed of the decoding bits of each user is output.

[0032] The decoding order controller is used for: the real-time confidence order is determined by using the real-time confidence of the first a priori log likelihood ratio, or if there is an unsuccessfully decoded user and the external iteration round does not reach the external round threshold value, the real-time confidence order is determined by using the real-time confidence of the second a priori log likelihood ratio of each unsuccessfully decoded user, and the external iteration of the message passing iterative detection, the decoding and the decoding check of the sparse code multiple access detector and the channel decoder is controlled in series according to the real-time confidence order.

[0033] The third aspect of the present application provides a sparse code multiple access system, comprising: a transmitter and the serial rearrangement receiver based on the sparse code multiple access of the second aspect of the present application;

[0034] The transmitter is used for encoding and mapping the information bit sequence of multiple users to be superimposed and then transmitted to the receiver;

[0035] The serial rearrangement receiver based on the sparse code multiple access is used for receiving the received signal transmitted by the transmitter, and outputting the decoding bit sequence.

[0036] The fourth aspect of the present application provides a computer device, comprising a memory and a processor, the memory stores a computer program, and the computer program is executed by the processor to make the processor execute the steps of the serial rearrangement receiving method based on the sparse code multiple access of any one of the first aspects of the present application.

[0037] The fifth aspect of the present application provides a computer readable storage medium, which stores a computer program, and the computer program is executed to realize the serial rearrangement receiving method based on the sparse code multiple access of any one of the first aspects of the present application.

[0038] The sixth aspect of the present application provides a computer program product comprising computer programs / instructions which, when executed by a processor, implement the sparse code multiple access based serial rearrangement receiving method according to any one of the first aspect of the present application.

[0039] From the above technical solutions, the present application has the following advantages:

[0040] The above-mentioned scheme of the present application provides a sparse code multiple access based serial rearrangement receiving method, which comprises: when receiving a received signal of multiple user superposition transmission, performing message passing iterative detection based on the received signal and the initialized a posteriori log-likelihood ratio of each user in series to determine a first a posteriori log-likelihood ratio, and performing external iteration of decoding and decoding check in the order of real-time confidence corresponding to the first a posteriori log-likelihood ratio to determine the first a posteriori log-likelihood ratio of each user and update the successfully decoded users or the unsuccessfully decoded users, and update the external iteration round; judging whether there is an unsuccessfully decoded user and whether the external iteration round reaches an external round threshold; if there is and the external round threshold is not reached, performing external iteration of each unsuccessfully decoded user in series using the received signal and the first a posteriori log-likelihood ratio to determine the second a posteriori log-likelihood ratio of each unsuccessfully decoded user and update the successfully decoded users or the unsuccessfully decoded users, and update the external iteration round; when it is determined that there is no unsuccessfully decoded user or the external iteration round reaches the external round threshold, outputting a decoded bit sequence composed of the decoded bits of each user. Based on the above-mentioned scheme, a serial decoding structure of serial external iteration is adopted, and at the same time, the decoding time of the user is dynamically rearranged in each round of external iteration in the order of confidence, so that the user performing decoding later benefits from the latest soft information output of the user performing decoding, in addition, since the unsuccessfully decoded user is dynamically determined in each round of external iteration to perform the next round of iteration, not only the calculation resources are saved, but also the decoding times are allowed to be set to any integer according to the hardware conditions, and overall, a more flexible compromise between performance and complexity is achieved, which helps to improve the receiver performance of the sparse code multiple access system under limited complexity. BRIEF DESCRIPTION OF DRAWINGS

[0041] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed to be used in the embodiments or prior art description will be briefly introduced as follows. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without any creative labor.

[0042] Figure 1 A step flow chart of a sparse code multiple access based serial rearrangement receiving method provided for the first embodiment of the present application;

[0043] Figure 2 Block diagram of the sparse code multiple access system of the IDD receiver provided in the embodiment one of the present application;

[0044] Figure 3 IDD receiver and R-SDD receiver decoding sequence example provided in the embodiment one of the present application;

[0045] Figure 4 Comparison diagram of the calculation complexity of the single code word of the R-SDD receiver and the IDD receiver provided in the embodiment one of the present application;

[0046] Figure 5 Comparison diagram of the BER curve of the R-SDD receiver and the IDD receiver provided in the embodiment one of the present application Figure 1 ;

[0047] Figure 6 Comparison diagram of the BER curve of the R-SDD receiver and the IDD receiver provided in the embodiment one of the present application Figure 2 ;

[0048] Figure 7 Structure diagram of the serial rearrangement receiver based on the sparse code multiple access provided in the embodiment two of the present application;

[0049] Figure 8 Structure diagram of the sparse code multiple access system provided in the embodiment three of the present application. DETAILED DESCRIPTION

[0050] The embodiment of the present application provides a serial rearrangement receiver based on the sparse code multiple access, which is used for solving the technical problem of improving the receiver performance of the sparse code multiple access system under the existing limited complexity.

[0051] In order to make the technical scheme of the present application more clear and easy to understand, the technical scheme in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the embodiments described below are only part of the embodiments of the present application, not all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application. The terms "first", "second", etc. are used to distinguish similar objects, not necessarily to describe a specific order or sequence.

[0052] Please refer to Figure 1This invention provides a serial rearrangement receiving method (R-SDD) based on sparse code multiple access (SMILE). It should be noted that this embodiment is applied to a sparse code multiple access system, which typically includes a transmitter and a receiver. In the transmitter, the preferred channel coding scheme is P-LDPC code, and each user... Information bit sequence Encoded into codewords by the channel encoder ,in, Index for users , Total number of users For information bit length, For users The One information bit, For transpose, The length of the codeword. For users The Each encoded bit, then each coded bits Divided into a group The modulation order is given, and the size is determined according to the constellation diagram. constellation chart Mapped to a sparse code multiple access encoder dimensional modulation symbol sequence ,in, Each dimension corresponds to a specific resource. Due to the sparsity of sparse code multiple access systems... Most dimensions are zero. Ultimately, the modulated symbol sequences of all users are summed and transmitted through the channel to the receiver. The received signal acquired by the receiver is... in In order to receive signals, For users The channel fading vector, This is channel noise; the receiver receives... Then, the information bits are recovered according to the following method steps in this embodiment. In specific implementation, the method includes:

[0053] Step 101: When receiving signals transmitted by multiple users, the message passing iterative detection is performed serially based on the received signals and the initial posterior log-likelihood ratio of each user to determine the first prior log-likelihood ratio. Then, the external iteration of decoding and decoding verification is performed according to the real-time confidence level corresponding to the first prior log-likelihood ratio to determine the first posterior log-likelihood ratio of each user and update it to indicate whether the user has successfully decoded or not. The external iteration round is also updated.

[0054] Receiving signal refers to the corresponding signal collected by the user at the receiving end after the signal is transmitted at the sending end.

[0055] Log-likelihood ratio (LLR) refers to a logarithmic measure of the relative likelihood of a bit being 0 or 1, which is a kind of soft information. Posterior log-likelihood ratio refers to the log-likelihood ratio output by decoding iteration. Prior log-likelihood ratio refers to the log-likelihood ratio output by message passing iterative detection. It can be understood that the prior log-likelihood ratio and the posterior log-likelihood ratio obtained by completing any round of external iteration of different external iteration rounds can be distinguished by "first", "second", etc.

[0056] Initialization of posterior log-likelihood ratio refers to that in the first round of external iteration, message passing iterative detection is performed before decoding, and at this time, no corresponding posterior log-likelihood ratio is obtained from decoding in the message passing iterative detection process, so an initialization preset posterior log-likelihood ratio is given.

[0057] Real-time confidence refers to the confidence calculated in the external iteration process, and the confidence is used to evaluate the priority of user decoding. Real-time confidence order refers to an order composed of a plurality of real-time confidence orders.

[0058] Successfully decoded user refers to a user who has completed all decoding. Correspondingly, or unsuccessfully decoded user refers to a user who has not completed all decoding.

[0059] External iteration round refers to the cumulative number of times of completing one round of external iteration. Each round of external iteration includes message passing iterative detection, decoding and decoding check of all users which need to perform external iteration at present.

[0060] In one specific embodiment of the embodiment, step 101 includes the following sub-steps:

[0061] S11, when receiving the receiving signal superimposed by the plurality of users, determining the initialization posterior log-likelihood ratio of each user;

[0062] S12, performing message passing iterative detection on the receiving signal and the initialization posterior log-likelihood ratio of each user, and outputting the first prior log-likelihood ratio of each user;

[0063] S13, calculating the real-time confidence according to the first prior log-likelihood ratio of each user, and determining the real-time confidence order by sorting;

[0064] S14, selecting the user with the highest confidence as the user to be decoded according to the real-time confidence order;

[0065] S15, decoding based on the first a priori log likelihood ratio of the user to be decoded to determine the corresponding first a posteriori log likelihood ratio;

[0066] S16, decoding check using the first a posteriori log likelihood ratio, determining whether the user to be decoded is a successful decoding user or an unsuccessful decoding user according to the determination result of whether decoding is successful;

[0067] S17, message passing iterative detection of the user to be decoded using the current first a posteriori log likelihood ratio and the updated initialization a posteriori log likelihood ratio to determine the new real-time confidence order;

[0068] S18, selecting the user with the highest confidence as the new user to be decoded according to the real-time confidence order, and decoding until the first a posteriori log likelihood ratio of each user and the successful decoding user or the unsuccessful decoding user are determined, and the external iteration round is updated.

[0069] The user to be decoded refers to the user to be decoded in the current round of external iteration.

[0070] The user to be decoded refers to the user to be decoded in the current round of external iteration.

[0071] It should be noted that when receiving a received signal superimposed by multiple users, the embodiment adopts an external iteration method to obtain the decoding result of each user, and each round of external iteration sets a corresponding number of message passing iterative detection, decoding and decoding check according to the number of users to be decoded in the current round of external iteration;

[0072] Different from Figure 2 The traditional IDD receiving processing architecture shown in the figure adopts a method of completing decoding independently and in parallel for each user, and the embodiment adopts a serial decoding structure. In any round of external iteration, the message passing iterative detection-decoding between users is executed in series, so that the user to be decoded can use the updated a posteriori log likelihood ratio obtained after the decoding of the previous user to perform message passing iterative detection. For example, after the first user decodes to obtain the first a posteriori log likelihood ratio, the a posteriori log likelihood ratio used by the second user for message passing iterative detection is the first a posteriori log likelihood ratio of the first user and the initialization a posteriori log likelihood ratio of the other users except the first user. Meanwhile, the user with higher confidence is preferentially processed, so as to determine the first a priori log likelihood ratio and the first a posteriori log likelihood ratio of each user, and the determination result of decoding check based on the first a posteriori log likelihood ratio divides the user into a successful decoding user or an unsuccessful decoding user, and the external iteration round is updated to record.

[0073] In practical implementation, message passing iterative detection refers to iterative detection based on the message passing algorithm (MPA), with the received signal as its input. and The output is Each message passing iteration includes the detection. The next MPA iteration This represents the total number of inner iterations. Before starting the MPA inner iterations, first... ( Defined as the first In the next iteration of message passing, from the first The user node sends to the first Initialize the mutual information (transmitted by each resource node):

[0074]

[0075] In the formula, For users The posterior log-likelihood ratio, For users The One encoded bit, For users The The posterior log-likelihood ratio corresponding to each encoded bit; it can be understood that in the first round of external iteration, since message passing iteration detection precedes decoding, there is no external information provided by decoding at this time, hence the posterior log-likelihood ratio is... Initialize to 0, Initialized to After initialization is complete, begin executing the message passing iteration, starting with the first iteration. Taking the intra-message iteration as an example, each intra-MPA iteration includes the following three steps:

[0076] 1) Traverse all and Calculate the combinations respectively. Each resource node The mutual information transmitted between user nodes; for the first user node The resource node sends to the first The mutual information transmitted by each user node can be calculated using the following formula:

[0077]

[0078] In the formula, Index for users , For users The modulation symbol sequence, To pass round index , Index for users , For users The modulation symbol sequence, Indexing resource nodes , For the first Each resource node carries a set of users. For the first Remove users from the user set supported by each resource node Subset after, For noise variance, For the first The received signal of each resource node For the first The user to the Channel fading vectors of each resource node For the first The user in the first Modulation symbols on each resource node For the first In the next iteration of message passing, from the first The user node sends to the first The mutual information transmitted between resource nodes For the first In the next message passing iteration, the first The resource node sends to the first Mutual information transmitted between user nodes;

[0079] 2) Traverse all and Calculate the combinations respectively. Each user node to Mutual information transmitted between resource nodes:

[0080]

[0081] In the formula, For the first In the next iteration of message passing, from the first The user node sends to the first The mutual information transmitted between resource nodes For the size of the constellation chart, Indexing resource nodes , For users The set of resource nodes used For users Remove resource nodes from the set of resource nodes used a subset of For the first the mutual information transmitted by the jth resource node to the ith user node in the kth message passing inner iteration;

[0082] 3) Calculate the posterior probability of each modulation symbol and calculate the prior log-likelihood ratio:

[0083]

[0084]

[0085] wherein, is the modulation symbol sequence of the user, is the posterior probability, is the constellation size, is the modulation symbol of the user, is the prior log-likelihood ratio of the user in the kth message passing inner iteration, is the ith information bit, is the modulation symbol of the user corresponding to the information bit of 0 in the constellation, is the modulation symbol of the user corresponding to the information bit of 1 in the constellation. According to the above three steps, the process of the kth MPA inner iteration of the user is completed. The result of the last MPA inner iteration is taken as the prior log-likelihood ratio of the user in the message passing iteration detection output in the current outer iteration, that is, In a more specific embodiment of the present embodiment, the sub-step S12 comprises:

[0086] S121, based on the initialized posterior log-likelihood ratio of each user, the prior log-likelihood ratio of any user in any current transmission round is determined by message iteration transmission; S122, if the current transmission round is 1, the average absolute value change is calculated by using the initialized posterior log-likelihood ratio of any user and the prior log-likelihood ratio of the current transmission round; S123, if the current transmission round is greater than 1, the average absolute value change is calculated by using the prior log-likelihood ratio of any user in the last transmission round and the prior log-likelihood ratio of the current transmission round;

[0087]

[0088] S121, based on the initialized posterior log-likelihood ratio of each user, the prior log-likelihood ratio of any user in any current transmission round is determined by message iteration transmission;

[0089] S122, if the current transmission round is 1, the average absolute value change is calculated by using the initialized posterior log-likelihood ratio of any user and the prior log-likelihood ratio of the current transmission round;

[0090] S123, if the current transmission round is greater than 1, the average absolute value change is calculated by using the prior log-likelihood ratio of any user in the last transmission round and the prior log-likelihood ratio of the current transmission round; ​​​​​​​​​

[0091] S124, when the average absolute value change is less than the change threshold or the current transmission round reaches the transmission round threshold, output the prior log likelihood ratio of the current transmission round as the first prior log likelihood ratio of any user.

[0092] It should be noted that, in order to further reduce the complexity, the embodiment also introduces an intelligent early stop mechanism for message passing iterative detection, and the specific method is as follows: in each MPA inner iteration, the average absolute value change of the LLR values before and after is calculated, and when the average absolute value change is lower than the set change threshold, it is indicated that the information has converged, at this time, the MPA iteration is terminated, and the prior log likelihood ratio of the current transmission round is directly output as the first prior log likelihood ratio of any user. As output, subsequent invalid calculation is avoided; wherein, the calculation process of the average absolute value change includes:

[0093]

[0094] It can be understood that the mechanism utilizes the feature that the message passing iterative detection has completed most of the effective information exchange in the first few iterations; through testing, setting the change threshold to 30 can effectively reduce the complexity of the detector without significantly affecting the performance.

[0095] In specific implementation, the embodiment adopts belief propagation (BP) decoding for P-LDPC code, and the input is , and the output is , and the decoding process also includes round BP inner iteration, and the specific calculation process includes:

[0096] 1) calculate the likelihood information of :

[0097]

[0098] 2) calculate the likelihood information of :

[0099]

[0100] 3) calculate the posteriori likelihood information of :

[0101]

[0102] After the BP inner iteration is completed, the final is output.

[0103] wherein, is the check node index​ , For the first One verification node, Indexing variable nodes , For the first 1 variable node For from the first The verification node to the first Log-likelihood ratio of each variable node Indexing variable nodes , In order to be with the first The checkpoint is associated with the first one, in addition to the second one. The set of variable nodes outside of the variable nodes. For the first The variable node to the first The log-likelihood ratio of each verification node It is the hyperbolic tangent function. For the first The variable node to the first The log-likelihood ratio of each verification node For the verification node index , For the first The variable node is associated with the first variable node, in addition to the first variable node. The set of verification nodes outside of the existing verification nodes. For from the first The verification node to the first Log-likelihood ratio of each variable node For users The prior log-likelihood ratio.

[0104] In a more specific embodiment of this example, sub-step S16 includes:

[0105] S161. Use the hard decision result of the first posterior log-likelihood ratio of the user to be decoded for decoding verification;

[0106] S162. If the decoding verification is passed, the user is determined to be a successful decoder, and the corresponding hard decision result is used as the decoded bit.

[0107] S163. If there is a hard decision result that fails the decoding verification, then the corresponding user is identified as having failed the decoding.

[0108] It should be noted that the decoding check is a check to determine whether decoding has been successful, and this can be set according to the specific encoding situation; taking P-LDPC (Prototype Low-Density Parity-Check) code as an example, its corresponding decoding check can use parity checking, one... P-LDPC codes contain A parity check equation, The length of the codeword. Let LLR be the length of the information bits. If the LLR obtained by a user after decoding passes all parity checks (i.e., the hard decision result of the LLR satisfies all parity check equations), the user is considered to have successfully decoded. This is used to distinguish between successful decoding users and those who have successfully decoded. The hard decision result of a successful decoding user is then determined as the decoded bits.

[0109] In one specific implementation of this embodiment, the real-time confidence level is the average mutual information based on the prior log-likelihood ratio.

[0110] It should be noted that this embodiment uses Average Mutual Information (AMI) as the criterion for evaluating the confidence level of each user, and its calculation formula is as follows:

[0111]

[0112]

[0113] in, Indicates the first Average mutual information per user Represents the mathematical expectation function, This is a function that converts the log-likelihood ratio into mutual information.

[0114] Step 102: Determine if there are any users who have failed to decode and whether the external iteration round has reached the external round threshold.

[0115] It should be noted that for each round of external iteration, the external iteration stopping condition is set when all users have successfully decoded (i.e., the verification constraint is met), or when the set external round threshold is reached (such as the maximum number of external iterations, which is usually 5 to 10 times).

[0116] Step 103: If the external round threshold exists but has not been reached, the received signal and each first posterior log-likelihood ratio are used to perform external iterations for each unsuccessfully decoded user in sequence, determine the second posterior log-likelihood ratio of each unsuccessfully decoded user and update it to either a successfully decoded user or an unsuccessfully decoded user, and update the external iteration round.

[0117] It should be noted that if there are users that have not been successfully decoded and the external iteration round has not reached the external round threshold, it means that the external iteration needs to continue, at this time, the successfully decoded users will no longer participate in the subsequent external iteration to save computing resources, so the confidence evaluation is performed again for each user that has not been successfully decoded to determine a new real-time confidence order for decoding, in a specific implementation, the similar process of step 101 is performed for serial decoding and dynamic decoding order rearrangement, including the following sub-steps:

[0118] S21, performing message passing iterative detection on the users that have not been successfully decoded according to the received signal and each first a posteriori log likelihood ratio, and outputting a second a posteriori log likelihood ratio of each user that has not been successfully decoded;

[0119] S22, determining a real-time confidence order by sorting according to the real-time confidence of each second a posteriori log likelihood ratio;

[0120] S23, selecting a user with the highest confidence as a user to be decoded according to the real-time confidence order;

[0121] S24, performing decoding based on the second a posteriori log likelihood ratio of the user to be decoded to generate a corresponding second a posteriori log likelihood ratio;

[0122] S25, performing decoding verification using the second a posteriori log likelihood ratio, and determining whether the user to be decoded is a new successfully decoded user or a new user that has not been successfully decoded according to the determination result of whether the decoding is successful;

[0123] S26, performing message passing iterative detection on the users that have not been decoded using the updated first a posteriori log likelihood ratio corresponding to the current second a posteriori log likelihood ratio to determine a new real-time confidence order;

[0124] S27, selecting a user with the highest confidence as a new user to be decoded according to the real-time confidence order, and performing decoding until the second a posteriori log likelihood ratio of each user that has not been successfully decoded in the last external iteration round is determined to be a successfully decoded user or a user that has not been successfully decoded, and the external iteration round is updated.

[0125] Step 104, when it is determined that there is no user that has not been successfully decoded or the external iteration round has reached the external round threshold, outputting a decoding bit sequence composed of decoding bits of each user.

[0126] It should be noted that if the external iteration stop condition is met, the decoding bit sequence composed of decoding bits of each user is output As the output of the decoding result, if the external iteration stopping condition is not met, the real-time confidence of each unsuccessfully decoded user is calculated by using the received signal and the second posterior log-likelihood ratio of each unsuccessfully decoded user according to the similar process of step 103, the real-time confidence order is determined, and the external iteration is continued according to the real-time confidence order until it is determined that there is no unsuccessfully decoded user or the external iteration round reaches the external round threshold, and the decoding result is output.

[0127] To better illustrate the technical effect of the embodiment, refer to Figures 3 to 6 , the scheme of the embodiment is applied to the receiver, and is compared with the traditional IDD receiver:

[0128] 1) In order to more intuitively show the decoding order dynamic rearrangement mechanism, in Figure 3 , the decoding order of the traditional IDD receiver and the proposed R-SDD receiver is compared. In this example, user 3 has the lowest confidence, which is the performance bottleneck of the whole system, and user 5 and user 6 have the highest confidence. In the traditional IDD receiver, the decoding of each user is independently and parallelly executed. In the R-SDD receiver, user 3 is always placed at the end for decoding, so that it fully enjoys the extrinsic information provided by other users, thereby accelerating the system convergence;

[0129] 2) In Figure 4 , the computational complexity of a single codeword of the proposed R-SDD receiver and the traditional IDD receiver is compared. The channel coding scheme uniformly uses a (3, 6) regular trellis code with a code length of 2400, Figure 4 (a) is the complexity of addition operation, Figure 4 (b) is the complexity of tanh operation. In order to make a fair comparison, the intelligent early stopping mechanism is deployed in both receivers, wherein, represents the maximum number of decoders allowed by the system. It can be seen that, compared with the traditional IDD receiver, the proposed R-SDD receiver has lower computational complexity;

[0130] 3) In order to verify the effectiveness of the proposed R-SDD receiver, bit error rate (BER) performance simulation is carried out in a 6-user, 4-resource sparse code multiple access system, wherein all receivers uniformly use a MU-2 trellis code with a code rate of 1 / 2 and a code length of 2400, and the BP algorithm is used for decoding, the maximum BP iteration number is 100, and the simulation is based on the AWGN channel. The BER simulation result is shown in Figures 5 to 6 Figure 5 The same ​The performance of the proposed R-SDD receiver and the traditional IDD receiver can be observed, and it can be observed that the R-SDD receiver brings considerable performance gain, and it should be noted that the performance gain is achieved without sacrificing complexity. Figure 6 In the embodiment, different The number of decoders of the traditional IDD receiver must be set as an integer multiple of the number of users, and the arbitrary designation of the number of decoders of the R-SDD receiver is more prominent, which shows the flexibility of the R-SDD receiver.

[0131] In conclusion, compared with the existing IDD receiver, the R-SDD receiver has better performance, lower computational complexity and more flexible hardware deployment.

[0132] In the embodiment, a serial decoding structure is adopted, and the decoding time of the user is dynamically adjusted in each round of external iteration through the confidence order, the user with the lowest current confidence is arranged for processing last, so that the user benefits from the latest soft information output of other users, and in addition, the user that fails to be decoded is dynamically determined in each round of external iteration to perform the next round of external iteration, which not only saves the computing resources, but also allows the number of decoding times to be set as an arbitrary integer according to the hardware condition, and overall, higher mutual information propagation efficiency brings lower bit error rate and lower computational complexity, and a more flexible compromise between performance and complexity is achieved.

[0133] Referring to Figure 7 The serial rearrangement receiver based on sparse code multiple access provided in the embodiment two comprises a sparse code multiple access detector, a channel decoder and a decoding order controller.

[0134] The sparse code multiple access detector is configured to perform message passing iterative detection on each user or each user that fails to be decoded based on a received signal of superimposed transmission of a plurality of users and an initialized a posteriori log likelihood ratio or a first a posteriori log likelihood ratio of each user, so as to determine a first a priori log likelihood ratio of each user or a second a priori log likelihood ratio of each user that fails to be decoded.

[0135] The channel decoder is configured to perform decoding and decoding check based on the first a priori log likelihood ratio or the second a priori log likelihood ratio, to determine a first a posteriori log likelihood ratio of each user or a second a posteriori log likelihood ratio of each user that fails to be decoded, to update the user that succeeds to be decoded or the user that fails to be decoded and the number of external iteration rounds according to the first a posteriori log likelihood ratio or the second a posteriori log likelihood ratio, and to judge whether there is the user that fails to be decoded and whether the number of external iteration rounds reaches an external round threshold value.

[0136] The decoding order controller is used to: determine the real-time confidence order by using the real-time confidence of each first prior log-likelihood ratio, or if there are users who have failed to decode and the external iteration round has not reached the external round threshold, determine the real-time confidence order by using the real-time confidence of each user who has failed to decode by using the second prior log-likelihood ratio, and control the sparse code multiple access detector and channel decoder to perform external iterations of message passing iteration detection, decoding and decoding verification in sequence according to the real-time confidence order.

[0137] It should be noted that, in this embodiment, under the control of the decoding sequence controller according to the confidence order of the corresponding processes, message passing iteration detection is performed by a sparse code multiple access detector. The sparse code multiple access detector can be a sparse code multiple access detector based on a message passing algorithm (MPA). Decoding, decoding verification, external iteration stop determination, and output of decoded bits are performed by a channel decoder. The channel decoder can be a belief propagation (BP) decoder.

[0138] Each round of external iteration is... A sparse code multiple access detector and It consists of a channel decoder, in which This indicates the number of users who have not yet successfully decoded the code in the initial first round of external iterations. , For the total number of users, and in subsequent external iterations ;

[0139] Within each external iteration, the channel decoders of each user are serially connected through a sparse code multiple access detector, so that the user who decodes later can utilize the mutual information of the users who decoded earlier. Thus, the R-SDD receiver has a serial decoding structure.

[0140] In each external iteration, the R-SDD receiver uses a decoding order controller to prioritize users with higher confidence levels, achieving serial decoding and dynamic decoding order reordering. Thanks to the above design, the R-SDD receiver can enable all users to make full use of the external information provided by the decoded users, accelerating convergence. At the same time, the external iteration can be stopped when the slowest convergent user successfully decodes, effectively reducing complexity.

[0141] In one specific embodiment of this example, the sparse code multiple access detector is specifically used for: when receiving received signals superimposed from multiple users, determining the initial posterior log-likelihood ratio of each user; performing message passing iterative detection using the received signals and each initial posterior log-likelihood ratio, and outputting the first prior log-likelihood ratio of each user; and performing message passing iterative detection using the updated initial posterior log-likelihood ratio corresponding to the current first posterior log-likelihood ratio for undecoded users, and determining the first prior log-likelihood ratio of the undecoded users.

[0142] The channel decoder is specifically used for: decoding based on the first prior log-likelihood ratio of the user to be decoded, and determining the corresponding first posterior log-likelihood ratio; performing decoding verification using the first posterior log-likelihood ratio, and determining whether the user to be decoded is a successful decoder or a failed decoder based on the result of whether the decoding was successful; until the first posterior log-likelihood ratio of each user is determined and updated to a successful decoder or a failed decoder, and the external iteration round is updated.

[0143] The decoding order controller is specifically used to: calculate the real-time confidence level based on each first prior log-likelihood ratio, sort and determine the real-time confidence level order; and select the user with the highest confidence level as the user to be decoded according to the real-time confidence level order.

[0144] In a more specific implementation of this embodiment, message passing iterative detection is performed using the received signal and each initialized posterior log-likelihood ratio, outputting the first prior log-likelihood ratio for each user, including:

[0145] Based on the initial posterior log-likelihood ratio, the message is iteratively passed to determine the prior log-likelihood ratio of any user in any current passing round.

[0146] If the current transmission round is 1, the mean absolute change is calculated by using the initial posterior log-likelihood ratio of any user and the prior log-likelihood ratio of the current transmission round.

[0147] If the current transmission round is greater than 1, the average absolute value change is calculated by comparing the prior log-likelihood ratio of any user in the previous transmission round with the prior log-likelihood ratio of the current transmission round.

[0148] When the change in the average absolute value is less than the change threshold or the current transmission round reaches the transmission round threshold, the prior log-likelihood ratio of the current transmission round is output as the first prior log-likelihood ratio of the user to be decoded.

[0149] It should be noted that the R-SDD receiver also introduces an intelligent early stopping mechanism for the MPA detector. This mechanism determines whether the information has converged by measuring the change in the average absolute value of the log-likelihood ratio. This mechanism leverages the characteristic that the MPA detector has already completed most of the effective information exchange in the first few iterations, thus avoiding subsequent invalid computations.

[0150] In one specific implementation of this embodiment, the channel decoder is specifically used to: perform decoding verification using the hard decision result of the first posterior log-likelihood ratio of the user to be decoded; if the decoding verification is passed, the user is determined to be a successful decoder, and the corresponding hard decision result is used as the decoded bit; if there is a hard decision result that fails the decoding verification, the user is determined to be a failed decoder.

[0151] In one specific implementation of this embodiment, the real-time confidence level is the average mutual information based on the prior log-likelihood ratio.

[0152] In one specific embodiment of this example, the sparse code multiple access detector is specifically configured to: perform message passing iterative detection on undecoded users based on the received signal and each first posterior log-likelihood ratio, and output the second prior log-likelihood ratio of each undecoded user; perform message passing iterative detection on undecoded users with the current second posterior log-likelihood ratio corresponding to each updated first posterior log-likelihood ratio, and determine the second prior log-likelihood ratio of the undecoded user; until the second posterior log-likelihood ratio of each undecoded user in the previous external iteration round is determined and updated to either a successfully decoded user or an unsuccessfully decoded user, and the external iteration round is updated.

[0153] The channel decoder is specifically used for: decoding based on the second prior log-likelihood ratio of the user to be decoded, generating the corresponding second posterior log-likelihood ratio; using the second posterior log-likelihood ratio for decoding verification, and determining whether the user to be decoded is a new successful decoding user or a new unsuccessful decoding user based on the determination result of whether the decoding was successful.

[0154] The decoding order controller is specifically used to: sort and determine the real-time confidence order by using the real-time confidence levels of each second prior log-likelihood ratio; and select the user with the highest confidence level as the user to be decoded according to the real-time confidence order.

[0155] In this embodiment of the invention, a serial decoding structure with serial external iterations is adopted. At the same time, the decoding timing of users is dynamically adjusted in each round of external iteration by the confidence order, and the user with the "lowest confidence" is arranged to be processed last, so that it can benefit from the latest soft information output of other users. In addition, since the user who failed to decode is dynamically determined to proceed to the next round of iteration in each round of external iteration, this not only saves computing resources, but also allows the number of decoding attempts to be set to any integer according to hardware conditions. Overall, the higher mutual information propagation efficiency enables the R-SDD receiver to have a lower bit error rate and lower computational complexity, achieving a more flexible trade-off between performance and complexity.

[0156] Please see Figure 8 The sparse code multiple access system provided in Embodiment 3 of the present invention includes: a transmitter and a serial rearrangement receiver based on sparse code multiple access as described in Embodiment 2 of the present invention;

[0157] A transmitter is used to encode and map the bit sequences of information from multiple users, then transmit them to a receiver.

[0158] A serial rearrangement receiver based on sparse code multiple access is used to receive the received signal transmitted by the transmitter and decode it to output a decoded bit sequence.

[0159] It should be noted that the transmitter includes a channel encoder and a sparse code encoder. For the specific processing principle, please refer to the existing technology. Thanks to the design of the R-SDD receiver, the R-SDD receiver enables all users to make full use of the external information provided by the decoded users, which accelerates the overall convergence of the system. At the same time, the system can stop external iteration when the slowest convergent user successfully decodes, which effectively reduces the system complexity and allows the number of decoding times to be set to any integer according to the hardware conditions, thus achieving flexibility and efficiency optimization.

[0160] Embodiment 4 of the present invention also provides a computer device, including a memory and a processor, wherein the memory stores a computer program; when the computer program is executed by the processor, the processor performs the steps of the serial rearrangement reception method based on sparse code multiple access as described in any of the above embodiments.

[0161] Embodiment 5 of the present invention also provides a computer-readable storage medium storing a computer program / instructions thereon, which, when executed by a processor, implements the steps of the serial rearrangement reception method based on sparse code multiple access as described in any of the above embodiments.

[0162] Embodiment 6 of the present invention also provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the steps of the serial rearrangement reception method based on sparse code multiple access as described in any of the above embodiments.

[0163] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working process of the system and receiver described above can be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0164] In the several embodiments provided in this application, it should be understood that the disclosed systems, receivers, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or modules may be electrical, mechanical, or other forms.

[0165] The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical modules; that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0166] Furthermore, the functional modules in the various embodiments of the present invention can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0167] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0168] The above-described embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method of serially-reordered reception based on sparse code multiple access, characterized in that, The method comprises the following steps: When receiving a received signal of superimposed transmission of multiple users, first a priori log likelihood ratios (LLRs) are determined based on the received signal and initialized a posteriori LLRs of the users by serial message passing iterative detection, and then external iterations of decoding and decoding check are performed according to a real-time confidence order corresponding to the first a priori LLRs, so as to determine first a posteriori LLRs of the users and update the users into successfully decoded users or unsuccessfully decoded users, and update an external iteration round; It is judged whether there is an unsuccessfully decoded user and whether the external iteration round reaches an external round threshold; If there is an unsuccessfully decoded user and the external iteration round does not reach the external round threshold, then external iterations of the unsuccessfully decoded users are performed by using the received signal and the first a posteriori LLRs of the users in series, so as to determine second a posteriori LLRs of the unsuccessfully decoded users and update the users into successfully decoded users or unsuccessfully decoded users, and update the external iteration round; When it is determined that there is no unsuccessfully decoded user or the external iteration round reaches the external round threshold, a decoded bit sequence composed of decoded bits of the users is output.

2. The serial-reordering reception method based on sparse code multiple access according to claim 1, characterized in that, The method for determining the first a priori LLRs when receiving the received signal of superimposed transmission of the multiple users based on the received signal and the initialized a posteriori LLRs of the users by serial message passing iterative detection, and performing the external iterations of decoding and decoding check according to the real-time confidence order corresponding to the first a priori LLRs, so as to determine the first a posteriori LLRs of the users and update the users into the successfully decoded users or the unsuccessfully decoded users, and update the external iteration round, comprises the following steps: When receiving the received signal of superimposed transmission of the multiple users, the initialized a posteriori LLRs of the users are determined; Message passing iterative detection is performed by using the received signal and the initialized a posteriori LLRs of the users, so as to output the first a priori LLRs of the users; Real-time confidences are calculated according to the first a priori LLRs, and a real-time confidence order is determined by sorting; According to the real-time confidence order, a user with the highest confidence is selected as a user to be decoded; Decoding is performed based on the first a priori LLR of the user to be decoded, so as to determine a corresponding first a posteriori LLR; Decoding check is performed by using the first a posteriori LLR, and a determination result of whether decoding is successful is used to determine that the user to be decoded is a successfully decoded user or an unsuccessfully decoded user; Message passing iterative detection is performed on the unsuccessfully decoded users by using the current first a posteriori LLR corresponding to the updated initialized a posteriori LLRs of the users, so as to determine a new real-time confidence order; According to the real-time confidence order, a user with the highest confidence is selected as a new user to be decoded, and decoding is performed until the first a posteriori LLRs of the users and the successfully decoded users or the unsuccessfully decoded users are determined, and the external iteration round is updated.

3. The method of claim 2, wherein, The method for performing the message passing iterative detection by using the initialized a posteriori LLRs of the users to output the first a priori LLRs of the users comprises the following steps: Message iterative passing is performed based on the initialized a posteriori LLRs of the users, so as to determine a priori LLR of any user at any current passing round; If the current passing round is 1, then an average absolute value change is calculated by using the initialized a posteriori LLR of any user and the priori LLR at the current passing round. If the current passing round is greater than 1, an average absolute value change is calculated by using a priori log-likelihood ratio of any user in the last passing round and a priori log-likelihood ratio of the current passing round; When the average absolute value change is less than a change threshold or the current passing round reaches a passing round threshold, the priori log-likelihood ratio of the current passing round is output as the first priori log-likelihood ratio of any user.

4. The method of claim 2, wherein, The decoding check using the first posteriori log-likelihood ratio, and determining the user to be decoded as a successfully decoded user or a unsuccessfully decoded user according to the determination result of whether the decoding is successful, comprises: Decoding check using the hard decision result of the first posteriori log-likelihood ratio of the user to be decoded; If the decoding check is passed, the user to be decoded is determined as a successfully decoded user, and the corresponding hard decision result is taken as a decoded bit; If there is a hard decision result that fails the decoding check, the corresponding user to be decoded is determined as a unsuccessfully decoded user.

5. The method of Claim 1, wherein, The real-time confidence is the average mutual information based on the priori log-likelihood ratio.

6. A serial-reordering receiver based on sparse code multiple access, characterized in that, Comprise: A sparse code multiple access detector, a channel decoder and a decoding order controller; The sparse code multiple access detector is configured to: based on the received signal of the superimposed transmission of the plurality of users, and the initialized posteriori log-likelihood ratio or the first posteriori log-likelihood ratio of each user, perform message passing iterative detection on each user or each unsuccessfully decoded user, and correspondingly determine the first posteriori log-likelihood ratio of each user or the second posteriori log-likelihood ratio of each unsuccessfully decoded user; The channel decoder is configured to: based on the first posteriori log-likelihood ratio or the second posteriori log-likelihood ratio, perform decoding and decoding check, determine the first posteriori log-likelihood ratio of each user or the second posteriori log-likelihood ratio of each unsuccessfully decoded user, update the successfully decoded user or the unsuccessfully decoded user and the outer iteration round according to the first posteriori log-likelihood ratio or the second posteriori log-likelihood ratio, and determine whether there is an unsuccessfully decoded user and whether the outer iteration round reaches an outer round threshold, and when it is determined that there is no unsuccessfully decoded user or the outer iteration round reaches the outer round threshold, output a decoded bit sequence composed of the decoded bits of each user; The decoding order controller is configured to: determine a real-time confidence order using the real-time confidence of the first posteriori log-likelihood ratio, or if there is an unsuccessfully decoded user and the outer iteration round does not reach the outer round threshold, determine a real-time confidence order using the real-time confidence of the second posteriori log-likelihood ratio of each unsuccessfully decoded user, and control the sparse code multiple access detector and the channel decoder to perform message passing iterative detection, decoding and decoding check in series according to the real-time confidence order.

7. A sparse code multiple access system, characterized by, Comprise: A transmitter and the serial rearrangement receiver based on sparse code multiple access of claim 6; The transmitter is configured to superimpose and transmit the information bit sequence of the plurality of users to the receiver after encoding and mapping; The serial rearrangement receiver based on sparse code multiple access is configured to receive the received signal transmitted by the transmitter, and perform decoding to output a decoded bit sequence.

8. A computer device, comprising: A computer program product comprising a memory having computer program stored therein and a processor, wherein the computer program is executable by the processor to cause the processor to perform the steps of the method of serial rearranged reception based on sparse code multiple access according to any one of claims 1-5.

9. A computer readable storage medium having stored thereon computer programs / instructions, characterized in that, The computer program / instructions, when executed by the processor, implement the steps of the method of serial rearranged reception based on sparse code multiple access according to any one of claims 1-5.

10. A computer program product comprising computer programs / instructions, characterized in that, The computer program / instructions, when executed by the processor, implement the steps of the method of serial rearranged reception based on sparse code multiple access according to any one of claims 1-5.

Images