A segmented interleaving transmission method, device and system for sparse code multiple access communication

Abstract

The application discloses a segmented interleaving transmission method, device and system for sparse code multiple access communication, relates to the technical field of communication, and comprises the following steps: acquiring decoding gain and cumulative information gain by adopting group interleaving delay mapping and interleaving Markov superposition mapping, and realizing transmission decoding by a joint detection decoding mechanism of adaptive sequential decoding and superposition decoding, so that the transmission performance of the sparse code multiple access scheme is improved.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a segmented interleaving transmission method, apparatus and system for sparse code multiple access communication. Background Technology

[0002] With the development of sixth-generation mobile communication (6G), the demands for massive machine-type communication (mMTC) and ultra-reliable low-latency communication (URLLC) have placed higher requirements on the connection capacity and spectral efficiency of wireless networks. Among these, non-orthogonal multiple access (NOMA) technology has been established as one of the key technologies for 5G and future 6G. NOMA technology can be classified into power domain NOMA (PD-NOMA) and code domain NOMA (CD-NOMA). The former mainly uses the different power levels between users for differentiation, while the latter relies on a specially designed codebook or sequence. Sparse code multiple access (SCMA) in code domain NOMA has received widespread attention.

[0003] SCMA essentially enables multiple users to share the same resource block through a sparse codebook. This sharing mechanism (i.e., non-orthogonality) inevitably leads to overlap of user signals at the receiver, making it difficult to completely separate signals from different users. To mitigate inter-user interference, spread spectrum repetition coding technology is typically used. Its working principle is to copy the coded bits at the transmitter and transmit them over the channel, then perform soft information combining at the receiver. However, traditional repetition coding only treats repeated bits as redundant information, making it difficult for repeated information to provide significant decoding gain, thus limiting the improvement of transmission performance. Summary of the Invention

[0004] This invention provides a segmented interleaving transmission method, apparatus and system for sparse code multiple access communication, which solves the technical problem that existing SCMA schemes only treat repeated bits as redundant information when using repetition coding to alleviate inter-user interference, resulting in limited transmission performance improvement.

[0005] The first aspect of this invention provides a segmented interleaving transmission method for sparse code multiple access communication, comprising: Determine time slot The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ; The all-zero coded block is compared with the first One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals; For the One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. Based on the encoded transmitted signal, the encoded received signal is sequentially decoded to determine the time slot. The a posteriori LLRs of the original coded blocks; If time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; When the gap The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0006] Optionally, the step of combining the all-zero coded block with the first One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals, including: The all-zero coded block, the first One copy of the coded block Grouping with the original encoded block to determine One encoding group, including: ; In the formula, Indicates the first coding group. Indicates time slot , This represents the first raw coded block. Indicates an all-zero coded block. Indicates the coded group index. Indicates the first One coding group, Indicates the index of the original encoded block. Indicates the number of original coded blocks. Indicates time slot The One original encoded block, Indicates time slot The The first copy of the original encoded block, Indicates the first One coding group, Indicates time slot The The first copy of the original encoded block; For coding group and coding group Bits are extracted sequentially from the original coded block, and bits are extracted from the all-zero coded block or the copy coded block to form multiple QPSK symbols; For coding group Bits are extracted sequentially from the copy coded block to form multiple QPSK symbols; Each QPSK symbol is transmitted as an encoded transmission signal.

[0007] Optionally, the first One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and transmitted as a replica, including: For the first One copy of the coded block Perform cyclic bit interleaving and superposition across time slots to determine the time slots. The stacked blocks include: ; In the formula, Indicates time slot , Indicates a replica index. Indicates time slot The An overlay of copies of the encoded block Indicates the number of original coded blocks. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The One copy of the encoded block, Indicates time slot The The first original coded block One copy of the encoded block, Indicates time slot The Interleaved blocks of 1 copy coded blocks Indicates bit index, Indicates the number of bits. Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block Interleaved blocks of 1 copy coded blocks Indicates the index of the original encoded block. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block The interleaved block of the 1st replica coded block bits, Represents the XOR operation; The superimposed blocks are modulated into QPSK symbols and then transmitted as replica signals.

[0008] Optionally, the encoded received signal based on the encoded transmitted signal is sequentially decoded to determine the time slot. The a posteriori LLRs of the original coded blocks include: The encoded received signal of the encoded transmitted signal coded groups The sub-coded received signal, based on time slots The The posterior LLRs of the first copy of the original coding block Time slots are determined using a message passing algorithm. The Prior LLRs of each original coded block And perform BP decoding to determine the time slot. The A posteriori LLRs of the original coded blocks ; For posterior LLRs Perform decoding verification and determine the decoding verification result; If posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of the original coded blocks ; If posterior LLRs If the decoding verification result is unsuccessful, then based on a posteriori LLRs... For the coded groups The sub-coded received signal determines the time slot through a message passing algorithm. The Prior LLRs of the first copy of the original coding block and time slot The Prior LLRs of each original coded block Prior LLRs and prior LLRs After merging, perform BP decoding and update the time slots. The A posteriori LLRs of the original coded blocks If posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of each original coded block If the posterior LLRs If the decoding verification result is unsuccessful, then a priori LLRs are used. Perform BP decoding to determine the time slot. The A posteriori LLRs of each original coded block ; According to posterior LLRs The decoding verification result determines the time slot. The A posteriori LLRs of each original coded block until Decoding then completes, and the time slot is determined. The a posteriori LLRs of the original coded blocks; Among them, initialization .

[0009] Optionally, the if time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence includes: If time slot If the decoding verification result is unsuccessful, then update the current superimposed decoding count and based on the time slot. A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs ; The superposition prior LLRs of each replica coded block of the replica transmitted signal and the replica received signal are determined. ; Based on replica posterior LLRs and superimposed prior LLRs Determine time slot The Interleaved Priors LLRs of Each Replica Coded Block ,include: ; In the formula, Indicates a replica index. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block 1 bit of replica post-hoc LLRs, Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; For intertwined prior LLRs Deinterleaving into time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs ; Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots The BP decoding of the encoded received signal, output time slot A posteriori LLRs of the original coded blocks ; If posterior LLRs If the decoding verification result is unsuccessful, and the current number of superimposed decoding iterations has not reached the maximum number of superimposed decoding iterations, then the posterior LLRs are... Replication to generate time slots The Each copy of the LLRs Then, interleaving is performed to generate time slots. The Interleaved blocks of replica coded blocks with replica post-replication LLRs ; Interleaving blocks of copy-after-LLRs With superimposed prior LLRs Perform XOR operation to generate time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs ,include: ; In the formula, Indicates time slot The The first original coded block The first copy of the encoded block Deinterleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved blocks of 1 bit replica post-LLRs Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots BP decoding of the encoded received signal, updating the time slot A posteriori LLRs of the original coded blocks And jump to execute the update of the current overlay decoding count, based on the time slot. A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs Steps; If posterior LLRs If the decoding verification result is successful, or the current number of superimposed decoding iterations reaches the maximum number of superimposed decoding iterations, then based on the time slot... The a posteriori LLRs of the original coded block correspond to the time slot determination. The decoded bit sequence.

[0010] The second aspect of this invention provides a segmented interleaving transmission apparatus for sparse code multiple access communication, used to implement the segmented interleaving transmission method for sparse code multiple access communication as described in any one of the first aspects of this invention, comprising: Encoding module, used to determine time slots The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ; The delay mapping module is used to map all-zero coded blocks to the first... One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals; The overlay mapping module is used to map the first... One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. The sequential decoding module is used to perform sequential decoding on the encoded received signal based on the encoded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded blocks; Overlay decoding module, used for multiple time slots If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; Decoding output module, used for time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0011] The third aspect of this invention provides a segmented interleaving transmission system for sparse code multiple access communication, used to implement the segmented interleaving transmission method for sparse code multiple access communication as described in any of the first aspects of this invention, comprising: The transmitter is used to: determine time slots. The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ;Match the all-zero coded block with the first One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of the first coding group are then transmitted as coded transmission signals; for the first... One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. The receiving end is configured to: sequentially decode the encoded received signal based on the encoded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded block; if the time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; when the time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0012] A fourth aspect of the present invention provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor causes the processor to perform the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in any of the preceding claims of the first aspect of the present invention.

[0013] The fifth aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed, it implements the segmented interleaving transmission method for sparse code multiple access communication as described in any of the preceding claims of the first aspect of the present invention.

[0014] The sixth aspect of the present invention provides a computer program product comprising a computer program / instruction, wherein when the computer program / instruction is executed by a processor, it implements the segmented interleaving transmission method for sparse code multiple access communication as described in any of the preceding claims of the first aspect of the present invention.

[0015] As can be seen from the above technical solutions, the present invention has the following advantages: The above-described solution of the present invention provides a segmented interleaving transmission method for sparse code multiple access communication, comprising: determining time slots. The information bit sequence corresponding to One raw coded block Perform on each original coded block Repeated encoding to determine the corresponding One copy of the coded block ;Match the all-zero coded block with the first One copy of the coded block After merging, the blocks are sequentially grouped and interleaved with the original coded blocks, and the delay mapping is performed as follows: The QPSK symbols of the first coding group are then transmitted as coded transmission signals; for the first... One copy of the coded block After interleaving and Markov superposition, the signal is mapped to QPSK symbols and transmitted as a replica. The encoded and received signals are then sequentially decoded based on the encoded transmitted signals to determine the time slots. The a posteriori LLRs of the original coded block; if the time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; when the time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoding bit sequence. Based on the above scheme, group interleaving delay mapping is used to incorporate coding and modulation into a joint design framework so that repetitive information can provide a large decoding gain. Interleaving Markov superposition mapping is used to achieve cross-time slot data coupling, which helps to obtain cumulative information gain from the time domain. At the same time, a matching joint detection decoding mechanism is set up. Thanks to the data processing advantage of performing joint coding and modulation optimization at the transmitter, even if the channel is in deep fading and the data at a certain moment is completely damaged, the original data can still be recovered using the coupling information of other time slots, thus improving the transmission performance of the SCMA scheme. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0017] Figure 1 This is a flowchart illustrating the steps of a segmented interleaving transmission method for sparse code multiple access communication provided in Embodiment 1 of the present invention. Figure 2 This is a schematic diagram of the packet interleaving delay mapping process provided in Embodiment 1 of the present invention; Figure 3 A flowchart illustrating the steps of a method provided in Embodiment 1 of the present invention; Figure 4 This is a schematic diagram of the LLR update mechanism in superposition decoding provided in Embodiment 1 of the present invention; Figure 5 This is the bit error rate performance curve with a repetition count of 1 provided in Embodiment 1 of the present invention; Figure 6 The frame error rate performance curve provided in Embodiment 1 of the present invention with a repetition count of 1; Figure 7 This is the bit error rate performance curve with a repetition count of 2 provided in Embodiment 1 of the present invention; Figure 8 The frame error rate performance curve with a repetition count of 2 provided in Embodiment 1 of the present invention; Figure 9 This is a structural block diagram of a segmented interleaving transmission device for sparse code multiple access communication provided in Embodiment 2 of the present invention.

[0018] Figure 10 This is a structural block diagram of a segmented interleaved transmission system for sparse code multiple access communication provided in Embodiment 3 of the present invention. Detailed Implementation

[0019] This invention provides a segmented interleaving transmission method, apparatus, and system for sparse code multiple access communication, which addresses the technical problem that existing SCMA schemes, when using repetitive coding to mitigate inter-user interference, only treat repetitive bits as redundant information, resulting in limited transmission performance improvement.

[0020] To make the objectives, features, and advantages of this invention more apparent and understandable, the technical solutions of the embodiments of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the embodiments described below are only some embodiments of this invention, and not all embodiments. Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention.

[0021] Please see Figure 1 The present invention provides a segmented interleaved transmission (SWIT) method for sparse code multiple access communication, the core design of which is to improve the performance of SCMA system by implementing a joint coding and modulation optimized data processing strategy at the transmitting end and adopting an adapted joint detection and decoding mechanism at the receiving end. This method can be applied to communication scenarios supporting 6G multi-user wireless communication, IoT communication, etc. The method includes: Step 101: Determine the time slot The information bit sequence corresponding to One raw coded block Perform on each original coded block Repeated encoding to determine the corresponding One copy of the coded block .

[0022] The raw coded block refers to the block obtained after channel coding of the user's information bits.

[0023] A copy block refers to a block of codes that has the same structure as the original block after being repeated, copied, or re-encoded. Each repetition is called a copy.

[0024] It should be noted that the key parameters defined during the initialization at the transmitting end include: time slot index. The number of repetitions (i.e., the number of copies) for each time slot. And the number of coded blocks in each time slot before repetition (i.e., the original number of coded blocks). Based on this, each time slot contains a total of One coded block; Specifically, time slots are set. The transmitted information bit sequence is processed by its respective encoder (such as a P-LDPC encoder) to obtain the corresponding... The original coded blocks are ,in It is a time slot The 1 original coded block and length is , Indicates the number of bits. This represents the index of the original encoded block, and after... After repeating this process, we get... One copy of the coded block , Indicates a replica index. Indicates time slot The The first original coded block There are copies of the encoded block, thus totaling _ ... The coded blocks are divided into three parts: (a) the original coded blocks (b) One copy of the coded block (c) the rest The first copy, i.e., the 1st copy One copy of the coded block .

[0025] Step 102: Combine the all-zero encoded block with the first... One copy of the coded block After merging, the blocks are sequentially grouped and interleaved with the original coded blocks, and the delay mapping is performed as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals.

[0026] A coding group refers to a group of coded blocks that are transmitted together.

[0027] Encoded transmission signals refer to transmission signals modulated based on the original coded block and the copy coded block.

[0028] In one specific embodiment of this example, step 102 includes the following sub-steps: S11, Encode the all-zero block, the first One copy of the coded block Grouping with the original coded blocks to determine One coding group; S12, For the coding group and coding group Bits are extracted sequentially from the original coded block, and bits are extracted from the all-zero coded block or the copy coded block to form multiple QPSK symbols; S13, For the coding group Bits are extracted sequentially from the copy coded block to form multiple QPSK symbols; S14. Transmit each QPSK symbol as an encoded transmission signal.

[0029] It should be noted that, in order to facilitate the joint design of channel coding and resource mapping, this embodiment combines the coded blocks of part (a) and part (b) together for transmission. Specifically, as follows: Figure 2 As shown: Given an all-zero coded block and a coding group index tag Determined according to preset grouping rules One encoding group, including: ; In the formula, Indicates the first coding group. Indicates time slot , This represents the first raw coded block. Indicates an all-zero coded block. Indicates the coded group index. Indicates the first One coding group, Indicates the index of the original encoded block. Indicates the number of original coded blocks. Indicates time slot The One original encoded block, Indicates time slot The The first copy of the original encoded block, Indicates the first One coding group, Indicates time slot The The first copy of the original encoded block; Subsequently, for the coding group Bit-level interleaving is performed to construct modulation symbols, that is, one bit is extracted sequentially from the first coded block (i.e., the original coded block) and the second coded block (i.e., the all-zero coded block or the first copy coded block) in the coded group to form a QPSK symbol; while for the last coded group... Then, two bits are extracted sequentially from a single coded block to form a QPSK symbol; the coded transmission signal is then transmitted to the receiving end based on the above modulation symbols.

[0030] It is understandable that when the original encoded block After being decoded, its soft information (i.e., LLR) can assist The detection, thereby improving the ability to target The interference cancellation effect, among which .

[0031] Step 103, for the first One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal.

[0032] The replica transmission signal refers to the transmission signal modulated based on the replica coded block.

[0033] In one specific embodiment of this example, step 103 includes the following sub-steps: S21, respectively for the first One copy of the coded block Perform cyclic bit interleaving and superposition across time slots to determine the time slots. Overlay blocks; S22. After the superimposed block is modulated into a QPSK symbol, it is transmitted as a replica signal.

[0034] It should be noted that traditional repetitive coding designs are usually limited to a single transmission slot and cannot obtain accumulated information gain from the time domain. This embodiment introduces a cross-slot data coupling mechanism, which creates a dependency between data in different slots, thereby breaking the inherent characteristic of independent data transmission in the time domain. This allows the advantages of joint cross-slot data transmission to be utilized to resist channel fading. Specifically: To further reduce the number of erroneous bits in transmission slots, this embodiment introduces Markov superposition to establish structured dependencies between different coding blocks in consecutive slots. This superposition mechanism enables soft information exchange between different transmitted data frames: [The text abruptly ends here, likely due to an incomplete sentence or missing information.] The rest The coded block (i.e., part (c)) is defined as follows: ,in Define time slots The interwoven version of part (c) is Among them, for of Through in The cyclic bit interleaving strategy is used between each coded block; based on and The bit-level XOR operation between them constructs the corresponding stacked block. ,in, Specifically, it includes: ; In the formula, Indicates time slot , Indicates a replica index. Indicates time slot The An overlay of copies of the encoded block Indicates the number of original coded blocks. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The One copy of the encoded block, Indicates time slot The The first original coded block One copy of the encoded block, Indicates time slot The Interleaved blocks of 1 copy coded blocks Indicates bit index, Indicates the number of bits. Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block Interleaved blocks of 1 copy coded blocks Indicates the index of the original encoded block. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block The interleaved block of the 1st replica coded block bits, Represents the XOR operation; After each superimposed block is modulated into a QPSK symbol, a replica signal is formed and transmitted to the receiving end.

[0035] Understandably, Markov superpositions construct a temporal Markov chain between adjacent time slots; therefore, the decoding of a coded block depends not only on the current observation but also on the next observation. Specifically, when... In the time slot If it cannot be correctly decoded, then in two adjacent time slots and Iterative decoding between the two methods enables successful decoding.

[0036] For example, such as Figure 3 As shown, the interleaved Markov superposition coding process with a repetition count of 2 is given.

[0037] It is understandable that we assume each coded block is in Carrying in each coded bit For each information bit, the spectral efficiency of traditional repetitive transmission includes: The spectral efficiency of the SWIT scheme proposed in this embodiment includes: By comparing the two, it can be seen that the rate loss in this implementation is only And with the number of transmission coding blocks and number of repetitions With the increase of [something], this loss can be significantly reduced.

[0038] Step 104: Sequentially decode the coded received signal based on the coded transmitted signal to determine the time slot. The a posteriori LLRs of the original encoded block.

[0039] In one specific embodiment of this example, step 104 includes the following sub-steps: S31, the encoded received signal of the encoded transmitted signal coded groups The sub-coded received signal, based on time slots The The posterior LLRs of the first copy of the original coding block Time slots are determined using a message passing algorithm. The Prior LLRs of each original coded block And perform BP decoding to determine the time slot. The A posteriori LLRs of each original coded block ; S32, For posterior LLRs Perform decoding verification and determine the decoding verification result; S33, if posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of each original coded block ; S34. If posterior LLRs If the decoding verification result is unsuccessful, then based on a posteriori LLRs... For the coded groups The sub-coded received signal determines the time slot through a message passing algorithm. The Prior LLRs of the first copy of the original coding block and time slot The Prior LLRs of each original coded block Prior LLRs and prior LLRs After merging, perform BP decoding and update the time slots. The A posteriori LLRs of each original coded block If posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of each original coded block If the posterior LLRs If the decoding verification result is unsuccessful, then a priori LLRs are used. Perform BP decoding to determine the time slot. The A posteriori LLRs of each original coded block ; S35, Based on posterior LLRs The decoding verification result determines the time slot. The A posteriori LLRs of each original coded block until Decoding then completes, and the time slot is determined. The a posteriori LLRs of the original coded blocks; Among them, initialization .

[0040] It should be noted that in time slots The received encoded received signal includes the corresponding Data of each coding group The sub-coded received signal, wherein, the first Each of the sub-coded received signals corresponds to two coded blocks. (in ), This represents an all-zero coded block, while the last one (i.e., the first...) represents the... (Each) sub-coded received signal corresponds to a single coded block In this embodiment, the receiving end is configured for the current time slot. The encoded received signal is sequentially decoded: for The sub-coded received signal is first utilized Known posterior LLRs Execute the message passing algorithm (MPA) to detect and determine prior LLRs Then to Perform BP decoding to obtain its corresponding a posteriori LLRs Subsequently, using Support The detection, because and They are the same, but two different decoding and verification scenarios need to be considered. 1) If A posteriori LLRs obtained in the previous decoding If the decoding is confirmed as successful through decoding verification (such as LDPC), then let... Directly to The sub-coded received signal undergoes MPA detection and BP decoding, and the BP algorithm is executed to obtain its corresponding a posteriori LLRs. ; 2) If Posterior LLRs The first decoding attempt was deemed unsuccessful, based on the first attempt. right The original coded block in the sub-coded received signal and copy code block Performing MPA testing yields the corresponding prior LLRs. and prior LLRs ,Will Prior LLRs (i.e., the first LLRs from) Obtained during detection )and Prior LLRs (i.e. from Obtained during detection The prior LLRs obtained after merging are used as targets The BP decoding input (i.e., using enhanced decoding input information) yields new a posteriori LLRs. ; ① If the second decoding check determines the a posteriori LLRs Decoding successful: based on this enhancement Sure , can be Perform MPA detection again to obtain Enhanced prior LLRs Then, for Perform BP decoding to obtain its a posteriori LLRs ; ②If the second decoding check determines the post-hoc LLRs Decoding failure: Directly use the prior LLRs obtained from the first unsuccessful decoding detection. right Perform BP decoding to obtain its a posteriori LLRs This can save one MPA calculation cost; According to similar The process, based on posterior LLRs The decoding verification result can be used to... Apply sequential decoding until the first step is completed. One raw coded block If the decoding is complete, then the decoding ends, thus obtaining the time-slot-based result. of A posteriori LLRs of each original coded block.

[0041] Step 105, if time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence.

[0042] In one specific embodiment of this example, step 106 includes the following sub-steps: S41, if time slot If the decoding verification result is unsuccessful, then update the current superimposed decoding count and based on the time slot. A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs ; S42. Determine the superposition prior LLRs of each replica coded block of the replica transmitted signal and the replica received signal. ; S43, Replica-based LLRs and superimposed prior LLRs Determine time slot The Interleaved Priors LLRs of Each Replica Coded Block ; S44, regarding interleaved prior LLRs Deinterleaving into time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs ; S45, Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots The BP decoding of the encoded received signal, output time slot A posteriori LLRs of the original coded blocks ; S46. If posterior LLRs If the decoding verification result is unsuccessful, and the current number of superimposed decoding iterations has not reached the maximum number of superimposed decoding iterations, then the posterior LLRs are... Replication to generate time slots The Each copy of the LLRs Then, interleaving is performed to generate time slots. The Interleaved blocks of replica coded blocks with replica post-replication LLRs ; S47, Interweave blocks of copy-after-LLRs With superimposed prior LLRs Perform XOR operation to generate time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs , ; S48, Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots BP decoding of the encoded received signal, updating the time slot A posteriori LLRs of the original coded blocks And jump to execute the update of the current overlay decoding count, based on the time slot. A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs Steps; S49. If posterior LLRs If the decoding verification result is successful, or the current number of superimposed decoding iterations reaches the maximum number of superimposed decoding iterations, then based on the time slot... The a posteriori LLRs of the original coded block correspond to the time slot determination. The decoded bit sequence.

[0043] It should be noted that, regarding time slots After completing sequential decoding, the time slot is determined. Whether the transmitted data was successfully decoded is to determine whether it will be in the time slot. Trigger its superposition decoding; when the time slot When the decoding of transmitted data fails, it will occur in the time slot. Trigger its superposition decoding, and set the maximum number of superposition decoding iterations to be defined as follows: , combined Figure 4 The process of superposition decoding includes: 1) Time slot Posterior LLRs Copy generation and subsequent verification of LLRs Then combine it with the time slot Superposition of prior LLRs of the replica received signal Performing XOR processing will generate the corresponding time slot. Interleaved Priors LLRs of Part (c) of the data ),and Including time slots of The first original coded block Interleaved prior LLRs of multiple bits of a copy coded block, where: ; In the formula, Indicates a replica index. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block 1 bit of replica post-hoc LLRs, Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; It is understandable that superimposed prior LLRs refer to the prior LLRs of the replica received signal. In one implementation, superimposed prior LLRs... The determination process includes: performing MPA detection on the received copy signal based on the codebook to determine the superimposed a priori LLRs; the SCMA system maps user data into multidimensional sparse codewords through the codebook, and the specific detection principle of the superimposed a priori LLRs can be found in existing technologies, which will not be elaborated here. 2) Then interweave the prior LLRs Deinterleaving is a priori LLRs and further merged into ; 3) Time slots Prior LLRs in Part (a) and Part (b) data )and Add them together, and then use them in the time slot. BP decoding of data, BP decoder outputs a posteriori (LLRs) ; 4) For posterior LLRs Perform decoding verification; if it is determined that the decoding was unsuccessful and did not meet the requirements... Then, through replication post-test LLRs To generate As corresponding replica a posteriori LLRs, and generate their interleaved versions. Then with time slots Superposition of prior LLRs Perform an XOR operation to generate information about the time slot. The deinterleaving prior of part (c) of the data And merged into unintertwined prior LLRs The process of determining the intertwined priors in this part includes: ; In the formula, Indicates time slot The The first original coded block The first copy of the encoded block Deinterleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved blocks of 1 bit replica post-LLRs Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; 5) Time slots Prior LLRs in Part (a) and the prior LLRs of the data in part (b) and The sum of the added information is used for time slots. BP decoding of the data determines the new posterior LLRs. Re-decode according to the process in steps 1) to 3) until the a posteriori LLRs are determined. For successful decoding or already achieved ; 6) If the posterior LLRs are determined For successful decoding or already achieved Post-hoc LLRs If the changes cease during transmission, the time slot is determined directly through hard decision. The decoded bit sequence.

[0044] It is understandable that the sequential decoding and superposition decoding processes of the SWIT receiver in this implementation can be referred to the algorithm steps shown in Table 1: Table 1 SWIT receiver mechanism

[0045] Step 106, when the time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0046] A stop transmission slot refers to a time slot when communication transmission is stopped.

[0047] It should be noted that if the time slot If the decoding verification result of the latest retained original coded block's post-hoc LLRs during transmission is successful, then in the time slot... No need to trigger overlay decoding, directly based on time slots The a posteriori LLRs output slots of the original coded block The decoded bit sequence; while determining the time slot When decoding the bit sequence, if the current time slot (at this time the current time slot is a time slot) If the transmission time slot is stopped, then based on the time slot... The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence, if the time slot If not a time slot for stopping transmission, then based on time slot. Time slots obtained by sequential decoding The a posteriori LLRs and time slots of the original coded block The decoding verification results of the posterior LLRs of the original coded block determine the time slot. The decoded bit sequence continues until the current time slot is the stop transmission time slot.

[0048] Understandably, time slots With time slot The decoding and transmission process between them can be found in the time slots. With time slot This will not be elaborated upon here.

[0049] To verify the technical effectiveness of this embodiment, The SCMA system performs performance simulations comparing the SWIT scheme of this embodiment with existing repetition coding schemes. The simulation results are as follows: Figures 5 to 8 As shown: In simulation experiment 1, both schemes are based on the same codebook and rule (3,6) P-LDPC code, with the parameter set to the number of copies. Maximum number of iterations for MPA detection and the maximum number of iterations for BP decoding Performance verification was performed using a non-Turbo decoding mode (i.e., without performing external iterations); such as Figure 5 The bit error rate (BER) performance curve shown represents the performance at a bit error rate of [missing information]. At that time, the proposed SWIT scheme achieved a gain of approximately 0.9 dB compared to existing repetition coding schemes. At a signal-to-noise ratio (SNR) of 4.5 dB, all users employing the proposed SWIT scheme achieved [a certain level of performance]. The bit error rate is higher than that of users 1-4 and users 5 and 6 using the existing repetition coding scheme, which only achieves a bit error rate of 1. and Bit error rate; such as Figure 6 The frame error rate (FER) performance curves shown exhibit a similar convergence performance trend; In simulation experiment two, besides modifying the number of copies to... In addition, the same simulation parameters as those used in Simulation Experiment 1 were employed; see reference. Figure 7 The BER performance shows that, compared with existing repetition coding schemes, the proposed SWIT scheme achieves a lower bit error rate for users 1-4 at a lower bit error rate. This achieved a bit error rate performance gain of approximately 1.3 dB, with users 5 and 6 achieving a bit error rate of [missing information]. At that time, a performance gain of approximately 1.3 dB was also achieved; while in the case of Figure 8 A similar trend in frame error rate performance can be observed in the FER performance curves shown.

[0050] In this embodiment of the invention, at the transmitting end, group interleaving delay mapping is used to incorporate coding and modulation into a joint design framework so that repetitive information can provide a large decoding gain. Interleaving Markov superposition mapping is used to achieve cross-time slot data coupling, which helps to obtain cumulative information gain from the time domain. At the receiving end, a matching joint detection decoding mechanism is set up. Thanks to the data processing advantages of joint coding and modulation optimization performed at the transmitting end, even if the channel is in deep fading and the data at a certain moment is completely damaged, the receiving end can still use the coupling information of other time slots to recover the original data. This significantly improves the bit error rate performance of the SCMA system in complex channel environments and enhances the robustness against burst errors.

[0051] Please see Figure 9 The present invention provides a segmented interleaving transmission apparatus for sparse code multiple access communication, comprising: Encoding module 901 is used to determine time slots. The information bit sequence corresponding to One raw coded block Perform on each original coded block Repeated encoding to determine the corresponding One copy of the encoded block ; Delay mapping module 902 is used to map the all-zero coded block to the first... One copy of the encoded block After merging, the blocks are sequentially grouped and interleaved with the original coded blocks, and the delay mapping is performed as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals; Overlay mapping module 903 is used for the first... One copy of the encoded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. Sequential decoding module 904 is used to perform sequential decoding of the encoded received signal based on the encoded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded blocks; Overlay decoding module 905, used for multiple time slots If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; Decoding output module 906, used for time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0052] Please see Figure 10 The present invention provides a segmented interleaved transmission system for sparse code multiple access communication, comprising: Transmitter 1001 is used to: determine time slots The information bit sequence corresponding to One raw coded block Perform on each original coded block Repeated encoding to determine the corresponding One copy of the encoded block ;Match the all-zero coded block with the first One copy of the encoded block After merging, the blocks are sequentially grouped and interleaved with the original coded blocks, and the delay mapping is performed as follows: The QPSK symbols of the first coding group are then transmitted as coded transmission signals; for the first... One copy of the encoded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. Receiver 1002 is used to: sequentially decode the coded received signal based on the coded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded block; if the time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; when the time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

[0053] Embodiment 4 of the present invention also provides a computer device, including a memory and a processor, wherein the memory stores a computer program; when the computer program is executed by the processor, the processor performs the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in Embodiment 1 of the present invention.

[0054] Embodiment 5 of the present invention also provides a computer-readable storage medium storing a computer program / instruction thereon, which, when executed by a processor, implements the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in Embodiment 1 of the present invention.

[0055] Embodiment 6 of the present invention also provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in Embodiment 1 of the present invention.

[0056] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and modules described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

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

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

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

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

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

Claims

1. A segmented interleaving transmission method for sparse code multiple access communication, characterized in that, include: Determine time slot The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ; The all-zero coded block is compared with the first One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals; For the One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. Based on the encoded transmitted signal, the encoded received signal is sequentially decoded to determine the time slot. The a posteriori LLRs of the original coded blocks; If time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; When the gap The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

2. The segmented interleaving transmission method for sparse code multiple access communication according to claim 1, characterized in that, The phrase "combining the all-zero coded block with the first" One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals, including: The all-zero coded block, the first One copy of the coded block Grouping with the original encoded block to determine One encoding group, including: ； In the formula, Indicates the first coding group. Indicates time slot , This represents the first raw coded block. Indicates an all-zero coded block. Indicates the coded group index. Indicates the first One coding group, Indicates the index of the original encoded block. Indicates the number of original coded blocks. Indicates time slot The One original encoded block, Indicates time slot The The first copy of the original encoded block, Indicates the first One coding group, Indicates time slot The The first copy of the original encoded block; For coding group and coding group Bits are extracted sequentially from the original coded block, and bits are extracted from the all-zero coded block or the copy coded block to form multiple QPSK symbols; For coding group Bits are extracted sequentially from the copy coded block to form multiple QPSK symbols; Each QPSK symbol is transmitted as an encoded transmission signal.

3. The segmented interleaving transmission method for sparse code multiple access communication according to claim 1, characterized in that, The first One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and transmitted as a replica, including: For the first One copy of the coded block Perform cross-slot cyclic bit interleaving and superposition to determine the time slot. The stacked blocks include: ； In the formula, Indicates time slot , Indicates a replica index. Indicates time slot The An overlay of copies of the encoded block Indicates the number of original coded blocks. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The One copy of the encoded block, Indicates time slot The The first original coded block One copy of the encoded block, Indicates time slot The Interleaved blocks of 1 copy coded blocks Indicates bit index, Indicates the number of bits. Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block Interleaved blocks of 1 copy coded blocks Indicates the index of the original encoded block. Indicates time slot The The first original coded block An overlay of copies of the encoded block Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the coded block superimposed on the block bits, Indicates time slot The The first original coded block The first copy of the encoded block bits, Indicates time slot The The first original coded block The interleaved block of the 1st replica coded block bits, Represents the XOR operation; The superimposed blocks are modulated into QPSK symbols and then transmitted as replica signals.

4. The segmented interleaving transmission method for sparse code multiple access communication according to claim 1, characterized in that, The encoded received signal based on the encoded transmitted signal is sequentially decoded to determine the time slot. The a posteriori LLRs of the original coded blocks include: The encoded received signal of the encoded transmitted signal coded groups The sub-coded received signal, based on time slots The The posterior LLRs of the first copy of the original coding block Time slots are determined using a message passing algorithm. The Prior LLRs of each original coded block And perform BP decoding to determine the time slot. The A posteriori LLRs of each original coded block ; For posterior LLRs Perform decoding verification and determine the decoding verification result; If posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of each original coded block ; If posterior LLRs If the decoding verification result is unsuccessful, then based on a posteriori LLRs... For the coded groups The sub-coded received signal determines the time slot through a message passing algorithm. The Prior LLRs of the first copy of the original coding block and time slot The Prior LLRs of each original coded block Prior LLRs and prior LLRs After merging, perform BP decoding and update the time slots. The A posteriori LLRs of each original coded block If posterior LLRs If the decoding verification result is successful, then let ,renew And for the first coded groups The sub-coded received signal is used to determine the time slot through a message passing algorithm and BP decoding. The A posteriori LLRs of each original coded block If the posterior LLRs If the decoding verification result is unsuccessful, then a priori LLRs are used. Perform BP decoding to determine the time slot. The A posteriori LLRs of each original coded block ; According to posterior LLRs The decoding verification result determines the time slot. The A posteriori LLRs of each original coded block until Decoding then completes, and the time slot is determined. The a posteriori LLRs of the original coded blocks; Among them, initialization .

5. The segmented interleaving transmission method for sparse code multiple access communication according to claim 1, characterized in that, The if time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence includes: If time slot If the decoding verification result is unsuccessful, then update the current superimposed decoding count, and based on the time slot... A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs ; The superposition prior LLRs of each replica coded block of the replica transmitted signal and the replica received signal are determined. ; Replica-based LLRs and superimposed prior LLRs Determine time slot The Interleaved Priors LLRs of Each Replica Coded Block ,include: ； In the formula, Indicates a replica index. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block 1 bit of replica post-hoc LLRs, Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; For intertwined prior LLRs Deinterleaving into time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs ; Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots The BP decoding of the encoded received signal outputs a time slot. A posteriori LLRs of the original coded blocks ; If posterior LLRs If the decoding verification result is unsuccessful, and the current number of superimposed decoding iterations has not reached the maximum number of superimposed decoding iterations, then the posterior LLRs are... Replication to generate time slots The Each copy of the LLRs Then, interleaving is performed to generate time slots. The Interleaved blocks of replica coded blocks with replica post-replication LLRs ; Interleaving blocks of copy-after-LLRs With superimposed prior LLRs Perform XOR operation to generate time slots The Deinterleaving Priors (LLRs) for Each Replica Encoded Block Then, merge and construct time slots. Intertwined priors LLRs ,include: ； In the formula, Indicates time slot The The first original coded block The first copy of the encoded block Deinterleaved prior LLRs of 1 bit, This represents an exponential function with the natural constant as its base. This represents a logarithmic function with the natural constant as its base. Indicates time slot The The first original coded block The first copy of the encoded block Interleaved blocks of 1 bit replica post-LLRs Indicates time slot The The first original coded block The first copy of the encoded block Superimposed prior LLRs of bits; Time slot Prior LLRs of the original coded block Time slot Prior LLRs of the first copy of the original encoded block Reconciliation of intertwined priors LLRs Add and then perform time slots BP decoding of the encoded received signal, updating the time slot A posteriori LLRs of the original coded blocks And jump to execute the update of the current overlay decoding count, based on the time slot. A posteriori LLRs of the original coded blocks Replication to generate time slots The Each copy of the LLRs Steps; If posterior LLRs If the decoding verification result is successful, or the current number of superimposed decoding iterations reaches the maximum number of superimposed decoding iterations, then based on the time slot... The a posteriori LLRs of the original coded block correspond to the time slot determination. The decoded bit sequence.

6. A segmented interleaving transmission apparatus for sparse code multiple access communication, characterized in that, The segmented interleaving transmission method for implementing sparse code multiple access communication as described in any one of claims 1-5 includes: Encoding module, used to determine time slots The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ; The delay mapping module is used to map all-zero coded blocks to the first... One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of each coding group are then transmitted as coded transmission signals; The overlay mapping module is used to map the first... One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. The sequential decoding module is used to perform sequential decoding on the encoded received signal based on the encoded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded blocks; Overlay decoding module, used for multiple time slots If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; Decoding output module, used for time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

7. A segmented interleaved transmission system for sparse code multiple access communication, characterized in that, The segmented interleaving transmission method for implementing sparse code multiple access communication as described in any one of claims 1-5 includes: The transmitter is used to: determine time slots. The information bit sequence corresponding to One raw coded block Perform on each of the original encoded blocks Repeated encoding to determine the corresponding One copy of the coded block ;Match the all-zero coded block with the first One copy of the coded block After merging, the original coded blocks are sequentially grouped and interleaved with a delay mapping as follows: The QPSK symbols of the first coding group are then transmitted as coded transmission signals; for the first... One copy of the coded block After interleaving and Markov superposition, the signal is mapped to a QPSK symbol and then transmitted as a replica signal. The receiving end is configured to: sequentially decode the encoded received signal based on the encoded transmitted signal to determine the time slot. The a posteriori LLRs of the original coded block; if the time slot If the decoding verification result is unsuccessful, then based on the time slot... The a posteriori LLRs of the original coded block and the a posteriori LLRs of the replica transmitted signal are used for time slotting. With time slot Overlay decoding, update time slots With time slot The a posteriori LLRs of the original coded blocks and the determination of time slots The decoded bit sequence; when the time slot The decoding verification result is either successful decoding or passing the time slot. With time slot Superposition decoding determines time slot After decoding the bit sequence, if the time slot To stop transmitting time slots, then based on time slots The a posteriori LLRs of the original coded block determine the time slot. The decoded bit sequence.

8. A computer device, characterized in that, The system includes a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor causes the processor to perform the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in any one of claims 1-5.

9. A computer-readable storage medium having a computer program / instructions stored thereon, characterized in that, When the computer program / instruction is executed by the processor, it implements the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in any one of claims 1-5.

10. A computer program product comprising a computer program / instructions, characterized in that, When the computer program / instruction is executed by the processor, it implements the steps of the segmented interleaving transmission method for sparse code multiple access communication as described in any one of claims 1-5.

Images