Encoding method and apparatus, and decoding method and apparatus

By flexibly dividing the subcode information length and the base matrix boosting value in SC-LDPC codes and optimizing the parity check matrix, the problem of low encoding and decoding performance in existing technologies is solved, and more efficient decoding is achieved.

WO2026012180A1PCT designated stage Publication Date: 2026-01-15HUAWEI TECH CO LTD +1
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2025/104987
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-07-11
Filing Date
2025-06-27
Publication Date
2026-01-15

AI Technical Summary

Technical Problem

In existing technologies, the encoding and decoding of spatially coupled low-density parity-check codes (SC-LDPC) mainly focus on the channel, resulting in low encoding and decoding performance.

Method used

By determining the information length of the subcode and the boost value of the basis matrix, the encoding method can be flexibly divided according to the decoding capability of the receiver. Taking advantage of window decoding, the parity check matrix can be optimized to improve decoding efficiency.

Benefits of technology

The encoding and decoding performance of SC-LDPC codes is improved under different decoding capabilities of receivers, achieving encoding that is more closely matched to the decoding capability and maximizing the decoding efficiency of the decoder.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025104987_15012026_PF_FP_ABST
    Figure CN2025104987_15012026_PF_FP_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of wireless communications, and provides an encoding method and apparatus and a decoding method and apparatus, for improving encoding / decoding performance. In the method, on the basis of first information, a first communication device determines an information length of a subcode and / or a lifting size of a base matrix of the subcode, wherein the first information indicates a decoding capability of a receiving end; the first communication device determines a coupling length L on the basis of the information length of the subcode and an information bit length comprised in a first sequence; the first communication device determines a check matrix on the basis of the base matrix and the lifting size; and the first communication device encodes the first sequence on the basis of the check matrix, to obtain a second sequence consisting of L subcodes. On the basis of the solution, code dividing methods can be flexibly determined under different decoding capabilities of receiving ends, so as to make full use the advantages of windowed decoding under limited decoding complexity, thereby improving the performance of SC-LDPC codes. In addition, decoding capabilities of receiving ends can be utilized in a simple way, thereby performing encoding better matching the decoding capabilities.
Need to check novelty before this filing date? Find Prior Art

Description

An encoding and decoding method and apparatus

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202410933519.9, filed on July 11, 2024, entitled "An Encoding, Decoding Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of wireless communication technology, and in particular to an encoding and decoding method and apparatus. Background Technology

[0004] Decoding spatially coupled low-density party-check codes (SC-LDPC) can be performed using window decoding. Window decoding leverages the diagonal matrix-like structure of the SC-LDPC code's parity check matrix, ensuring that each decoding operation only decodes no more than S elements within the SC-LDPC code. N There are 1 variable node and no more than S. M Decoding is performed on each check node, where S is called the decoding window length, and S≥w+1. After the current decoding window reaches the maximum number of iterations or completes decoding, the decoding window slides down m rows and right n rows on the basis matrix, and the decoding process continues in a new decoding window. Window decoding has a smaller decoder area and higher decoding efficiency compared to decoding directly on the entire SC-LDPC code.

[0005] However, current encoding and decoding methods for SC-LDPC mostly focus on the channel, using the channel to determine the parity check matrix and decoding window length of SC-LDPC, resulting in low encoding and decoding performance. Summary of the Invention

[0006] This application provides an encoding and decoding method and apparatus to improve encoding and decoding performance.

[0007] Firstly, an encoding method is provided. This method can be executed by a first communication device. Unless otherwise specified, "first communication device" in this application can refer to the first communication device itself (e.g., a network device, a terminal device), a component within the first communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the first communication device. The method includes: the first communication device determining the information length of a sub-code and / or the boost value of the base matrix of the sub-code based on first information. Wherein, the first information indicates the decoding capability of the receiving end. The first communication device determines a coupling length L based on the information length of the sub-code and the length of the information bits contained in the first sequence. The first communication device determines a parity check matrix based on the base matrix and the boost value. The first communication device encodes the first sequence according to the parity check matrix to obtain a second sequence composed of L sub-codes.

[0008] Based on the above scheme, the block coding scheme for SC-LDPC codes proposed in this application can flexibly determine the coding partitioning method under different decoding capabilities of the receiving end, so as to give full play to the advantages of windowed decoding with limited decoding complexity and improve the performance of SC-LDPC codes. In addition, the decoding capability of the receiving end can be utilized in a simple way, thereby performing coding that is more in line with the decoding capability.

[0009] In one possible implementation, the first communication device receives first information indicating one or more of the following: the length of information bits processed during decoding at the receiving end, the length of codewords processed during decoding at the receiving end, or the decoding parallelism supported by the receiving end. In another possible implementation, the first communication device receives first information indicating one or more of the following: the maximum length of codewords processed during decoding at the receiving end, the maximum length of information length of subcodes processed during decoding at the receiving end, or the maximum value of the boost value during decoding at the receiving end.

[0010] Based on the above scheme, the receiving end can report its decoding capability to the first communication device, thereby enabling the first communication device to utilize the decoding capability of the receiving end and perform encoding that better matches the decoding capability.

[0011] In one possible implementation, the first communication device determines a boost value based on the first information. The first communication device then determines the information length of the subcode based on the boost value and the number of information columns in the base matrix.

[0012] Based on the above scheme, the first communication device can determine the boost value according to the decoding capability of the receiving end, thereby determining the information length of the subcode, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0013] In one possible implementation, the first communication device determines the information length of the subcode based on the first information. The first communication device then determines a boost value based on the information length of the subcode and the number of information columns in the base matrix.

[0014] Based on the above scheme, the first communication device can determine the information length of the subcode according to the decoding capability of the receiving end, thereby determining the boost value and ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0015] In one possible implementation, K de When the range is i, the promotion value is the i-th value l. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0016] Based on the above scheme, the first communication device can determine the decoding capability K. de Determine the corresponding boost value. Specifically, for K... de and l i The segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0017] In one possible implementation, K de When the range is i, the information length of the subcode is the i-th value k. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0018] Based on the above scheme, the first communication device can determine the decoding capability K. de Determine the information length of the corresponding subcode. Specifically, for K... de and k iThe segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0019] In one possible implementation, the first communication device determines the code length of the sub-code based on the first information. The first communication device then determines the information length of the sub-code based on the code length and the code rate of the sub-code. Wherein, K... de When the range is i, the code length of the subcode is n. i K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0020] Based on the above scheme, the first communication device can determine the decoding capability K. de Determine the code length of the corresponding subcode, and then determine the information length of the subcode based on its code length and code rate. For K... de and n i The segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0021] In one possible implementation, N de When the value is in the m-th range, the promotion value is the m-th value l. m Among them, K de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the codeword processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0022] Based on the above scheme, the first communication device can determine the decoding capability N. de Determine the corresponding boost value. Specifically, for N... de and l m The segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0023] In one possible implementation, the first communication device determines the code length of the sub-code based on the first information. The first communication device then determines the information length of the sub-code based on the code length and the code rate of the sub-code. de When the range is m, the code length of the subcode is n. m N de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the information bits processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0024] Based on the above scheme, the first communication device can determine the decoding capability N. de Determine the code length of the corresponding subcode, and then determine the information length of the subcode based on its code length and code rate. For N... de and n i The segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0025] In one possible implementation, N de When the range is m, the information length of the subcode is the m-th value k. m Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0026] Based on the above scheme, the first communication device can determine the decoding capability N. de Determine the information length of the corresponding subcode. For N de and k i The segmentation can be constrained by w1 and / or w2, thereby ensuring that SC-LDPC has the optimal decoding efficiency under different decoding capabilities.

[0027] In one possible implementation, w1 equals 3, 4, or 5. And / or, w2 equals 15, 16, or 17.

[0028] Secondly, a decoding method is provided. This method can be executed by a second communication device. Unless otherwise specified, "second communication device" in this application can refer to the second communication device itself (e.g., a network device, a terminal device), a component within the second communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the second communication device. The method includes: the second communication device determining the information length of a sub-code and / or the lift value of the base matrix of the sub-code based on first information. Wherein, the first information indicates decoding capability. The second communication device determines a parity check matrix based on the base matrix and the lift value. The second communication device decodes a second sequence composed of L sub-codes based on the parity check matrix and the information length of the sub-codes to obtain a first sequence.

[0029] In one possible implementation, the second communication device sends first information indicating one or more of the following: the length of the information bits processed by the receiver during decoding, the length of the codeword processed by the receiver during decoding, or the decoding parallelism supported by the receiver.

[0030] In one possible implementation, the second communication device sends first information indicating one or more of the following: the maximum length of the codeword processed by the receiver during decoding, the maximum length of the information length of the subcode processed by the receiver during decoding, or the maximum value of the boost value during the receiver decoding.

[0031] In one possible implementation, the second communication device determines a boost value based on the first information. The second communication device then determines the information length of the subcode based on the boost value and the number of information columns in the base matrix.

[0032] In one possible implementation, the second communication device determines the information length of the subcode based on the first information. The second communication device then determines the boost value based on the information length of the subcode and the number of information columns in the base matrix.

[0033] In one possible implementation, K de When the range is i, the promotion value is the i-th value l. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0034] In one possible implementation, K deWhen the range is i, the information length of the subcode is the i-th value k. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0035] In one possible implementation, the second communication device determines the code length of the sub-code based on the first information. The second communication device then determines the information length of the sub-code based on its code length and code rate. Wherein, K... de When the range is i, the code length of the subcode is n. i K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0036] In one possible implementation, N de When the value is in the m-th range, the promotion value is the m-th value l. m Among them, K de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the codeword processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0037] In one possible implementation, the second communication device determines the code length of the sub-code based on the first information. The second communication device then determines the information length of the sub-code based on its code length and code rate. de When the range is m, the code length of the subcode is n. m N de One or more of the following conditions must be met: or, Where, Nm Let w1 be the length of the information bits processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0038] In one possible implementation, N de When the range is m, the information length of the subcode is the m-th value k. m Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0039] In one possible implementation, w1 equals 3, 4, or 5. And / or, w2 equals 15, 16, or 17.

[0040] Thirdly, a communication device is provided, comprising: a processing unit and a transceiver unit.

[0041] The processing unit is configured to determine the information length of the subcode and / or the boost value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability of the receiving end. The processing unit is further configured to determine the coupling length L based on the information length of the subcode and the length of the information bits contained in the first sequence. The processing unit is further configured to determine the parity check matrix based on the base matrix and the boost value. The processing unit is further configured to encode the first sequence according to the parity check matrix to obtain a second sequence composed of L subcodes. The transceiver unit is configured to transmit the second sequence.

[0042] In one possible implementation, the transceiver unit is further configured to receive first information, which indicates one or more of the following: the length of the information bits processed during decoding at the receiving end, the length of the codewords processed during decoding at the receiving end, or the decoding parallelism supported by the receiving end.

[0043] In one possible implementation, the transceiver unit is further configured to receive first information, which indicates one or more of the following: the maximum length of the codeword processed by the receiver during decoding, the maximum length of the information length of the subcode processed by the receiver during decoding, or the maximum value of the boost value during the receiver decoding.

[0044] In one possible implementation, the processing unit is specifically configured to determine the lift value based on the first information. The processing unit is specifically configured to determine the information length of the subcode based on the lift value and the number of information columns in the base matrix.

[0045] In one possible implementation, the processing unit is specifically used to determine the information length of the subcode based on the first information. The processing unit is specifically used to determine the boost value based on the information length of the subcode and the number of information columns in the base matrix.

[0046] In one possible implementation, K de When the range is i, the promotion value is the i-th value l. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0047] In one possible implementation, K de When the range is i, the information length of the subcode is the i-th value k. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0048] In one possible implementation, the processing unit is specifically used to determine the code length of the sub-code based on the first information. The processing unit is specifically used to determine the information length of the sub-code based on the code length and the code rate of the sub-code. Wherein, K... de When the range is i, the code length of the subcode is n. i K de One or more of the following conditions must be met: or, Among them, K iLet w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0049] In one possible implementation, N de When the value is in the m-th range, the promotion value is the m-th value l. m Among them, K de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the codeword processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0050] In one possible implementation, the processing unit is specifically configured to determine the code length of the subcode based on the first information. The processing unit is specifically configured to determine the information length of the subcode based on the code length and the code rate of the subcode. de When the range is m, the code length of the subcode is n. m N de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the information bits processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0051] In one possible implementation, N de When the range is m, the information length of the subcode is the m-th value k. m Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0052] In one possible implementation, w1 equals 3, 4, or 5. And / or, w2 equals 15, 16, or 17.

[0053] Fourthly, a communication device is provided, comprising: a processing unit and a transceiver unit.

[0054] The transceiver unit is used to acquire the second sequence. The processing unit is used to determine the information length of the subcode and / or the lift value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability. The processing unit is also used to determine the parity check matrix based on the base matrix and the lift value. The processing unit is further used to decode the second sequence consisting of L subcodes based on the parity check matrix and the information length of the subcodes to obtain the first sequence.

[0055] In one possible implementation, the transceiver unit is further configured to transmit first information, which indicates one or more of the following: the length of the information bits processed by the receiver during decoding, the length of the codeword processed by the receiver during decoding, or the decoding parallelism supported by the receiver.

[0056] In one possible implementation, the transceiver unit is further configured to transmit first information, which indicates one or more of the following: the maximum length of the codeword processed by the receiver during decoding, the maximum length of the information length of the subcode processed by the receiver during decoding, or the maximum value of the boost value during the receiver decoding.

[0057] In one possible implementation, the processing unit is specifically configured to determine the lift value based on the first information. The processing unit is specifically configured to determine the information length of the subcode based on the lift value and the number of information columns in the base matrix.

[0058] In one possible implementation, the processing unit is specifically used to determine the information length of the subcode based on the first information. The processing unit is specifically used to determine the boost value based on the information length of the subcode and the number of information columns in the base matrix.

[0059] In one possible implementation, K de When the range is i, the promotion value is the i-th value l. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0060] In one possible implementation, K deWhen the range is i, the information length of the subcode is the i-th value k. i Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0061] In one possible implementation, the processing unit is specifically used to determine the code length of the sub-code based on the first information. The processing unit is specifically used to determine the information length of the sub-code based on the code length and the code rate of the sub-code. Wherein, K... de When the range is i, the code length of the subcode is n. i K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0062] In one possible implementation, N de When the value is in the m-th range, the promotion value is the m-th value l. m Among them, K de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the codeword processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0063] In one possible implementation, the processing unit is specifically configured to determine the code length of the subcode based on the first information. The processing unit is specifically configured to determine the information length of the subcode based on the code length and the code rate of the subcode. de When the range is m, the code length of the subcode is n. m N de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the information bits processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

[0064] In one possible implementation, N de When the range is m, the information length of the subcode is the m-th value k. m Among them, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first range, and w1 be the maximum value in the first range. The first range is the range of values ​​corresponding to the product of the decoding window length, the boost value, and the number of information columns in the basis matrix. w1 is less than or equal to w2, and p is an integer.

[0065] In one possible implementation, w1 equals 3, 4, or 5. And / or, w2 equals 15, 16, or 17.

[0066] Fifthly, a communication device is provided for implementing the various methods described above. This communication device may be a first communication device as described in the first or third aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second or fourth aspect, or a device comprising the second communication device, or a device included in the second communication device. The communication device includes modules, units, or means corresponding to the methods described above, which may be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions described above.

[0067] A sixth aspect provides a communication device, comprising: a processor and a communication interface; the communication interface being used to communicate with a module outside the communication device; the processor being used to execute a computer program or instructions to cause the method described in any of the preceding aspects to be executed. The communication device may be a first communication device as described in the first aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second aspect, or a device comprising the second communication device, or a device included in the second communication device.

[0068] A seventh aspect provides a communication device, comprising: at least one processor; the processor being configured to execute a computer program or instructions stored in a memory to implement the method described in any of the preceding aspects. The memory may be coupled to the processor, or may be independent of the processor. The communication device may be a first communication device as described in the first aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second aspect, or a device comprising the second communication device, or a device included in the second communication device.

[0069] Eighthly, this application provides a communication system that may include a first communication device performing the method described in the first aspect and a second communication device performing the method described in the second aspect.

[0070] Ninthly, this application provides a computer-readable storage medium storing computer-readable instructions that, when read and executed by a computer, cause the computer to perform a method in any possible implementation of any of the first to second aspects described above.

[0071] In a tenth aspect, this application provides a computer program product that, when read and executed by a computer, causes the computer to perform a method in any possible implementation of any of the first to second aspects described above.

[0072] In one aspect, this application provides a chip for reading a computer program stored in a memory to execute the method in any possible implementation of any of the first to second aspects described above.

[0073] It is understandable that the technical effects of aspects two through eleven can be referenced from the technical effects of aspect one, and will not be elaborated here. Attached Figure Description

[0074] Figure 1 is a schematic diagram of a communication system architecture provided in an embodiment of this application;

[0075] Figure 2 is a schematic diagram of a coding / decoding process provided in an embodiment of this application;

[0076] Figure 3 is an exemplary flowchart of an encoding method provided in an embodiment of this application;

[0077] Figure 4 is an exemplary flowchart of a decoding method provided in an embodiment of this application;

[0078] Figure 5A is a schematic diagram showing the effect of an SC-LDPC code under different decoding window lengths according to an embodiment of this application.

[0079] Figure 5B is a schematic diagram showing the effect of another SC-LDPC code provided in the embodiment of this application under different decoding window lengths;

[0080] Figure 5C is a schematic diagram showing the effect of another SC-LDPC code provided in the embodiment of this application under different decoding window lengths;

[0081] Figure 6 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0082] Figure 7 is a schematic diagram of another communication device provided in an embodiment of this application;

[0083] Figure 8 is a structural schematic diagram of another communication device provided in an embodiment of this application;

[0084] Figure 9 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation

[0085] The technical solutions of this application can be applied to various communication systems, such as: Global System for Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), and 5th generation (5G) mobile communication systems, such as New Radio (NR) systems. The technical solutions provided in this application can also be applied to future communication systems, such as 6th generation (6G) mobile communication systems. Communication systems can also be Bluetooth communication systems, Wireless Local Area Network (WLAN) / Wireless WiFi communication systems, Narrow Band Internet of Things (NB-IoT) communication systems, etc. The technical solutions of this application embodiment can also be applied to satellite communication systems, wherein the satellite communication system can be integrated with the above-mentioned communication system.

[0086] To facilitate understanding of the embodiments of this application, the application scenario used in this application will be described using the communication system architecture shown in FIG1 as an example. Referring to FIG1, the communication system includes a network device 101 and a terminal device 102. The communication device provided in the embodiments of this application can be applied to the network device 101 or to the terminal device 102. It is understood that FIG1 only shows one possible communication system architecture that can be applied to the embodiments of this application, and in other possible scenarios, the communication system architecture may also include other devices.

[0087] Network device 101 is a node in a radio access network (RAN), and can be referred to as access network equipment, RAN node, etc. Optionally, the RAN can be a 3GPP-related cellular system, such as a 4G mobile communication system (e.g., LTE system), a 5G mobile communication system (e.g., NR system), or a future-oriented evolution system (e.g., 6G mobile communication system). The RAN can also be an open access network (open RAN, O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN can also be a communication system that integrates two or more of the above systems.

[0088] In one possible scenario, access network equipment can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a next-generation base station in a 6th-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system. Access network equipment can also be a macro base station, a micro base station, an indoor station, a relay node, a donor node, or a radio controller in a CRAN scenario. Optionally, access network equipment can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, in vehicle-to-everything (V2X) technology, the access network equipment can be a roadside unit (RSU).

[0089] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0090] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called an open centralized unit (O-CU) or an open CU, DU can also be called an open distributed unit (O-DU), CU-CP can also be called an open centralized unit control plane (O-CU-CP), CU-UP can also be called an open centralized unit user plane (O-CU-UP), and RU can also be called an open radio unit (O-RU). For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0091] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0092] Terminal equipment 102, also known as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device that provides voice or data connectivity to users, and can also be an Internet of Things (IoT) device. For example, terminal equipment includes handheld devices with wireless connectivity, vehicle-mounted devices, etc. Currently, terminal devices can be: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, etc.), in-vehicle devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), intelligent robots, workshop equipment, wireless terminals in autonomous driving, wireless terminals in remote surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying devices (such as intelligent robots, hot air balloons, drones, airplanes), etc. Terminal devices can also be other devices with terminal functions; for example, a terminal device can also be a device that performs terminal functions in device-to-device (D2D) communication. In this application, terminal devices with wireless transceiver functions and chips that can be installed in the aforementioned terminal devices are collectively referred to as terminal devices.

[0093] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal, or by a device containing terminal functions.

[0094] Network devices and terminals can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminals.

[0095] In the embodiments of this application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and / or c can represent: a, b, c, a and b, a and c, b and c, or a, b, and c, where each of a, b, and c can be an element itself or a set containing one or more elements.

[0096] In this application, terms such as "exemplary," "in some embodiments," and "in other embodiments" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Rather, the term "exemplary" is used to present the concept in a specific manner.

[0097] In this application, the terms "of," "corresponding (relevant)," and "corresponding" may sometimes be used interchangeably. It should be noted that, unless a distinction is emphasized, their intended meanings are consistent. Similarly, in the embodiments of this application, "communication" and "transmission" may sometimes be used interchangeably. It should be noted that, unless a distinction is emphasized, their intended meanings are consistent. For example, transmission can include sending and / or receiving, and can be a noun or a verb.

[0098] In this application, "instruction" can include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information for the purpose of instructing A, it can be understood that the instruction information carries A, directly instructs A, or indirectly instructs A.

[0099] It should be noted that the terms "first" and "second" used in the embodiments of this application are used only for the purpose of distinguishing descriptions and should not be construed as indicating or implying relative importance or order.

[0100] To facilitate understanding of the content of this application, the nouns or terms involved in the embodiments of this application will be explained below.

[0101] I. Information Bit Sequence

[0102] An information bit sequence refers to a sequence of multiple bits to be sent. For example, if the bits to be sent are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the information bit sequence is: 10101100101.

[0103] II. Code Length

[0104] Code length refers to the length of the bit sequence to be transmitted obtained by encoding the information bit sequence. The code length is greater than or equal to the length of the information bit sequence.

[0105] III. Bitrate

[0106] Code rate is the ratio of the length of the information bit sequence to the code length.

[0107] The length, code length, and code rate of the information bit sequence can be pre-configured by higher-layer signaling, MAC layer signaling, or downlink physical layer signals, and can also be obtained or calculated by the transmitting and receiving devices. For example, the transmitting and receiving devices can determine the code length based on the coding method, the frame structure used to transmit the information bits, the number of layers, and the modulation scheme. For example, the transmitting and receiving devices can obtain the code rate based on higher-layer signaling, MAC layer signaling, or downlink physical layer signals, or determine the code rate based on the modulation and coding scheme (MCS).

[0108] IV. LDPC Code

[0109] LDPC codes are a channel coding scheme very close to Shannon lines, characterized by high performance and low complexity. They have been adopted by 3GPP as the coding and decoding scheme for 5G communication data channels. Mainstream LDPC codes have a quasi-cyclic (QC) structure, which avoids bad structures such as short cycles and improves code distance by setting the shift amount of each block.

[0110] LDPC codes can be represented using a basis matrix, where elements are either 0 or 1. Expanding the basis matrix by adding 1 elements results in a ZC*ZC cyclic shift matrix, and expanding by adding 0 elements results in a ZC*ZC zero matrix. This expansion yields a parity-check matrix, which can be used for encoding or decoding. ZC can be referred to as the spread factor, lift factor, spread value, spread coefficient, lifting size, etc. The basis matrix can be represented as H. BG BG is an abbreviation for base graph. A basis matrix can also be represented by a base graph, and the two have a corresponding relationship.

[0111] For example, if the element in the i-th row and j-th column of the basis matrix is ​​1 and corresponds to a shifting value (SV), it can be represented by P. i,j This represents the shift value corresponding to the i-th row and j-th column. A shift value can be used to calculate the corresponding number of cyclic shifts.

[0112] SC-LDPC codes are constructed by coupling L disjoint subcodes, where L is called the coupling length. Their parity check matrix H has the form shown in Equation 1.

[0113] Among them, H i Let w be a parity check matrix of size M×N, and w is called the coupling width.

[0114] SC-LDPC codes with a QC structure are a special type of SC-LDPC code, obtained by lifting the basis matrix. When the lifting value is ZC, its basis matrix B has the form shown in Equation 2.

[0115] [Formula 2]

[0116] Among them, B i Let w be a base matrix block of size m×n, where m = N / ZC and n = N / ZC. w is called the coupling width.

[0117] SC-LDPC code decoding can be performed using window decoding. Window decoding utilizes the diagonal matrix structure of the SC-LDPC code's parity check matrix, ensuring that each decoding operation only delimits the parity check matrix within the SC-LDPC code by a factor of S. N There are 1 variable node and no more than S. M Decoding is performed on each check node, where S is called the decoding window length of window decoding, and S≥w+1. After the current decoding window reaches the maximum number of iterations or completes decoding, the decoding window slides down m rows and right n rows on the base graph, and continues the decoding process in a new decoding window. Window decoding has a smaller decoder area and higher decoding efficiency compared to decoding directly on the entire SC-LDPC code. Each decoding window WD has the form shown in Equation 3 on the base matrix.

[0118] However, current encoding and decoding methods for SC-LDPC mostly focus on the channel, using the channel to determine the parity check matrix and decoding window length of SC-LDPC.

[0119] In view of this, embodiments of this application provide an encoding and decoding method that determines the parity check matrix of the SC-LDPC code based on the decoding capability of the receiving end before encoding, which can improve decoding performance compared to the current SC-LDPC code.

[0120] Taking the communication system shown in Figure 1 as an example, to ensure the reliability of communication between devices, the transmitting end can encode the information to be transmitted, and correspondingly, the receiving end decodes the encoded information after receiving it. As shown in the encoding and decoding process in Figure 2, the source signal from the transmitting end is transmitted on the channel after sequentially undergoing source coding, channel coding, rate matching, and modulation. After receiving the signal, the receiving end sequentially undergoes demodulation and rate matching, channel decoding, and source decoding to obtain the destination signal. The transmitting end and receiving end can be either network devices or terminal devices, respectively. It can be understood that in downlink communication, the network device is the transmitting end and the terminal device is the receiving end; in uplink communication, the terminal device is the transmitting end and the network device is the receiving end. The network device can be either a transmitting end or a receiving end. Furthermore, this application does not exclude the possibility that both the transmitting end and the receiving end are terminal devices, in which case D2D communication occurs between the transmitting end and the receiving end. The method provided in this application's embodiments can be used in the channel coding process.

[0121] Figure 3 shows a flowchart of an encoding method. This method can be applied to a first communication device. The first communication device can be the sending end in the encoding / decoding flow shown in Figure 2; correspondingly, the second communication device can be the receiving end in the encoding / decoding flow shown in Figure 2. Unless otherwise specified, the term "first communication device" in this application can refer to the first communication device itself (e.g., a network device, a terminal device), a component within the first communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the first communication device. Similarly, unless otherwise specified, the term "second communication device" in this application can refer to the second communication device itself (e.g., a network device, a terminal device), a component within the second communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the second communication device.

[0122] For example, when the first communication device is a terminal device, the second communication device can be a network device, or the second communication device can also be a terminal device; when the first communication device is a network device, the second communication device can be a terminal device, or the second communication device can also be a terminal device. The method includes:

[0123] S301: The first communication device determines the information length of the subcode and / or the boost value of the base matrix of the subcode based on the first information.

[0124] For example, the first communication device can determine the information length of the subcode based on the first information. As another example, the first communication device can determine the lifting value of the base matrix of the subcode based on the first information. Furthermore, the first communication device can determine both the information length of the subcode and the lifting value of the base matrix of the subcode based on the first information.

[0125] The first piece of information can indicate the decoding capability of the receiving end, such as the second communication device. In one possible implementation, the decoding capability of the receiving end can be understood as the capability of the decoder at the receiving end, which can represent the length K of information bits that the decoder can process. de It can also represent the length of codeword bits N that the decoder can process. de Or, it could be one or more of the decoding parallelisms that the receiving end can support.

[0126] In one example, the decoding capability of the receiving end can be sent by the receiving end to the first communication device. For example, the receiving end can send its decoding capability to the first communication device when reporting capability information. For instance, an information element (IE) can be added to the UE capability information elements to indicate one or more of the following: the maximum code length (UE-define-maxcodelength), the maximum information length (UE-defined-maxinformationlength), or the maximum lifting size set that the receiving end can decode.

[0127] For example, the receiving end can send its decoding capabilities to the first communication device when reporting physical layer parameters (phy-parameters). For instance, a new field can be added to the physical layer parameters to indicate one or more of the following: the maximum code length (UE-define-maxcodelength), the maximum information length (UE-defined-maxinformationlength), or the maximum lift value (UE-defined-liftingsizeset) that the receiving end can decode.

[0128] In one possible scenario, the receiving end can precisely indicate specific values ​​when reporting decoding capabilities, such as one or more of the following: maximum code length, maximum information length, or maximum boost value.

[0129] In another possible scenario, the receiving end may not specify a precise numerical value when reporting decoding capabilities, but rather indicate a range. For example, the decoding capability of the decoder can be segmented, and the sequence number of the segment to which the decoding capability belongs can be sent to the first communication device. For instance, regarding K in the decoding capability... de Use it with function S1(K) de ) is divided into segments, where the function S1(K de As shown in Formula 4.

[0130] In Formula 4, p1 represents the decoding capability K. de The number of segments, These are the segmentation points for the decoding capability. The receiving end can number each segment and send the number to the first communication device. The first communication device can then determine the corresponding decoding capability of the receiving end based on the number.

[0131] For example, regarding N in decoding capability de Alternatively, it can be used with the function S2(N) de The function S2(N) is divided into segments. de As shown in Formula 5.

[0132] In Formula 5, p2 represents the decoding capability N. de The number of segments, These are the segmentation points for the decoding capability. The receiving end can number each segment and send the number to the first communication device. The first communication device can then determine the corresponding decoding capability of the receiving end based on the number.

[0133] It should be understood that p1 and p2 can be the same or different, and this application does not impose specific limitations. In the embodiments of this application, the segmentation of decoding capabilities can also be implemented in the form of a table.

[0134] In some embodiments, decoding capability K de and / or decoding capability N de This can correspond to a boost value. For example, the decoding capability K of the receiver. de The segment (or range) to which it belongs can correspond to a boost value. For example, the decoding capability N of the receiver. de A given boost value can correspond to a segment (or range). Optionally, different segments (or ranges) can correspond to different boost values. Thus, the first communication device can determine the boost value based on the decoding capability of the receiving end. Optionally, in other words, the boost value can be related to the decoding complexity, and the boost value determined under different decoding complexities can be different.

[0135] In other embodiments, the decoding capability K de and / or decoding capability N de This can correspond to the information length of the subcode. For example, the decoding capability K of the receiving end. de The segment (or range) to which it belongs can correspond to the information length of a subcode. For example, the decoding capability N of the receiving end... deThe segment (or range) to which a code belongs can correspond to the information length of a subcode. Optionally, different segments (or ranges) can correspond to different information lengths of subcodes. In this way, the first communication device can determine the information length of the subcode based on the decoding capability of the receiving end. Optionally, in other words, the information length of the subcode can be related to the decoding complexity, and the information length of the subcode determined under different decoding complexities can be different.

[0136] S302: The first communication device determines the coupling length L based on the information length of the subcode and the length of the information bits contained in the first sequence.

[0137] The first sequence can be the sequence to be encoded, and it can contain K information bits. The coupling length L can then be determined by the information length K of the subcode. sub The coupling length L is determined by the length K of the information bits contained in the first sequence. For example, the coupling length L can satisfy:

[0138] S303: The first communication device determines the parity check matrix based on the base matrix and the boost value.

[0139] For example, the first communication device can expand the basis matrix according to the boost value ZC, and obtain the parity check matrix after expansion. The expansion method can be referred to Equations 2 and 3, which will not be repeated here.

[0140] Optionally, the first communication device may also have already determined the translation value of the base matrix. For example, the first communication device may determine the translation value of the SC-LDPC code by referring to the method for determining the translation value in LDPC codes. The first communication device can then expand and translate the base matrix based on the boost value and the translation value to obtain the parity check matrix.

[0141] S304: The first communication device encodes the first sequence according to the parity check matrix to obtain a second sequence consisting of L subcodes.

[0142] The first communication device can perform SC-LDPC encoding on the first sequence according to the parity check matrix to obtain a second sequence consisting of L subcodes. Here, L is the coupling length.

[0143] Based on the above scheme, the block coding scheme of SC-LDPC code proposed in this application can flexibly determine the coding partitioning method under different decoding capabilities of the receiver, so as to give full play to the advantages of windowed decoding with limited decoding complexity and improve the performance of SC-LDPC code. In addition, the scheme shown in Figure 3 can utilize the decoding capability of the receiver in a simple way, so as to perform coding that is more in line with the decoding capability.

[0144] The following describes, through different scenarios, how the first communication device determines the information length and / or boost value of the subcode based on the decoding capability of the receiving end.

[0145] Case 1: Decoding capability K of the receiving end de Corresponding to the boost value.

[0146] In one example, the first communication device can determine the decoding capability K of the receiving end. de The boost value is determined to maximize the decoding efficiency of the SC LDPC code without exceeding the decoding capability of the receiver.

[0147] For example, the first communication device can acquire decoding capability K. de This refers to the length of information bits that the decoder can process. The first communication device can determine the decoding capability K based on the first information reported by the receiving end. de In case 1, the decoding capability K de There is a one-to-one correspondence between this and the boost value ZC. For example, the first communication device can utilize the function f1 and the decoding capability K. de The lift value ZC is then determined. The function f1 can be in piecewise form, as shown in Formula 6.

[0148] in, To increase the number of values, For the different boost values ​​that can be used, For decoding capability K de The decoding capability is segmented, with each segment corresponding to a boost value. For example, the decoding capability K at the receiver... de When the segment (or range) is i, the promotion value is the i-th value l. i , i = 1, 2, ..., p1-1.

[0149] Optionally, the specific settings of the parameters in function f1 need to be designed according to the form of the SC-LDPC code subcode. The form of function f1 can differ for different SC-LDPC code subcodes, which will not be described again below. Alternatively, the specific settings of the parameters in function f1 can be designed according to the decoding complexity. The form of function f1 can differ for different decoding complexities, which will not be described again below. In other words, the boost value can be related to the decoding complexity, and the boost value determined under different decoding complexities can be different.

[0150] In this embodiment, the selection of parameters for function f1 can satisfy formula 7 and / or formula 8 to ensure that SC-LDPC codes have optimal decoding efficiency under different decoding capabilities.

[0151] Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, and w2 be the minimum value in the range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer. For example, w1 equals 3, 4, or 5. Another example is w2 equaling 15, 16, or 17.

[0152] It should be understood that the function f1 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0153] In one possible implementation, the information length of the subcode can be determined based on the lift value and the number of information columns in the base matrix. For example, the first communication device can determine the lift value ZC using the above formula 6, and obtain the information length K of the subcode based on the lift value ZC and the number of information columns in the base matrix. sub .

[0154] Based on the scheme described in Case 1, the first communication device can determine the boost value according to the decoding capability of the receiving end, thereby determining the information length of the subcode, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0155] Case 2: Decoding capability N at the receiving end de Corresponding to the boost value.

[0156] For example, the first communication device can acquire decoding capability N. de This refers to the length of codewords that the decoder can process. The first communication device can determine the decoding capability N based on the first information reported by the receiving end. de In case 2, the decoding capability N de There is a one-to-one correspondence between this and the boost value ZC. For example, the first communication device can utilize the function f2 and the decoding capability N. de The lift value ZC is then determined. The function f2 can be in piecewise form, as shown in Formula 9.

[0157] in, To increase the number of values, For the different boost values ​​that can be used, For decoding capability N de The decoding capability is segmented, with each segment corresponding to a boost value. For example, the decoding capability N at the receiver... de When the m-th segment (or range) is defined, the promotion value is the m-th value l. m , m=1,2,…,p2-1.

[0158] In this embodiment, the selection of parameters for function f2 can satisfy formula 10 or formula 11 to ensure that the SC-LDPC code has the optimal decoding efficiency under different decoding capabilities.

[0159] Where, N m The length of the information bits processed by the receiver during decoding within the m-th range.

[0160] It should be understood that the function f2 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0161] In one possible implementation, the information length of the subcode can be determined based on the lifting value and the number of information columns in the base matrix. This can be implemented with reference to the relevant description in Case 1, and will not be repeated here.

[0162] Based on the scheme described in Scenario 2, the first communication device can determine the boost value according to the decoding capability of the receiving end, thereby determining the information length of the subcode, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0163] Case 3: Decoding capability K at the receiving end de Information length K of the subcode sub correspond.

[0164] For example, the first communication device can acquire decoding capability K. de In other words, the decoder can process information of length K. The first communication device can determine the decoding capability K based on the first information reported by the receiving end. de In case 3, the decoding capability K de Information length K of the subcode sub They can be mapped one-to-one. For example, the first communication device can utilize function f3 and decoding capability K. de To determine the information length K of the subcode sub The function f3 can be in piecewise form, as shown in Formula 12.

[0165] in, To increase the number of values, For the different boost values ​​that can be used, For decoding capability K de The decoding is segmented, with each segment's decoding capability corresponding to the information length of a sub-code. For example, the decoding capability K at the receiving end... de When dividing into segments (or ranges) of the i-th order, the information length of the subcode is the i-th value k. i , i = 1, 2, ..., p1-1.

[0166] In this embodiment, the parameters of function f3 can be selected to satisfy formula 13 and / or formula 14 to ensure that SC-LDPC has optimal decoding efficiency under different decoding capabilities.

[0167] It should be understood that function f3 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0168] In one possible implementation, for example, the first communication device can determine the information length K of the subcode. sub The number of information columns k contained in the basis matrix sub Determine the lift value ZC, satisfying...

[0169] Based on the above-mentioned scheme in case 3, the first communication device can determine the information length of the subcode according to the decoding capability of the receiving end, thereby determining the boost value, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0170] Case 4: Decoding capability N at the receiving end de It corresponds to the information length of the subcode.

[0171] For example, the first communication device can acquire decoding capability N. de This refers to the length of codewords that the decoder can process. The first communication device can determine the decoding capability N based on the first information reported by the receiving end. de In case 2, the decoding capability N de The information length of each subcode can be matched one-to-one. For example, the first communication device can utilize function f4 and decoding capability N. de The information length of the subcode is determined. The function f4 can be in a segmented form, as shown in Formula 15.

[0172] in, The length of the subcode information. The information length of the different subcodes that can be used, For decoding capability N de The decoding is segmented, with each segment corresponding to the information length of a sub-code. For example, the decoding capability N at the receiver... de When dividing the code into m segments (or ranges), the information length of the subcode is the m-th value k. m , m=1,2,…,p2-1.

[0173] In this embodiment, the selection of parameters for function f4 can satisfy formula 16 and / or formula 17 to ensure that SC-LDPC codes have optimal decoding efficiency under different decoding capabilities.

[0174] It should be understood that the function f4 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0175] In one possible implementation, the promotion value can be determined based on the information length of the subcode, as described in Case 3, and will not be repeated here.

[0176] Based on the above-mentioned scheme in case 4, the first communication device can determine the information length of the subcode according to the decoding capability of the receiving end, thereby determining the boost value, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0177] Case 5: Decoding capability K of the receiving end de The code length N of the subcode sub correspond.

[0178] In scenario 5, the first communication device can determine the code length of the sub-code based on the decoding capability of the receiving end. The first communication device can determine the code length and code rate R of the sub-code based on these parameters. sub Determine the information length of the subcode. For example, the information length K of the subcode... sub =N sub ×R sub .

[0179] In one example, the first communication device can acquire decoding capability K. de This refers to the length of information bits that the decoder can process. The first communication device can determine the decoding capability K based on the first information reported by the receiving end. de In case 5, the decoding capability K de The code length N of the subcode sub They can be mapped one-to-one. For example, the first communication device can utilize function f5 and decoding capability K. de To determine the code length N of the subcode. sub The function f5 can be in piecewise form, as shown in Formula 18.

[0180] in, The number of subcodes. For the different subcodes that can be used, For decoding capability K de The decoding is segmented, with each segment's decoding capability corresponding to the code length of a sub-code. For example, the decoding capability K at the receiver...de When dividing into segments (or ranges) of the i-th order, the code length of the subcode is the i-th value n. i , i = 1, 2, ..., p1-1.

[0181] In this embodiment, the selection of parameters for function f5 can satisfy formula 19 or formula 20 to ensure that the SC-LDPC code has the optimal decoding efficiency under different decoding capabilities.

[0182] It should be understood that the function f5 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0183] In one possible implementation, the promotion value can be determined based on the information length of the subcode, as described in Case 3, and will not be repeated here.

[0184] Based on the above-mentioned scheme in case 5, the first communication device can determine the information length of the subcode according to the decoding capability of the receiving end, thereby determining the boost value, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0185] Case 6: Decoding capability N at the receiving end de The code length N of the subcode sub correspond.

[0186] In scenario 6, the first communication device can determine the code length of the sub-code based on the decoding capability of the receiving end. The first communication device can determine the code length and code rate R of the sub-code based on these parameters. sub Determine the information length of the subcode. For example, the information length K of the subcode... sub =N sub ×R sub .

[0187] In one example, the first communication device can acquire decoding capability N. de In other words, this refers to the length of the code that the decoder can process. The first communication device can determine the decoding capability N based on the first information reported by the receiving end. de In case 5, the decoding capability N de The code length N of the subcode sub They can be mapped one-to-one. For example, the first communication device can utilize function f6 and decoding capability N. de To determine the code length N of the subcode. sub The function f6 can be in piecewise form, as shown in Formula 21.

[0188] in, The number of subcodes. For the different subcodes that can be used, For decoding capability N de The decoding is segmented, with each segment corresponding to the information length of a sub-code. For example, the decoding capability N at the receiver... de When dividing the code into segments (or ranges) of the mth degree, the code length of the subcode is the mth value n. m , m=1,2,…,p2-1.

[0189] In this embodiment, the selection of parameters for function f6 can satisfy formula 22 and / or formula 23 to ensure that the SC-LDPC code has the optimal decoding efficiency under different decoding capabilities.

[0190] It should be understood that the function f6 can also be represented in tabular form, and this application does not impose any specific limitations on it.

[0191] In one possible implementation, the promotion value can be determined based on the information length of the subcode, as described in Case 3, and will not be repeated here.

[0192] Based on the above-mentioned scheme 6, the first communication device can determine the information length of the subcode according to the decoding capability of the receiving end, thereby determining the boost value, ensuring that the decoder can perform decoding under the optimal decoding window length, so as to maximize the decoding efficiency of the decoder.

[0193] The first communication device encodes the first sequence to obtain the second sequence. Optionally, the second communication device can transmit the second sequence.

[0194] This application also provides a decoding method. Referring to Figure 4, an exemplary flowchart of a decoding method provided in this application is shown. This method can be applied to a second communication device. The second communication device can be the receiving end in the encoding / decoding flow shown in Figure 3. For example, when the first communication device is a terminal device or a module (such as a chip) in a terminal device, the second communication device can be a terminal device or a module (such as a chip) in a terminal device; or the second communication device can also be a network device or a module (such as a chip) in a network device; when the first communication device is a network device or a module (such as a chip) in a network device, the second communication device can be a module (such as a chip) in a terminal device. The method includes:

[0195] S401: The second communication device determines the information length of the subcode and / or the boost value of the base matrix of the subcode based on the first information.

[0196] S401 can be implemented with reference to S301, and will not be described in detail here.

[0197] S402: The second communication device raises the value and base matrix to determine the parity check matrix.

[0198] S402 can be implemented with reference to S303, and will not be elaborated here.

[0199] S403: Decode the second sequence according to the information length of the parity check matrix and the subcode to obtain the first sequence.

[0200] For example, the second communication device can receive a second sequence from the first communication device. The second sequence can be referred to in the aforementioned description of the second sequence generated by the first communication device, and will not be repeated here. For instance, the second sequence is a sequence to be decoded obtained in the second communication device after the first communication device has performed operations such as encoding, rate matching, modulation, and frequency conversion on the first sequence, and then transmitted through a wireless transmission environment. The first sequence can be referred to in the aforementioned description of the first sequence obtained by the first communication device, and will not be repeated here.

[0201] The second communication device can perform window decoding on the second sequence based on the parity check matrix and the information length of the subcode. The decoding window length can be determined based on one or more of the boost value, the information length of the subcode, and the number of information columns contained in the base matrix. It should be understood that the method by which the second communication device performs window decoding on the second sequence can be implemented with reference to the aforementioned decoding method for SC-LDPC, and will not be repeated here.

[0202] The effects of the encoding and decoding methods provided in the embodiments of this application will be described below with reference to the accompanying drawings.

[0203] Referring to Figure 5A, the threshold variation of the SC-LDPC code under different decoding window lengths is shown. The complexity is given in Figure 5A. The horizontal axis represents the decoding window length, and the vertical axis represents the threshold. In Figure 5A, the code rate is 3 / 4, the number of iterations per edge is 30, and the coupling length L = 6. It can be seen that both excessively large and excessively small decoding window lengths result in threshold loss.

[0204] Referring to Figure 5B, the threshold variation of the SC-LDPC code under different decoding window lengths is shown. The complexity is given in Figure 5B. The horizontal axis represents the decoding window length, and the vertical axis represents the threshold. In Figure 5B, the code rate is 1 / 2, the number of iterations per edge is 30, and the coupling length L = 6. It can be seen that both excessively large and excessively small decoding window lengths result in threshold loss.

[0205] Referring to Figure 5C, the threshold variation of SC-LDPC codes under different decoding window lengths is shown as decoding complexity changes. The horizontal axis represents the number of iterations for each edge, and the vertical axis represents the threshold. It can be seen that the threshold is optimal when the decoding window length is moderate.

[0206] Based on the concept of the above embodiments, and referring to FIG6, this application provides a communication device 600, which includes a processing unit 601 and a transceiver unit 602. The device 600 can be a communication device, or it can be an apparatus applied to a communication device that supports the communication device in performing encoding and decoding methods.

[0207] The transceiver unit can also be referred to as a transceiver module, transceiver, transceiver machine, transceiver device, etc. The processing unit can also be referred to as a processor, processing board, processing unit, processing device, etc. Optionally, the device in the transceiver unit used to implement the receiving function can be considered as a receiving unit. It should be understood that the transceiver unit is used to execute the sending and receiving operations of the communication device in the above method embodiments, and the device in the transceiver unit used to implement the sending function can be considered as a sending unit; that is, the transceiver unit includes a receiving unit and a sending unit.

[0208] Furthermore, it should be noted that if the device is implemented using a chip / chip circuit, the transceiver unit can be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operations) and output operations (corresponding to the aforementioned sending operations); the processing unit is an integrated processor, microprocessor, or integrated circuit.

[0209] The following describes in detail the implementation of the device 600 in both the transmitting and receiving ends.

[0210] By way of example, when the device 600 is applied to the transmitting end, the operations performed by its various units will be described in detail.

[0211] In one optional implementation, the communication device 600 can be applied to a transmitting end to execute the method executed by the transmitting end, specifically, for example, the method executed by the transmitting end in the embodiment shown in FIG3 above.

[0212] For example, processing unit 601 determines the information length of the subcode and / or the boost value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability of the receiving end. Processing unit 601 is further configured to determine the coupling length L based on the information length of the subcode and the length of the information bits contained in the first sequence. Processing unit 601 is further configured to determine the parity check matrix based on the base matrix and the boost value. Processing unit 601 is further configured to encode the first sequence according to the parity check matrix to obtain a second sequence composed of L subcodes. Transceiver unit 602 is configured to transmit the second sequence.

[0213] By way of example, when the device 600 is applied to the receiving end, the operations performed by its various units will be described in detail.

[0214] In one optional implementation, the communication device 600 can be applied to a receiving end to execute the method executed by the receiving end, specifically, for example, the method executed by the receiving end in the embodiment shown in FIG4 above.

[0215] For example, transceiver unit 602 is used to acquire the second sequence. Processing unit 601 is used to determine the information length of the subcode and / or the lift value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability. Processing unit 601 is also used to determine the parity check matrix based on the base matrix and the lift value. Processing unit 601 is also used to decode the second sequence composed of L subcodes based on the parity check matrix and the information length of the subcodes to obtain the first sequence.

[0216] Based on the concept of the embodiments, as shown in FIG7, this application provides a communication device 700. The communication device 700 includes a processor 710. Optionally, the communication device 700 may further include a memory 720 for storing instructions executed by the processor 710, or storing input data required for the processor 710 to execute the instructions, or storing data generated after the processor 710 executes the instructions. The processor 710 can implement the method shown in the above method embodiments through the instructions stored in the memory 720.

[0217] Based on the concept of the embodiments, as shown in FIG8, this application provides a communication device 800, which may be a chip or a chip system. Optionally, in this application embodiment, the chip system may be composed of chips, or may include chips and other discrete devices.

[0218] The communication device 800 may include at least one processor 810 coupled to a memory. Optionally, the memory may be located within or outside the device. For example, the communication device 800 may also include at least one memory 820. The memory 820 stores computer programs, configuration information, computer programs or instructions, and / or data necessary for implementing any of the above embodiments; the processor 810 may execute the computer programs stored in the memory 820 to perform the methods in any of the above embodiments. Optionally, the memory may also be integrated with the processor.

[0219] The coupling in this embodiment is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 810 may operate in conjunction with the memory 820. This embodiment does not limit the specific connection medium between the transceiver 830, processor 810, and memory 820.

[0220] The communication device 800 may also include a transceiver 830, through which the communication device 800 can interact with other devices. The transceiver 830 can be a circuit, a bus, a transceiver itself, or any other device capable of information interaction, also referred to as a signal transceiver unit. As shown in Figure 8, the transceiver 830 includes a transmitter 831, a receiver 832, and an antenna 833. Furthermore, when the communication device 800 is a chip-type device or circuit, the transceiver in the communication device 800 can also be an input / output circuit and / or a communication interface, capable of inputting data (or receiving data) and outputting data (or transmitting data). The processor is an integrated processor, a microprocessor, or an integrated circuit, and the processor can determine the output data based on the input data.

[0221] In one possible implementation, the communication device 800 can be applied to a communication device. Specifically, the communication device 800 can be a communication device or an apparatus capable of supporting a communication device and implementing the functions of the transmitting end or receiving end in any of the above embodiments. The memory 820 stores the necessary computer programs, computer programs or instructions and / or data for implementing the functions of the transmitting end or receiving end in any of the above embodiments. The processor 810 can execute the computer programs stored in the memory 820 to perform the methods executed by the transmitting end or receiving end in any of the above embodiments.

[0222] In the embodiments of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0223] In the embodiments of this application, the memory can be non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), or it can be volatile memory, such as random-access memory (RAM). The memory can also be any other medium capable of carrying or storing desired program code in the form of instructions or data structures, and accessible by a computer, but is not limited thereto. The memory in the embodiments of this application can also be a circuit or any other device capable of implementing storage functions, used to store computer programs, computer program or instruction and / or data.

[0224] Based on the above embodiments, referring to FIG9, this application embodiment also provides another communication device 900, including: an input / output interface 910 and a logic circuit 920; the input / output interface 910 is used to receive code instructions and transmit them to the logic circuit 920; the logic circuit 920 is used to run the code instructions to execute the method executed by the sending end or the receiving end in any of the above embodiments.

[0225] The following is a detailed description of the operations performed by the device 900 when applied to a transmitting or receiving end.

[0226] In one optional implementation, the communication device 900 can be applied to a transmitting end to execute the method executed by the transmitting end, specifically, for example, the method executed by the transmitting end in the embodiment shown in FIG3 above.

[0227] For example, logic circuit 920 is used to determine the information length of the subcode and / or the boost value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability of the receiving end. Logic circuit 920 is also used to determine the coupling length L based on the information length of the subcode and the length of the information bits contained in the first sequence. Logic circuit 920 is also used to determine the parity check matrix based on the base matrix and the boost value. Logic circuit 920 is also used to encode the first sequence according to the parity check matrix to obtain a second sequence composed of L subcodes. Input / output interface 910 is used to output the second sequence.

[0228] Since the communication device 900 provided in this embodiment can be applied to a transmitting end to execute the method described above, the technical effects it can achieve can be referred to the above method embodiment, and will not be repeated here.

[0229] In one optional implementation, the communication device 900 can be applied to a receiving end to execute the method executed by the receiving end, specifically, for example, the method executed by the receiving end in the embodiment shown in FIG4 above.

[0230] For example, input / output interface 910 is used to input the second sequence. Logic circuit 920 is used to determine the information length of the subcode and / or the lift value of the base matrix of the subcode based on the first information. The first information indicates the decoding capability. Logic circuit 920 is also used to determine the parity check matrix based on the base matrix and the lift value. Logic circuit 920 is further used to decode the second sequence consisting of L subcodes based on the parity check matrix and the information length of the subcodes to obtain the first sequence.

[0231] Since the communication device 900 provided in this embodiment can be applied to a receiving end to execute the method described above, the technical effects it can achieve can be referred to the above method embodiment, and will not be repeated here.

[0232] Based on the above embodiments, this application also provides a communication system, which includes at least one receiving end and at least one transmitting end. The technical effects obtained can be referred to the above method embodiments, and will not be repeated here.

[0233] Based on the above embodiments, this application also provides a computer-readable storage medium storing a computer program or instructions. When the instructions are executed, the method performed by the communication device in any of the above embodiments is implemented. The computer-readable storage medium may include various media capable of storing program code, such as a USB flash drive, portable hard drive, read-only memory, random access memory, magnetic disk, or optical disk.

[0234] To achieve the functions of the communication devices shown in Figures 6 to 9, this application also provides a chip, including a processor, for supporting the communication device in implementing the functions involved in the transmitting or receiving end in the above method embodiments. In one possible design, the chip is connected to a memory or includes a memory for storing necessary computer programs, instructions, and data for the transmitting or receiving end.

[0235] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0236] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer programs or instructions. These computer programs or instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0237] These computer programs or instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0238] These computer programs or instructions may 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 one or more flowcharts and / or one or more block diagrams.

Claims

1. An encoding method, characterized in that, include: The information length of the subcode and the lifting value of the base matrix of the subcode are determined; wherein the information length of the subcode and / or the lifting value of the base matrix of the subcode are determined based on first information, the first information indicating the decoding capability of the receiving end; The coupling length L is determined based on the information length of the subcode and the length of the information bits contained in the first sequence; The parity check matrix is ​​determined based on the base matrix and the lifting value; The first sequence is encoded according to the parity check matrix to obtain a second sequence consisting of L sub-codes.

2. The method according to claim 1, characterized in that, Also includes: Receive the first information.

3. A decoding method, characterized in that, include: Obtain the second sequence, which consists of L sub-codes, and is obtained by encoding the first sequence; The information length of the subcode and the lifting value of the base matrix of the subcode are determined; wherein the information length of the subcode and / or the lifting value of the base matrix of the subcode are determined based on first information, the first information indicating the decoding capability of the receiving end; The parity check matrix is ​​determined based on the base matrix and the lifting value; The second sequence is decoded according to the parity check matrix and the information length of the subcode to obtain the first sequence; wherein, L is determined according to the information length of the subcode and the length of the information bits contained in the first sequence.

4. The method according to claim 3, characterized in that, Also includes: Send the first message.

5. The method according to any one of claims 1 to 4, characterized in that, The first information indicates the decoding capability of the receiving end, including: The first information indicates one or more of the following: the length of information bits that the receiving end can process during decoding, the length of codewords that the receiving end can process during decoding, or the decoding parallelism supported by the receiving end; or, The first information indicates one or more of the following: the maximum length of the codeword that the receiving end can process during decoding, the maximum length of the information length of the subcode that the receiving end can process during decoding, or the maximum value of the boost value during decoding.

6. The method according to any one of claims 1 to 5, characterized in that, The determination of the information length of the subcode and the lifting value of the basis matrix of the subcode include: Based on the first information, determine the lifting value of the base matrix of the subcode; The information length of the subcode is determined based on the lift value and the number of information columns in the base matrix.

7. The method according to any one of claims 1 to 5, characterized in that, The determination of the information length of the subcode and the lifting value of the basis matrix of the subcode include: Based on the first information, determine the information length of the sub-code; The lifting value of the base matrix of the subcode is determined based on the information length of the subcode and the number of information columns in the base matrix.

8. The method according to claim 6, characterized in that, The decoding capability indicates the length K of information bits that the receiving end can process during decoding. de The step of determining the lifting value of the base matrix of the subcode based on the first information includes: The K de When the range is i, the boost value is the i-th value l. i ; Wherein, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first value range, w1 be the maximum value in the first value range, and w2 be the value range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

9. The method according to claim 7, characterized in that, The decoding capability indicates the length K of information bits that the receiving end can process during decoding. de The step of determining the information length of the sub-code based on the first information includes: The K de When the range is i-th, the information length of the sub-code is the i-th value k. i ; Wherein, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first value range, w1 be the maximum value in the first value range, and w2 be the value range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

10. The method according to claim 7, characterized in that, The decoding capability indicates the length K of information bits that the receiving end can process during decoding. de The step of determining the information length of the sub-code based on the first information includes: Based on the first information, determine the code length of the sub-code; The information length of the subcode is determined based on the code length and the code rate of the subcode. Wherein, K de When the range is i, the code length of the subcode is n. i The K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first value range, w1 be the maximum value in the first value range, and w2 be the value range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

11. The method according to claim 6, characterized in that, The decoding capability indicates the length N of codewords that the receiving end can process during decoding. de The step of determining the lifting value of the base matrix of the subcode based on the first information includes: The N de When the range is m, the boost value is the m-th value l. m ; Wherein, K de One or more of the following conditions must be met: or, Where, N m The length of the codeword processed by the receiver during decoding within the m-th range, w1 represents the minimum value in the first value range, w2 represents the maximum value in the first value range, the first value range is the value range corresponding to the product of the decoding window length, the boost value and the number of information columns in the base matrix, w1 is less than or equal to w2, and p is an integer.

12. The method according to claim 7, characterized in that, The decoding capability indicates the length N of codewords that the receiving end can process during decoding. de The step of determining the information length of the sub-code based on the first information includes: Based on the first information, determine the code length of the sub-code; The information length of the subcode is determined based on the code length and the code rate of the subcode. The N de When the range is m, the code length of the subcode is n. m The N de One or more of the following conditions must be met: or, Where, N m Let w1 be the length of the information bits processed by the receiver during decoding within the m-th range, w2 be the minimum value in the first value range, w1 be the maximum value in the first value range, and w2 be the value range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

13. The method according to claim 7, characterized in that, The decoding capability indicates the length N of codewords that the receiving end can process during decoding. de The step of determining the information length of the sub-code based on the first information includes: The N de When the range is m, the information length of the sub-code is the m-th value k. m ; Wherein, K de One or more of the following conditions must be met: or, Among them, K i Let w1 be the length of the information bits processed by the receiver during decoding within the i-th range, w2 be the minimum value in the first value range, w1 be the maximum value in the first value range, and w2 be the value range corresponding to the product of the decoding window length, the boost value, and the number of information columns in the base matrix. w1 is less than or equal to w2, and p is an integer.

14. The method according to any one of claims 8 to 13, characterized in that, The w1 is equal to 3, 4, or 5; and / or, The w2 is equal to 15, 16 or 17.

15. A communication device, characterized in that, It includes a unit for performing the method as described in any one of claims 1, 2, 5 to 14, or includes a unit for performing the method as described in any one of claims 3 to 14.

16. A communication device, characterized in that, include: A processor coupled to a memory for storing a program or instructions which, when executed by the processor, cause the device to perform the method as claimed in any one of claims 1, 2, 5 to 14, or cause the device to perform the method as claimed in any one of claims 3 to 14.

17. The apparatus according to claim 16, characterized in that, The communication device also includes the memory.

18. A chip system, characterized in that, The chip system includes: Communication interface; A processor is configured to invoke and execute the instructions via the communication interface, causing a device equipped with the chip system to perform the method as described in any one of claims 1, 2, 5 to 14, or causing a device equipped with the chip system to perform the method as described in any one of claims 3 to 14.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions that, when invoked by an electronic device, cause the electronic device to perform the method as described in any one of claims 1, 2, 5 to 14, or cause the electronic device to perform the method as described in any one of claims 3 to 14.

20. A computer program product, characterized in that, It includes computer execution instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1, 2, 5 to 14, or cause the electronic device to perform the method as described in any one of claims 3 to 14.

21. A communication system, characterized in that, It includes a communication device for performing the method as described in any one of claims 1, 2, 5 to 14, and a communication device for performing the method as described in any one of claims 3 to 14.

Citation Information

Patent Citations

  • Communication method, communication device and communication system

    CN110289933A

  • Layered decoding method and device, terminal equipment and medium

    CN114499541A

  • Method and apparatus for encoding / decoding channel in communication or broadcasting system

    EP3661084A1

  • Processing method and device for quasi-cyclic low density parity check coding

    US20210013901A1