Data processing method and apparatus, storage medium, and program product

Abstract

A data processing method and apparatus, a storage medium, and a program product. The method comprises: performing spatially coupled LDPC coding on a plurality of information bit sequences to obtain a plurality of coded bit sequences; interleaving X coded bit sequences among the plurality of coded bit sequences to obtain an interleaved bit sequence, wherein X is an integer greater than 1; modulating the interleaved bit sequence to obtain a modulation symbol sequence; and transmitting the modulation symbol sequence.

Description

Data processing methods, devices, storage media and software products

[0001] This disclosure claims priority to Chinese patent application No. 202510113556.X, filed on January 22, 2025, the entire contents of which are incorporated herein by reference. Technical Field

[0002] This disclosure relates to the field of communication technology, and in particular to a data processing method, apparatus, storage medium, and program product. Background Technology

[0003] With the gradual development of communication networks, the number of devices in wireless communication networks is increasing, and the requirements for data transmission quality are also becoming more stringent. However, data transmission may suffer from various problems such as data loss due to factors like channel attenuation and noise, which will reduce the quality of data transmission. Summary of the Invention

[0004] On one hand, a data processing method is provided, comprising: spatially coupled LDPC encoding of multiple information bit sequences to obtain multiple coded bit sequences; interleaving X coded bit sequences among the multiple coded bit sequences to obtain an interleaved bit sequence, wherein X is an integer greater than 1; modulating the interleaved bit sequence to obtain a modulation symbol sequence; and transmitting the modulation symbol sequence.

[0005] In another aspect, a data processing method is provided, comprising: receiving a modulation symbol sequence; demodulating the modulation symbol sequence to obtain a soft bit sequence; deinterleaving all soft bits of X coded bit sequences in the soft bit sequence to obtain multiple coded soft bit sequences, wherein X is an integer greater than 1; and performing spatially coupled LDPC decoding based on the multiple coded soft bit sequences to obtain multiple information bit sequences.

[0006] In another aspect, a data processing apparatus is provided, comprising: a processing unit and a transmitting unit; the processing unit is configured to perform spatially coupled LDPC encoding on multiple information bit sequences to obtain multiple coded bit sequences; the processing unit is further configured to perform interleaving processing on X coded bit sequences among the multiple coded bit sequences to obtain an interleaved bit sequence, wherein X is an integer greater than 1; the processing unit is further configured to modulate the interleaved bit sequence to obtain a modulation symbol sequence; and the transmitting unit is configured to transmit the modulation symbol sequence.

[0007] In another aspect, a data processing apparatus is provided, comprising: a receiving unit and a processing unit; the receiving unit is configured to receive a modulation symbol sequence; the processing unit is configured to demodulate the modulation symbol sequence to obtain a soft bit sequence; the processing unit is further configured to deinterleave all soft bits of X coded bit sequences in the soft bit sequence to obtain multiple coded soft bit sequences, wherein X is an integer greater than 1;

[0008] The processing unit is also used to perform spatially coupled LDPC decoding based on the multiple encoded soft bit sequences to obtain multiple information bit sequences.

[0009] In another aspect, an electronic device is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; and the processor implements the above-described data processing method when executing the computer program.

[0010] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored, which, when executed by a processor, implement the above-described data processing method.

[0011] In another aspect, a computer program product is provided, which includes computer program instructions that, when executed by a processor, implement the aforementioned data processing method. Attached Figure Description

[0012] To more clearly illustrate the technical solutions in this disclosure, the accompanying drawings used in some embodiments of this disclosure will be briefly described below. Obviously, the drawings described below are merely drawings of some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings.

[0013] Figure 1 is a diagram of a communication system architecture according to some embodiments;

[0014] Figure 2 is a flowchart illustrating a data processing method according to some embodiments;

[0015] Figure 3 is a schematic diagram of a parity check matrix according to some embodiments;

[0016] Figure 4 is a schematic diagram of an interleaving process according to some embodiments;

[0017] Figure 5 is a schematic diagram of a different bit sequence according to some embodiments;

[0018] Figure 6 is a schematic diagram of the reliability of a soft bit according to some embodiments;

[0019] Figure 7 is a schematic diagram of the reliability of another soft bit according to some embodiments;

[0020] Figure 8 is a schematic diagram of another interleaving process according to some embodiments;

[0021] Figure 9 is a schematic diagram of another interleaving process according to some embodiments;

[0022] Figure 10 is a schematic diagram of another interleaving process according to some embodiments;

[0023] Figure 11 is a schematic diagram of another interleaving process according to some embodiments;

[0024] Figure 12 is a schematic diagram of writing to a first matrix according to some embodiments;

[0025] Figure 13 is a schematic diagram of a cyclic shift interleaving according to some embodiments;

[0026] Figure 14 is a schematic diagram of a soft bit position according to some embodiments;

[0027] Figure 15 is a schematic diagram of another soft bit position according to some embodiments;

[0028] Figure 16 is a schematic diagram of another soft bit position according to some embodiments;

[0029] Figure 17 is a flowchart illustrating another data processing method according to some embodiments;

[0030] Figure 18 is a block diagram of a communication device according to some embodiments;

[0031] Figure 19 is a block diagram of another communication device according to some embodiments;

[0032] Figure 20 is a block diagram of another communication device according to some embodiments;

[0033] Figure 21 is a block diagram of another communication device according to some embodiments;

[0034] Figure 22 is a block diagram of another communication device according to some embodiments. Detailed Implementation

[0035] The technical solutions of this disclosure will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0036] It should be noted that, in this disclosure, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0037] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

[0038] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "more than one" means two or more.

[0039] With the rapid development of technologies such as big data, cloud computing, and latency-sensitive networks, the number of user devices in wireless communication networks is growing rapidly. Wireless communication networks will carry diverse applications and massive amounts of data, placing high demands on data processing throughput, reliability, and latency. With the development of intelligent transportation, intelligent industrial control, and intelligent logistics, users have increasingly strong requirements for ultra-low latency and ultra-reliable communication, meaning they need to send and successfully receive large volumes of data in a short period. In ultra-high throughput scenarios, data can be transmitted after encoding based on low-density parity check (LDPC). However, LDPC encoding results in a large number of coded blocks, which are not interconnected. Furthermore, when combined with higher-order modulation, the performance of the coded blocks is poor when passing through fading channels. This leads to poor performance and resistance to burst errors in LDPC encoding, reducing the quality of data transmission.

[0040] The coding and modulation process during data transmission will be described below.

[0041] In wireless communication systems, the transmitting end performs channel coding on the data to be transmitted to obtain a coded bit sequence (also called a coded block or sub-coded block). This coded bit sequence is then mapped to modulation symbols in a constellation diagram and transmitted to the receiving end. During data transmission through the channel, errors (such as bit loss) may occur due to factors like multipath propagation, noise, and interference. To address this, the transmitting end can add redundant information to the data to be transmitted through channel coding. This way, even if errors occur during transmission, the receiving end can recover the original data using this redundant information, thus eliminating distortion introduced during transmission. Furthermore, the receiving end needs to demodulate and decode the received modulation symbols to recover the data to be transmitted.

[0042] Currently, commonly used channel coding methods include LDPC coding, polar coding, turbo coding, and convolutional coding. Among them, LDPC coding is defined by a sparse (or low-density) parity-check matrix, and its decoding performance can be improved through iterative decoding, such as using belief-transfer decoding.

[0043] LDPC coding is a type of forward error correction coding. LDPC coding can be defined as a linear block code using a parity check matrix and boost values. Because the parity check matrix is ​​very sparse, decoding can be achieved with low complexity. The parity check matrix H of LDPC coding is an mb×Z matrix with nb×Z columns, composed of mb×nb submatrices. Each submatrix is ​​either a different power of the Z×Z standard permutation matrix P (corresponding to a cyclic shift matrix of the identity matrix) or a Z×Z all-zero square matrix, and the standard permutation matrix can be determined from the elements of the fundamental graph matrix. The parity check matrix H has the following form:

[0044] Among them, h ij Let represent the elements in the matrix, where i and j represent the row and column indices, respectively, mb is the number of rows in the matrix, and nb is the number of columns in the matrix. Let P be a power of a standard permutation matrix, and let the submatrix in the i-th row and j-th column of the parity check matrix H be... H b A simplified representation of the entire matrix H, usually representing a certain structure or property of matrix H.

[0045] like but That is, a Z×Z all-zero square matrix; if If the integer is greater than or equal to 0, then the corresponding submatrix is ​​the standard permutation matrix P. The power of the power (i.e., the cyclic shift of the identity matrix). The standard permutation matrix P of the above Z×Z is shown below (the standard permutation matrix is ​​formed by cyclically shifting the identity matrix one bit to the right):

[0046] so, This allows each submatrix or standard permutation matrix to be uniquely identified. If a submatrix is ​​a square matrix consisting entirely of zeros, the corresponding... Using -1 (or null values ​​or other representations), if a submatrix is ​​obtained by cyclic shift 's' of the identity matrix, then... Equals s, therefore all This can form either a fundamental matrix or a parity check matrix. The parity check matrix includes two types of elements: elements indicating an all-zero square matrix (which can be called -1 elements) and elements indicating cyclic shifts of the identity matrix (which can be called non--1 elements). By changing the elements indicating an all-zero square matrix to 0 and the elements indicating cyclic shifts of the identity matrix to 1, the fundamental graph matrix is ​​obtained. The fundamental graph matrix generally includes only two types of elements: 0 and 1. 0 is used to indicate an all-zero square matrix, and 1 is used to indicate cyclic shifts of the identity matrix (the number of shifts is determined by the parity check matrix).

[0047] Z is the dimension of the standard permutation matrix (submatrix) mentioned above, and can be called the lifting size. For ease of description, only the elements of the parity check matrix that indicate the cyclic shift of the identity matrix and the row and column indices of these elements can be described, while the remaining row and column indices are assumed to indicate the elements of the all-zero square matrix. Alternatively, the elements indicating the cyclic shift of the identity matrix can be represented by their cyclic shift values, while the elements indicating the all-zero square matrix can be described by -1, null, or empty values.

[0048] Spatially Coupled LDPC (SC-LDPC) coding introduces coupling relationships between multiple consecutive adjacent LDPC code blocks (i.e., the coded blocks obtained by LDPC coding) to improve the decoding correctness of each LDPC code, thereby enhancing the overall transmission reliability of the transport block. A spatially coupled LDPC code can be determined by a set of fundamental matrices and lift values. The set of fundamental matrices includes multiple fundamental matrices, and the lift values ​​are integers greater than 0. The coupling parity check matrix of a spatially coupled LDPC code can be expressed by the following formula:

[0049] Where, m s The coupling width (or coupling depth) for LDPC encoding, and the coupling parity matrix H. SC The elements in the coupled parity check matrix H include at least 0 and 1. SCIt includes multiple submatrices that are not all equal to 0 (such as the parity submatrix). Besides these Apart from 0, all other elements are equal to 0.

[0050] In spatially coupled LDPC codes, the forward parity-check matrix of the t-th sub-coded block can be represented as: The symbol 'T' represents the transpose operation. For any index t, if the forward parity-check matrix of the t-th sub-code block is equal to the forward parity-check matrix of the (t+T)-th sub-code block, and the forward parity-check matrices of the t-th to (t+T-1)-th sub-code blocks are all different, then the period of the spatially coupled LDPC code is equal to T, where T is a positive integer. If T equals 1, it can be considered a time-invariant spatially coupled LDPC code.

[0051] The encoding process of spatially coupled LDPC codes is as follows: The input information is spatially coupled LDPC encoded to obtain the encoded bit sequence C. The encoded bit sequence satisfies the following equation: H SC ×C=0, where C is the encoded bit sequence, 0 is an all-zero vector, and H SC It is a coupled parity check matrix. The encoded bit sequence includes L sub-coded blocks.

[0052] In spatially coupled LDPC codes, the forward parity-check matrix of the t-th sub-coded block These are composed of multiple fundamental matrices. The lift value Z is determined, where the i-th submatrix is... From the i-th fundamental matrix The lift value Z is determined, which is the i-th fundamental matrix. The i-th submatrix is ​​obtained by replacing the elements of the zero-index matrix with a zero-index matrix of size Z rows and Z columns, and by cyclically shifting the elements of the identity matrix with an identity matrix of size Z rows and Z columns. Multiple fundamental matrices This constitutes a basic matrix set. That is, spatially coupled LDPC encoding can be determined by the basic matrix set and the lift value Z. Spatially coupled LDPC encoding can be performed based on the basic matrix set and the lift value Z to obtain the encoded bit sequence.

[0053] To address this issue, this disclosure provides a data processing method. A first node can perform spatially coupled LDPC encoding on multiple information bit sequences to obtain multiple coded bit sequences. Interleaving is then performed between at least X coded bit sequences to obtain interleaved bit sequences, thereby increasing the coupling between the X coded bit sequences. This interleaving process can distribute errors in some coded bit sequences across all X coded bit sequences, reducing the probability of these errors being concentrated in one or a few sequences, leading to decoding failure of those sequences. This increases the robustness of signal transmission and improves data transmission quality. Furthermore, spatially coupled LDPC encoding further increases the coupling between coded bit sequences, thereby improving the decoding accuracy of the coded bit sequences and enhancing data transmission quality.

[0054] The data processing method provided in this disclosure can be applied to systems with various communication standards. For example, the systems to which the data processing provided in this disclosure is applicable include, but are not limited to, long-term evolution (LTE) systems, various versions based on LTE evolution, 5th generation mobile communication technology (5G) systems, 5th generation mobile communication technology advanced (5G-A) systems, future mobile communication networks (such as 6th generation mobile communication technology (6G) mobile communication networks, 7th generation mobile communication technology (7G) mobile communication networks), or multiple converged communication systems. Furthermore, the data processing method provided in this disclosure can also be applied to future-oriented communication systems.

[0055] For example, the above data processing method can be applied to the communication system shown in FIG1. ​​As shown in FIG1, the communication system includes: a first node 101 and a second node 102.

[0056] In this configuration, the first node 101 can be a terminal-side device, such as an IoT device, a mobile phone, or an in-vehicle device. The second node 102 can be a network-side device, such as a communication base station or a sensing base station. Alternatively, the first node 101 can be a network-side device, and the second node 102 can be a terminal-side device.

[0057] In some embodiments, the first node 101 can interleave X coded bit sequences from multiple coded bit sequences to obtain an interleaved bit sequence. Then, the first node 101 can modulate the interleaved bit sequence to obtain a modulated symbol sequence. Afterwards, the first node 101 can transmit the modulated symbol sequence. Correspondingly, the second node 102 can receive the modulated symbol sequence and demodulate it to obtain a soft bit sequence. Then, the second node 102 can deinterleave the soft bit sequence to obtain multiple coded soft bit sequences. Thus, since the interleaving process can distribute burst errors in some of the X coded bit sequences across the X coded bit sequences, the original data can be better recovered during decoding, thereby improving the error resistance of the coded bit sequences, enhancing the robustness of data transmission, and improving the quality of data transmission. Furthermore, spatially coupled LDPC coding can further increase the coupling between coded bit sequences, thereby improving the decoding accuracy of the coded bit sequences and enhancing the quality of data transmission.

[0058] In some embodiments, the terminal can be a device with wireless transceiver capabilities, which can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; it can also be deployed on water (such as on ships); and it can also be deployed in the air (e.g., on airplanes, balloons, and satellites). The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. The embodiments of this application do not limit the application scenarios. The term "terminal" can sometimes also refer to a user, user equipment (UE), access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, etc., but the embodiments of this application do not limit this to these terms.

[0059] In one possible implementation, the various types of UEs can also be mobile stations, user stations, mobile units, user cells, radio units, remote units, mobile devices, radio devices, wireless communication devices, remote devices, mobile user stations, access terminals, mobile terminals, radio terminals, remote terminals, handheld devices, user agents, mobile clients, clients, passive tags, or some other suitable term. Furthermore, the various types of UEs can also be cellular phones, personal digital assistants (PDAs), wireless modems, wireless communication devices, handheld devices, tablet computers, laptop computers, cordless phones, wireless local loop (WLL) stations, etc. The various types of UEs can communicate with various types of base stations and network equipment (including macro eNBs, small cell eNBs, relay base stations, etc.).

[0060] In some embodiments, the base station may be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved Node B (eNB, eNodeB, or gNodeB), a base station device in a 5G / 6G / 7G network, or a base station in a future communication system. The base station may include various macro base stations, micro base stations, femtocell base stations, wireless remote extensions, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or various network-side devices such as primary cells and secondary cells.

[0061] It should be noted that Figure 1 is only an exemplary framework diagram. The number of devices included in Figure 1 and the names of each device are not limited. In addition to the devices shown in Figure 1, the communication system may also include other devices, such as relay nodes.

[0062] The application scenarios of the embodiments disclosed herein are not limited. The system architecture and business scenarios described in the embodiments of this disclosure are for the purpose of more clearly illustrating the technical solutions of the embodiments of this disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of this disclosure. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this disclosure are also applicable to similar technical problems.

[0063] The data processing method provided in the embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0064] The data processing method provided in this embodiment can be applied to the first node 101 in the communication system shown in FIG1. ​​FIG2 shows a schematic flowchart of a data processing method, which includes S201, S202, S203 and S204.

[0065] In S201, multiple information bit sequences are spatially coupled LDPC encoded to obtain multiple encoded bit sequences.

[0066] The first node can segment the long original information into code blocks, obtaining multiple information bit sequences (also called code block information bit sequences). After spatially coupled LDPC encoding of these multiple information bit sequences, multiple encoded bit sequences can be obtained. Thus, the segmented code block information bit sequences are adaptable to LDPC encoding, thereby improving encoding efficiency. Furthermore, spatially coupled LDPC encoding can further increase the coupling between encoded bit sequences, thereby improving the decoding accuracy of the encoded bit sequences and enhancing the quality of data transmission.

[0067] In one possible implementation, the multiple coded bit sequences are L coded bit sequences obtained based on spatially coupled LDPC coding, where L is a positive integer greater than or equal to 1, and X is less than or equal to L. In this way, the first node can select X coded bit sequences from all L coded bit sequences for interleaving, thereby reducing the number of bit sequences to be processed and improving data processing efficiency. Optionally, the X coded bit sequences are multiple consecutive coded bit sequences from the L coded bit sequences.

[0068] In another possible implementation, multiple information bit sequences are encoded based on the fundamental matrix set and boost values ​​of the spatially coupled LDPC code to obtain multiple encoded bit sequences. The fundamental matrix set of the spatially coupled LDPC code includes at least two fundamental matrices. All fundamental matrices in the fundamental matrix set of the spatially coupled LDPC code have the same number of rows and the same number of columns; for example, the number of rows is mb and the number of columns is nb, where mb and nb are both positive integers.

[0069] In S202, X coded bit sequences from multiple coded bit sequences are interleaved to obtain an interleaved bit sequence.

[0070] Here, X is an integer greater than 1. The interleaved bit sequence can be a single bit sequence (also called a bit stream), or it can consist of multiple sub-bit sequences. For example, the maximum value of X is one of the following: 2, 4, 6, 8, 10, 12, 16, 20, 24, or 32.

[0071] The purpose of interleaving is to rearrange the order of bits so that burst errors occurring during transmission can be dispersed, making them easier to correct with error-correcting codes (such as convolutional codes, Turbo codes, LDPC codes, etc.). In traditional methods, interleaving is usually performed within each coded block (i.e., the encoded bit sequence) to distribute errors at different locations within that block.

[0072] However, in this embodiment, the first node can perform interleaving between the X coded bit sequences (i.e., between the X coded blocks), distributing burst errors in each coded bit sequence across different coded bit sequences. This avoids situations where some coded bit sequences contain a large number of burst errors, making it impossible to reconstruct the original data. Furthermore, in higher-order modulation, mapping information bits in the coded bit sequences to high-reliability bits of the modulation symbols provides greater protection for the information bits, improving reception performance and enhancing data transmission reliability. Thus, because burst errors in some of the X coded bit sequences are distributed across more coded bit sequences, the impact of burst errors is reduced during decoding, leading to better reconstruction of the original data. This improves the error resistance of the coded bit sequences, enhances data transmission robustness, and improves data transmission quality.

[0073] In one possible implementation, X is determined by the coupling width of the spatially coupled LDPC encoding, where the coupling width is a positive integer. X is equal to a positive integer multiple of the coupling width of the spatially coupled LDPC encoding. The maximum value of X is determined by the coupling width of the spatially coupled LDPC encoding. For example, the coupling width is equal to at least one of the following: 1, 2, 3, 4, 5, or 6.

[0074] In one possible implementation, X is determined by the coupling width and modulation order of the spatially coupled LDPC coding, where the coupling width is an integer greater than 0.

[0075] In one possible implementation, X is determined by the window length of the spatially coupled LDPC decoding, where the window length is an integer greater than 1. This window length can be determined by the terminal through reporting.

[0076] In S203, the interleaved bit sequence is modulated to obtain the modulated symbol sequence.

[0077] In spatially coupled LDPC decoding, modulation can also be called modulation mapping. The modulation symbol sequence includes multiple modulation symbols. For example, modulation methods for interleaved bit sequences can include binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), and quadrature amplitude modulation (QAM).

[0078] In one possible implementation, the modulation order of the modulation scheme can be equal to at least one of the following: 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14 or 16.

[0079] In S204, the modulation symbol sequence is transmitted.

[0080] After obtaining the interleaved bit sequence, it can be modulated and mapped based on the modulation order corresponding to the modulation scheme to obtain the modulation symbol sequence. This allows the first node to transmit the modulation symbol sequence, thus enhancing its resistance to burst errors during transmission, increasing transmission robustness, and improving signal transmission quality.

[0081] The above-mentioned coded bit sequence and modulation symbols will be described below.

[0082] I. Encoded Bit Sequence

[0083] In some embodiments, the index of the information bits (also called system bits) in the X coded bit sequences mapped to the mapping bit sequence of the modulation symbols in the modulation symbol sequence is less than or equal to the index of the parity bits in the X coded bit sequences mapped to the mapping bit sequence of the modulation symbols in the modulation symbol sequence. That is, the information bits are mapped to high-reliability bits in the mapping bit sequence of the modulation symbols, or bits with a bit error rate below a bit error rate threshold, or the index of the information bit in the mapping bit sequence is less than the index of the parity bit in the mapping bit sequence. For example, the information bits in each coded bit sequence can be preferentially mapped to the bit positions of high-reliability bits in the modulation symbols in the modulation symbol sequence (i.e., the bit positions with bit error rates below the bit error rate threshold mentioned above). In one example, the first S bits in the X coded bit sequences can be preferentially mapped to target bits in the modulation symbols in the modulation symbol sequence, where S is a positive integer. This can also be understood as the first S bits in the X coded bit sequences being information bits.

[0084] It should be noted that during modulation, the first node can divide all bits in the coded bit sequence into multiple mapped bit sequences. One mapped bit sequence, after modulation, yields a modulation symbol. Therefore, high-reliability bits in the mapped bit sequence can refer to bits with a bit error rate below the bit error rate threshold or bits with a large amplitude (absolute value) of the soft bits output from the demodulated modulation symbol.

[0085] In some other embodiments, a bit from the information bits of the m-th coded bit sequence in the X coded bit sequences is mapped to the 0th bit of the mapped bit sequence of a modulation symbol in the modulation symbol sequence, and a bit from the information bits of the n-th coded bit sequence in the X coded bit sequences is mapped to the 1st bit of the mapped bit sequence of a modulation symbol. Here, m and n are non-negative integers, and m is not equal to n. In this way, all the information bits in the X coded bit sequences can be mapped to the first two bits of the mapped bit sequence of the modulation symbol. This results in better reliability of the first two bits, a larger amplitude corresponding to the first two bits, a better bit error rate, and ensures the accuracy of information transmission.

[0086] In some other embodiments, X is determined by the modulation order corresponding to the modulation method based on the first signal. For example, X can be an integer multiple of the modulation order, such as X being equal to a times the modulation order, where a is equal to 1, 2, 3, 4, 5, 6, 8, 10, 12, or 16.

[0087] In some other embodiments, the check bit of the t-th coded bit sequence among the plurality of coded bit sequences is determined by at least the first information bit sequence and the last B information bit sequences among the plurality of information bit sequences. Here, B is determined by at least one of the following: t, the coupling width of the spatially coupled LDPC encoding. t is a non-negative integer less than or equal to the coupling width of the spatially coupled LDPC encoding. In one example, B is determined by the coupling width of the spatially coupled LDPC encoding, or B is equal to the coupling width of the spatially coupled LDPC encoding.

[0088] In one possible implementation, the parity bit of the first coded bit sequence among multiple coded bit sequences is determined by at least the first information bit sequence among multiple information bit sequences, the last B information bit sequences, and B first fundamental matrices. For example, B is a positive integer less than or equal to M, where M is the number of fundamental matrices in the set of fundamental matrices of the spatially coupled LDPC code.

[0089] Here, the number of rows in the first fundamental matrix is ​​equal to mb, and the number of columns is equal to kb, where kb is a positive integer less than or equal to nb. In one example, kb = nb - mb, where mb is the number of rows in the fundamental matrix of the spatially coupled LDPC code, and nb is the number of columns in the fundamental matrix of the spatially coupled LDPC code. Alternatively, the number of columns in the first fundamental matrix is ​​equal to kb, where kb = nb - mb. That is, the number of columns in the first fundamental matrix is ​​equal to the number of information columns in the fundamental matrix of the spatially coupled LDPC code, and the number of system columns in the fundamental matrix of the spatially coupled LDPC code is equal to the difference between the number of columns and the number of rows in its fundamental matrix.

[0090] Among the B first fundamental matrices, there exists a first fundamental matrix that consists of the first mb0 rows of a fundamental matrix from the set of fundamental matrices of spatially coupled LDPC codes, where mb0 is a positive integer less than or equal to mb. In one example, one of the B first fundamental matrices consists of the first kb0 columns and the first mb0 rows of a fundamental matrix from the set of fundamental matrices of spatially coupled LDPC codes, where kb0 is a positive integer less than or equal to nb, and mb0 is a positive integer less than or equal to mb.

[0091] B equals the coupling width of the spatially coupled LDPC code. For example, B equals M-1, where M is the number of fundamental matrices in the set of fundamental matrices of the spatially coupled LDPC code. In one example, M equals 2 and B equals 1.

[0092] The i-th first fundamental matrix among the B first fundamental matrices is Tb. i The set of fundamental matrices for spatially coupled LDPC codes includes M fundamental matrices {Hb0, Hb1, ..., Hb}. M-1}, then the i-th first fundamental matrix Tb among the B first fundamental matrices i It is the (i+1)th fundamental matrix Hb i+1 A submatrix, where i equals 0, 1, 2, ..., B-1. In one specific example, the i-th first fundamental matrix among the B first fundamental matrices is the (i+1)-th fundamental matrix Hb in the set of fundamental matrices of spatially coupled LDPC codes. i+1 The first kb0 columns and the first mb0 rows constitute the integers, where kb0 is a positive integer less than or equal to nb, and mb0 is a positive integer less than or equal to mb. In one example, kb0 = nb - mb. And mb0 equals mb.

[0093] In one possible implementation, the L information bit sequences (i.e., multiple information bit sequences) are all of equal length. In one example, L is an integer greater than or equal to 8. In yet another example, the minimum number of information bit sequences for spatially coupled LDPC coding is one of the following: 8, 10, 12, 16, 24, or 32.

[0094] In one possible implementation, the length of the information bit sequence is an integer greater than or equal to 128 and less than or equal to 8448. In one example, the length of the information bit sequence is equal to at least one of the following: 128, 256, 400, 512, 600, 800, 1024, 1536, 2048, 3072, 4096.

[0095] In one possible implementation, the minimum code rate supported by spatially coupled LDPC coding is equal to one of the following: 3 / 4, 2 / 3, 1 / 2, 2 / 5, 1 / 3, or 1 / 5.

[0096] In one possible implementation, the maximum value of X is determined by at least one of the following: coding rate, transport block size, data rate, target delay, target bit error rate, target reliability, terminal type, basic graph matrix index, or modulation order.

[0097] Here, delay generally refers to the time required for a data packet of a certain size to successfully (correctly) reach the receiver (sender) from the source (sender), which is the transmission delay. Air interface delay refers to the time required for a data packet of a certain size to successfully (correctly) reach the terminal from the base station, or the time required for a data packet of a certain size to successfully (correctly) reach the base station from the terminal. The target delay can be some target threshold for the transmission delay or air interface delay as described above. In one example, the target delay can be equal to at least one of the following: 0.05ms, 0.1ms, 0.2ms, 0.5ms, 0.8ms, 1ms, 2ms, 5ms, 10ms.

[0098] Reliability refers to the probability of successfully and correctly receiving a data packet of a certain size sent from the source (sender) to the destination (receiver). Bit error rate (BER) refers to the probability of incorrectly receiving a data packet of a certain size sent from the source (sender) to the destination (receiver). Reliability is equal to the difference between 1 and the BER. For example, if the BER is 0.01, then the reliability or probability of correct reception is 1 - 0.01 = 0.99. This target reliability can be some target threshold for reliability or probability of correct reception as described above. In one example, the target reliability can be equal to at least one of the following: 1-10 -1 1-10 -2 1-10 -3 1-10 -4 1-10 -51-10 -6 1-10 -7 1-10 -8 The target bit error rate can be some target threshold for the probability of incorrect reception as described above. In one example, the target bit error rate can be equal to at least one of the following: 10 -1 10 -2 10 -3 10 -4 10 -5 10 -6 10 -7 10 -8 In one example, the target bit error rate is 10. -1 In one example, the target bit error rate is 10. -6 In one example, the target bit error rate is 10. -4 .

[0099] II. Modulation Symbols

[0100] In some embodiments, at least one modulation symbol mapping bit sequence in the modulation symbol sequence is composed of bits from different coded bit sequences. This avoids errors in one coded bit sequence being mapped into a modulation symbol, thereby dispersing errors within a coded bit sequence and improving the robustness of the modulation symbol.

[0101] For example, in a modulation symbol sequence, there exist at least Y modulation symbols whose mapped bits come from different coded bit sequences, where Y is a positive integer. For example, Y could be equal to the number of symbols in the modulation symbol sequence, half that number, or 1 / 4 or 1 / 8 of the number of symbols. In one example, Y could be equal to 1. Another example is that the mapped bit sequence is the sequence of bits mapped onto the modulation symbols.

[0102] In some other embodiments, the 0th bit of the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence comes from the information bit of the 0th coded bit sequence of X coded bit sequences; and / or, the last bit of the mapped bit sequence of at least one modulation symbol comes from the parity bit of the last coded bit sequence of X coded bit sequences.

[0103] For example, in a modulation symbol sequence, there exists at least one modulation symbol mapping bit sequence in which the first bit of the mapping bit sequence is the information bit (or the first S bits) of the first coded bit sequence among multiple coded bit sequences, and the last bit of the mapping bit sequence is the parity bit (e.g., the last M bits, where M is a positive integer) of the last coded bit sequence among multiple coded bit sequences.

[0104] The above describes the coded bit sequence and the modulation symbol sequence. In determining the coded bit sequence, the number of bits in at least one of the multiple information bit sequences is equal to the maximum number of information bits in the spatially coupled LDPC coding.

[0105] In some embodiments, the maximum number of information bits is the product of the number of information columns (also known as the system column number) of the spatially coupled LDPC encoding and the maximum boost value. The number of information columns is equal to the difference between the number of columns and the number of rows of the parity check matrix of the spatially coupled LDPC encoding. For example, in at least one of the L information bit sequences, the number of bits in that sequence is equal to the maximum number of information bits in the spatially coupled LDPC encoding. In one example, the maximum number of information bits is 8448, the number of columns in the parity check matrix is ​​68 and the number of rows is 46, the number of information columns is 22, and the corresponding maximum boost value is 384. In another example, the maximum number of information bits is 3840, the number of columns in the parity check matrix is ​​52 and the number of rows is 42, the number of information columns is 10, and the corresponding maximum boost value is 384.

[0106] In one possible implementation, the L information bit sequence is obtained by dividing the same transport block into code blocks.

[0107] The following will describe an embodiment of this disclosure using spatially coupled LDPC encoding as an example.

[0108] Example 1: Determine the bit sequence to be encoded, which includes L information bit sequences. The L information bit sequences are a0, a1, a2, ..., a L-1 Each information bit sequence contains K bits (multiple information bit sequences have the same number of bits), where K is a positive integer. The r-th information bit sequence is a0, a1, a2, ..., a K-1 K equals 0, 1, 2, ..., L-1. Spatial coupling LDPC encoding of L information bit sequences yields L encoded bit sequences b0, b1, b2, ..., b... L-1 Each encoded bit sequence is b0, b1, b2, ..., b N-1 The number of bits in each encoded bit sequence is N.

[0109] Next, X coded bit sequences from the L coded bit sequences can be interleaved to obtain an interleaved bit sequence. This interleaved bit sequence is: f0, f1, f2, ..., f E-1 Where E is the number of bits in the interleaved bit sequence, and E is a positive integer. Subsequently, the interleaved bit sequence can be modulated to obtain the modulation symbol sequence: g0, g1, g2, ..., g G-1, where G is the number of modulation symbols in the modulation symbol sequence, and G is a positive integer.

[0110] Here, the length of each information bit sequence is K, and the length of each encoded bit sequence is N.

[0111] In one example, spatially coupled LDPC encoding is performed on the L information bit sequences to be encoded using the fundamental matrix set and boost values ​​of the spatially coupled LDPC code, resulting in L encoded bit sequences. The fundamental matrix set of the spatially coupled LDPC code includes at least two fundamental matrices. For example, each information bit sequence is a column vector, and the encoded bit sequence is a row vector.

[0112] All fundamental matrices in the set of fundamental matrices for spatially coupled LDPC codes have the same number of rows and the same number of columns. For example, the number of rows is mb and the number of columns is nb. Here, the fundamental matrix has the following structure: [Hb s Hb p ];Hb s It can be called the system column matrix, Hb p This can be called a check column matrix. Hb s The number of rows equals Hb p The number of rows is equal to mb; Hb s The number of columns is equal to kb, Hb p The number of columns is equal to mb. The number of columns in the fundamental matrix is ​​nb, that is, kb = nb - mb. Here, kb, nb, and mb are all integers greater than 0.

[0113] The parity check matrix can be determined from the fundamental matrix and the lift value Z. This involves replacing the elements in the fundamental matrix that indicate a square matrix of all zeros with a Z*Z matrix of all zeros, and replacing the elements in the fundamental matrix that indicate a cyclic shift of the identity matrix with a Z*Z cyclic shift matrix of the identity matrix (the shift value equals the element value, and can be a rightward or leftward cyclic shift). Similarly, each parity check matrix includes a systematic column matrix H. s And check column matrix H p That is, the parity check matrix has the following structure: [H s H p The set of fundamental matrices for spatially coupled LDPC codes includes Ms+1 fundamental matrices, where the i-th fundamental matrix Hb i The lift value Z can determine the corresponding i-th parity check matrix H. i =[H s H p ].

[0114] In one possible implementation, if all the fundamental matrices in the set of fundamental matrices of the spatially coupled LDPC code are (Hb0, Hb1, ..., Hb...),... M-1If the parity check matrix is ​​(H0, H1, ..., H...), then the corresponding parity check matrix is ​​(H0, H1, ..., H...). M-1 In the process of spatially coupled LDPC encoding, the bit sequence to be encoded can be encoded based on the basic matrix set and boost value of the spatially coupled LDPC code; alternatively, a parity check matrix can be generated first, and then the bit sequence to be encoded can be encoded using the parity check matrix of the spatially coupled LDPC code.

[0115] Similarly, each encoded bit sequence can be written as a concatenation of an information bit sequence (also known as a system bit sequence) and a check bit sequence, that is, the t-th encoded bit sequence can be described as Here, a t It is the systematic bit sequence in the t-th coded bit sequence (i.e., it can correspond to the t-th sub-information block), p t It is the parity bit sequence in the t-th encoded bit sequence. The encoded bit sequence consists of an information bit sequence and a parity bit sequence. The number of bits in the information bit sequence is equal to the systematic column matrix H in the parity check matrix. s The number of columns, the number of bits in the parity check bit sequence is equal to the number of parity column matrices H in the parity check matrix. p The number of columns (also equal to the system column matrix H) s (Number of rows). The information bit sequence in the t-th encoded bit sequence is composed of padding bits added to the t-th sub-information block, where no padding is needed when the number of padding bits is equal to 0.

[0116] During spatially coupled LDPC coding, when the t-th information bit sequence is input, for example, a t Obtain the t-th encoded bit sequence b t If t equals 0 (i.e., the first encoded bit sequence), the calculation is performed using the following formula:

[0117] Therefore, the sequence of the 0th encoded bit can be represented as Here, T i-1 It corresponds to the (i-1)th first fundamental matrix Tb i-1 The first parity check matrix is ​​determined by the lift value Z. It can be seen that in spatially coupled LDPC coding, when obtaining the parity bit sequence of the 0th encoded bit sequence, it is necessary to associate it with the last M information bit sequences of the bit sequence to be encoded.

[0118] If t is greater than or equal to 1 and less than M, specifically, the t-th encoded bit sequence b t The encoding calculation is as follows:

[0119] Here, T i It corresponds to the i-th first fundamental matrix Tbi The first parity check matrix is ​​determined by the boost value Z. Then, the t-th encoded bit sequence can be represented as...

[0120] When t is greater than or equal to M, the t-th encoded bit sequence is formed by M fundamental matrices Hb0, ..., Hb M-1 The parity check matrices corresponding to the boost value Z are used to encode the t-th information bit sequence, as follows: Here, the t-th encoded bit sequence can be represented as

[0121] When t equals L-1, L encoded bit sequences are obtained, with a total length of L*N bits. Then, either the encoded bit sequence or a portion of its bits is transmitted. Within each encoded bit sequence, a portion or all bits are selected for transmission. A circular buffer can be used to pre-store all bits of each encoded bit sequence, and the sequence can be cyclically selected based on a predefined starting position to obtain a rate-matched bit sequence with the required number of bits, which is then transmitted.

[0122] In one example, the set of fundamental matrices for a spatially coupled LDPC code has M = 2 fundamental matrices, meaning the coupling width of the spatially coupled LDPC code is equal to 1. These fundamental matrices are Hb0 and Hb1. As shown in Figure 3, the corresponding lift value Z is 64. Here, mb equals 2, nb equals 18, and kb = nb - mb = 16. Therefore, the parity check matrix determined by the fundamental matrix Hb0 and the lift value Z = 64 has a size of 2*64 rows and 18*64 columns. The parity check matrix determined by the fundamental matrix Hb1 and the lift value Z = 64 also has a size of 2*64 rows and 18*64 columns. Additionally, there is a first fundamental matrix Tb0, which is composed of the first kb = 16 columns of the first fundamental matrix Hb1, i.e., a matrix of size 2 rows and 16 columns, with a corresponding lift value Z = 64. The first parity check matrix determined by the first fundamental matrix Tb0 and the lift value Z = 64 has a size of 2*64 rows and 16*64 columns. Here, the first fundamental matrix Tb0 is composed of the first kb = 16 columns of the first fundamental matrix Hb1.

[0123] The code determined by the example of the fundamental matrix set of the spatially coupled LDPC code shown in Figure 3 has an information bit sequence length of K = 16 * 64 = 1024 and an encoded bit sequence length of N = 18 * 64 = 1152. Using the encoding method described above, two parity check matrices {H0, H1} and one first parity check matrix {T0} are determined by the fundamental matrix, the first fundamental matrix, and the boost value.

[0124] The above is an example description of encoding information bit sequences. The following will describe the encoding, interleaving, and modulation processes using different interleaving methods.

[0125] Method 1: Determine the bits in the X encoded bit sequences as a first bit sequence and perform interleaving.

[0126] Referring to Figure 2 and as shown in Figure 4, the interleaving process between the X coded bit sequences in S202 specifically includes:

[0127] In S401, a first bit sequence is determined based on X coded bit sequences.

[0128] The first bit sequence comprises a first part consisting of information bits from X encoded bit sequences, and a second part consisting of check bits from X encoded bit sequences. The first part precedes the second part. In one example, all bits from both the first and second parts constitute the first bit sequence.

[0129] A first bit sequence can be obtained by rearranging all bits in multiple bit sequences. During this rearrangement, all information bits from the X coded bit sequences are placed at the beginning of the first bit sequence (the first part mentioned above), while all parity bits are placed at the end (the second part mentioned above). For example, the order of information bits in the first part is the same as the order of information bits in the X coded bit sequences, and the order of parity bits in the second part is the same as the order of parity bits in the X coded bit sequences. In this way, the information bits or parity bits in each coded bit sequence still follow the order of the bits in the coded bit sequence and the arrangement order of the X coded bit sequences, thus preserving the information carried by the X coded bit sequences and ensuring the accuracy of the information.

[0130] In S402, the first bit sequence is interleaved.

[0131] Here, the number of bits in the interleaved bit sequence is equal to the number of bits in the first bit sequence.

[0132] Since the first bit sequence includes all the bits of the X coded bit sequences, it can be interleaved to obtain an interleaved bit sequence. This alters the order of the X coded bit sequences, thus mitigating burst errors in the coded bit sequences and improving data transmission quality.

[0133] In some embodiments, the i+j·Q-th bit in the interleaved bit sequence m The i-th bit is equal to the i-th E / Q-th bit in the first bit sequence. m+j bits; where j is less than or equal to E / Q. m -1 is a non-negative integer, and i is less than or equal to Q. m -1 is a non-negative integer, Q m Here, E is the modulation order, and E is the number of bits in the first bit sequence. Thus, when decoding, the receiver can reconstruct the first bit sequence before interleaving according to this correspondence, thereby recovering the original information and ensuring data accuracy.

[0134] In one possible implementation, all information bits of the X=16 encoded bit sequences can be placed at the beginning of the first bit sequence; all parity bits of the X=16 encoded bit sequences can be placed at the end of the first bit sequence, and the first bit sequence can be interleaved to obtain an interleaved bit sequence.

[0135] For example, as shown in Figure 5, step one is to determine the bit sequence to be encoded, 510.

[0136] Here, the number of bits in the bit sequence to be encoded is 102,400 bits, and the bit sequence to be encoded 510 includes L = 100 information bit sequences. Each information bit sequence has K = 1024 bits, as shown in Figure 5 {a0, a1, a2, ..., a 99}

[0137] Step 2: Spatial coupling LDPC encoding is performed on the bit sequence 510 to be encoded to obtain multiple encoded bit sequences 520.

[0138] Here, the length of the multiple coded bit sequences is 115200, including L = 100 coded bit sequences, each with a length of 1152 bits. Each coded bit sequence includes an information bit sequence 'a' and a parity bit sequence 'P'. In one example, there are no padding bits, so the length of the information bit sequence is equal to that of the corresponding information bit sequence; that is, the information bit sequence of each coded bit sequence is the same as the information bit sequence in the corresponding information bit sequence. The number of bits in the parity bit sequence of each coded bit sequence is equal to 128. The fundamental matrix of the spatially coupled LDPC coding is shown in Figure 3, with a boost value of 64.

[0139] Step 3: Determine the X encoded bit sequences as a first bit sequence 530.

[0140] In one example, all the information bits of the X = 100 encoded bit sequences are placed at the beginning of the first bit sequence 530; all the parity bits of the X encoded bit sequences are placed at the end of the first bit sequence 530, and the first bit sequence 530 is interleaved to obtain an interleaved bit sequence; as shown in Figure 5, the first bit sequence 530 has 115200 bits.

[0141] Step 4: Interleave the first bit sequence 530 according to the modulation order to obtain the interleaved bit sequence 540.

[0142] In one example, the first bit sequence 530 is interleaved according to the following formula to obtain the interleaved bit sequence 540: The i·E / Qth bit in the first bit sequence 530 m +j bits are assigned to the i+j·Q-th bit in the interleaved bit sequence 540. m Bits, here, j equals 0 to E / Q m -1 is any integer, i equals 0 to Q. m any integer Q = -1 m It is the modulation order, E is the number of bits in the first bit sequence 530 (equal to 115200), Q m Both E and f are positive integers, f is the interleaved bit sequence 540, and e is the first bit sequence 530.

[0143] Step 5: Modulate the interleaved bit sequence 540 to obtain the modulation symbol sequence 550.

[0144] In one possible implementation, the modulation mapping scheme can be one of the following: BPSK, QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, or 4096QAM. Here, the number of bits in the BPSK modulation mapping bit sequence (i.e., the modulation symbol sequence mentioned above) is equal to 1 (i.e., the corresponding modulation order Q). m The number of bits in the mapped bit sequence of QPSK modulation is equal to 2 (i.e., the corresponding modulation order Q). m The number of bits in the mapped bit sequence of 16QAM modulation is equal to 4 (i.e., the corresponding modulation order Q). m The number of bits in the mapped bit sequence of 64QAM modulation is equal to 6 (i.e., the corresponding modulation order Q). m The number of bits in the mapped bit sequence of 256QAM modulation is equal to 8 (i.e., the corresponding modulation order Q). m The number of bits in the mapped bit sequence of 1024QAM modulation is equal to 10 (i.e., the corresponding modulation order Q). mThe number of bits in the mapped bit sequence of 4096QAM modulation is equal to 12 (i.e., the corresponding modulation order Q). m (equals 12).

[0145] Step 6: Send modulation symbol sequence 550.

[0146] Here, in the soft bit sequence output by demodulation at the receiving end, the average reliability (amplitude value) of the soft bits located earlier in the soft bit index (soft bit idx) of the modulated bit sequence is greater than or equal to the average reliability (amplitude value) of the soft bits located later in the soft bit sequence. As shown in Figure 6(1), the 16QAM modulated bit sequence includes 4 bits (i.e., Q... m Equal to 4), as shown in Figure 6(1), the average reliability (amplitude value or mean log likelihood ratio, LLR) relationship of the corresponding demodulated output soft bit sequence is shown. The average amplitude value of the 0th soft bit and the 1st soft bit is the largest, followed by the 2nd soft bit and the 3rd soft bit. The mapped bit sequence of 64QAM modulation includes 6 bits (i.e., Q). m Equal to 6), as shown in Figure 6(2), the average reliability (amplitude value) relationship of the corresponding demodulated output soft bit sequence is that the average amplitude value of the 0th soft bit and the 1st soft bit is the largest, followed by the 2nd soft bit and the 3rd soft bit, and the average amplitude value of the 4th soft bit and the 5th soft bit is the smallest. The mapped bit sequence of 256QAM modulation includes 8 bits (i.e., Q). m Equal to 8), as shown in Figure 6(3), the average reliability (amplitude value) relationship of the corresponding demodulated output soft bit sequence is as follows: the average amplitude value of the 0th soft bit and the 1st soft bit is the largest, followed by the 2nd soft bit and the 3rd soft bit, then the 4th soft bit and the 5th soft bit, and the average amplitude value of the 6th soft bit and the 7th soft bit is the smallest. The mapped bit sequence of 1024QAM modulation includes 10 bits (i.e., Q). m As shown in Figure 6(4), the average reliability (amplitude value) relationship of the corresponding demodulated soft bit sequence is as follows: the average amplitude value of the 0th and 1st soft bits is the largest, followed by the 2nd and 3rd soft bits, then the 4th and 5th soft bits, then the 6th and 7th soft bits, and the average amplitude value of the 8th and 9th soft bits is the smallest. It can be seen that in the demodulated soft bit sequence, the average amplitude value of the soft bits with the first index (close to 0) is relatively large, that is, the reliability is relatively high.

[0147] In some other embodiments, during interleaving, the information bits of each coded bit sequence can be grouped to the beginning of the first bit sequence, and the parity bits of each coded bit sequence can be grouped to the end of the first bit sequence before symbol-level interleaving is performed. Furthermore, the average reliability (amplitude value) of the earlier soft bits in the demodulated soft bit sequence of the modulation symbol is higher. In this way, the interleaving method allows the information bits of each coded bit sequence to be preferentially mapped to the high-reliability bits in the first bit sequence, resulting in higher decoding performance.

[0148] Another example, as shown in Figure 7, illustrates the amplitude values ​​(or log-likelihood ratios (LLRs) of different soft bits (idx) in the information sequence obtained after the receiver demodulates and desymbols interleaves the received data signal (i.e., the signal including the modulation symbol sequence). Taking X=4 as an example, the X=4 coded bit sequences are interleaved using 16QAM modulation. {a0, a1, a2, a3} are the soft bit sequences of the information bit sequences in the X=4 coded bit sequences, and {p0, p1, p2, p3} are the soft bit sequences of the parity bit sequences in the X=4 coded bit sequences. It can be seen that the amplitude values ​​of the soft bits of the information bit sequences in the X=4 coded bit sequences are larger, while the amplitude values ​​of the soft bits of the parity bit sequences are smaller. Furthermore, since all bits of multiple coded bit sequences have undergone interleaving, burst errors can be dispersed, thereby resisting the effects of various burst interferences.

[0149] Method 2: Perform interleaving processing on each encoded bit sequence separately, and then perform interleaving processing based on the matrix.

[0150] Referring to Figure 2, as shown in Figure 8, the interleaving process between the X coded bit sequences in the above S202 specifically includes S801 and S802.

[0151] In S801, multiple second bit sequences are determined based on X coded bit sequences.

[0152] Here, a second bit sequence is obtained by interleaving a single encoded bit sequence. That is, multiple second bit sequences are obtained by interleaving X encoded bit sequences separately. The number of multiple second bit sequences is equal to the number of X encoded bit sequences.

[0153] In some embodiments, the i+j·Q-th bit in the v-th second bit sequence m The i-th bit is equal to the i-th E / Q-th bit in the v-th coded bit sequence. m +j bits; where Q mLet Q be the modulation order, E be the number of bits in the multiple second bit sequences, and i be less than or equal to Q. m A non-negative integer, j is less than or equal to E / Q. m A non-negative integer, v is equal to 0 to X-1.

[0154] For example, multiple second bit sequences can satisfy the following formula: The r-th encoded bit sequence e r The i·E r / Q m +j bits are assigned to the r-th bit sequence f. r The i+j·Q m bits, where j equals 0 to E r / Q m -1 is any integer, i equals 0 to Q. m any integer Q = -1 m It is the modulation order, E r Q is the number of bits in the r-th encoded bit sequence. m and E r All are positive integers, f r It is the r-th second bit sequence, e r It is the r-th encoded bit sequence, where r equals 0, 1, ..., X-1.

[0155] In S802, multiple second bit sequences are interleaved.

[0156] Interleaving can be performed between multiple second bit sequences. In this way, not only are burst errors in each encoded bit sequence distributed across that encoded bit sequence, but burst errors in each encoded bit sequence can also be distributed across multiple second bit sequences, thereby further improving robustness.

[0157] Method 3: First, interleave each encoded bit sequence separately to obtain multiple second bit sequences, and then determine the multiple second bit sequences as a first bit sequence for interleaving.

[0158] Referring to Figure 4 and as shown in Figure 9, in the above S401, determining a first bit sequence based on X encoded bit sequences specifically includes: S901 and S902.

[0159] In S901, X encoded bit sequences are defined as multiple second bit sequences.

[0160] It should be understood that the method of determining X encoded bit sequences into multiple second bit sequences is the same as the method in S701 above, and will not be repeated here.

[0161] In S902, multiple second bit sequences are defined as a single first bit sequence.

[0162] The method of determining multiple second bit sequences into a first bit sequence is the same as the method of determining X encoded bit sequences into a first bit sequence in S401 above, and will not be repeated here.

[0163] After determining multiple second bit sequences as a first bit sequence, the first bit sequence can be interleaved according to the above S402 method, thereby further increasing robustness.

[0164] Method 4: Divide the X encoded bit sequences into groups and then perform interleaving.

[0165] In some embodiments, multiple coded bit sequences are divided into Y groups of coded bit sequences, and each group of coded bit sequences is interleaved; wherein at least one group of coded bit sequences contains X coded bit sequences. Thus, X coded bit sequences from multiple coded bit sequences are divided into Y groups of coded bit sequences, and the multiple coded bit sequences in each group are interleaved to obtain an interleaved bit sequence.

[0166] In one possible implementation, the number of coded bit sequences contained in the Y groups of coded bit sequences is equal, that is, the number of coded bit sequences in each group of coded bit sequences is X.

[0167] In another possible implementation, the data in the coded bit sequence of group Y is X or X+1.

[0168] The following describes the methods for interleaving a first bit sequence or multiple second bit sequences in methods one through three.

[0169] In some embodiments, referring to FIG4 and as shown in FIG10, the interleaving process of the first bit sequence in S402 specifically includes S1001 to S1003.

[0170] In S1001, a first bit sequence is written into the first matrix column by column.

[0171] Here, the first matrix is ​​E / Q. m Q m A matrix of columns.

[0172] In one possible implementation, the first matrix can be an E / Q matrix. m Q mA column-wise blank matrix can be created by writing all the bits from the first bit sequence into all the blank positions of the first matrix column by column. Thus, the first matrix after writing the first bit sequence includes all the bits from the first bit sequence.

[0173] It should be noted that when the bits in the first bit sequence are written into the first matrix column by column, E / Q m Q can represent the number of modulation symbols obtained by modulating the first bit sequence. m It can represent the number of bits in a modulation symbol. Therefore, an E / Q... m Q m All bits in a row of the first matrix can be viewed as bits mapped to a single modulation symbol.

[0174] S1002. Interleave at least one column of the first matrix to obtain the second matrix.

[0175] Interleaving can be performed on at least one column of the first matrix, thereby shuffling the bit order in the first bit sequence and distributing burst errors to more modulation symbols, thus increasing robustness.

[0176] In one possible implementation, at least one column in the first matrix does not require interleaving.

[0177] In another possible implementation, the interleaving process for at least two columns in the first matrix is ​​handled differently.

[0178] S1003. Read all the bits in the second matrix row by row.

[0179] After interleaving, all bits can be read sequentially according to the rows of the second matrix to obtain the interleaved bit sequence. In this way, the order of the bits in the read interleaved bit sequence is rearranged compared to the first bit sequence, and its burst errors are distributed across multiple modulation symbols, thereby improving the robustness of the signal.

[0180] In one possible implementation, in steps S1001, S1002, and S1003 above, the first bit sequence can be written row-by-row into the first matrix, and then at least one row in the first matrix can be interleaved to obtain the second matrix. Afterward, all bits in the second matrix are read column-by-column to obtain the interleaved bit sequence.

[0181] In this embodiment of the disclosure, in step 1001 above, the method of writing multiple second bit sequences into the first matrix, followed by interleaving and reading out the bits, is the same as in steps S1001, S1002, and S1003 above, and will not be repeated here. It should be understood that the order in which the bits in the multiple second bit sequences are written into the first matrix is ​​the order of the multiple second bit sequences (i.e., the order of the X encoded bit sequences obtained after encoding).

[0182] In some other embodiments, referring to FIG4 and as shown in FIG11, the interleaving process of the first bit sequence in S402 specifically includes S1101 to S1103.

[0183] In S1101, a first bit sequence is written row by row into the third matrix.

[0184] Here, the third matrix is ​​Q. m E / Q m A matrix of columns.

[0185] In one possible implementation, the third matrix can be a Q. m E / Q m The blank matrix in the column can be used to write all the bits in the first bit sequence into all the blank positions in the third matrix row by row. In this way, the third matrix after writing the first bit sequence includes all the bits in the first bit sequence.

[0186] It should be noted that when writing the bits of the first bit sequence into the first matrix in order, E / Q... m Q can represent the number of modulation symbols obtained by modulating the first bit sequence. m It can represent the number of bits in a modulation symbol. Therefore, a Q... m E / Q m All bits in a column of the third matrix can be viewed as bits mapped to a single modulation symbol.

[0187] In S1102, at least one row of the third matrix is ​​interleaved to obtain the fourth matrix.

[0188] In one possible implementation, at least one row in the first matrix does not require interleaving.

[0189] In another possible implementation, the interleaving process for at least two rows in the first matrix is ​​handled differently.

[0190] In S1103, all bits in the fourth matrix are read out column by column.

[0191] After interleaving, all bits can be read sequentially according to the columns of the fourth matrix to obtain the interleaved bit sequence. In this way, the order of the bits in the read interleaved bit sequence is rearranged compared to the first bit sequence, and its burst errors are distributed across multiple modulation symbols, thereby improving the robustness of the signal.

[0192] In one possible implementation, in steps S1101, S1102, and S1103 above, the first bit sequence can be written column-wise into the third matrix, and then at least one column of the third matrix can be interleaved to obtain a fourth matrix. Afterward, all bits in the fourth matrix are read row-wise to obtain the interleaved bit sequence.

[0193] In this embodiment of the disclosure, in S1101 above, the method of writing multiple second bit sequences into a third matrix, followed by interleaving and reading out the bits, is the same as in S1101, S1102, and S1103 above, and will not be repeated here. It should be understood that the order in which the bits in the multiple second bit sequences are written into the third matrix is ​​the order of the multiple second bit sequences (i.e., the order of the X encoded bit sequences obtained after encoding).

[0194] For the above interleaving process, the interleaving method includes cyclic shift interleaving; the number of shifts in cyclic shift interleaving is determined by one of the following: the number of bits in the first bit sequence or the second bit sequence, the modulation order, the number of X coded bit sequences, the number of information bits in the coded bit sequence, and the number of parity bits in the coded bit sequence.

[0195] Here, the number of shifts is function(R / 2) i R represents the number of rows or columns of the first or third matrix, i is an integer less than or equal to the modulation order, and function() is the floor function; or, the shift amount is function((R / Q)). m R equals E / Q (1 / Q) × i). m , i is an integer less than or equal to the modulation order, Q m Here, E / Q is the modulation order, and function() is the floor function. m Not equal to an integer, R can be equal to the number of rows or columns of the first or third matrix.

[0196] When writing the first bit sequence or multiple second bit sequences according to the rows of the first matrix, R is the number of rows in the first matrix. When writing the first bit sequence or multiple second bit sequences according to the columns of the third matrix, R equals E / Q. m`function(x)` is the integer function, which can be used to round the smallest integer greater than or equal to the real number `x`, the largest integer less than or equal to the real number `x`, or the integer obtained by rounding the real number `x`. For example, in the case of performing cyclic shifting and interleaving on the `i`th row or `i`th column of the first matrix, the shift amount is equal to `function((R / Q)`. m )×i), where i equals 0, 1, ..., Q m -1.

[0197] In some other embodiments, interleaving is performed on the first bit sequence based on interleaving parameters, which include at least one of the following: the modulation order of the modulation scheme corresponding to the modulation symbol sequence, the number of bits in the first bit sequence, and the number of X coded bit sequences.

[0198] The following will describe the process of the above interleaving with examples.

[0199] Example 2 describes the process of determining the first bit sequence and interleaving the first bit sequence.

[0200] Let X = 8. All information bits from the X = 8 encoded bit sequences are placed at the beginning of the first bit sequence; all parity bits from the X = 8 encoded bit sequences are placed at the end of the first bit sequence. The first bit sequence is then interleaved to obtain an interleaved bit sequence. As shown in Figure 5, the number of bits E in the first bit sequence 530 is equal to 73008. Assuming the mapping modulation method is 64QAM, the modulation order Q... m It equals 6.

[0201] Then, the first bit sequence is written into an E / Q converter in column-major order. m Q m The first matrix of columns, as shown in Figure 12 (matrix 1210), has R = E / Q rows. m =73008 / 6=12168, the number of columns is Q m =6. The order of writing to the first matrix is ​​column-major. For example, after writing 12168 bits of column 0 (corresponding to bits 0 to 12167 in the first bit sequence), then write 12168 bits of column 1 (corresponding to bits 12168 to 24335 in the first bit sequence), and so on, writing all bits of the first bit sequence into the first matrix. In the first matrix 1210 shown in Figure 12, the leftmost column is column 0, and the rightmost column is column Q. m -1 = 5 columns.

[0202] Interleaving at least one column of the first matrix yields the second matrix, which is then read row-majorly to obtain the interleaved bit sequence. In a specific example, as shown in Figure 13, a cyclic shift interleaving operation is performed on the first column of the second matrix. The number of shifts in the cyclic shift is equal to function(R / 2) (i.e., when i = 1, counting from 0). Here, function(x) represents the smallest integer greater than or equal to the real number x, and R is the number of rows in the first matrix. R equals 12168, meaning the number of shifts in the cyclic shift is 6084.

[0203] In another example, a cyclic shift interleaving operation is performed on the first column of the first matrix, with the number of shifts equal to function(R / 2). 2 =3042 (i.e., i=2, counting from 0), and the second matrix can be obtained after cyclic shifting and interleaving operations.

[0204] In another example, a cyclic shift interleaving operation is performed on the i-th column of the first matrix, and the number of shifts in the cyclic shift is equal to function(R / 2). i Let i be 0, 1, ..., 5. That is, the number of shifts in the cyclic shift of column 0 is 12168, the number of shifts in the cyclic shift of column 1 is 6084, the number of shifts in the cyclic shift of column 2 is 3042, the number of shifts in the cyclic shift of column 3 is 1521, the number of shifts in the cyclic shift of column 4 is 760, and the number of shifts in the cyclic shift of column 5 is 380. After the cyclic shift interleaving operation, the second matrix can be obtained.

[0205] As shown in Figure 13, after performing cyclic shifting to obtain the second matrix, all bits of the second matrix can be read out row-wise to obtain the interleaved bit sequence. The bits in column 0 of the second matrix are mapped to the 0th bit of the corresponding mapping bit sequence for each modulation symbol; the bits in column 1 are mapped to the 1st bit; the bits in column 2 are mapped to the 2nd bit; and so on, with the bits in column 5 mapped to the 5th bit. Since the writing order of the first matrix 1210 shown in Figure 12 is column-wise, and the reading order of the second matrix shown in Figure 13 is row-wise, it can be guaranteed that in the soft bits of the demodulated output at the receiving end, the soft bit reliability of the information bits (or the first K bits) of the X=8 encoded bit sequence is higher than that of its parity bits (or the last M bits). Furthermore, different column interleavings between different columns in the second matrix can create an interleaving effect between different encoded bit sequences, dispersing continuous burst interference into different encoded bit sequences to improve reception performance.

[0206] In one example, the remaining X = 8 encoded bit sequences (i.e., the 8th to 15th encoded bit sequences) in the encoded bit sequence are interleaved according to the modulation order to obtain the interleaved bit sequence, which is then modulated and transmitted. The processing operations are similar to those described above and will not be repeated here.

[0207] Example 3 describes the process of determining multiple second bit sequences and interleaving these multiple second bit sequences.

[0208] The X = 6 coded bit sequences in the coded bit sequence are interleaved according to the modulation order to obtain the interleaved bit sequence. For example, using 64QAM modulation, Q... m =6, where X = 6 encoded bit sequences are the 0th to 5th encoded bit sequences in the encoded bit sequence. The interleaving process in this example includes:

[0209] First, each of the six encoded bit sequences is interleaved individually using the following formula to obtain six second bit sequences: The r-th encoded bit sequence e r The i·E r / Q m +j bits are assigned to the r-th bit sequence f. r The i+j·Q m bits, where j equals 0 to E r / Q m -1 is any integer, i equals 0 to Q. m Any integer of -1, E r f is the number of bits in the r-th encoded bit sequence (equal to 1152 bits). r It is the r-th second bit sequence, e r It is the r-th encoded bit sequence, where r equals 0, 1, ..., 5.

[0210] Then, write each of the six second bit sequences into an E / Q array in row-major order. m Q m The first matrix consists of columns, where E equals the total number of bits in the 6 encoded bit sequences (X = 6), i.e., E equals 6 * 1152 = 6912. At least one column in the first matrix is ​​interleaved to obtain the second matrix. Then, the second matrix is ​​read row-majorly to obtain the interleaved bit sequence. It should be understood that the interleaving of any one or more columns can be performed using the interleaving methods described above, which will not be repeated here.

[0211] Here, interleaving each of the six coded bit sequences individually to obtain six second bit sequences results in an interleaving process where the soft bit reliability of the information bits in these six coded bit sequences is higher than that of their parity bits. That is, information bits are mapped to positions with higher reliability in the mapped bit sequence of the modulation symbols, and parity bits are mapped to positions with lower reliability in the mapped bit sequence of the modulation symbols. This improves the accuracy of the information bits decoded at the receiver. Furthermore, column-wise interleaving of the first matrix not only ensures the above characteristics—that information bits are preferentially mapped to positions with higher reliability in the mapped bit sequence—but also disperses the continuous errors of burst interference across the various coded bit sequences, thereby reducing the impact of burst errors.

[0212] In another example, after performing the above data processing on the 0th to 5th encoded bit sequences, the same data processing is performed on the 6th to 11th encoded bit sequences, and so on up to the 95th encoded bit sequence, before processing the remaining 4 encoded bit sequences.

[0213] A bit sequence to be encoded is determined, which includes L information bit sequences. Let the L information bit sequences to be encoded be a0, a1, a2, ..., a... L-1 In this sequence, the number of bits in each information bit sequence is K = 8. Each information bit sequence is a0, a1, a2, ..., a K-1 .

[0214] Spatially coupled LDPC encoding is performed on the bit sequence to be encoded to obtain multiple encoded bit sequences. These multiple encoded bit sequences include L = 64 encoded bit sequences, namely b0, b1, b2, ..., b... L-1 The number of bits in each coded bit sequence is N = 12. Each coded bit sequence b is b0, b1, b2, ..., b N-1 The set of fundamental matrices for spatially coupled LDPC codes has M = 2 fundamental matrices, meaning the coupling width of the spatially coupled LDPC code is equal to 1. The fundamental matrix Hb0 is [0,0,0] and the fundamental matrix Hb1 is [0,1,-1], with a corresponding lift value Z equal to 4. Additionally, there are B = 1 first fundamental matrices Tb0, which are [0,1].

[0215] Based on the modulation order, X portions of the coded bit sequences from multiple coded bit sequences are interleaved to obtain an interleaved bit sequence. These X coded bit sequences comprise 64 coded bit sequences, and each X coded bit sequence is interleaved sequentially to obtain the interleaved bit sequence. For example, the coded bit sequences from 0 to X-1 are interleaved first, then the coded bit sequences from X to 2X-1 are interleaved, and so on.

[0216] In one example, interleaving X = 8 encoded bit sequences can be performed as follows: All information bits of the X = 8 encoded bit sequences are placed at the beginning of the first bit sequence; all parity bits of the X = 8 encoded bit sequences are placed at the end of the first bit sequence. This first bit sequence is then interleaved to obtain an interleaved bit sequence with 96 bits. The first bit sequence is interleaved according to the following formula: The i-th E / Q-th bit in the first bit sequence m +j bits are assigned to the i+j·Q-th bit in the interleaved bit sequence. m Bits, where j equals 0 to E / Q m -1 is any integer, i equals 0 to Q. m Any integer -1, E equals 96, f is the interleaved bit sequence, e is the first bit sequence, and the modulation scheme is 16QAM modulation. m =4. Modulation mapping is performed on the interleaved bit sequence to obtain the modulation symbol sequence. Modulation mapping is performed on the interleaved bit sequence to obtain the modulation symbol sequence: d0, d1, d2, ..., d G-1 , where G is the number of symbols in the modulation symbol sequence, and G equals 24.

[0217] As shown in Figure 14, the position indices of the mapped bit sequence for each modulation symbol sequence in the X = 8 encoded bit sequences are given. For example, the bit positions in the mapped bit sequence of the 0th symbol d0 are {0, 36, 72, 32}, the bit positions in the mapped bit sequence of the 1st symbol d1 are {1, 37, 73, 33}, and so on. 22 The bit in the mapped bit sequence has the position index {30, 66, 22, 94} in the 8-part encoded bit sequence, and the last 23rd symbol d 23The bit positions in the mapped bit sequence are {31, 67, 23, 95} within the 8 encoded bit sequences. In Figure 14, the integers in the table represent the position indices within the X = 8 encoded bit sequences. For example, position indices {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} correspond to the bit index of the 0th encoded bit sequence within the X = 8 encoded bit sequences, and position indices {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23} correspond to the bit index of the 1st encoded bit sequence within the X = 8 encoded bit sequences. As shown in Figure 14, the information bits are located in rows 0 to 2, and the check bits are located in rows 2 to 3. In the soft bits obtained by demodulation at the receiving end, corresponding to the soft bits in rows 0 and 1 in Figure 14, the average reliability of the soft bits is higher than that of the soft bits in rows 2 and 3. That is, the information bits in the encoded bit sequence are preferentially mapped to the earlier rows as shown in Figure 14.

[0218] In another example, the first bit sequence is written into a Q in row-major order. m =4 lines of E / Q m The first matrix has 24 columns. At least one row of the first matrix is ​​interleaved to obtain the second matrix. That is, the i-th row of the first matrix is ​​subjected to a cyclic shift and interleaving process, with the number of shifts equal to: function((R / Q) m )×i), where i equals 0, 1, ..., Q m -1, R equals E / Q m =24. That is, the number of cyclic shifts in row 0 is 0, the number of cyclic shifts in row 1 is 6, the number of cyclic shifts in row 2 is 12, and the number of cyclic shifts in row 8 is 18. As shown in Figure 15, compared with Figure 14, Figure 15 shows the mapping of each bit index in the X=8 coded bit sequence after interleaving each row to each modulation symbol. For example, the bit in the mapped bit sequence of symbol 0 d0 has the position index {0, 62, 88, 46} in the 8 coded bit sequence, the bit in the mapped bit sequence of symbol 1 d1 has the position index {1, 63, 89, 47} in the 8 coded bit sequence, and so on. Then, the interleaved bit sequence is obtained by reading the second matrix column-first, and then modulation mapping is performed to obtain the modulation symbol sequence: d0, d1, d2, ..., d G-1 G equals 24.

[0219] In another example, X = 6 coded bit sequences are interleaved, and 64QAM modulation is used. m=6, the following operation can be performed: interleave each of the X=6 encoded bit sequences individually according to the following formula to obtain X=6 second bit sequences: The r-th encoded bit sequence e r The i·E r / Q m +j bits are assigned to the r-th bit sequence f. r The i+j·Q m bits, where j equals 0 to E r / Q m -1 is any integer, i equals 0 to Q. m any integer Q = -1 m It is the modulation order, E r E is the number of bits in the r-th encoded bit sequence. r equals 12, f r It is the r-th second bit sequence, e r This is the r-th encoded bit sequence, where r equals 0, 1, ..., 5. Here, these X = 6 second bit sequences are written into a Q in row-major order. m =6 lines of E / Q m The first matrix has 12 columns. Interleaving is performed on at least one row of the first matrix, and a cyclic shift is performed on the i-th row of the first matrix. The number of shifts is equal to: function(R / 2) i ), where i equals 0, 1, ..., Q m -1, R equals E / Q m =12. That is, the number of cyclic shifts in row 0 is equal to 0, the number of cyclic shifts in row 1 is equal to 6, the number of cyclic shifts in row 2 is equal to 12, and the number of cyclic shifts in row 8 is equal to 18. As shown in (1) of Figure 16, this is the first matrix before interleaving. Among them, the number in the 0th dashed box from the leftmost position represents the 0th coded bit sequence e in X = 6 coded bit sequences. 0 The index positions of all bits; the number within the first dashed box represents the first coded bit sequence e in the X = 6 coded bit sequences. 1 The index positions of all bits are determined accordingly; the second matrix after interleaving is shown in Figure 16(2). The bit positions in the mapped bit sequence of the 0th symbol d0 are {36, 51, 65, 6, 8, 10} in the 8 encoded bit sequences, and the bit positions in the mapped bit sequence of the 1st symbol d1 are {37, 62, 4, 7, 9, 11} in the 8 encoded bit sequences, and so on. Then, the interleaved bit sequence is obtained by reading the second matrix column-wise, and then modulation mapping is performed to obtain the modulation symbol sequence: d0, d1, d2, ..., d G-1 G equals 12.

[0220] The data processing method provided in this disclosure can be applied to the second node 102 in the communication system shown in FIG1. ​​FIG17 shows a schematic flowchart of another data processing method. As shown in FIG17, the data processing method includes the following steps: S1701 to S1704.

[0221] In S1701, the modulation symbol sequence is received.

[0222] In S1702, the modulation symbol sequence is demodulated to obtain a soft bit sequence.

[0223] In S1703, all soft bits of the X encoded bit sequences in the soft bit sequence are deinterleaved to obtain multiple encoded soft bit sequences.

[0224] Here, X is an integer greater than 1.

[0225] In S1704, multiple information bit sequences are obtained by spatially coupled LDPC decoding based on multiple encoded soft bit sequences.

[0226] After receiving the modulation symbol sequence, the second node can demodulate it to obtain a soft bit sequence, which is the bit sequence corresponding to the interleaved bit sequence after the first node's interleaving process. Therefore, the first node also needs to deinterleave the soft bit sequences corresponding to the X coded bit sequences in the soft bit sequence to obtain multiple coded soft bit sequences, which are the bit sequences corresponding to the coded bit sequences after the first node's encoding process. In this way, the second node can decode based on multiple coded soft bit sequences to obtain multiple information bit sequences.

[0227] Since all soft bit sequences corresponding to the X coded bit sequences in the soft bit sequence of the modulation symbol sequence are obtained by interleaving the X coded bit sequences, some burst errors in the X coded bit sequences are distributed across more coded bit sequences. This reduces the impact of burst errors on one or several coded bit sequences, thereby increasing signal robustness and improving the accuracy of information transmission. Furthermore, spatially coupled LDPC coding can further increase the coupling between coded bit sequences, thereby improving the decoding accuracy of the coded bit sequences and enhancing the quality of data transmission.

[0228] In one possible implementation, the second node can interleave at least X*N soft bits in the soft bit sequence according to the modulation order to obtain the corresponding X coded soft bit sequences. The X coded soft bit sequences belong to L coded soft bit sequences, where L is the number of coded bit sequences of the spatially coupled LDPC code.

[0229] It should be noted that for descriptions of encoded bit sequences, interleaved bit sequences, etc., please refer to the description of the first node, and will not be repeated here in the embodiments of this disclosure.

[0230] It is understood that, in order to achieve the above-mentioned functions, the data processing apparatus includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments of this disclosure, this disclosure can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0231] This disclosure embodiment can divide the data processing device into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosure embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0232] Figure 18 is a schematic diagram of a communication device provided in an embodiment of this disclosure. The communication device can execute the data processing method provided in the above-described method embodiment. As shown in Figure 18, the communication device includes a processing unit 1801 and a transmitting unit 1802.

[0233] The processing unit 1801 is used to perform spatially coupled LDPC encoding on multiple information bit sequences to obtain multiple encoded bit sequences.

[0234] The processing unit 1801 is further configured to perform interleaving processing on X coded bit sequences among the plurality of coded bit sequences to obtain an interleaved bit sequence, wherein X is an integer greater than 1.

[0235] The processing unit 1801 is also used to modulate the interleaved bit sequence to obtain a modulated symbol sequence;

[0236] The transmitting unit 1802 is used to transmit the modulation symbol sequence.

[0237] In one possible implementation, X is determined by the coupling width of a spatially coupled LDPC encoding, wherein the coupling width is an integer greater than 0.

[0238] In one possible implementation, X is equal to a positive integer multiple of the coupling width of the spatially coupled LDPC encoding.

[0239] In one possible implementation, the maximum value of X is determined by the coupling width of the spatially coupled LDPC encoding.

[0240] In one possible implementation, the coupling width is equal to one of the following: 1, 2, 3, 4, 5, or 6.

[0241] In one possible implementation, the information bits in the X coded bit sequences are mapped to the index of the mapped bit sequence of the modulation symbols in the modulation symbol sequence, which is less than or equal to the index of the parity bits in the X coded bit sequences mapped to the index of the mapped bit sequence of the modulation symbols in the modulation symbol sequence.

[0242] In one possible implementation, a bit in the information bit of the m-th coded bit sequence of the X coded bit sequences is mapped to the 0th bit in the mapped bit sequence of a modulation symbol in the modulation symbol sequence, and a bit in the information bit of the n-th coded bit sequence of the X coded bit sequences is mapped to the 1st bit in the mapped bit sequence of the modulation symbol, where m and n are non-negative integers, and m is not equal to n.

[0243] In one possible implementation, the X coded bit sequences are X consecutive coded bit sequences among the plurality of coded bit sequences.

[0244] In one possible implementation, the maximum value of X is one of the following: 2, 4, 6, 8, 10, 12, 16, 20, 24 or 32.

[0245] In one possible implementation, the maximum value of X is determined by at least one of the following: coding rate, transport block size, data rate, target delay, target bit error rate, target reliability, terminal type, basic graph matrix index, or modulation order.

[0246] In one possible implementation, the modulation order is any one of the following: 4, 6, 8, 10, or 12.

[0247] In one possible implementation, the number of the X coded bit sequences is determined based on the modulation order.

[0248] In one possible implementation, the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence is composed of bits from different coded bit sequences. In a specific example, the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence is composed of bits from z different coded bit sequences, where z equals Q.m / 2 or Q m , where Q m The modulation order is denoted by . The mapped bit sequence of at least one modulation symbol in the modulation symbol sequence includes at least one information bit from the z coded bit sequences.

[0249] In one possible implementation, the 0th bit of the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence comes from the information bit of the 0th coded bit sequence in the X coded bit sequences; and / or,

[0250] The last bit of the mapped bit sequence of at least one modulation symbol comes from the parity bit of the last encoded bit sequence among the X encoded bit sequences.

[0251] In one possible implementation, the processing unit 1801 is specifically configured to: determine a first bit sequence based on the X coded bit sequences, and perform interleaving processing on the first bit sequence to obtain the interleaved bit sequence; wherein the first bit sequence includes all bits in the X coded bit sequences; perform interleaving processing on the first bit sequence to obtain the interleaved bit sequence; or, determine a plurality of second bit sequences based on the X coded bit sequences; wherein the first bit sequence includes all bits in the X coded bit sequences, and perform interleaving processing on the plurality of second bit sequences to obtain the interleaved bit sequence; wherein a second bit sequence is obtained by interleaving a single coded bit sequence.

[0252] The first bit sequence or the plurality of second bit sequences are interleaved to obtain the interleaved bit sequence. In one possible implementation, the processing unit 1801 is specifically used to: determine a plurality of second bit sequences based on the X coded bit sequences;

[0253] The plurality of second bit sequences are determined as the first bit sequence.

[0254] In one possible implementation, a first portion of the first bit sequence includes information bits from the X coded bit sequences, and a second portion of the first bit sequence includes check bits from the X coded bit sequences, with the first portion preceding the second portion. In a specific example, all bits of the first and second portions constitute the first bit sequence.

[0255] In one possible implementation, the i+j·Q-th bit in the v-th bit sequence of the second bit... m The i-th bit is equal to the i-th E / Q-th bit in the v-th coded bit sequence. m+j bits, v equals 0 to X-1;

[0256] Among them, Q m Let E be the modulation order, E be the number of bits in the plurality of second bit sequences, and i be less than or equal to Q. m A non-negative integer, j is less than or equal to E / Q. m . a non-negative integer.

[0257] In one possible implementation, the i+j·Q-th bit in the interleaved bit sequence m The i-th bit is equal to the i-th E / Q-th bit in the first bit sequence. m +j bits;

[0258] Among them, Q m Let Q be the modulation order, E be the number of bits in the first bit sequence, and i be a number less than or equal to Q. m A non-negative integer, j is less than or equal to E / Q. m . a non-negative integer.

[0259] In one possible implementation, the processing unit 1801 is specifically configured to: perform interleaving processing on the first bit sequence or the plurality of second bit sequences based on interleaving parameters, wherein the interleaving parameters include at least one of the following: modulation order, number of bits in the first bit sequence, and X.

[0260] In one possible implementation, the processing unit 1801 is specifically used for: the first matrix being E / Q m Q m A matrix of columns; Q m Let E be the modulation order, and E be the number of bits in the first bit sequence; interleave at least one column of the first matrix to obtain a second matrix; read all the bits in the second matrix row by row; read all the bits in the second matrix row by row.

[0261] Processing unit 1801 is specifically used for: writing the first bit sequence row by row into a first matrix, wherein the first matrix is ​​Q. m E / Q m A matrix of columns; Q m Where E is the modulation order, and E is the number of bits in the first bit sequence;

[0262] Interleave at least one row of the first matrix to obtain the second matrix;

[0263] Read all the bits in the second matrix column by column.

[0264] In one possible implementation, the processing unit 1801 is specifically used for:

[0265] The plurality of second bit sequences are written row-wise into a third matrix, the third matrix being an E / Q matrix. m Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the plurality of second bit sequences;

[0266] Interleave at least one column of the third matrix to obtain the fourth matrix;

[0267] Read all bits in the fourth matrix row by row;

[0268] Processing unit 1801 is specifically used for: writing the plurality of second bit sequences into a third matrix column by column, wherein the third matrix is ​​Q. m E / Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the plurality of second bit sequences;

[0269] Interleave at least one row of the third matrix to obtain the fourth matrix;

[0270] Read all the bits in the fourth matrix column by column.

[0271] In one possible implementation, the interleaving process includes cyclic shift interleaving;

[0272] The number of shifts in the cyclic shift interleaving is determined by at least one of the following: the number of bits in the first bit sequence, the modulation order, the number of the X coded bit sequences, the number of information bits in the coded bit sequences, and the number of parity bits in the coded bit sequences.

[0273] In one possible implementation, the number of shifts is function(R / 2) i R equals E / Q m , i is a positive integer less than or equal to the modulation order, function() is a rounding function, which can represent taking the smallest integer greater than or equal to the input parameter, or taking the largest integer less than or equal to the input parameter, or taking the integer obtained by rounding the input parameter;

[0274] Alternatively, the shift amount is function((R / Q) m R equals E / Q (1 / Q) × i). m i is a positive integer less than or equal to the modulation order, Q m Let be the modulation order, and function() be the floor function.

[0275] In one possible implementation, the number of bits in at least one of the plurality of information bit sequences is equal to the maximum number of information bits in the spatially coupled LDPC encoding.

[0276] In one possible implementation, the maximum number of information bits is the product of the number of information columns in the spatially coupled LDPC encoding and the maximum boost value, wherein the number of information columns is equal to the difference between the number of columns and the number of rows in the parity check matrix of the spatially coupled LDPC encoding.

[0277] In one possible implementation, the processing unit 1801 is specifically used to: divide the plurality of coded bit sequences into Y groups of coded bit sequences, and perform the interleaving process on each group of coded bit sequences; wherein at least one group of coded bit sequences contains X coded bit sequences, and Y is a positive integer.

[0278] In one possible implementation, the number of coded bit sequences contained in the Y group of coded bit sequences is equal to that in the X group.

[0279] In one possible implementation, the number of coded bit sequences contained in the Y group of coded bit sequences includes two options: X and X+1.

[0280] In one possible implementation, the maximum number of information bits encoded by the spatially coupled low-density parity-check code (LDPC) is equal to one of the following: 512, 768, 896, 1024, 1280, 1536, 1792, or 2048.

[0281] In one possible implementation, the transmitting unit 1802 may include a single antenna or multiple antennas.

[0282] In one possible implementation, as shown in Figure 19, the processing unit 1801 may further include an encoding unit 1901, an interleaving unit 1902, and a modulation unit 1903. The encoding unit 1901 is used to encode multiple information bit sequences to obtain multiple encoded bit sequences.

[0283] Interleaving unit 1902 is used to interleave X coded bit sequences among the plurality of coded bit sequences to obtain an interleaved bit sequence, wherein X is an integer greater than 1.

[0284] The modulation unit 1903 is also used to modulate the interleaved bit sequence to obtain a modulation symbol sequence.

[0285] Figure 20 is a schematic diagram of another communication device provided in an embodiment of this disclosure. The communication device can execute the data processing method provided in the above-described method embodiments. As shown in Figure 20, the communication device includes a receiving unit 2001 and a processing unit 2002.

[0286] Receiver unit 2001 is used to receive modulation symbol sequences;

[0287] Processing unit 2002 is used to demodulate the modulation symbol sequence to obtain a soft bit sequence;

[0288] The processing unit 2002 is further configured to perform deinterleaving processing on all soft bits of the X coded bit sequences in the soft bit sequence, and obtain multiple coded soft bit sequences, wherein X is an integer greater than 1;

[0289] The processing unit 2002 is also used to perform spatially coupled LDPC decoding based on the plurality of encoded soft bit sequences to obtain a plurality of information bit sequences.

[0290] In one possible implementation, X is determined by the coupling width of a spatially coupled LDPC encoding, wherein the coupling width is an integer greater than 0.

[0291] In one possible implementation, X is equal to a positive integer multiple of the coupling width of the spatially coupled LDPC encoding.

[0292] In one possible implementation, the maximum value of X is determined by the coupling width of the spatially coupled LDPC encoding.

[0293] In one possible implementation, the information bits in the X coded bit sequences are mapped to the index of the mapped bit sequence of the modulation symbols in the modulation symbol sequence, which is less than or equal to the index of the parity bits in the X coded bit sequences mapped to the index of the mapped bit sequence of the modulation symbols in the modulation symbol sequence.

[0294] In one possible implementation, at least one bit of the information bits of the m-th coded soft bit sequence in the X coded soft bit sequences is mapped to the 0th bit of the mapped bit sequence of a modulation symbol in the modulation symbol sequence, and at least one bit of the information bits of the n-th coded soft bit sequence in the X coded soft bit sequences is mapped to the 1st bit of the mapped bit sequence of the modulation symbol, where m and n are non-negative integers, and m is not equal to n.

[0295] In one possible implementation, the X coded soft bit sequences are X consecutive coded soft bit sequences among the plurality of coded soft bit sequences.

[0296] In one possible implementation, the maximum value of X is determined by at least one of the following: coding rate, transport block size, data rate, target delay, target bit error rate, target reliability, terminal type, basic graph matrix index, or modulation order.

[0297] In one possible implementation, the number of the plurality of coded soft bit sequences is determined based on the modulation order.

[0298] In one possible implementation, the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence is composed of bits from different encoded soft bit sequences.

[0299] In one possible implementation, the 0th bit of the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence comes from the information bit of the 0th coded soft bit sequence in the plurality of coded soft bit sequences; and / or,

[0300] The last bit of the mapped bit sequence of at least one modulation symbol comes from the parity bit of the last encoded soft bit sequence among the plurality of encoded soft bit sequences.

[0301] In one possible implementation, the transmitting unit 2001 may include a single antenna or multiple antennas.

[0302] In one possible implementation, as shown in FIG21, the processing unit 2002 may further include a demodulation unit 2101, a deinterleaving unit 2102, and a decoding unit 2103.

[0303] The demodulation unit 2101 is used to demodulate the first signal to obtain a soft bit sequence;

[0304] The deinterleaving unit 2102 is used to deinterleave all soft bits of at least X coded bit sequences in the soft bit sequence and obtain multiple coded soft bit sequences, where X is an integer greater than 1;

[0305] Decoding unit 2103 is used to decode the plurality of encoded soft bit sequences to obtain a plurality of information bit sequences.

[0306] In the case of implementing the functions of the integrated modules described above in hardware, this disclosure provides another possible structure for the communication device involved in the above embodiments. As shown in FIG22, the communication device 220 includes: a processor 2202 and a bus 2204. Optionally, the communication device may further include a memory 2201 (also referred to as a storage medium); optionally, the communication device may further include a communication interface 2203.

[0307] Processor 2202 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 2202 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 2202 may also be a combination of functions implementing computation, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0308] Processor 2202 can perform the following steps:

[0309] Step 1: Perform spatially coupled LDPC encoding on the L information bit sequences to obtain L encoded bit sequences, where L is an integer greater than 1.

[0310] Step 2: Interleave at least X coded bit sequences from the L coded bit sequences according to the modulation order to obtain the interleaved bit sequence, where X is an integer less than or equal to C.

[0311] Step 3: Modulate the interleaved bit sequence to obtain the modulated symbol sequence.

[0312] Step 4: Send the modulation symbol sequence through communication interface 2203.

[0313] Processor 2202 can also perform the following steps:

[0314] Step 1: Receive the modulation symbol sequence through communication interface 2203.

[0315] Step 2: Demodulate the modulation symbol sequence to obtain the soft bit sequence.

[0316] Step 3: Deinterleave multiple soft bit sequences in the soft bit sequence to obtain multiple coded soft bit sequences.

[0317] Step 4: Perform spatially coupled LDPC decoding on multiple encoded soft bit sequences to obtain multiple information bit sequences.

[0318] The communication interface 2203 is used to connect to other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0319] The memory 2201 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto.

[0320] As one possible implementation, the memory 2201 can exist independently of the processor 2202. The memory 2201 can be connected to the processor 2202 via a bus 2204 and is used to store instructions or program code. When the processor 2202 calls and executes the instructions or program code stored in the memory 2201, it can implement the data processing method provided in the embodiments of this disclosure.

[0321] In another possible implementation, the memory 2201 can also be integrated with the processor 2202.

[0322] In another possible implementation, the memory 2201 may further include data storage 2205 and processing instructions 2206. The data storage 2205 can be used as a local cache for information bit sequences, encoded bit sequences, parity matrices, transport blocks, and boost values, etc. The processing instructions 2206 are used to store processing instructions on how to encode, interleave, decode, deinterleave, etc., the data stored in the data storage 2205.

[0323] Bus 2204 can be an extended industry standard architecture (EISA) bus, etc. Bus 2204 can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used to represent it in Figure 22, but this does not mean that there is only one bus or one type of bus.

[0324] Some embodiments of this disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium) storing computer program instructions that, when executed on a computer, cause the computer to perform a data processing method as described in any of the above embodiments.

[0325] For example, the computer-readable storage media described above may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0326] This disclosure provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the data processing method described in any of the above embodiments. The above descriptions are merely specific implementations of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any variations or substitutions within the technical scope disclosed in this disclosure should be covered within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A data processing method, wherein, The method includes: Multiple information bit sequences are spatially coupled low-density parity-check code (LDPC) encoding is performed to obtain multiple encoded bit sequences. Interleave X coded bit sequences among the plurality of coded bit sequences to obtain an interleaved bit sequence, where X is an integer greater than 1; The interleaved bit sequence is modulated to obtain a modulated symbol sequence; The modulation symbol sequence is transmitted.

2. The method according to claim 1, wherein, X is determined by the coupling width of the spatially coupled LDPC encoding, wherein the coupling width is an integer greater than 0.

3. The method according to claim 1, wherein, X is equal to a positive integer multiple of the coupling width of the spatially coupled LDPC encoding.

4. The method according to claim 1, wherein, The maximum value of X is determined by the coupling width of the spatially coupled LDPC encoding.

5. The method according to any one of claims 2-4, wherein, The coupling width is equal to one of the following: 1, 2, 3, 4, 5 or 6.

6. The method according to claim 1, wherein, The index of the information bit in the X coded bit sequence mapped to the mapping bit sequence of the modulation symbol in the modulation symbol sequence is less than or equal to the index of the parity bit in the X coded bit sequence mapped to the mapping bit sequence of the modulation symbol in the modulation symbol sequence.

7. The method according to claim 1, wherein, One bit of the information bit of the m-th coded bit sequence in the X coded bit sequences is mapped to the 0th bit of the mapping bit sequence of a modulation symbol in the modulation symbol sequence, and one bit of the information bit of the n-th coded bit sequence in the X coded bit sequences is mapped to the 1st bit of the mapping bit sequence of the modulation symbol, where m and n are non-negative integers, and m is not equal to n.

8. The method according to claim 1, wherein, The X coded bit sequences are X consecutive coded bit sequences among the plurality of coded bit sequences.

9. The method according to claim 1, wherein, The maximum value of X is one of the following: 2, 4, 6, 8, 10, 12, 16, 20, 24 or 32.

10. The method according to claim 1, wherein, The maximum value of X is determined by at least one of the following: coding rate, transport block size, data rate, target delay, target bit error rate, target reliability, terminal type, basic graph matrix index, or modulation order.

11. The method according to claim 1, wherein, The modulation order is any one of the following: 4, 6, 8, 10 or 12.

12. The method according to claim 1, wherein, The number X of the encoded bit sequence is determined based on the modulation order.

13. The method according to claim 1, wherein, The mapped bit sequence of at least one modulation symbol in the modulation symbol sequence is composed of bits from different encoded bit sequences.

14. The method according to claim 1, wherein, The 0th bit of the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence comes from the information bit of the 0th coded bit sequence in the X coded bit sequences; and / or, The last bit of the mapped bit sequence of the at least one modulation symbol comes from the parity bit of the last encoded bit sequence among the X encoded bit sequences.

15. The method according to claim 1, wherein, The interleaving process between X coded bit sequences in the plurality of coded bit sequences includes: A first bit sequence is determined based on the X coded bit sequences, and the first bit sequence is interleaved to obtain the interleaved bit sequence; wherein, the first bit sequence includes all bits in the X coded bit sequences; Alternatively, multiple second bit sequences are determined based on the X encoded bit sequences, and the multiple second bit sequences are interleaved to obtain the interleaved bit sequence; wherein, one second bit sequence is obtained by interleaving one of the encoded bit sequences separately.

16. The method according to claim 15, wherein, Determining a first bit sequence based on the X coded bit sequences includes: Multiple second bit sequences are determined based on the X encoded bit sequences; The plurality of second bit sequences are determined as the first bit sequence.

17. The method according to claim 15, wherein, The first part of the first bit sequence includes information bits from the X encoded bit sequences, and the second part of the first bit sequence includes check bits from the X encoded bit sequences. The first part precedes the second part.

18. The method according to claim 15 or 16, wherein, The i+j·Q-th bit in the v-th bit sequence of the second bit sequence m The i-th bit is equal to the i-th E / Q-th bit in the v-th coded bit sequence. m +j bits, v equals 0 to X-1; Among them, Q m Let E be the modulation order, E be the number of bits in the plurality of second bit sequences, and i be less than or equal to Q. m A non-negative integer, j is less than or equal to E / Q. m . a non-negative integer.

19. The method according to claim 15, wherein, The i+j·Q-th bit sequence in the interleaved bit sequence m The i-th bit is equal to the i-th E / Q-th bit in the first bit sequence. m +j bits; Among them, Q m Let Q be the modulation order, E be the number of bits in the first bit sequence, and i be a number less than or equal to Q. m A non-negative integer, j is less than or equal to E / Q. m . a non-negative integer.

20. The method of claim 15, wherein, The interleaving process of the first bit sequence or the interleaving process of the plurality of second bit sequences includes: The first bit sequence or the plurality of second bit sequences are interleaved based on interleaving parameters, wherein the interleaving parameters include at least one of the following: modulation order, number of bits in the first bit sequence, and X.

21. The method according to claim 15, wherein, The interleaving process for the first bit sequence includes: The first bit sequence is written column-wise into a first matrix, the first matrix being E / Q. m Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the first bit sequence; Interleave at least one column of the first matrix to obtain the second matrix; Read all bits in the second matrix row by row; or... The interleaving process for the first bit sequence includes: The first bit sequence is written row-wise into a first matrix, the first matrix being Q. m E / Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the first bit sequence; Interleave at least one row of the first matrix to obtain the second matrix; Read all the bits in the second matrix column by column.

22. The method according to claim 15, wherein, The interleaving process for the plurality of second bit sequences includes: The plurality of second bit sequences are written row-wise into a third matrix, the third matrix being an E / Q matrix. m Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the plurality of second bit sequences; Interleave at least one column of the third matrix to obtain the fourth matrix; Read all bits in the fourth matrix row by row; or... The interleaving process for the plurality of second bit sequences includes: The plurality of second bit sequences are written column-wise into a third matrix, the third matrix being Q. m E / Q m A column matrix; Q m Where E is the modulation order, and E is the number of bits in the plurality of second bit sequences; Interleave at least one row of the third matrix to obtain the fourth matrix; Read all the bits in the fourth matrix column by column.

23. The method according to claim 21 or 22, wherein, The interleaving process includes cyclic shift interleaving; The number of shifts in the cyclic shift interleaving is determined by at least one of the following: the number of bits in the first bit sequence, the modulation order, the number of the X coded bit sequences, the number of information bits in the coded bit sequences, and the number of parity bits in the coded bit sequences.

24. The method according to claim 23, wherein, The shift amount is function(R / 2) i R equals E / Q m , i is a positive integer less than or equal to the modulation order, and function() is the floor function; Alternatively, the shift amount is function((R / Q) m R equals E / Q (1 / Q) × i). m i is a positive integer less than or equal to the modulation order, Q m Let be the modulation order, and function() be the floor function.

25. The method according to claim 1, wherein, The number of bits in at least one of the plurality of information bit sequences is equal to the maximum number of information bits in the spatially coupled LDPC encoding.

26. The method of claim 25, wherein, The maximum number of information bits is the product of the number of information columns in the spatially coupled LDPC encoding and the maximum boost value, wherein the number of information columns is equal to the difference between the number of columns and the number of rows in the parity check matrix of the spatially coupled LDPC encoding.

27. The method according to claim 1, wherein, The step of interleaving X coded bit sequences among the plurality of coded bit sequences to obtain an interleaved bit sequence includes: The plurality of coded bit sequences are divided into Y groups of coded bit sequences, and the interleaving process is performed on each group of coded bit sequences; wherein, at least one group of coded bit sequences contains X coded bit sequences, and Y is a positive integer.

28. The method according to claim 27, wherein, The Y-group coded bit sequences contain an equal number of coded bit sequences.

29. The method according to claim 27, wherein, The number of coded bit sequences contained in the Y group of coded bit sequences It includes the following two types: X and X+1.

30. The method according to claim 1, wherein, The maximum number of information bits in the spatially coupled LDPC encoding is equal to one of the following: 512, 768, 896, 1024, 1280, 1536, 1792, or 2048.

31. A data processing method, wherein, The method includes: Receive modulation symbol sequence; The modulation symbol sequence is demodulated to obtain a soft bit sequence; Deinterleaving is performed on all soft bits of the X encoded bit sequences in the soft bit sequence to obtain multiple encoded soft bit sequences, where X is an integer greater than 1; Multiple information bit sequences are obtained by spatially coupled LDPC decoding based on the multiple encoded soft bit sequences.

32. The method according to claim 31, wherein, X is determined by the coupling width of the spatially coupled LDPC encoding, wherein the coupling width is an integer greater than 0.

33. The method according to claim 31, wherein, X is equal to a positive integer multiple of the coupling width of the spatially coupled LDPC encoding.

34. The method according to claim 31, wherein, The maximum value of X is determined by the coupling width of the spatially coupled LDPC encoding.

35. The method according to claim 31, wherein, The index of the information bit in the X coded bit sequence mapped to the mapping bit sequence of the modulation symbol in the modulation symbol sequence is less than or equal to the index of the parity bit in the X coded bit sequence mapped to the mapping bit sequence of the modulation symbol in the modulation symbol sequence.

36. The method according to claim 31, wherein, At least one bit of the information bits of the m-th coded soft bit sequence in the X coded soft bit sequences is mapped to the 0th bit of the mapping bit sequence of a modulation symbol in the modulation symbol sequence, and at least one bit of the information bits of the n-th coded soft bit sequence in the X coded soft bit sequences is mapped to the 1st bit of the mapping bit sequence of the modulation symbol, where m and n are non-negative integers, and m is not equal to n.

37. The method according to claim 31, wherein, The X coded soft bit sequences are X consecutive coded soft bit sequences among the plurality of coded soft bit sequences.

38. The method according to claim 31, wherein, The maximum value of X is determined by at least one of the following: coding rate, transport block size, data rate, target delay, target bit error rate, target reliability, terminal type, basic graph matrix index, or modulation order.

39. The method according to claim 31, wherein, The number X of the encoded soft bit sequence is determined based on the modulation order.

40. The method according to claim 31, wherein, The mapped bit sequence of at least one modulation symbol in the modulation symbol sequence is composed of bits from different encoded soft bit sequences.

41. The method according to claim 31, wherein, The 0th bit of the mapped bit sequence of at least one modulation symbol in the modulation symbol sequence comes from the information bit of the 0th coded soft bit sequence in the plurality of coded soft bit sequences; and / or, The last bit of the mapped bit sequence of the at least one modulation symbol comes from the parity bit of the last encoded soft bit sequence among the plurality of encoded soft bit sequences.

42. A communication device, wherein, include: Memory and processor; Memory and processor are coupled; The memory is used to store instructions that can be executed by the processor; When the processor executes the instructions, it performs the method as described in any one of claims 1-41.

43. A computer-readable storage medium, wherein, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-41.

44. A computer program product, wherein, The computer program product includes computing technology program instructions that, when executed by a processor, implement the method as described in any one of claims 1-41.

Images