Transmission method and apparatus, communication device, and readable storage medium

Abstract

The application discloses a transmission method and device, communication equipment and a readable storage medium. The method comprises the following steps: obtaining a pilot information bit sequence and a data information bit sequence according to an information load; obtaining a header part according to the pilot information bit sequence; obtaining an IDMA encoding part according to the pilot information bit sequence and a first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence; and obtaining a data packet according to the header part and the IDMA encoding part.

Description

Technical Field

[0001] This application belongs to the field of communication technology, specifically relating to a transmission method, apparatus, communication equipment, and readable storage medium. Background Technology

[0002] Giant address access (GMA) is a multiple access technology based on a non-cooperative mechanism that supports a massive number of connections. From the theoretical perspective of multiple access channels, GMA breaks through the previous capacity domain optimization approach, using the average error rate per user as the optimization target in large-scale access networks, greatly improving access efficiency while ensuring access reliability. From the perspective of mobile communication system technology evolution, GMA has stronger overload resistance than cooperative non-orthogonal multiple access (NOMA) technology, and eliminates the signaling overhead and latency generated during cooperation, thus meeting the requirements of low-latency, short-packet transmission. The transmitting end adopts a passive, same-codebook, high-energy-efficiency design, adapting to the trend of massive, simplified, and low-power industrial internet access devices. Therefore, GMA has become a key focus of 6G network air interface standardization.

[0003] In current giant address access coding design, the problem of increased multiple access interference caused by the growth in the number of users is an urgent issue that needs to be addressed. Summary of the Invention

[0004] This application provides a transmission method, apparatus, communication device, and readable storage medium that can solve the problem of increased multiple access interference caused by the growth of the number of users.

[0005] Firstly, a data processing method is provided, applied at the sending end, including:

[0006] Based on the information payload, the pilot information bit sequence and the data information bit sequence are obtained;

[0007] The header portion is obtained based on the pilot information bit sequence;

[0008] Based on the pilot information bit sequence and the first bit sequence, the interleaved split multiple access (IDMA) coding part is obtained, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence;

[0009] The data packet is obtained based on the header and IDMA encoding portions.

[0010] Optionally, the method further includes:

[0011] The data packet is transmitted in a single time slot;

[0012] or,

[0013] The data packets are sent using a multi-timeslot mapping method.

[0014] Optionally, the data packet is sent via multi-timeslot mapping, including:

[0015] Based on the mapping pattern vector, the data packet is mapped to multiple time slots, and the mapped data packet is sent.

[0016] Optionally, the data packet is mapped to multiple time slots according to the mapping pattern vector, and the mapped data packet is sent, including:

[0017] Obtain the mapped pattern vector;

[0018] The data packet is mapped to position 1 in the mapping pattern vector, and the data packet at position 1 is sent.

[0019] Optionally, obtaining the mapping pattern vector includes:

[0020] Based on the unequal diversity degree, the random repetition count β of the data packet is obtained. l ;

[0021] Based on the number of random repetitions β l Get a top β l A vector with 1 element in each position and 0 elements in the other positions, and a total length of V;

[0022] The vector is uniformly and randomly interwoven so that element 1 is evenly distributed at all positions, thus obtaining the mapping pattern vector;

[0023] Where V represents the total number of time slots.

[0024] Optionally, the method further includes:

[0025] Obtain configuration information, which includes: number of active users and / or number of time slots;

[0026] Based on the configuration information and at least one of the following: serial interference elimination SIC convergence optimization objective, SIC start-up condition optimization objective, and packet coding energy efficiency optimization objective, an unequal diversity distribution is obtained.

[0027] Optionally, the SIC convergence optimization objective refers to an unequal diversity distribution that satisfies SIC iterative convergence and minimizes the time slot collision threshold.

[0028] Optionally, the optimization objective of the SIC startup conditions refers to: simulating the SIC process through Monte Carlo simulation to verify whether the SIC process can be started with a preset probability under multiple Monte Carlo simulations.

[0029] Optionally, the data packet coding energy efficiency optimization objective refers to the unequal diversity distribution corresponding to the lowest signal-to-noise ratio (SNR) value after data packet coding.

[0030] Optionally, the first bit sequence is obtained by repeatedly encoding the data information bit sequence, including:

[0031] The data information bit sequence is encoded using a channel encoder to obtain an initial bit sequence;

[0032] The initial bit sequence is repeatedly encoded to obtain the first bit sequence.

[0033] Optionally, based on the pilot information bit sequence and the first bit sequence, the IDMA encoded portion is obtained, including:

[0034] Based on the first bit sequence and the interleaver pattern corresponding to the pilot information bit sequence, the interleaved second bit sequence is obtained;

[0035] The IDMA coded portion is obtained based on the second bit sequence and the preset modulation constellation table.

[0036] Secondly, a data processing method is provided for use at a receiving end, including:

[0037] The data packet is received, the data including a header and an IDMA encoded portion. The IDMA encoded portion is obtained by the transmitting end based on the pilot information bit sequence and a first bit sequence, the first bit sequence being obtained by repeatedly encoding the data information bit sequence.

[0038] Optionally, the method includes:

[0039] If the data packet is sent by the sender through a single time slot, the information payload of the data packet is obtained according to the single time slot decoding.

[0040] or,

[0041] If the data packet is sent by the sender using a multi-slot mapping method, the information payload of the data packet is obtained based on single-slot decoding and inter-slot serial interference cancellation decoding on the composite factor graph.

[0042] Optionally, single-slot decoding includes:

[0043] Based on the data packet, the pilot symbol sequence and the coded information symbol sequence are obtained;

[0044] Based on the pilot symbol sequence, determine the packet header portion and the interleaver pattern;

[0045] Under the condition of satisfying the joint iteration of the basic signal estimator ESE multi-user detection and the channel decoder (such as the LDPC decoder; other decoders that can realize joint iteration of the channel decoder can also be applied here without any specific limitation), the data part is obtained according to the encoded information symbol sequence and the interleaver pattern.

[0046] The information payload is obtained based on the header portion and the data portion.

[0047] Optionally, based on the encoded information symbol sequence, the interleaver pattern, and the joint iteration of ESE multi-user detection and channel decoder, the data portion of the information payload is obtained, including:

[0048] Determine whether the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations;

[0049] When the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations, ESE multi-user detection is performed on the encoded information symbol sequence to obtain the posterior log-likelihood ratio (LLR) of the interleaved encoded bits.

[0050] The interleaved coded bits a posteriori LLR are deinterleaved according to the interleaver pattern to obtain the coded bits LLR;

[0051] The channel decoder decodes the LLR coded bits, and when the maximum number of iterations of the channel decoder is reached, the channel decoder outputs the decoding result.

[0052] The decoding result output by the channel decoder is subjected to repeat code LLR expansion and / or interleaving, and then the step of determining whether the current ESE multi-user detection and channel decoder joint iteration number is less than or equal to the maximum joint iteration number is returned.

[0053] When the current number of joint iterations of ESE multi-user detection and channel decoder is greater than the maximum number of joint iterations, the data part is obtained based on the decoding result output by the channel decoder.

[0054] Optionally, the inter-slot serial interference cancellation decoding on the composite factor graph includes:

[0055] For each time slot, the packet header and IDMA encoded portion are obtained through single-time-slot decoding.

[0056] The composite factor diagram is obtained through the aforementioned head section;

[0057] Obtain the time slot nodes and user nodes in the composite factor graph, where the time slot node represents the IDMA coding result within a single time slot, and the user node represents the IDMA decoding result for each user;

[0058] The time slot nodes are classified into a first type of time slot node and a second type of time slot node; wherein, the number of undecoded users superimposed on the first type of time slot is less than or equal to the time slot collision threshold, and the number of undecoded users superimposed on the second type of time slot is greater than the time slot collision threshold.

[0059] Based on the process of the first type of time slot node transmitting information to the user node, and the process of the user node transmitting information to the second type of time slot node, some second type of time slot nodes are converted into first type of time slot nodes, so that the number of users of some second type of time slot nodes after interference cancellation is lower than a preset threshold, until all second type of time slot nodes are converted into first type of time slot nodes.

[0060] The information output by the user node is used as the decoding result of the IDMA encoded part;

[0061] Specifically, each time the first type of time slot node transmits information to the user node, an IDMA decoding is required, and each time the user node transmits information to the second type of time slot node, an IDMA encoding is required.

[0062] Thirdly, a data processing apparatus is provided for use at a transmitting end, comprising:

[0063] The first processing module is used to obtain the pilot information bit sequence and the data information bit sequence based on the information payload;

[0064] The second processing module is used to obtain the packet header part based on the pilot information bit sequence;

[0065] The third processing module is used to obtain the IDMA encoded part based on the pilot information bit sequence and the first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence;

[0066] The fourth processing module is used to obtain data packets based on the packet header and the IDMA encoding portion.

[0067] Fourthly, a data processing apparatus is provided for use at a receiving end, comprising:

[0068] The first receiving module is used to receive data packets, the data including a header and an IDMA encoded portion. The IDMA encoded portion is obtained by the transmitting end based on the pilot information bit sequence and a first bit sequence, the first bit sequence being obtained by repeatedly encoding the data information bit sequence.

[0069] Fifthly, a communication device is provided, including a memory, a processor, and a program stored in the memory and executable on the processor; when the processor executes the program, it performs the steps of the method as described in the first or second aspect.

[0070] A sixth aspect provides a readable storage medium having a program stored thereon, which, when executed by a processor, implements the steps of the method as described in the first or second aspect.

[0071] In this embodiment, the transmitting end introduces repetitive coding within the time slot by introducing repetitive diversity coding gain in single-time slot coding and multi-time slot coding, forming a single-time slot IDMA multiple access coding structure to combat multiple access interference caused by the superposition of multi-user data packets in the time slot, thereby achieving low-complexity and high-efficiency giant address access. Attached Figure Description

[0072] Figure 1 This is a schematic diagram of the basic encoding and decoding structure for giant address access;

[0073] Figure 2 This is a schematic diagram of sparse IDMA single-user coded transmission;

[0074] Figure 3 This is a schematic diagram of a sparse IDMA multi-user decoding and receiving structure;

[0075] Figure 4 This is a schematic diagram of the encoding of a single-user transmitter in a cascaded compression sensing scheme;

[0076] Figure 5 This is a schematic diagram of multi-user receiver decoding in a cascaded compressed sensing scheme;

[0077] Figure 6 This is one of the schematic diagrams of the transmission method provided in the embodiments of this application;

[0078] Figure 7 This is a second schematic diagram of the transmission method provided in the embodiments of this application;

[0079] Figure 8 This is a schematic diagram of the system architecture of the single-slot coded giant address access scheme in the embodiments of this application;

[0080] Figure 9 This is a schematic diagram of the system architecture of the multi-slot coded giant address access scheme in the embodiments of this application;

[0081] Figure 10a This is a flowchart of the overall processing of the single-slot coding scheme at the transmitting end in the embodiments of this application;

[0082] Figure 10bThis is a flowchart of the transmitter header compression sensing coding in the single-slot coding scheme of this application embodiment;

[0083] Figure 10c This is a flowchart of the IDMA encoding of the data portion at the transmitting end in the single-slot coding scheme of this application embodiment;

[0084] Figure 11a This is a flowchart of the receiver processing of the single-slot coding scheme in the embodiments of this application;

[0085] Figure 11b This is a flowchart of the receiver compressed sensing packet header detection in the single-slot coding scheme of this application embodiment;

[0086] Figure 11c This is a flowchart of the IDMA encoding of the receiving data portion of the single-slot coding scheme in the embodiments of this application;

[0087] Figure 12 This is a flowchart of the unequal diversity degree distribution optimization in the embodiments of this application;

[0088] Figure 13a This is a flowchart of the overall processing of the multi-slot coding scheme at the transmitting end in the embodiments of this application;

[0089] Figure 13b This is a flowchart of the multi-slot coding scheme transmitting end packet header compression sensing coding in the embodiments of this application;

[0090] Figure 13c This is a flowchart of the IDMA encoding of the data portion of the transmitting end in the multi-slot coding scheme of this application embodiment;

[0091] Figure 13d This is a flowchart illustrating the generation of repeating patterns at the transmitting end of the multi-slot coding scheme in this application embodiment;

[0092] Figure 14a This is a flowchart of single-slot decoding at the receiver of the multi-slot coding scheme in the embodiments of this application;

[0093] Figure 14b This is a flowchart of the receiver compressed sensing packet header detection in the multi-slot coding scheme of this application embodiment;

[0094] Figure 14c This is a flowchart of the IDMA decoding of the receiver data portion of the multi-slot coding scheme in the embodiments of this application;

[0095] Figure 15 This is a schematic diagram of SIC decoding of the composite factor graph in the embodiments of this application;

[0096] Figure 16 This is a flowchart of the receiver processing of the multi-slot coding scheme in the embodiments of this application;

[0097] Figure 17 This is a schematic diagram illustrating the relationship between the SNR threshold and the number of active users in an embodiment of this application;

[0098] Figure 18 This is one of the schematic diagrams of the transmission method provided in the embodiments of this application;

[0099] Figure 19 This is a second schematic diagram of the transmission method provided in the embodiments of this application;

[0100] Figure 20 This is a schematic diagram of the communication device in the embodiments of this application. Detailed Implementation

[0101] The technical solutions of the embodiments of this application will be clearly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application are within the scope of protection of this application.

[0102] The terms "first," "second," etc., used in the specification and claims of this application are used to distinguish similar objects and not to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that embodiments of this application can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of the same class, not limited in number; for example, a first object can be one or more. Furthermore, in the specification and claims, "and / or" indicates at least one of the connected objects, and the character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0103] To facilitate understanding of the technical solution of this application, the following technical points are introduced:

[0104] I. Giant Address Access Technology

[0105] Based on the structural characteristics of non-cooperative access, the design of system solutions for giant address access needs to address two issues: 1) random user collisions and information recovery; 2) the impact of channel noise. Simultaneously, the transmitting end of the giant address access system adopts a distributed structure, while the receiving end adopts a centralized structure, such as... Figure 1 As shown, users u1 and u2 are encoded independently, but use the same encoder. The encoded results are sent to the channel, where multilevel superposition is performed. The superimposed information is then sent to the decoder, and the decoder outputs the information bits of users u1 and u2.

[0106] Therefore, in this mode, users are not distinguished, and slotted ALOHA is used as the basic transmission structure and channel collision mechanism. Each user randomly selects a time slot to send its data packets, resulting in random collisions in the channel. The receiving algorithm needs to detect and decode the superimposed multi-user signals to recover the randomly superimposed multi-user information. Giant address access primarily uses the Per User Probability of Error (PUPE) to define the system's optimization metric, aiming to increase the number of users supported and improve energy efficiency under a given PUPE. Under this condition, giant address access is concerned with the relationship between the average packet loss rate (PUPE) and the minimum signal-to-noise ratio (SNR) required by the system to meet that packet loss rate requirement. Under the same access scale, the lower the SNR threshold required by the system, the higher the system's energy efficiency and the stronger its resistance to multiple access interference.

[0107] In current giant address access coding designs, two schemes are relatively representative: the Compressive Channel Sensing (CCS) scheme based on compressed sensing coding and the Sparse Interleaving Division Multiple Access (IDMA) scheme based on unequal diversity spread spectrum.

[0108] II. Giant Address Access Technology Based on Sparse Spread Spectrum Scheme

[0109] In the design of the IDMA scheme based on sparse unequal diversity, this scheme uses IDMA as the basic coding paradigm. It constructs low-rate coding by repeating, interleaving, and superimposing a basic forward error correction code, while simultaneously relying on interleaving patterns to distinguish users. As long as the receiver knows the interleaving patterns of each user participating in the superposition, the user information can be recovered through a certain receiver algorithm. However, in non-cooperative giant address access coding scenarios, the receiver cannot know the interleaving patterns of each user a priori. In this case, the interleaving pattern sequence number can be mapped into a short pilot signal through compressed sensing and appended to the data portion after IDMA coding for transmission.

[0110] Sparse IDMA builds upon this by improving the IDMA coding for each user within a time slot. It replaces equal repetitions with random, unequal repetitions, differentiating their diversity and code rate, further enhancing diversity beyond just interleaving pattern differentiation. Simultaneously, by padding insufficient code lengths with zeros, it creates a sparse superposition structure between user codewords, reducing multiple access interference compared to equal-diversity repetition. Furthermore, the pilot prefix carries not only interleaving pattern information but also the repetition count.

[0111] In the design of the user information sending end, the user information is divided into two parts, such as... Figure 2 As shown, assume the user information length is m bits. The first part serves as the packet header w. b The length is m b The bit is subjected to compressed sensing encoding to obtain a code length of N. b The first part of the encoded output, in this case, the header not only carries the original user information, but also the interleaving pattern information and repeating pattern set from the second part of the encoding. The second part of the code is w. c Code length m c =mm b bit, assuming the second part of the code has a code length of N after encoding. c First, we perform channel reliability coding, using Low Density Parity Check (LDPC) code. Then, we perform BPSK modulation, repeating the modulated information l times. The repetition pattern is a distribution function based on the packet header, l = l(w b Since the number of repetitions is randomly determined based on the distribution function, the code length after repetition may be less than N. c If the code length is insufficient, pad with zeros to obtain a code of length N. c The second part is the encoded output. The total encoded output from the sending end is N = N b +N c Therefore, the total bitrate is

[0112] When multiple users send information simultaneously, the encoded codewords collide and overlap on the channel. The receiver then receives the overlapped code information.

[0113] The receiving end still processes the received codeword information in two parts, such as... Figure 3 As shown. First, the first part of the decoding is performed, which involves decoding the received packet header information N. b Compressed sensing decoding uses the result as both the output of the first part of the decoding (which is part of the user data) and the input of the BP decoder in the second part of the decoding. The decoding result of the first part simultaneously carries information about the interleaving pattern and the repeating pattern set used in the second part of the encoding. Therefore, during the second part of the decoding, the decoding result of the first part needs to be input into the BP decoder to recover the second part of the code information for each user based on the repeating pattern set and the interleaving pattern. Finally, the decoding results of the first and second parts are combined to obtain the complete decoding result.

[0114] The receiver selects a BP decoder to perform information recovery decoding on the received superimposed user information. Based on the factor graph corresponding to the bit overlap relationship under unequal diversity conditions within a time slot, the BP decoder can recover the user information that caused the collisions and superpositions from this factor graph. The factor graph information is stored and transmitted through the packet header. At the decoding end, a compressed sensing decoding algorithm is first used to extract the factor graph information from the packet header. In this scheme, the factor graph information mainly consists of two parts: a set of repeating patterns and an interleaving pattern. The sparse IDMA scheme introduces an unequal diversity repetition coding design based on IDMA coding, which effectively reduces multiple access interference in a single time slot compared to IDMA coding with equal repetition counts. However, its coding gain has limited impact on system energy efficiency as the number of users increases.

[0115] III. Design of a Cascaded Compressed Sensing Coding Scheme

[0116] Compressed sensing coding maps user information bits to columns of the detection matrix through positional encoding, solving the column space in the complex field, i.e., the support set recovery problem, at the receiver. As the length of the user's information payload (i.e., the input length of compressed sensing coding) increases, the size of the compressed sensing matrix increases exponentially, leading to excessive encoding and decoding complexity. Therefore, Chamberland et al. proposed Cascaded Compressed Sensing (CCS) coding based on compressed sensing (CS), employing a divide-and-conquer approach to further divide the user information bits into smaller sub-blocks, each of which is recovered using the standard CS algorithm. This segmentation coding mode introduces a new problem: in giant address access coding mode, the receiver needs to combine the results of slot-by-slot decoding to reconstruct each user. This requires additional coding to determine the mapping relationship between sub-blocks of the same user's data packet in different slots. However, by adding redundant information to each sub-block before transmission, which allows the sub-blocks to be combined at the receiver, the overhead of adding redundancy is negligible compared to the achievable computational complexity and corresponding performance gains. The specific encoding method for this redundant information is based on the tree coding design concept, that is, there is a check relationship between the user's data sub-blocks, and the association between packets can be confirmed through verification.

[0117] Therefore, the cascaded compressed sensing coding scheme reduces the column space size of the compressed sensing matrix by segmenting it into blocks and reduces the row space size by dividing it into time slots, thus keeping the complexity of compressed sensing coding within an acceptable range. Simultaneously, checksums are added between sub-blocks, and encoding and decoding are completed using a segmentation and reassembly method. The first user data packet is used as the root node, and subsequent data packets are used as leaf nodes on the code tree, gradually expanding the tree. The decoding process involves a depth-first search of the code tree using checksums to obtain a path from the root to a leaf, ultimately concatenating the user's various sub-blocks. After obtaining the recovery information of a single sub-block through the CS decoding algorithm, the receiving end needs to obtain a tree-like candidate path graph through a tree-like decoding structure. The correctness of the path is verified by the added redundant checksum information, allowing the surviving path to be obtained, thus acquiring the initial user information.

[0118] The transmitting end mainly consists of two parts: one is a system linear block code based on a random parity-check matrix, which is a tree-structured code; the other is a signal processing module based on compressed sensing, such as... Figure 4 As shown.

[0119] The transmitting end divides each user's information payload into blocks, appends tree-coded check bits to each sub-block, forming equal-length composite information; then maps the composite information into a sparse vector, performs compressed sensing encoding, and sends it to the time slot. The decoding process of this scheme is as follows: Figure 5 As shown, firstly, time-slot compressed sensing decoding is performed to decrypt the superimposed composite information (including the data portion and tree-coded parity bits). Then, starting from the root node (without parity), the tree structure is expanded and the correct path is found according to the parity relationship, concatenating the information belonging to the same user.

[0120] This scheme employs tree coding for packet segmentation based on single-slot compressed sensing coding, thereby reducing the complexity of compressed sensing multiple access codes while maintaining the high efficiency of CS coding. However, as the number of active users increases, the system's energy efficiency significantly decreases due to reduced sparsity and the performance degradation of tree coding.

[0121] As described above, both of the comparative methods have their shortcomings and need improvement:

[0122] 1. The zero-filling scheme in the time slots of the sparse IDMA scheme is not conducive to the implementation of the linear detection structure, and the complexity of IDMA decoding relying on the full BP algorithm is high. At the same time, this scheme has the problem of IDMA performance regression caused by the increase of collision interference as the number of users increases. As the number of time slots increases, the code length becomes shorter, and the gain of unequal diversity in the time slots is limited.

[0123] 2. The system implementation complexity of the cascaded compression-aware coding scheme is still concentrated in the support set recovery problem. In order to maintain the sparsity condition under a high number of users, the tree coding depth needs to be increased, which in turn increases the error rate of packet assembly, resulting in performance degradation.

[0124] See Figure 6 This application provides a data processing method. The execution subject of the method can be a sending end, and the specific steps include: step 601, step 602, step 603 and step 604.

[0125] Step 601: Based on the information payload, obtain the pilot information bit sequence and the data information bit sequence;

[0126] Step 602: Obtain the packet header portion based on the pilot information bit sequence;

[0127] Step 603: Obtain the IDMA encoded portion based on the pilot information bit sequence and the first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence; Step 604: Obtain the data packet based on the packet header portion and the IDMA encoded portion.

[0128] In one embodiment of this application, the method further includes: transmitting the data packet through a single time slot.

[0129] For the transmitter of the single-slot coding scheme, an IDMA coding structure with intra-packet repetition is adopted to achieve high-energy-efficiency coding. At the same time, the interleaving pattern information of the IDMA is introduced by compressed sensing pilot transmission to ensure the same codebook and passive coding design at the coding end. Furthermore, the design of the single-slot coding scheme is realized by adopting intra-packet repetition.

[0130] In one embodiment of this application, the method further includes: sending the data packet via multi-timeslot mapping.

[0131] For the transmitter of the multi-slot coding scheme, an intra-packet repetitive IDMA structure with inter-packet unequal diversity coding is adopted, which further improves the system energy efficiency on the basis of the single-slot scheme.

[0132] In one embodiment of this application, the data packet is transmitted via multi-timeslot mapping, including:

[0133] Based on the mapping pattern vector, the data packet is mapped to multiple time slots, and the mapped data packet is sent into the channel.

[0134] In one embodiment of this application, multi-slot mapping is performed on the data packet according to the mapping pattern vector, and the mapped data packet is sent into the channel, including:

[0135] Obtain the mapped pattern vector;

[0136] The data packet is mapped to position 1 in the mapping pattern vector, and the data packet at position 1 is sent into the channel.

[0137] In one embodiment of this application, obtaining the mapping pattern vector includes:

[0138] Based on the unequal diversity degree, the random repetition count β of the data packet is obtained. l That is, the random number generator generates random repetitions β. l The rules are determined by the unequal diversity degree;

[0139] Based on the number of random repetitions β l Get a top β l A vector with 1 element in each position and 0 elements in the other positions, and a total length of V;

[0140] The vector is uniformly and randomly interwoven so that element 1 is evenly distributed at all positions, thus obtaining the mapping pattern vector;

[0141] Where V represents the total number of time slots.

[0142] It is understandable that diversity degree is used to represent the number of times a data packet is repeated, unequal diversity degree means that the number of times a data packet is repeated can be different, and unequal diversity degree distribution is used to represent the probability of the repeated data packet occurrence.

[0143] In one embodiment of this application, the method further includes:

[0144] Obtain configuration information, which includes: number of active users and / or number of time slots;

[0145] Based on the configuration information, and at least one of the SIC convergence optimization objective, SIC startup condition optimization objective, and packet coding energy efficiency optimization objective, an unequal diversity distribution is obtained.

[0146] In one embodiment of this application, the SIC convergence optimization objective refers to an unequal diversity distribution that satisfies SIC iterative convergence and minimizes the collision threshold.

[0147] In one embodiment of this application, the optimization objective of the SIC initiation condition is to verify, through Monte Carlo simulation of the SIC process, the unequal diversity distribution that can initiate the SIC process with a preset probability under multiple Monte Carlo simulations.

[0148] In one embodiment of this application, the data packet coding energy efficiency optimization objective refers to the unequal diversity distribution corresponding to the lowest SNR value after data packet coding.

[0149] By employing density evolution to ensure convergence, Monte Carlo simulation to ensure startup conditions, and introducing minimum energy efficiency conditions, a packet coding unequal diversity lookup table under a specific configuration is finally generated, thereby enabling the determination of unequal diversity in multi-slot coding schemes.

[0150] In one embodiment of this application, the first bit sequence is obtained by repeatedly encoding the data information bit sequence, including:

[0151] The data information bit sequence is encoded using a channel encoder to obtain an initial bit sequence;

[0152] The initial bit sequence is repeatedly encoded to obtain the first bit sequence.

[0153] In one embodiment of this application, a DMA-coded portion is obtained based on the pilot information bit sequence and the first bit sequence, including:

[0154] Based on the first bit sequence and the interleaver pattern corresponding to the pilot information bit sequence, the interleaved second bit sequence is obtained;

[0155] The IDMA coded portion is obtained based on the second bit sequence and the preset modulation constellation table.

[0156] In this embodiment, the transmitting end introduces repetitive coding within the time slot by introducing repetitive diversity coding gain in single-slot coding and multi-slot coding, forming a single-slot IDMA multiple access coding structure to combat multiple access interference caused by the superposition of multi-user data packets in the time slot, achieving better performance while maintaining low complexity. Furthermore, by introducing irregular packet-level repetitive coding between time slots, the receiving end can start time slot joint SIC iteration based on single-slot decoding, further eliminating multiple access interference and improving performance.

[0157] See Figure 7 This application provides a data processing method, the execution subject of which includes a receiving end, and the specific steps include: step 701.

[0158] Step 701: Receive data packet, the data including a header and an IDMA encoded part, the IDMA encoded part being obtained by the transmitting end based on the pilot information bit sequence and a first bit sequence, the first bit sequence being obtained by repeatedly encoding the data information bit sequence.

[0159] The content corresponding to the repeated data information bit sequence can be understood as the content obtained by repeatedly encoding the data information bit sequence.

[0160] In one embodiment of this application, the method includes:

[0161] If the data packet is sent by the sender through a single time slot, the information payload of the data packet is obtained according to the single time slot decoding.

[0162] For the receiver of the single-slot coding scheme, a joint iteration of ESE multi-user detection and SPA decoder is adopted to achieve low-complexity decoding of the single-slot coding scheme.

[0163] In one embodiment of this application, the method includes:

[0164] If the data packet is sent by the sender using a multi-slot mapping method, the information payload of the data packet is obtained based on single-slot decoding and inter-slot serial interference cancellation decoding on the composite factor graph.

[0165] For the receiver of the multi-slot coding scheme, an inter-packet SIC structure is added to the low-complexity single-slot decoding structure of ESE+SPA to further eliminate multi-user superposition interference.

[0166] In one embodiment of this application, single-slot decoding includes:

[0167] Based on the data packet, the pilot symbol sequence and the coded information symbol sequence are obtained;

[0168] Based on the pilot symbol sequence, determine the header portion of the information payload and the interleaver pattern;

[0169] The data portion of the information payload is obtained by combining the encoded information symbol sequence, the interleaver pattern, and the joint iteration of the elementary signal estimator (ESE) multi-user detection and the channel decoder (or LDPC SPA decoder).

[0170] The information payload is obtained based on the header portion and the data portion.

[0171] In one embodiment of this application, under the condition of joint iteration of ESE multi-user detection and channel decoder, the data portion of the information payload is obtained according to the encoded information symbol sequence and the interleaver pattern, including:

[0172] Determine whether the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations;

[0173] When the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations, ESE multi-user detection is performed on the encoded information symbol sequence to obtain the posterior log-likelihood ratio (LLR) of the interleaved encoded bits.

[0174] The interleaved coded bits a posteriori LLR are deinterleaved according to the interleaver pattern to obtain the coded bits LLR;

[0175] The channel decoder decodes the LLR coded bits, and when the maximum number of iterations of the LDPC SPA decoder is reached, the channel decoder outputs the decoding result.

[0176] The decoding result output by the channel decoder is subjected to repeat code LLR expansion and / or interleaving, and then the step of determining whether the current ESE multi-user detection and channel decoder joint iteration number is less than or equal to the maximum joint iteration number is returned.

[0177] When the current number of joint iterations of ESE multi-user detection and channel decoder is greater than the maximum number of joint iterations, the data part of the information payload is obtained based on the decoding result output by the channel decoder.

[0178] In one embodiment of this application, inter-slot serial interference cancellation decoding on the composite factor graph includes:

[0179] For each time slot, the packet header and IDMA encoded portion are obtained through single-time-slot decoding.

[0180] The composite factor diagram is obtained through the aforementioned head section;

[0181] Obtain the time slot nodes and user nodes in the composite factor graph, where the time slot node represents the IDMA coding result within a single time slot, and the user node represents the IDMA decoding result for each user;

[0182] The time slot nodes are classified into a first type of time slot node and a second type of time slot node; wherein, the number of undecoded users superimposed on the first type of time slot is less than or equal to the time slot collision threshold, and the number of undecoded users superimposed on the second type of time slot is greater than the time slot collision threshold.

[0183] Based on the process of the first type of time slot node transmitting information to the user node, and the process of the user node transmitting information to the second type of time slot node, some second type of time slot nodes are converted into first type of time slot nodes, so that the number of users of some second type of time slot nodes after interference cancellation is lower than a preset threshold, until all second type of time slot nodes are converted into first type of time slot nodes.

[0184] The information output by the user node is used as the decoding result of the IDMA encoded part;

[0185] Specifically, each time the first type of time slot node transmits information to the user node, an IDMA decoding is required, and each time the user node transmits information to the second type of time slot node, an IDMA encoding is required.

[0186] In this embodiment, the transmitting end introduces repetitive coding within the time slot by introducing repetitive diversity coding gain in single-slot coding and multi-slot coding, forming a single-slot IDMA multiple access coding structure to combat multiple access interference caused by the superposition of multi-user data packets in the time slot, achieving better performance while maintaining low complexity. Furthermore, by introducing irregular packet-level repetitive coding between time slots, the receiving end can start time slot joint SIC iteration based on single-slot decoding, further eliminating multiple access interference and improving performance.

[0187] In this application embodiment, the design concept of giant address access coding mainly includes three aspects:

[0188] (1) Repetition diversity. The embodiments of this application not only introduce repetition diversity gain within packets through IDMA, but also introduce packet-level diversity gain between packets through random repetition coding;

[0189] (2) Unequal diversity design. Compared with regular repetition, irregular repetition brings greater coding gain. Therefore, the embodiments of this application adopt an unequal diversity design in inter-packet coding;

[0190] (3) Time slot structure design. Time slot structure is an important tool for analyzing the changes in multiple access interference as the number of users increases. The focus of coding design and parameter optimization is to minimize multiple access interference as the number of users increases. Although it is not possible to design a completely deterministic optimal time slot structure under non-cooperative transmission mechanism as in cooperative coding, the probabilistic analysis of randomized structure is still important, especially for packet diversity design.

[0191] This application includes two giant address access coding schemes:

[0192] (1) A single-slot coding scheme using IDMA with packet header as the multiple access code.

[0193] For the single-slot coding scheme, (a) diversity gain is introduced by repeating IDMA coding within the packet to improve the ability to resist multi-user superposition interference, thereby reducing the SNR threshold of the system and achieving an energy efficiency advantage over the compressed sensing coding scheme under high user numbers; (b) the interleaver pattern used to distinguish multi-user characteristics in IDMA is transmitted through compressed sensing pilots so that the receiver can further complete IDMA multi-user decoding on the basis of recovering the pilot under the condition of unscheduled giant address access; (3) the repeating coding method within the packet allows the receiver to adopt a linear decoding design, thereby reducing complexity.

[0194] (2) Based on (1), a multi-slot coding scheme with unequal diversity packet coding is introduced.

[0195] For multi-slot coding schemes, (a) based on single-slot coding schemes, not only is intra-packet repetition diversity gain introduced through IDMA, but inter-packet diversity gain is also introduced through unequal diversity degree coding, thereby improving system energy efficiency. (b) The inter-packet unequal diversity repetition coding structure can further eliminate multi-user superposition interference by using serial interference cancellation decoding based on factor graphs at the receiver, resulting in significant performance gains. Under the configuration of multiple users and enhanced multiple access interference, it has higher energy efficiency than the sparse IDMA coding scheme.

[0196] It is understandable that single-slot coding schemes, through intra-packet equal diversity repetition and multi-slot coding, can achieve better coding efficiency and coding gain than compressed sensing concatenated coding schemes with low complexity. Meanwhile, multi-slot schemes, by fully utilizing diversity coding gain in the design of giant access, can effectively enhance the ability to resist multiple access interference, thereby improving system energy efficiency and achieving performance superior to sparse IDMA schemes.

[0197] This application includes two specific multi-user coding transmission schemes: a single-slot coding scheme and a multi-slot coding scheme, each with its own transceiver processing flow. For the multi-slot coding scheme, there is also an offline parameter optimization step. The following sections describe the transmitter design, receiver design, unequal diversity distribution optimization, transmitter design, and receiver design of the single-slot scheme through five steps: A, B, C, D, and E. These five parts, combined, constitute the single-slot giant address access coding transmission system and the multi-slot giant address access transmission system, as follows: Figure 8 and Figure 9 As shown.

[0198] A: Processing flow at the transmitter in a single-timeslot scheme:

[0199] Input: User l's information payload w of length B l Length of the headband B sCompressed sensing mapping matrix A, weaving mapper set F, LDPC code rate configuration RL, repetition code code rate configuration RR, modulation constellation table A.

[0200] Output: User l's sent data packet v l .

[0201] The specific process is as follows:

[0202] 1. Data segmentation: Dividing the information payload w l Cut into length B s pilot information bit sequence d l =w l (1:B s ) is of length B c =BB s Data information bit sequence b l =w l (B s +1:B) These two sequences;

[0203] 2. Encoding: Sub-process 1 (compressed sensing encoding of the packet header) and sub-process 2 (IDMA encoding of the data portion) are executed in parallel to obtain the packet header portion s of the transmitted data packet. l and the IDMA encoded portion x of the transmitted data packet. l .

[0204] 3. Assembly and Sending: Assemble and send the package header section (s) l With IDMA coding part x l The two parts are combined to form a data packet v of length N for user l. l That is: v l =[b l ;d l ].

[0205] Subprocess A.1: Compressed sensing encoding of the packet header:

[0206] Input: The length of the segment obtained by user l is B. s Pilot information bit sequence d l , Compressed sensing mapping matrix A.

[0207] Output: The header portion s of the sent data packet l .

[0208] The specific process is as follows:

[0209] 1. Number system conversion: Converting a binary bit sequence d... l Convert to decimal number τ through number system transformation l ;

[0210] 2. Position mapping: Mapping the decimal number τl τ corresponds one-to-one with the column indices of the compressed sensing mapping matrix A. l Corresponding to its τth l +1 column;

[0211] 3. Compressed sensing spread spectrum: Select the τth digit of the compressed sensing mapping matrix A. l +1 column is used as the header pilot for transmission, i.e., s l =a τl+1 Its length is N s .

[0212] Sub-process A.2: IDMA encoding of the data portion:

[0213] Input: The length of the segment obtained by user l is B. c pilot information bit sequence d l and length B c Data information bit sequence b l , interleaving mapper set F, LDPC code rate configuration RL, repetition code code rate configuration RR, modulation constellation table A.

[0214] Output: IDMA encoded portion x of the transmitted data packet l .

[0215] The specific process is as follows:

[0216] 1. LDPC encoding: Encoding the data information bit sequence b l The input is a LDPC encoder with a bit rate of RL, and the result is a length of B. u =B c / RL encoded bit sequence u l ;

[0217] 2. Repetitive encoding: (The last part is incomplete and likely refers to encoding errors.) l After repeating 1 / RR times, the length is B. c The encoded bit sequence c of / (RL*RR) l ;

[0218] 3. Interleaving: Interleaving the binary bit sequence d l Convert to decimal number τ through number system transformation l Select the τth interleaver map from the set F l Interweaver diagram c l Inputting this interleaver yields a length of B. c The interleaved bit sequence c′ of / (RL*RR) l =f τl (c l );

[0219] 4. For the bit sequence c′l Modulated according to constellation A, the size of the constellation table is Q. m If |A|, then the modulation order is N. m =log2(Q) m Finally, the IDMA encoded symbol sequence x is obtained. l The length is N c =B c / (RL*RR*N m ).

[0220] Therefore, the encoding and transmission process for each user at the sending end is obtained, such as... Figures 10a-10c As shown:

[0221] B. Receiver processing flow for single-timeslot scheme:

[0222] Input: Received signal vector y in a single time slot, time slot length N, pilot length N s , Compressed sensing mapping matrix A, interleaver mapping set F, modulation constellation table A, maximum number of self-iterations of LDPC SPA decoder I1, maximum number of joint iterations of ESE multi-user detection and LDPC SPA decoder I2.

[0223] Output: Information payload detection results for each user l

[0224] The specific process is as follows:

[0225] 1. Data segmentation: Divide the received signal vector y into segments of length N. s pilot information bit sequence y s =y(1:N s ) is a sum of length N c =NN s IDMA encoded information symbol sequence y c =y(N s +1:N);

[0226] 2. Execute sub-process B.1 (Compressed Sensing Packet Header Detection) to obtain the packet header portion of each user information payload. and diagrams of each user interleaver

[0227] 3. Execute sub-process B.2 (IDMA multi-user iterative monitoring) to obtain the data portion of each user's information payload.

[0228] 4. Assembly: Iterate through each user l and extract the packet header. With IDMA coding part The two parts are combined to form an information payload detection result of length B. Right now:

[0229] Subprocess B.1: Compressed sensing packet header detection:

[0230] Input: The length of the segmented data is N. s Pilot symbol sequence y s , Compressed sensing mapping matrix A, interleaver mapping set F.

[0231] Output: The header portion of each user information payload User interleaving diagrams

[0232] The specific process is as follows:

[0233] 1. OMP support set recovery: This involves restoring the pilot symbol sequence y... s The input is fed into the OMP algorithm, which searches for the components of y based on the mapping matrix A. s The set of columns of A that all user data packet headers map to, i.e., the support set.

[0234] 2. Location mapping: Mapping the support set Each element in the array (a partial column of A) corresponds one-to-one with its index in A, the first... Columns correspond to decimal numbers This yields a series of decimal numbers.

[0235] 3. Execute the following two operations in parallel:

[0236] a) Number system conversion: Convert each decimal number... Convert to length B s binary sequence

[0237] b) Interwoven pattern mapping: based on Select the first interleaver map from the set F in sequence. Interweaver diagram Obtain the interleaver patterns of each user superimposed on the current time slot.

[0238] Subprocess B.2: IDMA Multi-User Iterative Detection

[0239] Input: The length of the segmented data is N. c IDMA encoded information symbol sequence y c Interleaving patterns for each user Modulation constellation table A, maximum number of self-iterations of LDPC SPA decoder I1, maximum number of joint iterations of ESE multi-user detection and LDPC SPA decoder I2.

[0240] Output: Data portion of each user information payload

[0241] The specific process is as follows:

[0242] 1. Initialization: Joint iteration count ite out =0, LDPC SPA decoder self-iteration count ite in =0, after interleaving, the encoded bits c′ l Prior LLR L a (c' l ) = 0, the prior probability L of the information bit in the LDPC SPA decoder a (b l =0, the number of users is determined based on the number of interleaver patterns.

[0243] 2. Determine the current joint iteration number (item). out The relationship with the maximum number of joint iterations I2, if ite out <I2, proceed to step 3; otherwise, proceed to step 6.

[0244] 3. Perform ESE multi-user detection symbol by symbol (Since ESE detection involves the mapping relationship between symbols and bits, for ease of description, it is described bit by bit and symbol by symbol, with the subscript m∈{1,…,N}) m} represents the current interleaved coded bit sequence c′ l bit c' in m,n,l It is the symbol sequence x sent by user l. l The symbol x in n,l The m-th bit is included, n∈{1,…,N} c} represents the current bit c' m,n,l This corresponds to the symbol sequence x sent by user l. l The nth modulation symbol x n,l ):

[0245] a) For each user l, iterate through all n, then iterate through all users l:

[0246] i. Interleave the encoded bits c' m,n,l The prior LLR is converted to the probability value corresponding to the bit being 0 / 1:

[0247]

[0248] ii. Based on the interleaved encoded bits c' m,n,l Given the probability distribution, find the sign of x. n,l Mean:

[0249] Where d m (x) represents the value of the m-th bit corresponding to the symbol x in the modulation constellation table A;

[0250] iii. Find the symbol x n,l variance:

[0251] b) Traverse n and l:

[0252] i. Calculation symbol x n,l Channel transition probability:

[0253] ii. Calculate the external information of the ESE output:

[0254]

[0255] c) At this point, the ESE can output the post-interleaved coded bit a posteriori (LLRL) for each user. e (c′ l );

[0256] 4. Subsequent decoding of each user's information can be processed in parallel, iterating through all users in parallel:

[0257] a) Untangling: Based on the tangling pattern Obtain the inverse mapping pattern Post-interleaved coded bit a posteriori (LLRL) for user l e (c′ l Deinterleaving is performed to obtain the encoded bits.

[0258] b) Duplicate code LLR merging: Let c j,l For c l The j-th bit in u k,l For u l The k-th bit in Iterate through j to obtain the prior probability L of the codeword for the LDPC SPA decoder. a (u l );

[0259] c) Using information bits as a priori LLR L a (b l ) = 0 and codeword prior LLRL a (u l Using as input, the LDPC SPA decoding algorithm is started. After I1 iterations, the output information bit posterior LLR sequence L(b) is generated. l ), and codeword post-validation LLRL(u l );

[0260] d) External information processing: Calculation of L e(u l )=L(u l )-L a (u l );

[0261] e) LLR extension for repeating codes: Traversing j yields the encoded bit extrinsic information LLRL e (c l );

[0262] f) Interleaving: Encoding the extra-bit information LLRL after interleaving user l. e (c′ l Deinterleaving is performed to obtain the interleaved coded bits c′. l Prior LLR

[0263] 5. After all users have completed the parallel traversal, the updated L is obtained. a (c′1),…,L a (c′ L (Jump to step 2);

[0264] 6. The posterior probabilities of information bits for all users: L(u1),…,L(u L A hard judgment is made to obtain the information portion of the test results.

[0265] Therefore, the decoding and transmission process for each user at the receiving end is obtained, such as... Figures 11a-11c As shown.

[0266] C: Optimization of unequal diversity degree distribution:

[0267] To optimize the performance of multi-slot packet coding, the packet diversity degree construction at the sending end needs to be optimized to achieve the best performance during the SIC process on the composite factor graph shown in sub-procedure E.2. For example... Figure 15 As shown, if the packet diversity degree of user k in time slot v is β l This indicates that the time slot node is connected to β. l Each time slot node, i.e., user l repeatedly sends its data packets to β. l On each time slot. Let β be... l The probability P(β) of taking the value i l =i) is λ i Then the degree distribution of user nodes can be written in multinomial form. Where i represents β lThe possible values ​​of λ(x) can also be obtained. Similarly, the degree distribution ρ(x) of the time slot nodes can be obtained. This degree distribution λ(x) can be optimized offline. Given a fixed scenario configuration, it can be directly applied to the transmitter configuration of each user as the input of sub-process D.3 (unequal diversity mapping pattern generation) of process D (multi-time slot transmitter processing process) to control the packet coding diversity degree of each user, thereby making the packet coding structure statistically optimal.

[0268] Input: Scenario configuration to be optimized: Number of active users K a With time slot number V.

[0269] Output: Optimized best degree distribution configuration table.

[0270] The specific process is as follows:

[0271] 1. SIC convergence optimization: Given K a Through density evolution pinch breakpoint analysis with V, we find the points that satisfy SIC iterative convergence (i.e., ultimately achieve the system packet loss rate PUPE reaching the preset index ∈ within a finite number of iterations) and satisfy the collision threshold T. th The minimum inequality distribution λ(x) can be optimized using a numerical search method within a given T. th Given a randomly generated unequal diversity degree distribution of user nodes λ(x), the unequal diversity degree distribution ρ(x) of time slot nodes is determined by λ(x): ρ r =P(Bino(λ′(1)K) a ,1 / V)=r), that is, the total number of trials is λ′(1)K a The binomial distribution is then used. The probability curves of the pruning of time slot nodes are then plotted. -1 The curves x(θ) and x(θ) represent the probability of user node pruning. These two curves are determined by SIC density evolution. (By performing an axial symmetry transformation on the curve of y(θ) with y=θ as the axis of symmetry, we can obtain y) -1 The curve (θ) is given by x(θ) = λ(θ). If the two curves intersect, it indicates that the SIC process eventually fails to converge; if the two curves do not intersect, it indicates that the SIC iteration eventually converges, and the degree distribution λ(x) is added to the candidate set Λ1 of the optimal degree distribution. th Gradually increase, in each T th When the change occurs, all possible λ(x) are traversed, and finally the candidate set Λ1 of the first degree distribution that satisfies the EXIT opening condition is searched.

[0272] 2. SIC startup condition optimization: In actual K aWith configuration V, each unequal diversity degree distribution in the candidate set Λ is traversed, and its SIC process is simulated using Monte Carlo simulation to verify whether it can guarantee the initiation of the SIC process with the required probability ∈1 under multiple simulations. If SIC can be initiated under this configuration, it is added to the second degree distribution candidate set Λ2.

[0273] 3. Packet coding energy efficiency optimization: For each degree distribution in the candidate set Λ2, calculate its average unequal diversity degree distribution λ′(1); and by using the K corresponding to this unequal diversity degree distribution... a V and the number of superimposed users T th Simulations were performed on the single-slot encoding and decoding process under the specified configuration (i.e., simulations were completed by implementing processes A and B under their respective configurations) to obtain the lowest SNR value (E) that satisfies the packet loss rate requirement ∈2. b / N0) T By combining the above two parameters, the SNR threshold of the system after packet encoding under unequal diversity degree distribution λ(x) is finally obtained: E b / N0=(E b / N0) T *λ′(1). Traverse the candidate set Λ2 to find the one that makes E b / N0 Lowest degree distribution λ * (x).

[0274] 4. Repeat steps 1-3, and compare the unequal diversity degree distribution optimized in step 3 with the system K. a The V configuration combination forms an optimal unequal diversity distribution configuration table, which the sending end can look up to configure the unequal diversity degree, as shown in the table below:

[0275] Table 1: Optimization Results of Multi-Slot RDSMA Parameters

[0276]

[0277] The process structure for optimizing this degree distribution can be summarized as follows: Figure 12 The process is shown below.

[0278] D: Transmitter processing flow for multi-timeslot schemes:

[0279] Input: User l's information payload w of length B l Length of the headband B s Compressed sensing mapping matrix A, weaving mapper set F, LDPC code rate configuration RL, repetition code code rate configuration RR, modulation constellation table A, system-set maximum repetition count I max and the optimal degree distribution λ i (i = 1, 2, ..., I) max ), total number of time slots V, and optimal degree distribution λ(x) after process C optimization.

[0280] Output: Multi-slot data packets z sent by user l l .

[0281] The specific process is as follows:

[0282] 1. Data segmentation: Dividing the information payload w l Cut into length B s pilot information bit sequence d l =w l (1:B s ) is of length B c =BB s Data information bit sequence b l =w l (B s +1:B) These two sequences;

[0283] 2. Encoding: Sub-process 1 (compressed sensing encoding of the packet header) and sub-process 2 (IDMA encoding of the data portion) are executed in parallel to obtain the packet header portion s of the transmitted data packet. l and the IDMA encoded portion x of the transmitted data packet. l .

[0284] 3. Assembly: Assemble the head section (s) l With IDMA coding part x l By combining the two parts, a data packet v of length N for user l is formed. l That is: v l =[b l ;d l ].

[0285] 4. Mapping Pattern Generation: Execute subprocess 3 (Inequal Diversity Mapping Pattern Generation) to generate the mapping pattern vector u. l .

[0286] 5. Multi-slot mapping transmission: Based on the mapping pattern vector u l , will data packet v l Send to u l The position is 1, and it is sent into the channel.

[0287] Subprocess D.1: Compressed sensing encoding of the packet header:

[0288] Input: The length of the segment obtained by user l is B. s Pilot information bit sequence d l , Compressed sensing mapping matrix A.

[0289] Output: The header portion s of the sent data packet l .

[0290] The specific process is as follows:

[0291] 1. Number system conversion: Converting a binary bit sequence d... l Convert to decimal number τ through number system transformation l ;

[0292] 2. Position mapping: Mapping the decimal number τ l τ corresponds one-to-one with the column indices of the compressed sensing mapping matrix A. l Corresponding to its τth l +1 column;

[0293] 3. Compressed sensing spread spectrum: Select the τth digit of the compressed sensing mapping matrix A. l +1 column is used as the header pilot for transmission, i.e. Its length is N s

[0294] Subprocess D.2: IDMA encoding of the data portion:

[0295] Input: The length of the segment obtained by user l is B. c pilot information bit sequence d l and length B c Data information bit sequence b l , interleaving mapper set F, LDPC code rate configuration RL, repetition code code rate configuration RR, modulation constellation table A.

[0296] Output: IDMA encoded portion x of the transmitted data packet l .

[0297] The specific process is as follows:

[0298] 1. LDPC encoding: Encoding the data information bit sequence b l The input is a LDPC encoder with a bit rate of RL, and the result is a length of B. u =B c / RL encoded bit sequence u l ;

[0299] 2. Repetitive encoding: (The last part is incomplete and likely refers to encoding errors.) l After repeating 1 / RR times, the length is B. c The encoded bit sequence c of / (RL*RR) l ;

[0300] 3. Interleaving: Interleaving the binary bit sequence d l Convert to decimal number τ through number system transformation l Select the τth interleaver map from the set F l Interweaver diagram c lInputting this interleaver yields a length of B. c The interleaved bit sequence of / (RL*RR)

[0301] 4. For the bit sequence c′ l Modulated according to constellation A, the size of the constellation table is Q. m If |A|, then the modulation order is N. m =log2(Q) m Finally, the IDMA encoded symbol sequence x is obtained. l The length is N c =B c / (RL*RR*N m ).

[0302] Subprocess D.3: Generation of unequal diversity mapping patterns:

[0303] Input: The maximum number of repetitions set by the system (I) max and the optimal degree distribution λ i (i = 1, 2, ..., I) max The total number of time slots is V, where the input parameters satisfy constraint I. max <V.

[0304] Output: Unequal diversity mapping pattern vector u l .

[0305] The specific process is as follows:

[0306] 1. Diversity degree generation: based on λ i A random number generator is used to generate the random repetition count β of the data packets for user l. l Among them, P(β) l =i)=λ i That is, the random number generator guarantees β l The probability P(β) of taking the value i l =i) is λ i ;

[0307] 2. Mapping pattern generation: Based on β l , producing a pre-β l A vector u' with 1st element and 0th element in all subsequent positions, and a total length of V. l Then, they are uniformly and randomly interwoven, so that the 1 element is evenly distributed in all positions, forming β. k -Sparse inequality mapping vector u l .

[0308] The above sub-processes and overall process descriptions yield the encoding and transmission process at the transmitting end under a multi-slot coding scheme, as follows: Figures 13a-13d As shown.

[0309] E: Receiver processing flow for multi-timeslot schemes:

[0310] Input: The received signal vector y in each time slot v (v = 1, 2, ..., V, where V is the maximum number of time slots), time slot length N, pilot length N s Compressed sensing mapping matrix A, interleaver mapping set F, modulation constellation table A, maximum number of self-iterations I1 for LDPC SPA decoder, maximum number of joint iterations I2 for ESE multi-user detection and LDPC SPA decoder, collision tolerance T th .

[0311] Output: Information payload detection results for each user l

[0312] The specific process is as follows:

[0313] 1. Slot-by-slot decoding: Traverse each slot v, and decode the received signal y in each slot. v As input, sub-process E.1 (single-slot decoding) is executed to obtain the decoding information of user k on each time slot v. Compressed sensing packet header detection information and the number of users superimposed on that time slot.

[0314] 2. Factor Graph Reconstruction: Traverse all time slots v and reconstruct the compressed sensing packet header detection information of each time slot. Packet head detection results with other time slots If they are the same, it means that the data packets are duplicates. For time slot v, the time slot numbers that are duplicates of it can form a set: After comparing all packet headers across all time slots, the total number of sending users K can be obtained. a Different header sequences Corresponding K a A set of repeating time slot numbers Based on these time slot number sets, the connection relationship between user node l and time slot node v can be determined and stored as an adjacency matrix U.

[0315] 3. Determine whether the IDMA encoded portions of all users have been decoded, i.e., the iteration termination condition for multi-slot decoding. (Information in each time slot can be translated) or |L + |=K a (All user information has been translated). If this condition is not met, proceed to step 4; otherwise, proceed to step 7.

[0316] 4. Node Classification: Divide all V time slot nodes into two categories. One category consists of time slot v that satisfies the translatability condition in the i-th iteration, i.e. However, the other time slot v' does not satisfy the translatability condition in the i-th iteration, i.e. For each time slot v∈V that satisfies the single-slot decodeable condition + Detect its corresponding header information Packet header sequence corresponding to each user Perform a comparison, query the factor graph U, and add user node l to the set of user nodes that have been successfully decoded, L. + ;

[0317] 5. Execute sub-process E.2 (inter-slot serial interference cancellation decoding on the composite factor graph), using slots v∈V that satisfy the single-slot decodable condition. + The detected data information helps to recover the time slot v'∈V that is overloaded by interference and does not meet the single-slot decodeability condition. - The information above indicates that when time slot v' meets the SIC condition, decoding can be successfully completed, and the user information that can be decoded after updating the SIC is updated. And change its own time slot translation count After completing this step, proceed to step 3.

[0318] 6. Once all user information on time slot v has been translated, the iteration terminates, and the recovered information payload for each user l, which was marked in step 5, is output.

[0319] Subprocess E.1: Single-slot decoding:

[0320] Input: Received signal vector y in the time slot, time slot length N, pilot length N s Compressed sensing mapping matrix A, interleaver mapping set F, modulation constellation table A, maximum number of self-iterations of LDPC SPA decoder I1, maximum number of joint iterations of ESE multi-user detection and LDPC SPA decoder I2, and maximum number of collisions T in a single time slot.

[0321] Output: Information payload detection results for each user l

[0322] The specific process is as follows:

[0323] 1. Data segmentation: Divide the received signal vector y into segments of length N. s pilot information bit sequence y s =y(1:N s ) is a sum of length N c =NN s IDMA encoded information symbol sequence y c =y(Ns +1:N);

[0324] 2. Execute sub-process E.1.I (Compressed Sensing Packet Header Detection) to obtain the packet header portion of each user information payload. and diagrams of each user interleaver

[0325] 3. Execute sub-process E.1.II (IDMA multi-user iterative detection) to obtain the data portion of each user's information payload.

[0326] 4. Assembly: Iterate through each user l and extract the packet header. With IDMA coding part The two parts are combined to form an information payload detection result of length B. Right now:

[0327] Subprocess E.1.I: Compressed sensing packet header detection:

[0328] Input: The length of the segmented data is N. s Pilot symbol sequence y s , Compressed sensing mapping matrix A, interleaver mapping set F.

[0329] Output: The header portion of each user information payload User interleaving diagrams

[0330] The specific process is as follows:

[0331] 1. OMP support set recovery: This involves restoring the pilot symbol sequence y... s The input is fed into the OMP algorithm, which searches for the components of y based on the mapping matrix A. s The set of columns of A that all user data packet headers map to, i.e., the support set.

[0332] 2. Location mapping: Mapping the support set Each element in the array (a partial column of A) corresponds one-to-one with its index in A, the first... Columns correspond to decimal numbers This yields a series of decimal numbers.

[0333] 3. Execute the following two operations in parallel:

[0334] a) Number system conversion: Convert each decimal number... Convert to length B s binary sequence

[0335] b) Interwoven pattern mapping: based on Select the first interleaver map from the set F in sequence. Interweaver diagram Obtain the interleaver patterns of each user superimposed on the current time slot.

[0336] Subprocess E.1.II: IDMA Multi-User Iterative Detection

[0337] Input: The length of the segmented data is N. c IDMA encoded information symbol sequence y c Interleaving patterns for each user Modulation constellation table A, maximum number of self-iterations of LDPC SPA decoder I1, maximum number of joint iterations of ESE multi-user detection and LDPC SPA decoder I2.

[0338] Output: Data portion of each user information payload

[0339] The specific process is as follows:

[0340] 1. Initialization: Joint iteration count ite out =0, LDPC SPA decoder self-iteration count ite in =0, after interleaving, the encoded bits c′ l Prior LLR L a (c' l ) = 0, the prior probability L of the information bit in the LDPC SPA decoder a (b l ) = 0, the number of users is determined based on the number of interleaver patterns;

[0341] 2. Determine the current joint iteration number (item). out The relationship with the maximum number of joint iterations I2, if ite out <I2, proceed to step 3; otherwise, proceed to step 6.

[0342] 3. Perform ESE multi-user detection symbol by symbol (Since ESE detection involves the mapping relationship between symbols and bits, for ease of description, it is described bit by bit and symbol by symbol, with the subscript m∈{1,…,N}) m} represents the current interleaved coded bit sequence c′ l bit c' in m,n,l It is the symbol sequence x sent by user l. l The symbol x in n,l The m-th bit is included, n∈{1,…,N} c} represents the current bit c' m,n,l This corresponds to the symbol sequence x sent by user l.l The nth modulation symbol x n,l ):

[0343] a) For each user l, iterate through all n, then iterate through all users l:

[0344] i. Interleave the encoded bits c' m,n,l The prior LLR is converted to the probability value corresponding to the bit being 0 / 1:

[0345]

[0346] ii. Based on the interleaved encoded bits c' m,n,l Given the probability distribution, find the sign of x. n,l Mean:

[0347] Where d m (x) represents the value of the m-th bit corresponding to the symbol x in the modulation constellation table A;

[0348] iii. Find the symbol x n,l variance:

[0349] d) Traverse n and l:

[0350] i. Calculation symbol x n,l Channel transition probability:

[0351] ii. Calculate the external information of the ESE output:

[0352]

[0353] e) At this point, the ESE can output the post-interleaved coded bit a posteriori (LLRL) for each user. e (c′ l );

[0354] 4. Subsequent decoding of each user's information can be processed in parallel, iterating through all users in parallel.

[0355] a) Untangling: Based on the tangling pattern Obtain the inverse mapping pattern Post-interleaved coded bit a posteriori (LLRL) for user l e (c′ l Deinterleaving is performed to obtain the encoded bits.

[0356] b) Duplicate code LLR merging: Let c j,l For c l The j-th bit in u k,l For u lThe k-th bit in Iterate through j to obtain the prior probability L of the codeword for the LDPC SPA decoder. a (u l );

[0357] c) Using information bits as a priori LLR L a (b l ) = 0 and codeword prior LLRL a (u l Using as input, the LDPC SPA decoding algorithm is started. After I1 iterations, the output information bit posterior LLR sequence L(b) is generated. l ), and codeword post-validation LLRL(u l );

[0358] d) External information processing: Calculation of L e (u l )=L(u l )-L a (u l );

[0359] e) LLR extension for repeating codes: Traversing j yields the encoded bit extrinsic information LLRL e (c l );

[0360] f) Interleaving: Encoding the extra-bit information LLRL after interleaving user l. e (c′ l Deinterleaving is performed to obtain the interleaved coded bits c′. l a priori

[0361] 5. After all users have completed the parallel traversal, the updated L is obtained. a (c′1),…,L a (c′ L Proceed to step 2; calculate the posterior probabilities of the information bits for all users: l(u1), ..., L(u... L A hard judgment is made to obtain the information portion of the test results.

[0362] Therefore, the detailed processing procedure of sub-process D.1—the single-slot decoding process—for each user's decoding transmission at the receiving end is obtained, as follows: Figures 14a-14c As shown.

[0363] Subprocess E.2: Slot-to-Slot Sequential Interference Cancellation (SIC) Decoding on the Composite Factor Diagram:

[0364] According to the decoding process of the multi-slot coding scheme, at the packet coding level, the superimposed user information on the remaining over-tolerance slots needs to be decoded through SIC. Therefore, this scheme adds a SIC decoding process based on composite factor graphs to the decoding process. Figure 15 As shown, after slot-by-slot decoding in step 1, the compressed sensing packet header y on all slots... c,v It should be translated into the header information for each user. However, the IDMA encoded portion may not be fully decoded (second type time slot v'∈V). - (Due to collision exceeding tolerance, the IDMA decoding result is unreliable). Based on the preceding factor graph reconstruction process (step 2), the k-th decoding result on slot v can establish a mapping relationship with user number l to determine the correspondence between packets and users, that is, to determine the connection relationship between slot nodes and user nodes on the factor graph (if there is a connection, it means that the user sent a copy of a packet on that slot). Therefore, the packet encoding structure of the user on the slot can be recovered as follows: Figure 15 The composite factor diagram is shown.

[0365] based on Figure 15 In the factor graph, the data packets sent by the user node to the connected time slot node can be obtained from the translated user node. That is, the message transmitted from the user node to the time slot node is the remapped transmission packet. After performing SIC, the time slot node reduces the number of users superimposed on it to the collision tolerance T. th The following steps (making the node a decodable time slot) are then performed, followed by single-slot decoding. Therefore, the user information transmitted from the time slot node to the user node is correctly decoded. The specific process of the decoding algorithm is as follows: Input: the recovered factor graph structure U, the node classification set L + V + V - Collision tolerance T th The received signal y in each time slot v And the pilot information decoded by single-slot decoding and user information Translation count

[0366] Output: Updated user information And translation count

[0367] Iterate through all time slots v'∈V that do not meet the translation conditions. - :

[0368] 1. Message passing from user node l to time slot node v':

[0369] 1-a) Counting valid edges of time slot nodes: Traverse k and check the packet header detection information translated from each node. With each Perform a comparison; if the conditions are met... And l∈L + This indicates that the k-th data packet in time slot v' has been successfully decoded in other time slots, satisfying the SIC condition. At this time, the effective connection count γ on node v' of that time slot is... v′ =γ v′ +1(γ v′ Initialize l to 0), and add l to the set of valid edges for that time slot. ( (Initialized to an empty set) until all packet headers in time slot v' are compared.

[0370] 1-b) SIC condition determination: If time slot v' satisfies the single-slot decoding condition after SIC: Then proceed to step 1-c; otherwise, proceed to step 4.

[0371] 1-c) User information remapping: Remapping the effective edge set The translated information of each user l within. After being remapped to the encoded form using process A (single-slot coding), the data packet is sent.

[0372] 1-d) Initiate the SIC procedure on this time slot: based on the message passed from user node l to time slot node v' Subtract the information already translated at time slot node v'

[0373] 2. Message passing from user node v' to time slot node l:

[0374] 2-a) Decoding recovery: As the received signal, the single-slot decoding process shown in sub-process D.1 is executed to obtain the decoding information of each user superimposed on that time slot.

[0375] 2-b) User information update: based on the detection information in Baotou. and The comparison results determine the attribution relationship between the information and the user (v',k)→l, and then... Updated to

[0376] 3. Update the slot translation count Change v' to the next V - The time slot number is determined, and the process is repeated starting from step 1.

[0377] 4. Maintain time slot translation count Change v' to the next V - The time slot number is determined, and the process is repeated starting from step 1.

[0378] Based on the above sub-processes and overall process description, we can obtain the decoding and transmission process for each user at the receiving end under the multi-slot coding scheme, as follows: Figure 16 As shown:

[0379] The embodiments of this application have the following advantages:

[0380] (1) Improve system energy efficiency.

[0381] The giant address access multi-user coded transmission scheme of this application can significantly reduce the SNR threshold compared with existing technologies (especially under the condition of multiple users).

[0382] (2) Improve throughput.

[0383] Under the same energy efficiency (signal-to-noise ratio) and packet loss rate requirements, the improved giant address access multi-user coded transmission scheme can accommodate more users, enabling the system to achieve a higher total information rate.

[0384] (3) Enhance adaptability and flexibility.

[0385] In the multi-user coding transmission scheme for giant address access in this application embodiment, the code rate of IDMA and the matrix dimension design of compressed sensing can be optimized accordingly with changes in the number of active users and actual system indicators. Under each specific configuration, a good performance level can always be achieved through parameter design. The degree distribution optimization design of the multi-slot coding scheme can also obtain the optimal configuration through optimization methods under specific configurations, thereby maximizing coding gain and enabling the receiver to eliminate multi-user interference as much as possible.

[0386] Example

[0387] according to Figure 8 and Figure 9 The system architecture and technical process details shown in A through E implement two giant address access coding schemes, with the following configuration parameters:

[0388] Table 2: Configuration of Single-Slot Coordinated Giant Address Access Scheme

[0389]

[0390]

[0391] Table 3: Configuration of Multi-Slot Coding Giant Address Access Scheme

[0392]

[0393] Under the aforementioned large address access configuration, a simulation was conducted using the above-described encoding and transmission scheme. The relationship between the SNR required for the system to achieve a PUPR of 0.01 and the number of active users was examined. The simulation results are as follows: Figure 17 As shown:

[0394] The two comparative schemes selected in the figure are both based on single-slot coding. BCH-CC is a soft symbol detection BCH concatenated code coding scheme, Sparse IDMA is the scheme introduced in the giant address access technology based on sparse spread spectrum, and CS is the compressed sensing spread spectrum scheme introduced in the design of concatenated compressed sensing coding scheme. Looking at the longitudinal perspective, our scheme has a significant performance advantage over the other two schemes: our scheme improves system energy efficiency by 1dB compared to the CS scheme, and by more than 3dB compared to the BCH scheme. The BCH scheme, due to its low coding efficiency and reliance on channel equivalence, experiences rapid performance degradation in scenarios with high user numbers and dense collisions. The compressed sensing scheme, due to increased collisions as the number of users increases, requires increasing the number of slots to maintain sparsity, thus increasing the depth of tree coding and raising the error rate of code block merging, resulting in a significant performance degradation. Our proposed scheme, however, has the best slope advantage; due to the use of intra-slot diversity, its single-slot coding SNR threshold exhibits a basically low-slope linear growth trend. In a horizontal comparison, this solution improves the system capacity by more than 30% compared to pure compressed sensing when SNR=5.

[0395] See Figure 18 This application provides a data processing apparatus for use at a transmitting end. The apparatus 1800 includes:

[0396] The first processing module 1801 is used to obtain the pilot information bit sequence and the data information bit sequence based on the information payload;

[0397] The second processing module 1802 is used to obtain the packet header part based on the pilot information bit sequence;

[0398] The third processing module 1803 is used to obtain the IDMA encoded part based on the pilot information bit sequence and the first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence;

[0399] The fourth processing module 1804 is used to obtain data packets based on the packet header and the IDMA encoding portion.

[0400] In one embodiment of this application, the apparatus further includes:

[0401] The first sending module is used to send the data packet through a single time slot.

[0402] In one embodiment of this application, the apparatus further includes:

[0403] The second sending module is used to send the data packet through a multi-timeslot mapping method.

[0404] In one embodiment of this application, the second sending module is further configured to: perform multi-slot mapping on the data packet according to the mapping pattern vector, and send the mapped data packet into the channel.

[0405] In one embodiment of this application, the second sending module includes:

[0406] The first acquisition unit is used to acquire the mapping pattern vector;

[0407] The sending unit is used to map the data packet to a position of 1 in the mapping pattern vector and send the data packet at position 1 to the channel.

[0408] In one embodiment of this application, the first acquisition unit is further configured to:

[0409] Based on the unequal diversity degree, the random repetition count β of the data packet is obtained. l ;

[0410] Based on the number of random repetitions β l Get a top β l A vector with 1 element in each position and 0 elements in the other positions, and a total length of V;

[0411] The vector is uniformly and randomly interwoven so that element 1 is evenly distributed at all positions, thus obtaining the mapping pattern vector;

[0412] Where V represents the total number of time slots.

[0413] In one embodiment of this application, the apparatus further includes:

[0414] The first acquisition module is used to acquire configuration information, which includes: the number of active users and / or the number of time slots;

[0415] The fifth processing module is used to obtain the unequal diversity distribution based on the configuration information and at least one of the SIC convergence optimization objective, the SIC start-up condition optimization objective, and the packet coding energy efficiency optimization objective.

[0416] In one embodiment of this application, the SIC convergence optimization objective refers to an unequal diversity distribution that satisfies SIC iterative convergence and minimizes the collision threshold.

[0417] In one embodiment of this application, the optimization objective of the SIC initiation condition is to: simulate the SIC process through Monte Carlo simulation and verify the unequal diversity distribution of the SIC process initiation with a preset probability under multiple Monte Carlo simulations.

[0418] In one embodiment of this application, the data packet coding energy efficiency optimization objective refers to the unequal diversity distribution corresponding to the lowest SNR value after data packet coding.

[0419] In one embodiment of this application, the third processing module 1803 is further configured to:

[0420] The data information bit sequence is encoded using a channel encoder (such as an LDPC code encoder; other channel encoders that can achieve similar functions can also be used here, and there is no limitation on this) to obtain an initial bit sequence.

[0421] The initial bit sequence is repeatedly encoded to obtain the first bit sequence.

[0422] In one embodiment of this application, the third processing module 1803 is further configured to:

[0423] Based on the first bit sequence and the interleaver pattern corresponding to the pilot information bit sequence, the interleaved second bit sequence is obtained;

[0424] The IDMA coded portion is obtained based on the second bit sequence and the preset modulation constellation table.

[0425] In the embodiments of this application, the device is capable of implementing this application. Figure 6 The various processes implemented in the method embodiments shown, and the same beneficial effects achieved, will not be described again here to avoid repetition.

[0426] See Figure 19 This application provides a data processing apparatus, which is applied at a receiving end. The apparatus 1900 includes:

[0427] The first receiving module 1901 is used to receive data packets, the data including a header and an IDMA encoded portion. The IDMA encoded portion is obtained by the transmitting end based on the pilot information bit sequence and a first bit sequence, the first bit sequence being obtained by repeatedly encoding the data information bit sequence.

[0428] In one embodiment of this application, the apparatus includes:

[0429] The sixth processing module is used to obtain the information payload by single-slot decoding if the data packet is sent by the sender through a single time slot.

[0430] In one embodiment of this application, the apparatus includes:

[0431] The seventh processing module is used to obtain the information payload by means of single-slot decoding and inter-slot serial interference cancellation decoding on the composite factor graph if the data packet is sent by the sending end through multi-slot mapping.

[0432] In one embodiment of this application, single-slot decoding includes:

[0433] Based on the data packet, the pilot symbol sequence and the coded information symbol sequence are obtained;

[0434] Based on the pilot symbol sequence, determine the header portion of the information payload and the interleaver pattern;

[0435] Under the condition of joint iteration of ESE multi-user detection and channel decoder, the data part of the information payload is obtained according to the encoded information symbol sequence and the interleaver pattern;

[0436] The information payload is obtained based on the header portion and the data portion.

[0437] In one embodiment of this application, under the condition of joint iteration of ESE multi-user detection and channel decoder, the data portion of the information payload is obtained according to the encoded information symbol sequence and the interleaver pattern, including:

[0438] Determine whether the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations;

[0439] When the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations, ESE multi-user detection is performed on the encoded information symbol sequence to obtain the interleaved coded bit a posteriori (LLR).

[0440] The interleaved coded bits a posteriori LLR are deinterleaved according to the interleaver pattern to obtain the coded bits LLR;

[0441] The channel decoder decodes the LLR coded bits, and when the maximum number of iterations of the LDPC SPA decoder is reached, the channel decoder outputs the decoding result.

[0442] The decoding result output by the channel decoder is subjected to repeat code LLR expansion and / or interleaving, and then the step of determining whether the current ESE multi-user detection and channel decoder joint iteration number is less than or equal to the maximum joint iteration number is returned.

[0443] When the number of joint iterations of the current ESE multi-user detection and channel decoder is greater than the maximum number of joint iterations, the data part of the information payload is obtained based on the decoding result output by the channel decoder.

[0444] In one embodiment of this application, inter-slot serial interference cancellation decoding on the composite factor graph includes:

[0445] For each time slot, the packet header and IDMA encoded portion are obtained through single-time-slot decoding.

[0446] The composite factor diagram is obtained through the aforementioned head section;

[0447] Obtain the time slot nodes and user nodes in the composite factor graph, where the time slot node represents the IDMA coding result within a single time slot, and the user node represents the IDMA decoding result for each user;

[0448] The time slot nodes are classified into a first type of time slot node and a second type of time slot node; wherein, the number of undecoded users superimposed on the first type of time slot is less than or equal to the time slot collision threshold, and the number of undecoded users superimposed on the second type of time slot is greater than the time slot collision threshold.

[0449] Based on the process of the first type of time slot node transmitting information to the user node, and the process of the user node transmitting information to the second type of time slot node, some second type of time slot nodes are converted into first type of time slot nodes, so that the number of users of some second type of time slot nodes after interference cancellation is lower than a preset threshold, until all second type of time slot nodes are converted into first type of time slot nodes.

[0450] The information output by the user node is used as the decoding result of the IDMA encoded part;

[0451] Specifically, each time the first type of time slot node transmits information to the user node, an IDMA decoding is required, and each time the user node transmits information to the second type of time slot node, an IDMA encoding is required.

[0452] In the embodiments of this application, the device is capable of implementing this application. Figure 7 The various processes implemented in the method embodiments shown, and the same beneficial effects achieved, will not be described again here to avoid repetition.

[0453] Optional, such as Figure 20 As shown, this application embodiment also provides a communication device 2000, including a processor 2001, a memory 2002, and a program or instructions stored in the memory 2002 and executable on the processor 2001. When the program or instructions are executed by the processor 2001, they implement the above-mentioned... Figure 6 or Figure 7The various processes of the method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0454] This application embodiment also provides a readable storage medium storing a program or instructions that, when executed by a processor, implement the above-described functionality. Figure 6 or Figure 7 The various processes of the method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0455] The processor mentioned above is the processor in the terminal described in the above embodiments. The readable storage medium includes computer-readable storage media, such as computer read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.

[0456] This application embodiment also provides a chip, which includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the various processes of the above information processing method embodiments and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0457] It should be understood that the chip mentioned in the embodiments of this application may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.

[0458] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

[0459] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a computer software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network-side device, etc.) to execute the methods described in the various embodiments of this application.

[0460] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A data processing method, applied at a sending end, characterized in that, include: Based on the information payload, the pilot information bit sequence and the data information bit sequence are obtained; Compressed sensing encoding is performed based on the pilot information bit sequence and the compressed sensing mapping matrix to obtain the packet header. Based on the pilot information bit sequence and the first bit sequence, the interleaved split multiple access (IDMA) coding portion is obtained, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence; The data packet is obtained based on the header portion and the IDMA encoding portion.

2. The method according to claim 1, characterized in that, The method further includes: The data packet is transmitted in a single time slot; or, The data packets are sent using a multi-timeslot mapping method.

3. The method according to claim 2, characterized in that, Sending the data packets via multi-timeslot mapping includes: Based on the mapping pattern vector, the data packet is mapped to multiple time slots, and the mapped data packet is sent.

4. The method according to claim 3, characterized in that, Based on the mapping pattern vector, the data packet is mapped to multiple time slots, and the mapped data packet is sent, including: Obtain the mapped pattern vector; The data packet is mapped to position 1 in the mapping pattern vector, and the data packet at position 1 is sent.

5. The method according to claim 4, characterized in that, The process of obtaining the mapping pattern vector includes: The random repetition count of the data packet is obtained based on the unequal diversity degree. ; Based on the number of random repetitions Get a previous The first element is 1, and the other elements are 0. The total length is [length missing]. ; The vector is uniformly and randomly interwoven so that element 1 is evenly distributed at all positions, thus obtaining the mapping pattern vector; in, This indicates the total number of time slots.

6. The method according to claim 5, characterized in that, The method further includes: Obtain configuration information, which includes: number of active users and / or number of time slots; Based on the configuration information and at least one of the following objectives: serial interference elimination SIC convergence optimization objective, SIC start-up condition optimization objective, and packet coding energy efficiency optimization objective, an unequal diversity distribution is obtained.

7. The method according to claim 6, characterized in that, The SIC convergence optimization objective refers to an unequal diversity distribution that satisfies SIC iterative convergence and minimizes the time slot collision threshold.

8. The method according to claim 6, characterized in that, The optimization objective of the SIC initiation conditions is to: simulate the SIC process through Monte Carlo simulation and verify the unequal diversity distribution of the SIC process initiation with a preset probability under multiple Monte Carlo simulations.

9. The method according to claim 6, characterized in that, The data packet coding energy efficiency optimization objective refers to the unequal diversity distribution corresponding to the lowest signal-to-noise ratio (SNR) value after data packet coding.

10. The method according to claim 1, characterized in that, The first bit sequence is obtained by repeatedly encoding the data information bit sequence, including: The data information bit sequence is encoded using a channel encoder to obtain an initial bit sequence; The initial bit sequence is repeatedly encoded to obtain the first bit sequence.

11. The method according to claim 1, characterized in that, Based on the pilot information bit sequence and the first bit sequence, the IDMA encoded part is obtained, including: Based on the first bit sequence and the interleaver pattern corresponding to the pilot information bit sequence, the interleaved second bit sequence is obtained; The IDMA coded portion is obtained based on the second bit sequence and the preset modulation constellation table.

12. A data processing method, applied at a receiving end, characterized in that, include: The receiver receives a data packet, which includes a header and an IDMA encoded portion. The IDMA encoded portion is obtained by the transmitter based on a pilot information bit sequence and a first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding a data information bit sequence. The header is obtained by the transmitter through compressed sensing encoding based on the pilot information bit sequence and a compressed sensing mapping matrix. The header is obtained by the receiver through parsing the pilot information bit sequence.

13. The method according to claim 12, characterized in that, The method includes: If the data packet is sent by the sender through a single time slot, the information payload of the data packet is obtained according to the single time slot decoding. or, If the data packet is sent by the sender using a multi-slot mapping method, the information payload of the data packet is obtained based on single-slot decoding and inter-slot serial interference cancellation decoding on the composite factor graph.

14. The method according to claim 13, characterized in that, Single-slot decoding includes: Based on the data packet, the pilot symbol sequence and the coded information symbol sequence are obtained; Based on the pilot symbol sequence, determine the packet header portion and the interleaver pattern; Under the condition of joint iteration of basic signal estimator ESE multi-user detection and channel decoder, the data part is obtained according to the encoded information symbol sequence and the interleaver pattern; The information payload is obtained based on the header portion and the data portion.

15. The method according to claim 14, characterized in that, Under the condition of satisfying the joint iteration of ESE multi-user detection and channel decoder, the data part of the information payload is obtained according to the encoded information symbol sequence and the interleaver pattern, including: Determine whether the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations; When the current number of joint iterations of ESE multi-user detection and channel decoder is less than or equal to the maximum number of joint iterations, ESE multi-user detection is performed on the encoded information symbol sequence to obtain the posterior log-likelihood ratio (LLR) of the interleaved encoded bits. The interleaved coded bits a posteriori LLR are deinterleaved according to the interleaver pattern to obtain the coded bits LLR; The channel decoder decodes the LLR coded bits, and when the maximum number of iterations of the channel decoder is reached, the channel decoder outputs the decoding result. The decoding result output by the channel decoder is subjected to repeat code LLR expansion and / or interleaving, and then the step of determining whether the current ESE multi-user detection and channel decoder joint iteration number is less than or equal to the maximum joint iteration number is returned. When the current number of joint iterations of ESE multi-user detection and channel decoder is greater than the maximum number of joint iterations, the data part is obtained based on the decoding result output by the channel decoder.

16. The method according to claim 14, characterized in that, Inter-slot serial interference cancellation decoding on the composite factor graph includes: For each time slot, the packet header and IDMA encoded portion are obtained through single-time-slot decoding. The composite factor diagram is obtained through the aforementioned head section; Obtain the time slot nodes and user nodes in the composite factor graph, where the time slot node represents the IDMA coding result within a single time slot, and the user node represents the IDMA decoding result for each user; The time slot nodes are classified into a first type of time slot node and a second type of time slot node; wherein, the number of undecoded users superimposed on the first type of time slot is less than or equal to the time slot collision threshold, and the number of undecoded users superimposed on the second type of time slot is greater than the time slot collision threshold. Based on the process of the first type of time slot node transmitting information to the user node, and the process of the user node transmitting information to the second type of time slot node, some second type of time slot nodes are converted into first type of time slot nodes, so that the number of users of some second type of time slot nodes after interference cancellation is lower than a preset threshold, until all second type of time slot nodes are converted into first type of time slot nodes. The information output by the user node is used as the decoding result of the IDMA encoded part; Specifically, each time the first type of time slot node transmits information to the user node, an IDMA decoding is required, and each time the user node transmits information to the second type of time slot node, an IDMA encoding is required.

17. A data processing apparatus, applied at a transmitting end, characterized in that, include: The first processing module is used to obtain the pilot information bit sequence and the data information bit sequence based on the information payload; The second processing module is used to perform compressed sensing encoding based on the pilot information bit sequence and the compressed sensing mapping matrix to obtain the packet header. The third processing module is used to obtain the IDMA encoded part based on the pilot information bit sequence and the first bit sequence, wherein the first bit sequence is obtained by repeatedly encoding the data information bit sequence; The fourth processing module is used to obtain the data packet based on the packet header and the IDMA encoding portion.

18. A data processing apparatus, applied at a receiving end, characterized in that, include: The first receiving module is used to receive data packets, the data packets including a header and an IDMA encoded portion. The IDMA encoded portion is obtained by the transmitting end based on the pilot information bit sequence and a first bit sequence, the first bit sequence being obtained by repeatedly encoding the data information bit sequence. The header is obtained by the transmitting end through compressed sensing encoding based on the pilot information bit sequence and the compressed sensing mapping matrix. The header is obtained by the receiving end through parsing based on the pilot information bit sequence.

19. A communication device, comprising a memory, a processor, and a program stored in the memory and executable on the processor; characterized in that, When the processor executes the program, it implements the steps of the method as described in any one of claims 1 to 16.

20. A readable storage medium having a program stored thereon, characterized in that, When the program is executed by a processor, it implements the steps of the method as described in any one of claims 1 to 16.

Images