Spatial coupling LDPC coding method and device, and data processing method and device

Abstract

The invention provides a space coupling LDPC coding method and device, and a data processing method and device, and the coding method comprises the steps: obtaining a to-be-coded bit sequence, and enabling the to-be-coded bit sequence to comprise a plurality of to-be-coded bit subsequences; based on a basic matrix set, space coupling LDPC coding is carried out on the to-be-coded bit sequence, a coded bit sequence is obtained, and the coded bit sequence comprises a plurality of coded bit subsequences; wherein the non-first coded bit sub-sequence in the coded bit sequence is obtained by coding based on at least one correspondingly associated coded bit sub-sequence and one correspondingly associated to-be-coded bit sub-sequence, and the basic matrix set at least comprises two sub basic matrixes and is used for realizing coding of the to-be-coded bit sub-sequence. According to the invention, spatial coupling between different bit subsequences is realized based on the sub-basic matrix incidence relation, so that the error correction performance of the data packet can be improved, and the robustness and reliability of data communication are improved.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of wireless communication, and in particular, to a spatially coupled LDPC encoding method and device, and a data processing method and device. BACKGROUND

[0002] With the rapid development of big data, cloud computing, latency-sensitive network and other technologies, user equipment in wireless communication networks is experiencing explosive growth, which will carry a variety of applications and massive data, which puts higher requirements on data transmission rate, throughput, reliability, latency, etc. With the application development of wireless communication technology in virtual reality / augmented reality, intelligent transportation, intelligent industrial control, intelligent logistics and other related fields, the communication requirements for ultra-high data rate, ultra-low latency and ultra-high reliability are becoming more and more intense. In the future mobile communication air interface standard protocol, compared with the existing 5G mobile communication, the demand for peak rate will increase by one or more orders of magnitude.

[0003] In a wireless communication system, a transmitting end performs channel coding on data to be transmitted to obtain a coded bit subsequence, and then maps the coded bit subsequence into constellation modulation symbols and transmits the constellation modulation symbols to a receiving end. In a data transmission channel, due to the influence of factors such as multipath, noise, interference, etc., data transmission errors may occur.

[0004] In order to eliminate the distortion caused by data transmission, the transmitting end adds some redundant information to the data to be transmitted through channel coding, and the receiving end can recover the original data to be transmitted through the redundant information. Here, the receiving end needs to perform channel decoding on the received constellation modulation symbols to recover the data to be transmitted.

[0005] The currently commonly used channel coding methods include low density parity check (LDPC) coding, polarization coding, turbo coding, and convolutional coding, etc. Among them, LDPC coding is a forward error correction coding method. LDPC code can be defined by a sparse (or low density) parity check matrix, for example, a linear block code is defined based on a parity check matrix and a lifting value, and the coding method can improve the decoding performance through iterative decoding (such as belief propagation decoding).

[0006] However, since the check matrix used in the above LDPC coding method is very sparse, only low complexity decoding can be achieved. In the face of future ultra-high reliability demand scenarios, the size of the transmission block continues to increase, and the current 5G NR (New Radio of 5 thIn the protocol of the New Radio (NR) (5th Generation), if the transmission block exceeding the maximum code block length is segmented, and each code block is still encoded independently, the information transmission between code blocks will be limited, and the demand of future ultra-high reliability scenarios cannot be met. SUMMARY

[0007] The embodiments of the present disclosure at least provide a spatially coupled LDPC encoding method and device, a data processing method and device, which improve the error correction performance of data packets by using a spatially coupled encoding method, increase the robustness and reliability of data communication, and meet the requirement of higher peak rate.

[0008] In a first aspect, the embodiments of the present disclosure provide a spatially coupled LDPC encoding method applied to a first transmission node, and the method comprises:

[0009] obtaining a to-be-encoded bit sequence, wherein the to-be-encoded bit sequence comprises a plurality of to-be-encoded bit subsequences;

[0010] performing spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a base matrix set to obtain an encoded bit sequence, wherein the encoded bit sequence comprises a plurality of encoded bit subsequences;

[0011] wherein a non-first encoded bit subsequence in the encoded bit sequence is obtained by encoding at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, and the base matrix set comprises at least two sub-base matrices used for encoding the to-be-encoded bit subsequence.

[0012] In a possible implementation, the base matrix set comprises at least A sub-base matrices, and a minimum row weight of a sub-matrix formed by mb0 rows and nb0 columns in the upper left corner of the A sub-base matrices is greater than or equal to nb0-1, wherein mb0 is a positive integer, nb0 is an integer greater than 4, and A is a positive integer.

[0013] In a possible implementation, the base matrix set comprises at least A sub-base matrices, and a minimum column weight of a sub-matrix formed by mb0 rows and nb0 columns in the upper left corner of the A sub-base matrices is greater than mb0-1, wherein mb0 is an integer greater than or equal to 1, nb0 is an integer greater than 4, and A is a positive integer.

[0014] In a possible implementation, the base matrix set comprises at least A sub-base matrices, and a number of all non-1 elements in a sub-matrix formed by mb0 rows and nb0 columns in the upper left corner of the A sub-base matrices is greater than mb0*nb0-Δt, wherein mb0 is a positive integer, nb0 is an integer greater than 4, Δt is a positive integer less than 12, and A is a positive integer.

[0015] In a possible implementation, the A is less than or equal to a number of sub-base matrices in the base matrix set.

[0016] In a possible implementation, the nb0 is equal to kb+Ab, where the kb is a system column number of the spatially coupled LDPC encoding, the kb is an integer greater than 5, and the Ab is equal to 0, 1, 2, 3, 4, 5, or 6.

[0017] In a possible implementation, the kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36.

[0018] In a possible implementation, the mb0 is equal to 1, 2, 3, 4, 5, or 6.

[0019] In a possible implementation, the spatially coupled LDPC encoding the bit sequence to be encoded based on the base matrix set comprises:

[0020] For a non-first bit sub-sequence to be encoded, determining a sub-parity check matrix set corresponding to the bit sub-sequence to be encoded based on an associated sub-base matrix set corresponding to the bit sub-sequence to be encoded; and

[0021] Encoding the bit sub-sequence to be encoded based on the sub-parity check matrix set corresponding to the bit sub-sequence to be encoded, to obtain an encoded bit sub-sequence;

[0022] Combining the encoded bit sub-sequences determined for the respective bit sub-sequences to be encoded in a sequence, to obtain the encoded bit sequence.

[0023] In a possible implementation, the determining the sub-parity check matrix set corresponding to the bit sub-sequence to be encoded comprises:

[0024] Obtaining a lifting value Z matching the bit sub-sequence to be encoded;

[0025] Performing matrix extension on each sub-base matrix in the associated sub-base matrix set corresponding to the bit sub-sequence to be encoded based on the lifting value Z, to obtain the sub-parity check matrix set corresponding to the bit sub-sequence to be encoded.

[0026] In a possible implementation, the performing matrix extension on each sub-base matrix in the associated sub-base matrix set corresponding to the bit sub-sequence to be encoded based on the lifting value Z comprises:

[0027] for each sub-generator matrix in the associated sub-generator matrix group, replacing an element in the sub-generator matrix indicating a zero matrix with a zero matrix of Z*Z, and / or replacing an element in the sub-generator matrix indicating a cyclic shift of an identity matrix with a cyclic shift matrix of the identity matrix of Z*Z;

[0028] determining a sub-parity check matrix of each sub-generator matrix in the associated sub-generator matrix group based on the zero matrix and / or the cyclic shift matrix after the replacement;

[0029] determining a sub-parity check matrix group corresponding to the sub-bit sequence to be encoded based on the sub-parity check matrix of each sub-generator matrix in the associated sub-generator matrix group.

[0030] In a possible implementation, the lifting value Z is p*2 q where p belongs to an element in a set {2, 3, 5, 7, 9, 11, 13, 15}, and q belongs to an element in a set {0, 1, 2, 3, 4, 5, 6, 7, 8}.

[0031] In a possible implementation, the encoding of the sub-bit sequence to be encoded based on the sub-parity check matrix group corresponding to the sub-bit sequence to be encoded comprises:

[0032] for a non-first sub-bit sequence to be encoded, determining a coded bit sequence obtained by encoding the sub-bit sequence to be encoded based on the sub-parity check matrix group corresponding to the sub-bit sequence to be encoded and at least one coded bit sequence obtained by encoding a sub-bit sequence before the sub-bit sequence to be encoded.

[0033] In a possible implementation, the coded bit sequence is obtained by calculation as follows:

[0034]

[0035] where M represents the number of sub-generator matrices in the generator matrix set, H x is used to represent a system column matrix in the sub-parity check matrix corresponding to the 0th sub-generator matrix, and are respectively used to represent a system column matrix and a check column matrix in the sub-parity check matrix corresponding to the 0th sub-generator matrix t is the tth sub-bit sequence to be encoded, b t is the tth coded bit sequence.

[0036] In a possible implementation, the i th sub-generator matrix in the generator matrix set comprises a system column matrix Hb sWhen each of the s rows indicates a non-1 element, a ratio of a number of elements indicating non-1 in other mb-s rows included in the system matrix to (mb-s)×kb is denoted as T i , T i satisfies the following relationship:

[0037] The ratio T0 of the 0th sub-matrix is greater than the ratios T1, T2,..., TM-1 of the 1st to M-1th sub-matrices, any one of which satisfies the following relationship: M-1 The 0th sub-matrix is a relevant sub-matrix corresponding to a first to-be-encoded bit sub-sequence;

[0038] Wherein, s is an integer greater than 0 and less than or equal to mb, and M is an integer less than or equal to the number of sub-matrices in the set of base matrices.

[0039] In a possible implementation, the method further includes:

[0040] Sending the entire or partial encoded bit sequence to a second transmission node.

[0041] In a second aspect, the disclosure also provides a data processing method applied to a second transmission node, the method including:

[0042] Receiving a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence including a plurality of encoded bit sub-sequences;

[0043] Performing spatially coupled LDPC decoding on the to-be-decoded data sequence based on a set of base matrices to obtain a decoded bit sequence, the decoded bit sequence being consistent with a to-be-encoded bit sequence, the decoded bit sequence including a plurality of decoded bit sub-sequences;

[0044] Wherein, a non-first encoded bit sub-sequence in the encoded bit sequence is obtained based on encoding of at least one corresponding associated encoded bit sub-sequence and one corresponding associated to-be-encoded bit sub-sequence, and the set of base matrices includes at least two sub-matrices for realizing encoding for the to-be-encoded bit sub-sequence.

[0045] In a third aspect, the disclosure also provides a spatially coupled LDPC encoding device applied to a first transmission node, the device including:

[0046] An obtaining module for obtaining a to-be-encoded bit sequence, the to-be-encoded bit sequence including a plurality of to-be-encoded bit sub-sequences;

[0047] An encoding module for performing spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a set of base matrices to obtain an encoded bit sequence, the encoded bit sequence including a plurality of encoded bit sub-sequences.

[0048] wherein the non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding the at least one corresponding associated encoded bit subsequence and the one corresponding associated to-be-encoded bit subsequence, and the base matrix set includes at least two sub-base matrices, and is used to implement encoding for the to-be-encoded bit subsequence.

[0049] In a fourth aspect, the present disclosure further provides a data processing apparatus applied to a second transmission node, the apparatus comprising:

[0050] a receiving module configured to receive a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence including a plurality of encoded bit subsequences;

[0051] a processing module configured to perform spatially coupled LDPC decoding on the to-be-decoded data sequence based on a base matrix set to obtain a decoded bit sequence, the decoded bit sequence being consistent with a to-be-encoded bit sequence, and the decoded bit sequence including a plurality of encoded bit subsequences;

[0052] wherein the non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding the at least one corresponding associated encoded bit subsequence and the one corresponding associated to-be-encoded bit subsequence, and the base matrix set includes at least two sub-base matrices, and is used to implement encoding for the to-be-encoded bit subsequence.

[0053] In a fifth aspect, the present disclosure further provides an electronic device, comprising a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory being in communication through the bus when the electronic device is running, and the machine readable instructions being executed by the processor to perform the spatially coupled LDPC encoding method according to any one of the first aspect and various embodiments thereof or to perform the data processing method according to the second aspect.

[0054] In a sixth aspect, the present disclosure further provides a computer readable storage medium, the computer readable storage medium storing a computer program, the computer program being executed by a processor to perform the spatially coupled LDPC encoding method according to any one of the first aspect and various embodiments thereof or to perform the data processing method according to the second aspect.

[0055] With the space-coupled LDPC encoding method and device, the data processing method and device, in the case of obtaining a to-be-encoded bit sequence, the to-be-encoded bit sequence can be space-coupled LDPC encoded based on a base matrix set, to obtain an encoded bit sequence. The non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding the corresponding associated at least one encoded bit subsequence and the corresponding associated one to-be-encoded bit subsequence. That is, the different bit subsequences are space-coupled based on the sub-base matrix association relationship, avoiding the poor communication reliability problem existing in the existing independent encoding mode, and improving the error correction performance of the data packet and increasing the robustness and reliability of the data communication.

[0056] Other advantages of the present disclosure will be described in more detail in conjunction with the following description and drawings.

[0057] It should be understood that the above description is only a summary of the technical solutions of the present disclosure, so as to enable a general understanding of the technical means of the present disclosure, and then implement the content of the specification. In order to make the above and other purposes, features and advantages of the present disclosure more obvious and easy to understand, the following will illustrate the specific embodiments of the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0058] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings needed in the embodiments will be briefly introduced. The drawings incorporated into the specification and form part of the specification, which show the embodiments consistent with the present disclosure, and together with the specification, are used to illustrate the technical solutions of the present disclosure. It should be understood that the drawings only show some embodiments of the present disclosure, and therefore should not be regarded as limiting the scope of protection, and for those skilled in the art, other related drawings can also be obtained without creative labor. Moreover, the same reference numerals are used to represent the same components throughout the drawings. In the drawings:

[0059] Figure 1 A scene schematic diagram of a space-coupled LDPC encoding method provided by an embodiment of the present disclosure is shown;

[0060] Figure 2 A structure schematic diagram of a first transmission node in an application scenario of a space-coupled LDPC encoding method provided by an embodiment of the present disclosure is shown;

[0061] Figure 3 A flowchart of a space-coupled LDPC encoding method provided by an embodiment of the present disclosure is shown;

[0062] Figure 4FIGS. 1(a)-1(d) show a diagram of a coupling principle of a spatially coupled LDPC code in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0063] Figure 5 FIGS. 5(a)-5(b) show a diagram of a sub-base matrix of the embodiment one example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0064] Figure 6 FIGS. 6(a)-6(c) show a diagram of a sub-base matrix of the embodiment two example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0065] Figure 7 FIGS. 7(a)-7(b) show a diagram of a sub-base matrix of the embodiment three example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0066] Figure 8 FIGS. 8(a)-8(c) show a diagram of a sub-base matrix of the embodiment four example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0067] Figure 9 FIGS. 9(a)-9(b) show a diagram of a sub-base matrix of the embodiment five example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0068] Figure 10 FIGS. 10(a)-10(c) show a diagram of a sub-base matrix of the embodiment six example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0069] Figure 11 FIGS. 11(a)-11(b) show a diagram of a sub-base matrix of the embodiment seven example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0070] Figure 12 FIGS. 12(a)-12(c) show a diagram of a sub-base matrix of the embodiment eight example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0071] Figure 13 FIGS. 13(a)-13(c) show a diagram of a sub-base matrix of the embodiment nine example in the spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0072] Figure 14FIGS. 14(a)-14(c) show a schematic diagram of a sub-matrix related to an example of embodiment ten in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0073] Figure 15 FIGS. 15(a)-15(c) show a schematic diagram of a sub-matrix related to an example of embodiment eleven in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0074] Figure 16 FIG. 16 shows a schematic diagram of a check column matrix with a Raptor-like structure related to an example of embodiment twelve in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0075] Figure 17 FIG. 17 shows a schematic diagram of a check column matrix with an identity matrix structure related to an example of embodiment twelve in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0076] Figure 18 FIG. 18 shows a schematic diagram of a check column matrix with a lower triangular structure related to an example of embodiment twelve in a spatially coupled LDPC encoding method according to an embodiment of the present disclosure;

[0077] Figure 19 FIG. 19 shows a flowchart of a data processing method according to an embodiment of the present disclosure;

[0078] Figure 20 FIG. 20 shows a schematic diagram of a spatially coupled LDPC encoding apparatus according to an embodiment of the present disclosure;

[0079] Figure 21 FIG. 21 shows a schematic diagram of a data processing apparatus according to an embodiment of the present disclosure;

[0080] Figure 22 FIG. 22 shows a schematic diagram of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0081] Exemplary embodiments of the present disclosure will be described more fully hereinafter with reference to the accompanying drawings. While example embodiments of the present disclosure are shown in the drawings, it is understood that the present disclosure can be embodied in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the present disclosure to those skilled in the art.

[0082] In the description of the embodiments of the present disclosure, it should be understood that terms such as "including" or "having" are intended to indicate that there exists one or more features, numbers, steps, actions, components, parts or combinations thereof in the specification, and do not exclude the presence or possibility of one or more other features, numbers, steps, actions, components, parts or combinations thereof.

[0083] Unless otherwise specified, " / " means or, for example, A / B can mean A or B; "and / or" in this document only describes the association relationship of the associated objects, and means that there can be three relationships, for example, A and / or B can mean that A exists alone, A and B exist together, and B exists alone.

[0084] The terms "first", "second" and the like are only used to distinguish the same or similar technical features, and cannot be understood as indicating or implying relative importance or quantity of the technical features. Therefore, the features defined by "first", "second" and the like can explicitly or implicitly include one or more such features. In the description of the embodiments of the present disclosure, unless otherwise specified, the meaning of the term "multiple" is two or more than two.

[0085] It is found through research that the traditional LDPC code can be defined by a sparse (or low density) parity check matrix, for example, a linear block code is defined based on a base matrix and a lifting value, and the decoding performance can be improved by iterative decoding (such as belief propagation decoding) of the coding mode.

[0086] However, since the check matrix used in the above LDPC coding mode is very sparse, only low complexity decoding can be achieved. In the face of future ultra-high reliability demand scenarios, the size of the transport block continues to increase, and in the current 5G NR protocol, the transport block exceeding the maximum code block length is segmented for processing, and if each code block is still independently coded, this will limit the information transmission between code blocks and code blocks, and cannot meet the needs of future ultra-high reliability scenarios.

[0087] In order to at least partially solve one or more of the above problems and other potential problems, the present disclosure provides at least one spatially coupled LDPC coding scheme, which can couple multiple code blocks to further improve the reliability of data transmission.

[0088] In addition, the spatially coupled LDPC code constructed by the present disclosure makes the base matrix have different sparse and dense characteristics in different rows. The spatially coupled LDPC code with this structure has higher error correction performance of data packets than the traditional LDPC code, increases the robustness of data communication, and can meet the requirement of higher peak rate.

[0089] To facilitate the understanding of the present embodiment, first, the application scenario of the spatially coupled LDPC encoding method disclosed in the present embodiment is introduced in detail. The spatially coupled LDPC encoding method provided by the present embodiment can be applied to any related scenario requiring wireless data transmission, for example, it can be data transmission between a first transmission node and a second transmission node (as shown in Figure 1 During the data transmission process, due to the influence of factors such as multipath, noise, interference, etc., the LDPC code can be used as a channel encoding method to eliminate the distortion caused in the transmission process.

[0090] As shown in the data transmission schematic diagram between the first transmission node and the second transmission node Figure 1 The first transmission node 110 and the second transmission node 120 can perform wireless signal sending, receiving and related interaction, etc.

[0091] In one example, the first transmission node 110 and the second transmission node 120 include but are not limited to the following devices: base station (Base Station, BS), access point (Access Point, AP), node B (node B), g node B (generalized node B, g node B), radio network controller (Radio Network Controller, RNC), evolved node B (Evolved Node B, eNB), base station controller (Base Station Controller, BSC), base transceiver station (Base Transceiver Station, BTS), transceiver function (Transceiver Function, TF), radio router, radio transceiver, basic service set (Basic Service Set, BSS), extended service set (Extended Service Set, ESS) or radio base station (Radio Base Station, RBS).

[0092] The first transmission node 110 and the second transmission node 120 can also be an access terminal, a user equipment (User Equipment, UE), a user unit, a user station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent or a user device, etc. without specific limitation here.

[0093] In the embodiments of the present disclosure, encoding based on the spatially coupled LDPC code can be performed at the first transmission node 110, and then the encoded bit sequence is transmitted to the second transmission node 120 through a wireless transmission protocol. In actual applications, in order to facilitate data transmission, the first transmission node 110 here can include an encoding processing module 111 and / or a transmitter 112, as shown in Figure 2 The encoding processing module 111 here can perform encoding processing on the input to-be-encoded bit sequence to obtain an encoded bit sequence, and the transmitter 112 can transmit the data (such as an encoded bit sub-sequence) obtained after encoding processing in a sequential order. The transmitter 112 can include a single antenna or can include multiple antennas.

[0094] In combination with the related introduction of the above application scenarios, the spatially coupled LDPC encoding method disclosed in the embodiments of the present disclosure will be described in detail. The execution subject of the spatially coupled LDPC encoding method provided by the embodiments of the present disclosure is generally an electronic device with certain computing capability, which can include, for example, a terminal device or a server or other processing device. The terminal device can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a 5G network or a future 5G or above network, and the like. The other processing device can be, for example, the first transmission node described above. In some possible implementation manners, the spatially coupled LDPC encoding method can be implemented by a processor invoking computer-readable instructions stored in a memory.

[0095] It can be seen that the execution subject of the spatially coupled LDPC encoding method provided by the embodiments of the present disclosure can be, but is not limited to, the first transmission node in the scenario schematic diagram as shown in Figure 1 The execution subject of the spatially coupled LDPC encoding method provided by the embodiments of the present disclosure can be, but is not limited to, the first transmission node in the scenario schematic diagram as shown in

[0096] Referring to Figure 3 , a flowchart of the spatially coupled LDPC encoding method provided by the embodiments of the present disclosure is shown, and the method includes the following steps S110-S120:

[0097] S110: obtain a to-be-encoded bit sequence, the to-be-encoded bit sequence comprising a plurality of to-be-encoded bit subsequences;

[0098] S120: perform spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a base matrix set to obtain an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit subsequences; wherein a non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding of at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, and the base matrix set comprises at least two sub-base matrices and is used to implement encoding on the to-be-encoded bit subsequence.

[0099] The spatially coupled LDPC code provided in the embodiments of the present disclosure enables the encoding of the to-be-encoded bit sequence without separately splitting each to-be-encoded bit subsequence, but rather based on the sub-base matrix to perform encoding with association, in other words, the code blocks have certain association between the code blocks, not only having excellent decoding error correction performance but also being able to meet the demand characteristics of high-speed encoding and decoding of block LDPC code. This is mainly because the spatially coupled LDPC encoding method provided in the embodiments of the present disclosure is a channel coding derived from LDPC convolutional code, and combines the respective advantages of LDPC code and convolutional code. The spatial coupling characteristic causes the spatially coupled LDPC (SC-LDPC) code to have a "threshold saturation" phenomenon, which enables the SC-LDPC code to theoretically more closely approach the Shannon capacity limit performance.

[0100] The spatially coupled LDPC encoding method provided in the embodiments of the present disclosure, in the process of encoding each to-be-encoded bit subsequence of the to-be-encoded bit sequence, encodes the first to-be-encoded bit subsequence based on the corresponding sub-base matrix, and for other to-be-encoded bit subsequences, determines the corresponding associated sub-base matrix set and then performs encoding based on the associated sub-base matrix set, that is, the non-first encoded bit subsequence is obtained based on encoding of at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence. Since the associated sub-base matrix set here can cover the forward encoding information, the encoded bit subsequence can highlight or express the information of the code block to which the forward to-be-encoded bit subsequence belongs. Thus, a more robust and reliable encoded bit sequence is obtained.

[0101] In the determination of the associated sub-basic matrix group corresponding to the to-be-encoded bit sub-sequence, in addition to the sub-basic matrix corresponding to the to-be-encoded bit sub-sequence, all the sub-basic matrices before the sub-basic matrix can also be referenced, for example, for the second to-be-encoded bit sub-sequence, the associated sub-basic matrix group corresponding to the second to-be-encoded bit sub-sequence can be determined based on the second sub-basic matrix corresponding to the to-be-encoded bit sub-sequence, and the first sub-basic matrix (corresponding to the first encoded bit sub-sequence) and the zeroth sub-basic matrix (corresponding to the zeroth encoded bit sub-sequence).

[0102] Based on the feature of row weight, the base matrix set (i.e., a plurality of sub-basic matrices with a sequence) of the spatially coupled LDPC code in the embodiment of the present disclosure includes at least A sub-basic matrices, and the minimum row weight in the sub-matrix composed of the upper left corner mb0 row and nb0 column of the A sub-basic matrices is greater than or equal to nb0-1, where mb0 is a positive integer, nb0 is an integer greater than 4, and A is a positive integer. Based on this, more dense data coding can be realized to ensure that more data information can be encoded together, thereby improving the data transmission rate while ensuring the reliability of data transmission.

[0103] Based on the feature of column weight, the base matrix set (i.e., a plurality of sub-basic matrices with a sequence) of the spatially coupled LDPC code in the embodiment of the present disclosure includes at least A sub-basic matrices, and the minimum column weight in the sub-matrix composed of the upper left corner mb0 row and nb0 column of the A sub-basic matrices is greater than mb0-1, where mb0 is an integer greater than or equal to 1, nb0 is an integer greater than 4, and A is a positive integer. Based on this, more dense data coding can be realized to ensure that more data information can be encoded together, thereby improving the data transmission rate while ensuring the reliability of data transmission.

[0104] The base matrix set (i.e., a plurality of sub-basic matrices with a sequence) of the spatially coupled LDPC code in the embodiment of the present disclosure includes at least A sub-basic matrices, and the number of all non-1 elements in the sub-matrix composed of the upper left corner mb0 row and nb0 column of the A sub-basic matrices is greater than mb0*nb0-Δt, where mb0 is a positive integer, nb0 is an integer greater than 4, Δt is a positive integer less than 12, and A is a positive integer. Based on this, more dense data coding can be realized to ensure that more data information can be encoded together, thereby improving the data transmission rate while ensuring the reliability of data transmission.

[0105] Wherein, the above A is less than or equal to the number of sub-basic matrices in the base matrix set.

[0106] wherein the nb0 columns at the top left corner of the A sub- base matrices are characterized in that nb0 is equal to kb+Db, wherein kb is the number of systematic columns of the spatially coupled LDPC code, kb is an integer greater than 5, and Db is equal to 0, 1, 2, 3, 4, 5, or 6.

[0107] wherein the kb is characterized in that kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36.

[0108] wherein the mb0 rows at the top left corner of the A sub- base matrices are characterized in that mb0 is equal to 1, 2, 3, 4, 5, or 6.

[0109] The sub-base matrices of the spatially coupled LDPC code constructed by the embodiments of the present disclosure include a systematic column matrix and a check column matrix. In one specific example, the sub-base matrix has the following structure: [Hb s ,Hb p ], wherein Hb s is referred to as the systematic column matrix, and Hb p is referred to as the check column matrix. The number of rows of the systematic column matrix Hb s is equal to the number of rows of the check column matrix Hb p , and both are equal to mb; the number of columns of the systematic column matrix Hb s is equal to kb, and the number of columns of the check column matrix Hb p is equal to mb. The number of columns of the sub-base matrix is nb, which satisfies the following relationship: kb=nb–mb, that is, the number of columns of the systematic column matrix of the sub-base matrix is equal to the difference between the number of columns and the number of rows of the sub-base matrix. Wherein kb, nb and mb are all integers greater than 0.

[0110] In the embodiments of the present disclosure, the spatially coupled LDPC encoding of the to-be-encoded bit sequence can be performed based on a set of base matrices according to the following steps:

[0111] Step one, for a non-first to-be-encoded bit sub-sequence, determining a sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence based on the associated sub-base matrix group corresponding to the to-be-encoded bit sub-sequence; and encoding the to-be-encoded bit sub-sequence based on the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence to obtain an encoded bit sub-sequence;

[0112] Step two, combining the encoded bit sub-sequences determined by the respective to-be-encoded bit sub-sequences in the order to obtain an encoded bit sequence.

[0113] Here, firstly, the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence can be determined based on the associated sub-basic matrix group corresponding to the to-be-encoded bit sub-sequence, then data encoding for the to-be-encoded bit sub-sequence is performed based on the sub-parity check matrix group, and finally the encoded bit sub-sequences determined by the respective to-be-encoded bit sub-sequences are combined in the order to obtain the encoded bit sequence.

[0114] Similarly, the sub-parity check matrix group also has multiple sub-parity check matrix groups, and each sub-parity check matrix group can correspond to a sub-basic matrix.

[0115] Here, the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence can be determined according to the following steps:

[0116] Step one, obtain the promotion value Z matching the to-be-encoded bit sub-sequence;

[0117] Step two, based on the promotion value Z, perform matrix expansion on each sub-basic matrix in the associated sub-basic matrix group corresponding to the to-be-encoded bit sub-sequence to obtain the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence.

[0118] The promotion value Z here is the dimension of the standard permutation matrix, which can realize the expansion of the sub-basic matrix, for example, replacing the element indicating the all-zero matrix in the sub-basic matrix with the all-zero matrix of Z*Z, and for example, replacing the element indicating the cyclic shift of the unit matrix in the sub-basic matrix with the cyclic shift matrix of the unit matrix of Z*Z. After the replacement is completed, the sub-parity check matrix of each sub-basic matrix can be obtained, and the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence is determined.

[0119] The promotion value in the embodiment of the present disclosure is an integer greater than 0, for example, can be equal to an integer power of 2 times.

[0120] In one example, the promotion value can be equal to 8, 16, 32, 64, 128, 256, or 512; in another example, the promotion value can be equal to 3, 6, 12, 24, 48, 96, 192, or 384; in yet another example, the promotion value is equal to p*2 q , and less than or equal to 512, p is equal to an element in the set {2, 3, 5, 7, 9, 11, 13, 15}, and q is equal to an element in the set {0, 1, 2, 3, 4, 5, 6, 7, 8}.

[0121] Here, in order to facilitate understanding of the process of realizing matrix expansion based on the promotion value, the specific form of the check matrix will be illustrated first.

[0122] In a specific example, the parity-check matrix H of the LDPC code is an mb×z row and nb×z column matrix, composed of mb×nb submatrices. Each submatrix is ​​either a different power of a z×z standard permutation matrix (corresponding to a cyclic shift matrix of the identity matrix) or a z×z all-zero square matrix. The parity-check matrix H has the following form:

[0123]

[0124] if have That is, a z×z all-zero square matrix; if If it is an integer greater than or equal to 0, the corresponding submatrix is ​​the standard permutation matrix P. The standard permutation matrix P of z×z, which is the z-th power (i.e., the cyclic shift of the identity matrix), is shown below (the standard permutation matrix is ​​formed by cyclically shifting the identity matrix one bit to the right):

[0125]

[0126] so, This allows each submatrix to be uniquely identified. If a submatrix is ​​a square matrix consisting entirely of zeros, the corresponding... Using -1 (or null values), if a submatrix is ​​obtained by cyclic shift 's' of the identity matrix, then... Equals s, therefore all They can form a fundamental matrix. This fundamental matrix includes two types of elements: elements indicating an all-zero square matrix and elements indicating a cyclic shift of the identity matrix.

[0127] The lift value Z is the dimension of the standard permutation matrix (submatrix). The base matrix of the LDPC code can be obtained by replacing the elements indicating cyclic shifts of the identity matrix in the base matrix with "1" and replacing all elements indicating all-zero square matrices with "0". Therefore, the base matrix of an LDPC code contains only two types of elements: "0" and "1". "0" indicates an element at that index position that is an all-zero square matrix, and "1" indicates an element at that index position that is a cyclic shift of the identity matrix.

[0128] For ease of description, only the elements of the fundamental matrix that indicate the cyclic shift of the identity matrix and their row and column indices can be described, while the remaining row and column indices are assumed to be 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.

[0129] In one example, the fundamental matrix of an LDPC code (2 rows and 4 columns) is as follows, with a boost value of 4:

[0130]

[0131] In this example, the check matrix H is:

[0132]

[0133] The corresponding base matrix is as follows:

[0134]

[0135] In combination with the specific forms of the check matrix, the process of determining the sub-pairing check matrix of the sub-base matrix in the embodiments of the present disclosure will be explained in detail.

[0136] Before specifically describing the process of determining the sub-pairing check matrix, first, the coupling principle of the spatially coupled LDPC code provided by the embodiments of the present disclosure is described based on the protograph coupling, Figure 4 (a)-(d) are the process of obtaining the spatially coupled LDPC protograph from the protograph, wherein the black dot represents the variable node, the plus square is the check node, and the solid line connecting the variable node and the check node is called the edge.

[0137] Figure 4 (a) shows the protograph of the LDPC code; Figure 4 (b) shows that the LDPC code protograph is copied multiple times for coupling, and the indexes of the protographs after copying are represented by t, t+1, t+2, etc. The number of copies can be referred to as the coupling chain length. Figure 4 (c) shows that part of the edge in each protograph is decoupled and reconnected to the subsequent LDPC protograph, and the farthest distance of the connection is limited by the constraint length, which can be referred to as the coupling width. Figure 4 (d) is the protograph of the spatially coupled LDPC after the protograph coupling.

[0138] In the embodiments of the present disclosure, the coupling check matrix of one spatially coupled LDPC code can be composed of multiple sub-pairing check matrices, which can be specifically represented by the following formula.

[0139]

[0140] Wherein, L is the coupling chain length, m s is the coupling width (or coupling depth).

[0141] In one specific embodiment, the tthto-be-encoded bit sequence in the spatially coupled LDPC encoding sequence corresponds to the sub-matrix group in the entire coupling check matrix H SC The sub-matrix group not equal to 0 in the tthto-be-encoded bit sequence is The sub-matrix group contains the sub-pairing check matrices of each sub-base matrix, which are respectively composed of multiple sub-base matrices and lifting value Z, wherein the i-th sub-matrix is determined by the i-th sub-base matrix and lifting value Z, that is, replacing the element indicating the all-zero matrix in the i-th sub-base matrix with a Z-by-Z all-zero matrix and replacing the element indicating the cyclic shift of the identity matrix with a matrix obtained by cyclically shifting a Z-by-Z identity matrix to obtain the i-th sub-matrix wherein i = 0, 1, …, m s , t = 0, 1, …, L-1.

[0142] It can be known that the spatially coupled LDPC code in the embodiment of the present disclosure can be determined by a plurality of sub-base matrices and a lifting value Z, wherein the plurality of sub-base matrices constitute a base matrix of the spatially coupled LDPC code, and are represented as follows:

[0143]

[0144] wherein the element in the base matrix Hb SC includes at least an element indicating an all-zero matrix and an element indicating a cyclic shift of an identity matrix. Generally, the element indicating the all-zero matrix can be represented by -1 or null or a null value or other values, and the element indicating the cyclic shift of the identity matrix is a non-negative integer less than Z, which is used to indicate the size of the cyclic shift. The base matrix Hb SC includes a plurality of sub-matrices (such as ) whose elements are not all elements indicating all-zero matrices. In addition to these , the remaining elements are elements indicating all-zero matrices, wherein i = 0, 1, …, m s , t = 0, 1, …, L-1. Wherein, has a size of mb rows and nb columns, and mb and nb are positive integers. As shown above, the number of rows of the base matrix of the spatially coupled LDPC code is (L+m s )*mb, and the number of columns is L*nb.

[0145] It should be noted that, in order to facilitate subsequent decoding, the spatially coupled LDPC code herein can include at least one tailing base matrix in addition to the plurality of sub-base matrices having a sequence. If the i-th tailing base matrix is Tb i , i is an integer greater than or equal to 0 and less than or equal to M-2, and the size of the tailing base matrix Tb i is mb*mb, then the base matrix of the spatially coupled LDPC code is as follows:

[0146]

[0147] In a specific example, the tailing matrix Tbi may include, but not limited to: unit matrix, Raptor-like structure, lower triangular structure.

[0148] Based on the above description of the basis matrix of the spatially coupled LDPC code, it can be determined that for a to-be-encoded bit sequence, a spatially coupled LDPC code corresponding to the to-be-encoded bit sequence can be determined, and the spatially coupled LDPC code can be obtained by matrix expansion based on the plurality of sub-basis matrices with the sequence.

[0149] In the process of specifically implementing data encoding, since the association encoding is adopted in the embodiment of the present disclosure, when encoding the to-be-encoded bit subsequence, the to-be-encoded bit subsequence is encoded based on the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence.

[0150] Specifically, based on the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence and at least one encoded bit subsequence that has been completed encoding before the to-be-encoded bit subsequence, the encoded bit subsequence obtained by encoding the to-be-encoded bit subsequence is determined.

[0151] It can be known that in the process of encoding the current to-be-encoded bit subsequence, the embodiment of the present disclosure not only refers to the sub-parity check matrix group corresponding to the current to-be-encoded bit subsequence, but also combines the encoded bit subsequence that has been completed encoding, thereby realizing sequential encoding, and in the process of encoding the current subsequence, the encoded bit subsequence that has been calculated is combined, which not only ensures that the calculation amount will not be increased, but also improves the reliability of the encoding.

[0152] In the embodiment of the present disclosure, the encoded bit subsequence can be obtained by calculation as follows:

[0153]

[0154] Wherein, M represents the number of sub-basis matrices in the basis matrix set, H x is used to represent the systematic column matrix and the check column matrix in the sub-parity check matrix corresponding to the 0th sub-basis matrix, a and are used to represent the systematic column matrix and the check column matrix in the sub-parity check matrix corresponding to the 0th sub-basis matrix, respectively, a t is the tth to-be-encoded bit subsequence, b t is the tth encoded bit subsequence.

[0155] In order to facilitate understanding of the above encoding process, a specific example can be combined to be specifically explained.

[0156] The input to-be-encoded bit sequence can be described by L to-be-encoded bit subsequences, denoted as a={a0,a1,...,aL-1} The length of each to-be-encoded bit subsequence is k bits, and the elements in each to-be-encoded bit subsequence include but are not limited to elements in a Galois field GF(2), and the total length of the to-be-encoded bit sequence is equal to k*L, and the output L encoded bit subsequences are denoted as b={b0, b1,..., b L-1} The length of each encoded bit subsequence is n bits.

[0157] In the actual encoding process, the to-be-encoded bit sequence can be encoded by using a plurality of sub-base matrices (such as M sub-base matrices) included in the spatially coupled LDPC code, and M is an integer greater than 1.

[0158] For the tthto-be-encoded bit subsequence a t , the tthencoded bit subsequence b t is obtained by encoding the tthto-be-encoded bit subsequence a t according to the M sub-base matrices and the lifting value Z.

[0159] Here, the tthencoded bit subsequence b t is obtained by encoding according to the following process:

[0160] According to the M sub-base matrices (Hb0, Hb1,..., Hb M-1 ) and the lifting value Z, the M sub-parity check matrices H0, H1,..., H M-1 are determined, that is, the elements in the sub-base matrix indicating the all-zero matrix are replaced by the all-zero matrix of Z*Z, and the elements in the sub-base matrix indicating the cyclic shift of the unit matrix are replaced by the cyclic shift matrix of the unit matrix of Z*Z.

[0161] When t is equal to 0, the 0thencoded bit subsequence is obtained by encoding the 0thto-be-encoded bit subsequence based on the 0thsub-base matrix Hb0 of the M sub-base matrices and the lifting value Z. It can be understood that the 0thencoded bit subsequence can be calculated by the 0thsub-parity check matrix H0 determined by the 0thsub-base matrix Hb0 and the lifting value Z.

[0162]

[0163] Therefore, the 0thencoded bit subsequence can be expressed as

[0164] When t is equal to 1, the 1stencoded bit subsequence is obtained by encoding the 1stto-be-encoded bit subsequence based on the 0thsub-base matrix Hb0, the 1stsub-base matrix Hb1 and the lifting value Z of the M sub-base matrices. It can be understood that the 1stencoded bit subsequence can be calculated as follows:

[0165]

[0166] Thus, the first coded bit subsequence can be represented as

[0167] When t is less than M, the t sub-base matrices Hb0,..., Hbt-1in the M sub-base matrices are used to encode the first t uncoded bit subsequences to obtain the first t coded bit subsequences. t-1 The first t coded bit subsequences can be calculated as follows:

[0168]

[0169] Thus, the first coded bit subsequence can be represented as

[0170] When t is greater than or equal to M, the M sub-base matrices Hb0,..., Hbt-1in the M sub-base matrices are used to encode the first t uncoded bit subsequences to obtain the first t coded bit subsequences. M-1 The first t coded bit subsequences can be calculated as follows:

[0171]

[0172] Thus, the first coded bit subsequence can be represented as

[0173] Here, in order to achieve the transmission requirement of meeting a higher peak rate, the i-th sub-base matrix in the base matrix set (i.e., the plurality of sub-base matrices with a sequence order) of the spatially coupled LDPC code in the embodiment of the present disclosure includes a system column matrix Hbi s When there are s rows each of which indicates a non-1 element, a ratio of a number of non-1 elements in other mb-s rows included in the system column matrix to (mb-s) x kb is denoted as T i , T i satisfies the following relationship:

[0174] The ratio T0of the 0-th sub-base matrix is greater than the ratios T1, T2,..., TM-1of the 1st sub-base matrix to the M-1th sub-base matrix. M-1 Any one of the ratios; the 0-th sub-base matrix is the associated sub-base matrix corresponding to the first uncoded bit subsequence.

[0175] Wherein, s is an integer greater than 0 and less than or equal to mb, and M is an integer less than or equal to the number of sub-base matrices in the base matrix set.

[0176] To further understand the space-coupled LDPC encoding method provided by the embodiments of the present disclosure, the following will be described through several specific embodiments.

[0177] In a specific embodiment, the base matrix set includes at least A sub-base matrices, and the minimum row weight of the sub-matrix composed of the upper left corner mb0 rows and nb0 columns in the A sub-base matrices is greater than or equal to nb0-1, where mb0 is a positive integer, nb0 is an integer greater than 4, and A is a positive integer. Wherein, nb0 is equal to kb+Δb, kb is the system column number of the space-coupled LDPC encoding, kb is an integer greater than 5, Δb is equal to 0, 1, 2, 3, 4, 5, or 6, kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36, and mb0 is equal to 1, 2, 3, 4, 5, or 6.

[0178] Embodiment one

[0179] In the embodiments of the present disclosure, the base matrix set of the space-coupled LDPC code includes two sub-base matrices: sub-base matrix 0 and sub-base matrix 1, and the size of each sub-base matrix is mb=6 rows and nb=22 columns. The difference between the number of columns and the number of rows of the sub-base matrix is nb-mb=16, which is equal to the system column number kb=16 in each sub-base matrix, and satisfies greater than 6. The coupling width M-1=1, and the lifting value Z=32. An example of the 0thsub-base matrix is shown in FIG. 8(a), and an example of the 1stsub-base matrix is shown in FIG. 8(b). Figure 5 Figure 5 (b).

[0180] In this embodiment, the base matrix set includes A=2 sub-base matrices, and the minimum row weight of the sub-matrix composed of the upper left corner mb0=2 rows and nb0=kb+Δb=16+2=18 columns in the A=2 sub-base matrices is equal to nb0-1. In another example, if the upper left corner mb0=2 rows and nb0=kb+Δb=16+0=16 columns in the A=2 sub-base matrices, then the minimum row weight of the composed sub-matrix is greater than nb0-1.

[0181] In a specific embodiment, the base matrix set includes at least A sub-base matrices, and the minimum column weight of the sub-matrix composed of the upper left corner mb0 rows and nb0 columns in the A sub-base matrices is greater than mb0-1, where mb0 is an integer greater than or equal to 1, nb0 is an integer greater than 4, and A is a positive integer. Wherein, nb0 is equal to kb+Δb, kb is the system column number of the space-coupled LDPC encoding, kb is an integer greater than 5, Δb is equal to 0, 1, 2, 3, 4, 5, or 6, kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36, and mb0 is equal to 1, 2, 3, 4, 5, or 6. ​

[0182] Embodiment Two

[0183] In the embodiments of the present disclosure, the base matrix set of the spatially coupled LDPC code includes 3 sub-base matrices: sub-base matrix 0, sub-base matrix 1 and sub-base matrix 2, each of which has a size of mb=1 row and nb=9 columns, each of which has kb=8, a coupling width M-1=2, and a lifting value Z=128. An example of the 0thsub-base matrix is shown in FIG. 10(a), an example of the 1stsub-base matrix is shown in FIG. 10(b), and an example of the 2ndsub-base matrix is shown in FIG. 10(c). Figure 6 Figure 6 Figure 6

[0184] The base matrix set includes A=2 sub-base matrices, and the minimum row weight of the sub-matrix composed of the upper left corner mb0=1 row and nb0=kb+Δb=8+1=9 columns of the A=2 sub-base matrices is greater than nb0-1. In another example, if the upper left corner mb0=2 row and nb0=kb+Δb=8+0=8 columns of the A=2 sub-base matrices, the minimum row weight of the sub-matrix composed of the upper left corner mb0=2 row and nb0=kb+Δb=8+0=8 columns of the A=2 sub-base matrices is greater than nb0-1.

[0185] In a specific embodiment, the base matrix set includes at least A sub-base matrices, and the number of all non-1 elements in the sub-matrix composed of the upper left corner mb0 rows and nb0 columns of the A sub-base matrices is greater than mb0*nb0-Δt, where mb0 is a positive integer, nb0 is an integer greater than 4, Δt is a non-negative integer less than 12, and A is a positive integer. Wherein, nb0 is equal to kb+Δb, kb is the system column number of the spatially coupled LDPC code, kb is an integer greater than 5, Δb is equal to 0, 1, 2, 3, 4, 5, or 6, kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36, and mb0 is equal to 1, 2, 3, 4, 5, or 6.

[0186] Embodiment Three

[0187] In the embodiments of the present disclosure, the base matrix set of the spatially coupled LDPC code includes 2 sub-base matrices: sub-base matrix 0 and sub-base matrix 1, each of which has a size of mb=2 rows and nb=18 columns, each of which has kb=16, a coupling width M-1=1, and a lifting value Z=64. An example of the 0thsub-base matrix is shown in FIG. 11(a), and an example of the 1stsub-base matrix is shown in FIG. 11(b). Figure 7 Figure 7

[0188] ​​​​​In this embodiment, the number of all non-1 elements in the sub-matrix consisting of the left upper mb0=2 rows and nb0=kb+Ab=16+2=18 columns of all the A=2 sub-base matrices in the base matrix set of the spatially coupled LDPC code is equal to 34, which is greater than mb0*nb0-At=33. In another example, if A=2 sub-base matrices consist of the left upper mb0=2 rows and nb0=kb+Ab=16+1=17 columns, the number of all non-1 elements in the sub-matrix is equal to 33, which is greater than mb0*nb0-At=32.

[0189] In this embodiment, the number of all non-1 elements in the sub-matrix consisting of the left upper mb0=2 rows and nb0=kb+Ab=16+0=16 columns of all the A=2 sub-base matrices in the base matrix set of the spatially coupled LDPC code is equal to mb0*nb0.

[0190] In a specific embodiment, the base matrix of the spatially coupled LDPC code includes a column number of the system column matrix equal to 8, mb0 equal to 1, and nb0 equal to 9.

[0191] Embodiment Four

[0192] In the embodiments of the present disclosure, the base matrix set of the spatially coupled LDPC code includes 3 sub-base matrices: sub-base matrix 0, sub-base matrix 1, and sub-base matrix 2, each of which has a size of mb=1 row and nb=9 column, kb=8 in each sub-base matrix, the coupling width M-1=2, and the lifting value Z=128. An example of the 0thsub-base matrix is shown in FIG. 8(a), an example of the 1stsub-base matrix is shown in FIG. 8(b), and an example of the 2ndsub-base matrix is shown in FIG. 8(c). Figure 8 Figure 8 Figure 8

[0193] The number of all non-1 elements in the sub-matrix consisting of the left upper mb0=1 row and nb0=9 columns of the sub-base matrix 0 is 9, which is equal to mb0*nb0=9. The number of all non-1 elements in the sub-matrix consisting of the left upper mb0=1 row and nb0=9 columns of the sub-base matrix 1 is 9, which is equal to mb0*nb0=9. The number of all non-1 elements in the sub-matrix consisting of the left upper mb0=1 row and nb0=9 columns of the sub-base matrix 2 is 9, which is equal to mb0*nb0=9. The number of all non-1 elements in the sub-matrix consisting of the left upper mb0 rows and nb0 columns of all the 3 sub-base matrices is equal to mb0*nb0.

[0194] ​​​In a specific example, the number of all non--1 elements in the submatrix formed by the top-left row mb0 and column nb0 of all submatrices in the set of foundational matrices of spatially coupled LDPC codes is equal to mb0*nb0. The number of columns in the systematic column matrix of the submatrices of spatially coupled LDPC codes is 16, mb0 is 2, and nb0 is 16.

[0195] Example 5

[0196] In this embodiment of the disclosure, the set of fundamental matrices for spatially coupled LDPC codes includes two sub-fundamental matrices: sub-fundamental matrix 0 and sub-fundamental matrix 1. Each sub-fundamental matrix has a size of mb = 2 rows and nb = 18 columns, with kb = 16 columns, a coupling width M-1 = 1, and a lift value Z = 64. An example of the 0th sub-fundamental matrix is ​​shown below. Figure 9 As shown in (a), an example of the first subfundamental matrix is ​​as follows: Figure 9 As shown in (b).

[0197] The number of all non--1 elements in the submatrix formed by the top-left columns mb0=2 and nb0=16 in submatrix 0 is mb0*nb0=32. The number of all non--1 elements in the submatrix formed by the top-left columns mb0=2 and nb0=16 in submatrix 1 is mb0*nb0=32.

[0198] In a specific example, when the number of columns in the systematic column matrix of the subfundamental matrix of a spatially coupled LDPC code is less than or equal to 12, the coupling width of the spatially coupled LDPC code is equal to or greater than 2.

[0199] Example 6

[0200] In the disclosed embodiment, the number of systematic columns in the sub-fundamental matrix of the spatially coupled LDPC code is 8, satisfying the condition of being less than or equal to 12, and the coupling width of the spatially coupled LDPC code is 2, satisfying the condition of being equal to or greater than 2. For example, each sub-fundamental matrix has a size of mb = 3 rows and nb = 11 columns, kb = 8 in each sub-fundamental matrix, a coupling width M-1 = 2, and a lift value Z = 64. For example, kb = 8, M = 3, and the lift value Z = 256. There are three sub-fundamental matrices: sub-fundamental matrix 0, sub-fundamental matrix 1, and sub-fundamental matrix 2. An example of the 0th sub-fundamental matrix is ​​as follows... Figure 10 As shown in (a), an example of the first subfundamental matrix is ​​as follows: Figure 10 As shown in (b), an example of the second sub-fundamental matrix is ​​as follows: Figure 10 As shown in (c).

[0201] In a specific example, when the number of systematic columns in the subfundamental matrix of a spatially coupled LDPC code is greater than 12, the coupling width of the spatially coupled LDPC code is equal to 1.

[0202] Embodiment Seven

[0203] In the embodiments of the present disclosure, the number of columns of the system columns of the sub-paradigm matrix of the spatially coupled LDPC code is equal to 16, the condition of being greater than 12 is met, the coupling width of the spatially coupled LDPC code is equal to 1, and the condition of the coupling width being equal to 1 is met. For example, the size of each sub-paradigm matrix is mb=6 rows and nb=22 columns, kb=8 in each sub-paradigm matrix, the coupling width M-1=1, and the lifting value Z=32. There are two sub-paradigm matrices: sub-paradigm matrix 0 and sub-paradigm matrix 1. An example of the 0thsub-paradigm matrix is shown in FIG. 8(a), and an example of the 1stsub-paradigm matrix is shown in FIG. 8(b). Figure 11 Figure 11

[0204] In a specific example, in the base matrix set, there are at least one row of non-1 elements in each column of the system column matrix (hereinafter referred to as the system column), and the number of rows of non-1 elements in the system column of each sub-paradigm matrix can be different.

[0205] Embodiment Eight

[0206] In the embodiments of the present disclosure, there are 3 rows of non-1 elements in the system column of the 0thsub-paradigm matrix of the M sub-paradigm matrices, and there is 1 row of non-1 elements in the system column of the 1stto (M-1)thsub-paradigm matrix of the M sub-paradigm matrices. For example, kb=8, M=3, and the lifting value Z=256. There are three sub-paradigm matrices: sub-paradigm matrix 0, sub-paradigm matrix 1, and sub-paradigm matrix 2, and the size of each sub-paradigm matrix is mb=3 rows and nb=11 columns. An example of the 0thsub-paradigm matrix is shown in FIG. 9(a), and there are 3 rows (the first three rows) of non-1 elements in the system column of the 0thsub-paradigm matrix; an example of the 1stsub-paradigm matrix is shown in FIG. 9(b), and there is 1 row (the first row) of non-1 elements in the system column of the 1stsub-paradigm matrix; and an example of the 2ndsub-paradigm matrix is shown in FIG. 9(c), and there is 1 row (the first row) of non-1 elements in the system column of the 2ndsub-paradigm matrix. Figure 12 Figure 12 Figure 12

[0207] In a specific example, there are s rows of elements indicating non-1 in the system column of the ithsub-paradigm matrix in the base matrix set, and there are another mb-s rows in the system column of the ithsub-paradigm matrix, and the ratio of the number of elements indicating non-1 in the mb-s rows to (mb-s)×kb is denoted as T i , s is an integer greater than 0 and less than or equal to mb, i is an integer greater than or equal to 0 and less than M, and the characteristics satisfy the following relationship:

[0208] ​​​​​The ratio T0 of the 0th sub-base matrix is greater than the ratios T1, T2,..., T M-1 .

[0209] Embodiment Nine

[0210] In the embodiments of the present disclosure, kb=8, M=3, the lifting value Z=64, and there are three sub-base matrices: a 0th sub-base matrix, a 1st sub-base matrix, and a 2nd sub-base matrix, each of which has a size of mb=16 rows and nb=24 columns; a 0th sub-base matrix is shown in FIG. 10(a), in which s0=3 rows (the first three rows) are all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s0=13 rows (the last 13 rows) to (mb-s0)*kb is T0=45 / 104; a 1st sub-base matrix is shown in FIG. 10(b), in which s1=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s1=15 rows (the last 15 rows) to (mb-s1)*kb is T1=1 / 12; and a 2nd sub-base matrix is shown in FIG. 10(c), in which s2=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s2=15 rows (the last 15 rows) to (mb-s2)*kb is T2=1 / 10; the above T0 is less than T1, and T0 is less than T2. Figure 13 (a) shown, s0=3 rows (the first three rows) are all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s0=13 rows (the last 13 rows) to (mb-s0)*kb is T0=45 / 104; a 1st sub-base matrix is shown in FIG. 10(b), in which s1=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s1=15 rows (the last 15 rows) to (mb-s1)*kb is T1=1 / 12; and a 2nd sub-base matrix is shown in FIG. 10(c), in which s2=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s2=15 rows (the last 15 rows) to (mb-s2)*kb is T2=1 / 10; the above T0 is less than T1, and T0 is less than T2. Figure 13 (a) shown, s0=3 rows (the first three rows) are all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s0=13 rows (the last 13 rows) to (mb-s0)*kb is T0=45 / 104; a 1st sub-base matrix is shown in FIG. 10(b), in which s1=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s1=15 rows (the last 15 rows) to (mb-s1)*kb is T1=1 / 12; and a 2nd sub-base matrix is shown in FIG. 10(c), in which s2=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s2=15 rows (the last 15 rows) to (mb-s2)*kb is T2=1 / 10; the above T0 is less than T1, and T0 is less than T2. Figure 13 (a) shown, s0=3 rows (the first three rows) are all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s0=13 rows (the last 13 rows) to (mb-s0)*kb is T0=45 / 104; a 1st sub-base matrix is shown in FIG. 10(b), in which s1=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s1=15 rows (the last 15 rows) to (mb-s1)*kb is T1=1 / 12; and a 2nd sub-base matrix is shown in FIG. 10(c), in which s2=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s2=15 rows (the last 15 rows) to (mb-s2)*kb is T2=1 / 10; the above T0 is less than T1, and T0 is less than T2.

[0211] In a specific example, the system column matrix and the check column matrix are included in the sub-base matrix of the spatially coupled LDPC code, and the check column matrix of the 0th sub-base matrix of the sub-base matrix includes but is not limited to: a unit matrix, a Raptor-like structure, and a lower triangular structure. The check column matrix of the 1st to (M-1)th sub-base matrix of the M sub-base matrices includes but is not limited to: a matrix in which the column weight of the first d columns is greater than 0 and the column weight of the remaining columns is equal to 0, d is an integer greater than 0, and all elements of the matrix are elements indicating a zero matrix.

[0212] Embodiment Ten

[0213] In a specific example, the check column matrix of the 0th sub-base matrix is a unit matrix, and the check column matrix of the 1st to (M-1)th sub-base matrix is a matrix in which the column weight of the first d columns is greater than 0 and the column weight of the remaining columns is equal to 0, d is an integer greater than 0. For example, kb=8, M=3, and the lifting value Z=256. There are three sub-base matrices: a 0th sub-base matrix, a 1st sub-base matrix, and a 2nd sub-base matrix, each of which has a size of mb=8 rows and nb=11 columns. A 0th sub-base matrix is shown in FIG. 11(a), in which the check column matrix of the 0th sub-base matrix is a unit matrix; a 1st sub-base matrix is shown in FIG. 11(b), in which the check column matrix of the 1st sub-base matrix is a matrix in which the column weight of the first d columns is greater than 0 and the column weight of the remaining columns is equal to 0; and a 2nd sub-base matrix is shown in FIG. 11(c), in which the check column matrix of the 2nd sub-base matrix is a matrix in which the column weight of the first d columns is greater than 0 and the column weight of the remaining columns is equal to 0. Figure 14 (a) shown, s0=3 rows (the first three rows) are all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s0=13 rows (the last 13 rows) to (mb-s0)*kb is T0=45 / 104; a 1st sub-base matrix is shown in FIG. 10(b), in which s1=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s1=15 rows (the last 15 rows) to (mb-s1)*kb is T1=1 / 12; and a 2nd sub-base matrix is shown in FIG. 10(c), in which s2=1 row (the first row) is all non-1 elements, and the ratio of the number of all non-1 elements in the other mb-s2=15 rows (the last 15 rows) to (mb-s2)*kb is T2=1 / 10; the above T0 is less than T1, and T0 is less than T2. Figure 14(b) shows that the column weight of the first d = 2 columns is greater than 0, and the column weight of the remaining columns is equal to 0; an example of the second sub-base matrix is as shown in Figure 14 (c) shows that the column weight of the first d = 2 columns is greater than 0, and the column weight of the remaining columns is equal to 0; an example of the second sub-base matrix is as shown in

[0214] In the embodiments of the present disclosure, the sub-base matrix of the spatially coupled LDPC code includes a systematic column matrix and a check column matrix, and the check column matrix of the 0th sub-base matrix of the sub-base matrix includes but is not limited to a unit matrix, a Raptor-like structure, and a lower triangular structure.

[0215] Embodiment eleven

[0216] In a specific example, the check column matrix of the 0th sub-base matrix is a unit matrix, and the check column matrix of the 1st to (M-1)th sub-base matrix is a matrix in which the column weight of the first d columns is greater than 0, and the column weight of the remaining columns is equal to 0, and d is an integer greater than 0. For example, kb = 8, M = 3, and the lifting value Z = 64. There are three sub-base matrices: sub-base matrix 0, sub-base matrix 1, and sub-base matrix 2, each of which has a size of mb = 16 rows and nb = 24 columns. An example of the 0th sub-base matrix is as shown in Figure 15 (a) shows that the check column matrix of the 0th sub-base matrix is a unit matrix; an example of the 1st sub-base matrix is as shown in Figure 15 (b) shows that the column weight of the first d = 2 columns is greater than 0, and the column weight of the remaining columns is equal to 0; an example of the second sub-base matrix is as shown in Figure 15 (c) shows that the column weight of the first d = 2 columns is greater than 0, and the column weight of the remaining columns is equal to 0; an example of the second sub-base matrix is as shown in

[0217] In the embodiments of the present disclosure, the sub-base matrix of the spatially coupled LDPC code includes a systematic column matrix and a check column matrix, and the check column matrix of the 0th sub-base matrix of the sub-base matrix includes but is not limited to a unit matrix, a Raptor-like structure, and a lower triangular structure.

[0218] Embodiment twelve

[0219] In a specific example, the check column matrix with the Raptor-like structure has the following characteristics, as shown in Figure 16As shown in the figure, the circle dot represents a non-1 element, and the blank place represents a -1 element. The upper left corner mb0 row mb0 column sub-matrix 202 has a row weight greater than 1 and a column weight greater than 1; the lower left corner mb-mb0 row mb0 column sub-matrix 204 has a column weight greater than 0; all elements in the upper right corner mb0 row mb-mb0 column sub-matrix 206 are non-1 elements; and all elements on the diagonal of the lower right corner mb-mb0 row mb-mb0 column sub-matrix 208 are non-1 elements, and the remaining elements are -1 elements.

[0220] In a specific example, a check column matrix with a unit matrix structure is shown as Figure 17 As shown in the figure, the circle dot represents a non-1 element, and the blank place represents a -1 element. If the check column matrix in the sub-basic matrix has a unit matrix structure, the encoding process is very simple, all the check bit calculations do not need to perform an inverse operation, and parallel calculation can be performed, the complexity is very low, and fast encoding operation can be performed.

[0221] In a specific example, a check column matrix with a lower triangular structure is shown as Figure 18 As shown in the figure, the circle dot represents a non-1 element, and the blank place represents a -1 element. The check column matrix with a lower triangular structure has the following characteristics:

[0222] All elements on the diagonal are non-1 elements; and at least one -1 element exists in all elements below the diagonal.

[0223] The check column matrix with a lower triangular structure in the sub-basic matrix has the following advantages: all check bit calculations do not need to perform an inverse operation, the encoding operation can be simplified, the encoding complexity can be reduced, and fast encoding can be performed.

[0224] Here, the sub-basic matrix constructed according to the various embodiments described above can realize encoding for the to-be-encoded bit sequence, and the specific construction form can refer to the description above, and is not specifically limited here.

[0225] The first transmission node here can send all bits of the encoded bit sequence or send part of the encoded bit sequence to the second transmission node after encoding the to-be-encoded bit sequence according to the basic matrix set of the spatially coupled LDPC code and the lifting value to obtain the encoded bit sequence.

[0226] The second transmission node here can perform data processing to obtain the original to-be-encoded bit sequence after receiving the to-be-decoded data sequence, such as Figure 19As shown, a method flowchart of a data processing method provided by the embodiment of the present disclosure is shown, and the execution subject of the space-coupled LDPC encoding method can be the second transmission node or other electronic devices with certain computing capability, for example, including a terminal device or a server or other processing device, the terminal device can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a 5G network or a future 5G network or above, and the like, and the method is implemented by the following steps:

[0227] S210: receiving a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence including a plurality of encoded bit subsequences;

[0228] S220: performing space-coupled LDPC decoding on the to-be-decoded data sequence based on a base matrix set to obtain a decoded bit sequence, the decoded bit sequence being consistent with the to-be-encoded bit sequence, the decoded bit sequence including a plurality of decoded bit subsequences; wherein a non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding of at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, and the base matrix set includes at least two sub-base matrices, which are used to implement encoding for the to-be-encoded bit subsequence.

[0229] Here, for the received to-be-decoded data sequence, the space-coupled LDPC decoding can be performed on the to-be-decoded data sequence based on a base matrix set to obtain a to-be-encoded bit sequence, and the process of processing the encoded bit sequence is equivalent to the decoding process based on the space-coupled LDPC code, which corresponds to the encoding process.

[0230] Wherein, the construction process of the space-coupled LDPC code can refer to the related description in the above embodiment, which is not repeated here.

[0231] It can be known that, since the embodiment of the present disclosure implements the associated encoding mode based on the space-coupled LDPC code at the first transmission node, the encoding results between the code blocks have certain association, so that even if the transmission is affected by factors such as multipath, noise, interference, etc., more reliable data communication can be realized based on the reliability of the encoding, so that the probability of error of the final decoded bit sequence is smaller, thereby having a more extensive application space.

[0232] In the description of the present specification, the description referring to the terms "some possible embodiments", "some embodiments", "an example", "a specific example", or "some examples" and the like means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present disclosure, and the above terms do not necessarily represent the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in any one or more embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the specification and the features of the different embodiments or examples without contradiction.

[0233] Regarding the method flowchart of the embodiments of the present disclosure, certain operations are described as different steps executed in a certain order. Such flowcharts are illustrative rather than limiting. Certain steps described herein can be grouped together and executed in a single operation, or certain steps can be split into multiple sub-steps, and certain steps can be executed in an order different from that shown herein. Each step shown in the flowchart can be implemented in any manner by any circuit structure and / or tangible mechanism (for example, by software running on a computer device, hardware (for example, processor or chip implemented logic functions), etc., and / or any combination thereof) in any way.

[0234] The person skilled in the art can understand that in the method described in the above specific embodiments, the writing order of each step does not mean a strict execution order, and the specific execution order of each step should be determined by its function and possible inherent logic.

[0235] Based on the same inventive concept, the present disclosure also provides a device corresponding to the method. Since the principle of solving problems by the device in the embodiments of the present disclosure is similar to the above-mentioned method of the present disclosure, the implementation of the device can be referred to the implementation of the method, and the repeated parts will not be described here.

[0236] Referring to Figure 20 As shown in the figure, a schematic diagram of a spatially coupled LDPC encoding device provided by the embodiments of the present disclosure is shown, and the device comprises: an acquisition module 210, an encoding module 220; wherein,

[0237] The acquisition module 210 is configured to acquire a to-be-encoded bit sequence, and the to-be-encoded bit sequence comprises a plurality of to-be-encoded bit subsequences.

[0238] The encoding module 220 is configured to perform spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a base matrix set to obtain an encoded bit sequence, and the encoded bit sequence comprises a plurality of encoded bit subsequences.

[0239] The non-first coded bit subsequence in the coded bit sequence is obtained based on coding of at least one corresponding associated coded bit subsequence and one corresponding associated to-be-coded bit subsequence. The base matrix set includes at least two sub-base matrices, which are used to realize coding of the to-be-coded bit subsequence.

[0240] With the spatially coupled LDPC coding device, when the to-be-coded bit sequence is obtained, the to-be-coded bit sequence can be spatially coupled LDPC coded based on one base matrix set to obtain a coded bit sequence. The non-first coded bit subsequence in the coded bit sequence is obtained based on coding of at least one corresponding associated coded bit subsequence and one corresponding associated to-be-coded bit subsequence. That is, different bit subsequences are spatially coupled based on the sub-base matrix association relationship, which avoids the poor communication reliability problem of the existing independent coding mode, improves the error correction performance of the data packet, and increases the robustness and reliability of data communication.

[0241] In a possible implementation, the base matrix set (i.e., a plurality of sub-base matrices with a sequence order) of the spatially coupled LDPC code in the encoding module 220 includes at least A sub-base matrices, and the minimum row weight in the sub-matrix formed by the upper left corner mb0 rows and nb0 columns of the A sub-base matrices is greater than or equal to nb0-1, where mb0 is a positive integer, nb0 is an integer greater than 4, and A is a positive integer. Based on this, more dense data coding can be realized to ensure that more data information can be coded together, thereby improving the data transmission rate while ensuring data transmission reliability.

[0242] In a possible implementation, the base matrix set (i.e., a plurality of sub-base matrices with a sequence order) of the spatially coupled LDPC code in the encoding module 220 includes at least A sub-base matrices, and the minimum column weight in the sub-matrix formed by the upper left corner mb0 rows and nb0 columns of the A sub-base matrices is greater than mb0-1, where mb0 is an integer greater than or equal to 1, nb0 is an integer greater than 4, and A is a positive integer. Based on this, more dense data coding can be realized to ensure that more data information can be coded together, thereby improving the data transmission rate while ensuring data transmission reliability.

[0243] In a possible implementation, the set of base matrices of the space-coupled LDPC code in the encoding module 220 can further include (i.e., have a sequence order of) at least A sub-base matrices, and a number of all non-1 elements in a sub-matrix formed by a left upper corner mb0 rows and nb0 columns of the A sub-base matrices is greater than mb0*nb0-Δt, where mb0 is a positive integer, nb0 is an integer greater than 4, Δt is a positive integer less than 12, and A is a positive integer. Based on this, more dense data coding can be implemented to ensure that more data information can be coded together, thereby improving the data transmission rate while ensuring the reliability of data transmission.

[0244] wherein A is less than or equal to a number of sub-base matrices in the set of base matrices.

[0245] wherein the left upper corner nb0 columns of the A sub-base matrices are characterized in that nb0 is equal to kb+Δb, wherein kb is a system column number of the space-coupled LDPC coding, kb is an integer greater than 5, and Δb is equal to 0, 1, 2, 3, 4, 5, or 6.

[0246] wherein kb is characterized in that kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36.

[0247] wherein the left upper corner mb0 rows of the A sub-base matrices are characterized in that mb0 is equal to 1, 2, 3, 4, 5, or 6.

[0248] In a possible implementation, the sub-base matrix of the space-coupled LDPC code constructed by the encoding module 220 includes a system column matrix and a check column matrix. In a specific example, the sub-base matrix has the following structure: wherein Hb s is referred to as the system column matrix, and Hb p is referred to as the check column matrix. The number of rows of the system column matrix Hb s is equal to the number of rows of the check column matrix Hb p , and both are equal to mb; the number of columns of the system column matrix Hb s is equal to kb, and the number of columns of the check column matrix Hb p is equal to mb. The number of columns of the sub-base matrix is nb, and the following relationship is satisfied: kb=nb–mb, that is, the number of columns of the system column matrix of the sub-base matrix is equal to the difference between the number of columns and the number of rows of the sub-base matrix. Wherein kb, nb, and mb are all integers greater than 0.

[0249] In a possible implementation, the encoding module 220 is specifically configured to perform space-coupled LDPC coding on a to-be-encoded bit sequence based on a set of base matrices according to the following steps:

[0250] For the non-first to-be-encoded bit subsequence, determine a sub-parity check matrix group corresponding to the to-be-encoded bit subsequence based on the associated sub-basic matrix group corresponding to the to-be-encoded bit subsequence; and

[0251] Encode the to-be-encoded bit subsequence based on the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence to obtain an encoded bit subsequence;

[0252] Combine the encoded bit subsequences determined by the respective to-be-encoded bit subsequences in the order to obtain an encoded bit sequence.

[0253] In a possible implementation, the encoding module 220 is specifically configured to determine the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence according to the following steps:

[0254] Obtain a lifting value Z matching the to-be-encoded bit subsequence;

[0255] Perform matrix extension on each sub-basic matrix in the associated sub-basic matrix group corresponding to the to-be-encoded bit subsequence based on the lifting value Z to obtain the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence.

[0256] In a possible implementation, the encoding module 220 is specifically configured to perform matrix extension on each sub-basic matrix in the associated sub-basic matrix group corresponding to the to-be-encoded bit subsequence based on the lifting value Z according to the following steps:

[0257] For each sub-basic matrix in the associated sub-basic matrix group, replace an element in the sub-basic matrix indicating a zero matrix with a zero matrix of Z*Z, and / or replace an element in the sub-basic matrix indicating a cyclic shift of a unit matrix with a cyclic shift matrix of a unit matrix of Z*Z;

[0258] Determine the sub-parity check matrix of each sub-basic matrix in the associated sub-basic matrix group based on the replaced zero matrix and / or the cyclic shift matrix;

[0259] Determine the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence based on the sub-parity check matrix of each sub-basic matrix in the associated sub-basic matrix group.

[0260] In a possible implementation, the lifting value Z takes a value of p*2 q where p belongs to an element in a set {2, 3, 5, 7, 9, 11, 13, 15}, and q belongs to an element in a set {0, 1, 2, 3, 4, 5, 6, 7, 8}.

[0261] In one possible implementation, the encoding module 220 is specifically configured to encode the bit subsequence to be encoded based on the sub-parity check matrix group corresponding to the bit subsequence to be encoded according to the following steps:

[0262] For the current non-first bit subsequence to be encoded, based on the sub-parity check matrix group corresponding to the bit subsequence to be encoded and at least one encoded bit subsequence that has been encoded before the bit subsequence to be encoded, determine the encoded bit subsequence obtained by encoding the bit subsequence to be encoded.

[0263] In one possible implementation, the encoding module 220 is specifically used to obtain the encoded bit subsequence according to the following calculation:

[0264]

[0265] Where M represents the number of subfundamental matrices in the fundamental matrix set, and H... x Used to represent the sub-parity check matrix corresponding to the x-th sub-fundamental matrix and a is used to represent the systematic column matrix and parity column matrix in the sub-parity check matrix corresponding to the 0th sub-fundamental matrix, respectively. t Let b be the t-th bit subsequence to be encoded. t Let t be the coded bit subsequence.

[0266] In one possible implementation, the i-th sub-fundamental matrix in the set of fundamental matrices of the spatially coupled LDPC code (i.e., multiple sub-fundamental matrices in sequence) includes the systematic column matrix Hb. s When there are s rows where all elements are non--1, the ratio of the number of non--1 elements in the other mb-s rows of the system column matrix to (mb-s)×kb is denoted as T. i T i The following relationship must be satisfied:

[0267] The ratio T0 of the 0th sub-fundamental matrix is ​​greater than the ratios T1, T2, ..., T1 of the 1st to M-1th sub-fundamental matrices. M-1 Any ratio in the matrix; the 0th sub-fundamental matrix is ​​the associated sub-fundamental matrix corresponding to the first bit subsequence to be encoded;

[0268] Where s is an integer greater than 0 and less than or equal to mb, and M is an integer less than or equal to the number of subfundamental matrices in the set of fundamental matrices.

[0269] In one possible implementation, the device further includes:

[0270] The sending module 230 is used to send all or part of the encoded bit sequence to the second transmission node.

[0271] Referring to Figure 21 Fig. 1 is a schematic diagram of a data processing apparatus provided by an embodiment of the present disclosure, which comprises a receiving module 310 and a processing module 320, wherein

[0272] The receiving module 310 is configured to receive a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit subsequences.

[0273] The processing module 320 is configured to perform spatially coupled LDPC decoding on the to-be-decoded data sequence based on a base matrix set to obtain a decoded bit sequence, the decoded bit sequence being consistent with the to-be-encoded bit sequence, the decoded bit sequence comprising a plurality of decoded bit subsequences.

[0274] The non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding of at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, the base matrix set comprising at least two sub-base matrices, and the base matrix set is used to implement encoding for the to-be-encoded bit subsequence.

[0275] It should be noted that the apparatus in the embodiment of the present disclosure can implement each process of the embodiments of the foregoing method and achieve the same effects and functions, which will not be described here.

[0276] Corresponding to Figure 3 the spatially coupled LDPC encoding method in the embodiment of the present disclosure and Figure 19 the data processing method in the embodiment of the present disclosure, the present disclosure further provides an electronic device, as shown in Figure 22 Fig. 2 is a structural schematic diagram of an electronic device provided by an embodiment of the present disclosure, which comprises:

[0277] a processor 410, a memory 420, and a bus 430; the memory 420 is configured to store execution instructions, comprising an internal memory 421 and an external memory 422; the internal memory 421 is also referred to as an internal storage, and is used to temporarily store operation data in the processor 410 and exchange data with the external memory 422 such as a hard disk, the processor 410 exchanges data with the external memory 422 through the internal memory 421, and when the electronic device 600 is running, the processor 410 and the memory 420 communicate through the bus 430, so that the processor 410 executes the following instructions:

[0278] obtaining a to-be-encoded bit sequence, the to-be-encoded bit sequence comprising a plurality of to-be-encoded bit subsequences;

[0279] performing spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a base matrix set to obtain an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit subsequences;

[0280] The non-first coded bit subsequence in the coded bit sequence is obtained based on encoding of the at least one corresponding associated coded bit subsequence and the one to-be-encoded bit subsequence, and the base matrix set includes at least two sub-base matrices, which are used to implement encoding for the to-be-encoded bit subsequence.

[0281] Or, the following instructions are executed:

[0282] Receiving a to-be-decoded data sequence corresponding to the coded bit sequence, the coded bit sequence including a plurality of coded bit subsequences;

[0283] Performing spatially coupled LDPC decoding on the to-be-decoded data sequence based on a base matrix set to obtain a decoded bit sequence, the decoded bit sequence being consistent with the to-be-encoded bit sequence, and the decoded bit sequence including a plurality of decoded bit subsequences;

[0284] The non-first coded bit subsequence in the coded bit sequence is obtained based on encoding of the at least one corresponding associated coded bit subsequence and the one to-be-encoded bit subsequence, and the base matrix set includes at least two sub-base matrices, which are used to implement encoding for the to-be-encoded bit subsequence.

[0285] The present disclosure also provides a computer readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the steps of the spatially coupled LDPC encoding method or the data processing method described in the above method embodiments. The storage medium can be a volatile or non-volatile computer readable storage medium.

[0286] The present disclosure also provides a computer program product carrying a program code, the instructions included in the program code being used to perform the steps of the spatially coupled LDPC encoding method or the data processing method described in the above method embodiments. For details, please refer to the above method embodiments, which will not be described here.

[0287] The computer program product can be specifically implemented by hardware, software or a combination thereof. In one optional embodiment, the computer program product is specifically embodied as a computer storage medium, and in another optional embodiment, the computer program product is specifically embodied as a software product, such as a software development kit (SDK) and the like.

[0288] The various embodiments in the present disclosure are described in a progressive manner, and the same or similar parts among the various embodiments can be cross-referenced. Each embodiment focuses on the differences from other embodiments. In particular, for the apparatus, device, and computer-readable storage medium embodiments, since they are substantially similar to the method embodiments, the description is simplified, and the relevant parts can be referred to the description of the method embodiments.

[0289] The apparatus, device, and computer-readable storage medium provided by the embodiments of the present disclosure correspond to the method, and therefore, the apparatus, device, and computer-readable storage medium also have similar beneficial technical effects as the method. Since the beneficial technical effects of the method have been described in detail above, the beneficial technical effects of the apparatus, device, and computer-readable storage medium will not be described here.

[0290] Those skilled in the art will understand that the embodiments of the present disclosure can be implemented in a method and an apparatus (device or system), or a computer-readable storage medium. Therefore, the present disclosure can be implemented in a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware. Moreover, the present disclosure can be in the form of a computer-readable storage medium implemented on one or more computer-usable storage media containing computer-usable program code (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.).

[0291] The present disclosure is described with reference to flowcharts and / or block diagrams of the method, apparatus (device or system), and computer-readable storage medium according to the embodiments of the present disclosure. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce the functions specified in one or more flows in the flowcharts and / or one or more blocks in the block diagrams.

[0292] These computer program instructions can also be stored in a computer-readable memory that can cause the computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a product including instruction apparatus, which implements the functions specified in one or more flows in the flowcharts and / or one or more blocks in the block diagrams.

[0293] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks and / or flowchart diagrams in one or more flowcharts.

[0294] In one typical arrangement, the computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0295] The memory can include non-persistent memory and / or volatile memory, such as random access memory (RAM) and / or cache memory, non-volatile memory, such as read-only memory (ROM), EPROM, and / or flash memory. The memory is an example of computer readable media.

[0296] Computer readable media includes permanent and non-permanent, movable and non-movable media that can be implemented by any method or technology for storing information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer readable storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory, read-only memory, electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape magnetic disk storage or other magnetic storage device, or any other non-transmission medium that can be used to store information accessible by a computing device. In addition, although the operations of the methods of the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that the operations must be performed in that particular order, or that all of the illustrated operations must be performed to achieve the desired result. In addition, certain steps can be omitted, combined into a single step, and / or divided into multiple steps.

[0297] Although the spirit and principles of the present disclosure have been described above with reference to several specific embodiments, it should be understood that the present disclosure is not limited to the disclosed specific embodiments, and the division of aspects does not mean that the features in these aspects cannot be combined. The present disclosure is intended to cover various modifications and equivalent arrangements included in the spirit and scope of the appended claims.

Claims

1. A method of space-coupled LDPC encoding, the method comprising: The method is applied to a first transmission node, and the method comprises: obtaining a to-be-encoded bit sequence, the to-be-encoded bit sequence comprising a plurality of to-be-encoded bit subsequences; performing spatially coupled LDPC encoding on the to-be-encoded bit sequence based on a base matrix set to obtain an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit subsequences; wherein a non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, and the base matrix set comprises at least two sub-base matrices for realizing encoding of the to-be-encoded bit subsequence.

2. The method of claim 1, wherein, In the base matrix set, at least A sub-base matrices are included, and a minimum row weight of a sub-matrix formed by a left upper corner mb0 row and a nb0 column in the A sub-base matrices is greater than or equal to nb0-1, wherein mb0 is a positive integer, nb0 is an integer greater than 4, and A is a positive integer.

3. The method of claim 1, wherein, In the base matrix set, at least A sub-base matrices are included, and a minimum column weight of a sub-matrix formed by a left upper corner mb0 row and a nb0 column in the A sub-base matrices is greater than mb0-1, wherein mb0 is an integer greater than or equal to 1, nb0 is an integer greater than 4, and A is a positive integer.

4. The method of claim 1, wherein, In the base matrix set, at least A sub-base matrices are included, and a number of all non-1 elements in a sub-matrix formed by a left upper corner mb0 row and a nb0 column in the A sub-base matrices is greater than mb0*nb0-Δt, wherein mb0 is a positive integer, nb0 is an integer greater than 4, Δt is a positive integer less than 12, and A is a positive integer.

5. The method according to any one of claims 2 to 4, characterized in that, The A is less than or equal to a number of sub-base matrices in the base matrix set.

6. The method according to any one of claims 2 to 4, characterized in that, The nb0 is equal to kb+Δb, wherein kb is a system column number of the spatially coupled LDPC encoding, kb is an integer greater than 5, and Δb is equal to 0, 1, 2, 3, 4, 5, or 6.

7. The method of claim 6, wherein, The kb is equal to 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, or 36.

8. The method according to any one of claims 2 to 4, characterized in that, The mb0 is equal to 1, 2, 3, 4, 5, or 6.

9. The method of claim 1, wherein, The performing spatially coupled LDPC encoding on the to-be-encoded bit sequence based on the base matrix set comprises: for a non-first to-be-encoded bit subsequence, determining a sub-parity check matrix group corresponding to the to-be-encoded bit subsequence based on an associated sub-base matrix group corresponding to the to-be-encoded bit subsequence; and encoding the to-be-encoded bit subsequence based on the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence to obtain an encoded bit subsequence; combining the encoded bit subsequences determined for the respective to-be-encoded bit subsequences in a sequence to obtain the encoded bit sequence.

10. The method of claim 9, wherein, The determining the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence comprises: obtaining a lifting value Z matching the to-be-encoded bit subsequence; performing matrix extension on each sub-base matrix in the associated sub-base matrix group corresponding to the to-be-encoded bit subsequence based on the lifting value Z to obtain the sub-parity check matrix group corresponding to the to-be-encoded bit subsequence.

11. The method of claim 10, wherein, The matrix expansion of each sub-basic matrix in the associated sub-basic matrix group corresponding to the to-be-encoded bit sub-sequence based on the lifting value Z comprises: For each sub-basic matrix in the associated sub-basic matrix group, replacing an element in the sub-basic matrix indicating a zero matrix with a zero matrix of Z*Z, and / or replacing an element in the sub-basic matrix indicating a cyclic shift of a unit matrix with a cyclic shift matrix of the unit matrix of Z*Z; Based on the zero matrix and / or the cyclic shift matrix after the replacement is completed, determining a sub-parity check matrix of each sub-basic matrix in the associated sub-basic matrix group; Based on the sub-parity check matrix of each sub-basic matrix in the associated sub-basic matrix group, determining a sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence.

12. The method of claim 10, wherein, The value of the lift value Z is p*2 q where p belongs to the set of elements {2, 3, 5, 7, 9, 11, 13, 15} and q belongs to the set of elements {0, 1, 2, 3, 4, 5, 6, 7, 8}.

13. The method according to any one of claims 9 to 12, characterized in that, The encoding of the to-be-encoded bit sub-sequence based on the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence comprises: For a non-first to-be-encoded bit sub-sequence to be currently encoded, based on the sub-parity check matrix group corresponding to the to-be-encoded bit sub-sequence and at least one encoded bit sub-sequence that has been encoded before the to-be-encoded bit sub-sequence, determining an encoded bit sub-sequence obtained by encoding the to-be-encoded bit sub-sequence.

14. The method according to any one of claims 9 to 12, characterized in that, The encoded bit sub-sequence is obtained by calculation as follows: wherein M represents the number of sub-matrices in the basic matrix set, H x Hx represents the sub-parity check matrix corresponding to the xth sub-basic matrix, and H0 represents the system column matrix and the check column matrix in the sub-parity check matrix corresponding to the 0th sub-basic matrix, respectively, a t bt represents the tth sub-sequence of the to-be-encoded bits, b t bt represents the tth sub-sequence of the encoded bits.

15. The method of claim 1, wherein, The i-th sub-matrix of the base matrix set includes a system column matrix Hb s When there are s rows in which all elements are indicative of non-1, the ratio of the number of elements indicative of non-1 in the other mb-s rows included in the system column matrix to (mb-s) x kb is denoted as T i , T i satisfies the following relationship: The ratio T0 of the 0th sub-base matrix is greater than the ratios T1, T2,..., TM-1 of the 1st to M-1st sub-base matrices, any one of which is T0 M-1 The ratio T0 of the 0th sub-base matrix is greater than the ratios T1, T2,..., TM-1 of the 1st to M-1st sub-base matrices, any one of which is T0 Wherein, s is an integer greater than 0 and less than or equal to mb, and M is an integer less than or equal to the number of sub-basic matrices in the basic matrix set.

16. The method of claim 1, wherein, The method further comprises: Sending all or part of the encoded bit sequence to the second transmission node.

17. A data processing method, characterized by, Applied to the second transmission node, the method comprises: Receiving a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit sub-sequences; Based on a basic matrix set, performing spatially coupled LDPC decoding on the to-be-decoded data sequence to obtain a decoded bit sequence, the decoded bit sequence being consistent with a to-be-encoded bit sequence, the decoded bit sequence comprising a plurality of decoded bit sub-sequences; Wherein, a non-first encoded bit sub-sequence in the encoded bit sequence is obtained by encoding at least one corresponding associated encoded bit sub-sequence and one corresponding associated to-be-encoded bit sub-sequence, and the basic matrix set at least comprises two sub-basic matrices, used to realize encoding for the to-be-encoded bit sub-sequence.

18. A spatially coupled LDPC encoding apparatus, comprising: Applied to the first transmission node, the apparatus comprises: An acquisition module configured to acquire a to-be-encoded bit sequence, the to-be-encoded bit sequence comprising a plurality of to-be-encoded bit sub-sequences; An encoding module configured to, based on a basic matrix set, perform spatially coupled LDPC encoding on the to-be-encoded bit sequence to obtain an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit sub-sequences; Wherein, a non-first encoded bit sub-sequence in the encoded bit sequence is obtained by encoding at least one corresponding associated encoded bit sub-sequence and one corresponding associated to-be-encoded bit sub-sequence, and the basic matrix set at least comprises two sub-basic matrices, used to realize encoding for the to-be-encoded bit sub-sequence.

19. A data processing apparatus, characterized by Applied to the second transmission node, the apparatus comprises: receive a to-be-decoded data sequence corresponding to an encoded bit sequence, the encoded bit sequence comprising a plurality of encoded bit subsequences; perform spatially coupled LDPC decoding on the to-be-decoded data sequence based on a base matrix set to obtain a decoded bit sequence, the decoded bit sequence being consistent with a to-be-encoded bit sequence, the decoded bit sequence comprising a plurality of encoded bit subsequences; wherein a non-first encoded bit subsequence in the encoded bit sequence is obtained based on encoding of at least one corresponding associated encoded bit subsequence and one corresponding associated to-be-encoded bit subsequence, and the base matrix set comprises at least two sub-base matrices for realizing encoding on the to-be-encoded bit subsequence.

20. An electronic device, comprising: comprise: a processor, a memory, and a bus, the memory storing machine-readable instructions executable by the processor, when the electronic device is running, the processor and the memory communicate through the bus, the machine-readable instructions executed by the processor perform the spatially coupled LDPC encoding method of any one of claims 1-16 or perform the data processing method of claim 17.

21. A computer-readable storage medium, characterized in that, The computer program stored on the computer readable storage medium is executed by the processor to perform the spatially coupled LDPC encoding method of any one of claims 1-16 or perform the data processing method of claim 17.

Images