A data encoding method, a communication device and a computer readable storage medium

By determining the target redundant version and the starting position of the target data in communication technology, and extracting the target submatrix from the LDPC encoding matrix for encoding, the problem of delay and resource consumption during the encoding process is solved, and lower operations are achieved quantity and delay to improve decoding success rate.

CN115642985BActive Publication Date: 2024-12-03XINGCHENG (GUANGZHOU) TECH APPL CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211095862.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-06
Publication Date
2024-12-03
Estimated Expiration
2042-09-06

AI Technical Summary

Technical Problem

The existing communication technology has problems of delay and resource consumption during data transmission, especially during the encoding process.

Method used

By determining the target redundant version and the starting position of the target data, the target submatrix is ​​extracted from the LDPC encoding matrix for encoding, and only partial matrix operations are performed to reduce the single operation amount and delay.

Benefits of technology

It significantly reduces the computational volume and delay in the encoding process, especially when sending the first redundant version, the delay is low, which improves the decoding success rate.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115642985B_ABST
    Figure CN115642985B_ABST
Patent Text Reader

Abstract

The present invention relates to a data encoding method, a communication device and a computer-readable storage medium. The data encoding method comprises determining a target redundant version of data to be transmitted; determining the starting position of the target data according to the target redundant version when the encoded data is not calculated; determining a target sub-matrix from a coding matrix according to the starting position of the target data and the data length of the target data; encoding the data to be transmitted using the target sub-matrix to obtain the target data. The above method only involves the operation of a part of the matrix in a single data transmission, so the single operation amount is less and the operation speed is faster. In particular, when sending the first redundant version, the delay is low.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of communications, and in particular to a data encoding method, a communication device, and a computer-readable storage medium. Background Art

[0002] With the development of communication technology, the current mainstream communication method has reached 5G (fifth generation mobile communication technology). In some communication technologies, IR-HARQ (Incremental Redundancy-Hybrid Automatic Repeat reQuest) technology is used when transmitting data to improve the decoding success rate by retransmitting redundant versions. However, although the current communication means have superior performance, they still have disadvantages in terms of latency and resource consumption.

[0003] Therefore, how to reduce the encoding delay and computational complexity is an urgent problem to be solved. Summary of the invention

[0004] In view of the deficiencies of the above-mentioned related technologies, the purpose of the present application is to provide a data encoding method, a communication device and a computer-readable storage medium, aiming to solve the problems of time delay and high resource consumption in the encoding process.

[0005] A data encoding method, comprising:

[0006] Determining a target redundancy version of the data to be transmitted, wherein the coded data of the data to be transmitted is defined with at least two redundancy versions, the coded data is data obtained after the data to be transmitted is completely encoded by a coding matrix, each of the redundancy versions corresponds to a different starting position of the coded data, and the target redundancy version is one of the at least two redundancy versions;

[0007] In the case where the coded data is not calculated, determining a starting position of target data according to the target redundancy version, the target data being a portion of the coded data corresponding to the target redundancy version;

[0008] Determine a target sub-matrix from the encoding matrix according to the starting position of the target data and the data length of the target data, wherein the target sub-matrix is ​​a portion of the encoding matrix corresponding to the target data;

[0009] The target sub-matrix is ​​used to encode the data to be transmitted to obtain the target data.

[0010] Optionally, the target redundancy version includes at least one of the redundancy version currently required to be transmitted and the redundancy version to be transmitted next time.

[0011] Optionally, the coding matrix includes an LDPC coding matrix, and the LDPC coding matrix includes a core check matrix and an extended check matrix;

[0012] The encoded data includes a first subcode block corresponding to the core check matrix and a second subcode block corresponding to the extended check matrix.

[0013] Optionally, the redundancy version includes a first redundancy version, and a starting position corresponding to the first redundancy version is a header of the first subcode block;

[0014] The first redundancy version corresponds to a complete first subcode block and a portion of the second subcode block, and determining a target submatrix from the LDPC coding matrix according to a starting position of the target data and a data length of the target data includes:

[0015] It is determined that the target sub-matrix includes the complete core check matrix and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the first redundant version.

[0016] Optionally, the redundancy version includes a second redundancy version, the second redundancy version corresponds to a part of the second subcode block, and a range corresponding to the second redundancy version does not overlap with a range corresponding to the first redundancy version;

[0017] Determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes:

[0018] It is determined that the target sub-matrix includes a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the second redundancy version.

[0019] Optionally, the redundancy version includes a third redundancy version, a starting position corresponding to the third redundancy version is within the second subcode block, and the third redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block;

[0020] Determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes:

[0021] It is determined that the target submatrix includes a region of the core check matrix corresponding to the portion of the first subcode block corresponding to the third redundancy version and a region of the extended check matrix corresponding to the portion of the second subcode block corresponding to the third redundancy version.

[0022] Optionally, the redundancy version includes a fourth redundancy version, a starting position corresponding to the fourth redundancy version is within the first subcode block, and the fourth redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block;

[0023] Determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes:

[0024] It is determined that the target sub-matrix includes a region of the core check matrix corresponding to the portion of the first subcode block corresponding to the fourth redundancy version and a region of the extended check matrix corresponding to the portion of the second subcode block corresponding to the fourth redundancy version.

[0025] Optionally, the data to be transmitted includes a code block generated according to a transmission block.

[0026] Based on the same inventive concept, the present application also provides a communication device, the communication device comprising a processor, a memory and a communication bus;

[0027] The communication bus is used to realize the connection and communication between the processor and the memory;

[0028] The processor is used to execute one or more programs stored in the memory to implement the steps of the above-mentioned data encoding method.

[0029] Based on the same inventive concept, the present application also provides a computer-readable storage medium, which stores one or more programs. The one or more programs can be executed by one or more processors to implement the steps of the above-mentioned data encoding method.

[0030] Beneficial Effects

[0031] The data encoding method, communication device and computer-readable storage medium provided by the present invention, in the process of encoding data, only use a part of the encoding matrix to perform encoding operation according to the target redundant version, a single operation only involves the operation of a part of the matrix, the single operation amount is less, and the operation speed is faster, especially when sending the first redundant version, the delay is low; and in some implementation processes, such as in the scenario with a high first decoding success rate, the overall amount of operation and delay can be significantly reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 A schematic diagram of a basic flow chart of a data encoding method provided by an embodiment of the present invention;

[0033] Figure 2 A schematic diagram of an LDPC coding matrix provided in an embodiment of the present invention;

[0034] Figure 3 A schematic diagram of coded data and redundant versions provided by an embodiment of the present invention;

[0035] Figure 4 A schematic diagram of a coding range corresponding to a redundancy version RV0 provided in an embodiment of the present invention;

[0036] Figure 5 A schematic diagram of a coding range corresponding to a redundancy version RV2 provided in an embodiment of the present invention;

[0037] Figure 6 A schematic diagram of a coding range corresponding to a redundancy version RV3 provided in an embodiment of the present invention;

[0038] Figure 7 A schematic diagram of a coding range corresponding to a redundancy version RV1 provided in an embodiment of the present invention;

[0039] Figure 8 A schematic structural diagram of a communication device provided in yet another optional embodiment of the present invention. DETAILED DESCRIPTION

[0040] In order to facilitate the understanding of the present application, the present application will be described more fully below with reference to the relevant drawings. The preferred embodiments of the present application are given in the drawings. However, the present application can be implemented in many different forms and is not limited to the embodiments described herein. On the contrary, the purpose of providing these embodiments is to make the disclosure of the present application more thoroughly and comprehensively understood.

[0041] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein in the specification of this application are only for the purpose of describing specific embodiments and are not intended to limit this application.

[0042] Example:

[0043] This embodiment provides a data encoding method. Figure 1 As shown, including:

[0044] S101, determining a target redundant version of data to be transmitted;

[0045] S102, determining the starting position of the target data according to the target redundant version;

[0046] S103, determining a target sub-matrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data;

[0047] S104, using the target sub-matrix to encode the data to be transmitted to obtain target data;

[0048] In this embodiment, the coded data to be transmitted is defined to have at least two redundant versions, and the redundant versions correspond to different starting positions of the coded data. It should be noted that the coded data is the data obtained after the data to be transmitted is completely encoded by the coding matrix. Exemplarily, this embodiment corresponds to the use of IR-HARQ technology or similar technology when transmitting data. In the process of information transmission, the transmitter first sends a redundant version of the data. If the receiving end does not successfully decode, then the transmitter can send another redundant version of the data.

[0049] The data to be transmitted in this embodiment includes a code block generated according to a transmission block. Exemplarily, the code block can be obtained by cutting the transmission block. In some examples, a transmission block greater than a predetermined length is cut into a code block of a predetermined length. In other examples, if the length of the transmission block is less than the predetermined length, the transmission block can be used as a code block. In practical applications, each code block can also be added with a CRC (Cyclical Redundancy Check) code.

[0050] In the above data encoding method, the target redundant version to be encoded is first determined, and the starting position of the target data is determined. In this process, the encoded data is not calculated. That is to say, this embodiment does not completely encode the data to be transmitted. Since each transmission only involves one redundant version, the encoded data will not be completely sent at one time. In this embodiment, the starting position of the target data is first determined according to the target redundant version. The target data is the part of the encoded data corresponding to the target redundant version, that is, the target data is actually the part of the data that will be actually sent during this data transmission. Of course, the target data can only be obtained after the data to be encoded is encoded. Although the data to be encoded is not encoded in advance in this embodiment, the target redundant version can reflect the starting position of this section of the target data. In addition, according to the actual transmission requirements, the data length of each transmission can also be determined before encoding.

[0051] It is understandable that, although the complete coded data is not determined, knowing the starting position of the target data and its data length is sufficient to determine the position range of the target data in the entire coded data. The encoding process of this embodiment depends on the coding matrix, and the determined coding matrix can compile the complete coded data. Based on the calculation rules of the matrix, when using part of the content of the matrix, the partial data corresponding to this part of the matrix can also be calculated.

[0052] The target sub-matrix is ​​a part of the encoding matrix. Specifically, the target sub-matrix is ​​the part of the encoding matrix corresponding to the target data. The target data is obtained by operating the target sub-matrix with the data to be encoded.

[0053] It can be seen that the data encoding method of this embodiment, in the process of encoding data, only uses a part of the encoding matrix according to the target redundant version to perform encoding operations. Compared with the method in the related art of first calculating the complete encoded data and then intercepting and sending the part corresponding to the redundant version, the above method of this embodiment only involves the operation of part of the matrix in a single operation, with less single operation amount and faster operation speed, especially when sending the first redundant version, the transmission delay is low; and in some implementation processes, such as in the scenario with a high first decoding success rate, the overall operation amount and delay can be significantly reduced.

[0054] The target redundant version in this embodiment may be the redundant version currently required to be transmitted, that is, this embodiment may partially encode the data of the redundant version currently required to be transmitted. The target redundant version may also be the redundant version required to be transmitted next time, and similarly, only the required data is obtained by encoding, and the data that does not need to be transmitted does not need to be calculated.

[0055] In some implementations, the coding matrix includes but is not limited to a coding matrix such as an LDPC coding matrix that can encode redundant check information, such as Figure 2 As shown, the LDPC coding matrix includes a core check matrix A and an extended check matrix B; the coded data includes a first subcode block corresponding to the core check matrix A and a second subcode block corresponding to the extended check matrix B. The core check matrix A completes the basic LDPC coding, and the extended check matrix B is used to generate redundant check information to complete IR-HARQ and adapt to different code rate requirements. The LDPC coding matrix in this embodiment may have been adapted to the code rate requirement, that is, its extended check matrix B has been designed according to the required code rate requirement. The data encoding method of this embodiment can actually be applicable to the communication process of any code rate. Exemplarily, the extended check matrix B includes but is not limited to at least one of a row quasi-orthogonal matrix, a row orthogonal matrix, and a non-row orthogonal matrix; this embodiment does not limit the specific design method of the extended check matrix B, and other matrices or combinations of matrices can also be used as the extended check matrix B. For ease of understanding, see Figure 3 In the IR-HARQ protocol, the coded data is defined as a circular cyclic structure. In the related art, the coded data can be put into a circular buffer for use after being obtained. For example, Figure 3 The coded data is displayed clockwise in the circular loop, and the tail of the second subcode block 20 is connected to the head of the first subcode block 10. In this embodiment, the coded data in the example is not actually obtained, but the redundant version and the actual data corresponding thereto still apply the same rules.

[0056] Exemplarily, the redundant versions of the data to be transmitted include at least two, each redundant version corresponds to a different starting position, and at least one of the redundant versions has independent decoding capability. The data of the redundant version with independent decoding capability at least includes a complete first subcode block and a part of a second subcode block, and decoding can be attempted through the information contained in itself. In practical applications, the redundant version that is ranked first in order among the redundant versions usually has independent decoding capability.

[0057] In some implementations, the redundancy version includes a first redundancy version, the starting position corresponding to the first redundancy version is the head of the first subcode block, the first redundancy version corresponds to the complete first subcode block and part of the second subcode block, and the determining the target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes:

[0058] It is determined that the target sub-matrix includes the complete core check matrix and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the first redundant version.

[0059] In some implementations, the redundancy version includes a second redundancy version, the second redundancy version corresponds to a portion of the second subcode block, and a range corresponding to the second redundancy version does not overlap with a range corresponding to the first redundancy version;

[0060] The target submatrix is ​​determined from the LDPC coding matrix according to the starting position of the target data and the data length of the target data, including:

[0061] The target sub-matrix is ​​determined to include a region in the extended check matrix corresponding to the portion of the second sub-code block corresponding to the second redundant version.

[0062] In some implementations, the redundancy version includes a third redundancy version, a starting position corresponding to the third redundancy version is within the second subcode block, and the third redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block;

[0063] The target submatrix is ​​determined from the LDPC coding matrix according to the starting position of the target data and the data length of the target data, including:

[0064] The target sub-matrix is ​​determined to include a region of the core check matrix corresponding to the portion of the first sub-code block corresponding to the third redundancy version and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the third redundancy version.

[0065] In some implementations, the redundancy version includes a fourth redundancy version, a starting position corresponding to the fourth redundancy version is within the first subcode block, and the fourth redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block.

[0066] For better understanding, the data encoding method of this embodiment is described below with reference to an example of a specific communication process.

[0067] In this example, the coded data of the data to be transmitted is defined as four redundancy versions: RV0, RV1, RV2, and RV3. The starting position of each redundancy version is as follows: Figure 3 As shown, the starting position of the redundancy version RV0 is at the head of the first subcode block 10, the starting position of the redundancy version RV1 is at a certain position in the first subcode block 10, the starting positions of the redundancy versions RV2 and RV3 are respectively at a certain position in the second subcode block 20, and the starting positions of the redundancy versions RV0, RV1, RV2 and RV3 are distributed in the clockwise direction of the figure and are different. Under the premise of meeting the requirements of the specification, the data length corresponding to each redundancy version is determined according to the actual situation, and this example is not limited.

[0068] The redundant version RV0 (data) covers the complete first subcode block 10 and part of the second subcode block 20, so the redundant version RV0 has the ability of self-decoding; when it is sent for the first time, the redundant version RV0 is sent first. Figure 4 As shown, in this embodiment, the matrix within the range of X1 in the LDPC coding matrix is ​​determined as the target sub-matrix according to the starting position and length of the redundant version RV0. The target sub-matrix is ​​used to encode the code block to be transmitted this time. The target sub-matrix can be cut out separately, or the encoding can be ended when the boundary of the target sub-matrix is ​​encoded. The target data obtained is the part of the data corresponding to the redundant version RV0 in the encoded data. After obtaining the target data, the target data can be sent to the receiving end, and the receiving end attempts to decode after receiving the target data.

[0069] If the receiving end receives information that has not been successfully decoded, the next redundant version needs to be sent. In this embodiment, the redundant versions are sent in the order of RV0, RV2, RV3 and RV1, so the redundant version RV2 needs to be sent. In some implementations, the receiving end may not feedback whether the decoding is successful, but directly request the data to be transmitted from the transmitting end again. In this case, the next redundant version also needs to be encoded and sent.

[0070] Encode the redundant version RV2. In this example, the redundant version RV2 does not overlap with the redundant version RV0. In some examples, the redundant version RV2 can complement the redundant version RV0 to form a complete encoded data. Figure 5 As shown, according to the starting position and length of the redundant version RV2, the matrix within the range of X2 in the LDPC coding matrix is ​​determined as the target submatrix, and the range of X2 in the LDPC coding matrix includes a part of the extended check matrix.

[0071] If the receiving end receives information that has not been successfully decoded, the redundant version RV3 is encoded in sequence, and the redundant version RV3 includes the rear end portion of the second subcode block 20 and the front end portion of the first subcode block 10. Figure 6 As shown, according to the starting position and length of the redundant version RV3, the matrix within the range of X3 in the LDPC coding matrix is ​​determined as the target submatrix, and the range of X3 in the LDPC coding matrix includes a part of the core check matrix and a part of the extended check matrix.

[0072] Similarly, if the receiving end still receives information that has not been successfully decoded, the redundant version RV4 is encoded in sequence, and the redundant version RV4 includes the rear end portion of the first subcode block 10 and the front end portion of the second subcode block 20. Figure 7 As shown, according to the starting position and length of the redundant version RV4, the matrix within the range of X4 in the LDPC coding matrix is ​​determined as the target submatrix, and the range of X4 in the LDPC coding matrix includes a part of the core check matrix and a part of the extended check matrix. It can be understood that due to the different starting positions of the redundant version RV4 and the redundant version RV3, although both partially cover the core check matrix and the extended check matrix, the range of X4 in the LDPC coding matrix is ​​not the same as the range of X3 in the LDPC coding matrix.

[0073] In practical applications, the division of redundant versions of coded data may also be carried out in other forms, which are not limited in this embodiment. Redundant versions divided in other forms may also adopt the data encoding method described above in this embodiment to achieve the effect of lower single encoding delay and lower computational complexity.

[0074] In the above example, after receiving the message that needs to be encoded, the data to be encoded is encoded to obtain the target data.

[0075] As another example, the target data may be obtained in advance before receiving the message to be encoded, that is, the target redundant version may not be the redundant version to be transmitted immediately.

[0076] Exemplarily, the redundancy version definition of this example is the same as that of the previous example. When sending for the first time, the redundancy version RV0 is still sent first. When sending the redundancy version RV0, the data encoding method in this embodiment is still used, and only the part of the matrix corresponding to the redundancy version RV0 is used to encode the data to be encoded. The target data obtained is the part of the data corresponding to the redundancy version RV0 in the encoded data. After obtaining the target data, the target data can be sent to the receiving end, and the receiving end attempts to decode after receiving the target data.

[0077] In this example, after the encoding of the redundant version RV0 is completed, the redundant version RV2 to be sent next time is encoded immediately, that is, the redundant version RV2 is used as the target redundant version, and the matrix within the range of X2 in the LDPC coding matrix is ​​determined as the target sub-matrix according to the starting position and length of the redundant version RV2. The target data encoded according to the redundant version RV2 can be pre-stored in the cache. When the receiving end receives information that the receiving end has not successfully decoded, the target data encoded by the redundant version RV2 can be immediately sent to the receiving end. In addition, after the target data encoded by the redundant version RV2 is sent, the target data of the redundant version RV3 to be sent next time can be pre-encoded using the above method. If the receiving end successfully decodes according to the target data, the target data stored in the cache can be cleared.

[0078] This example pre-encodes the redundant version that may need to be transmitted. During the encoding process, only part of the encoding matrix needs to be used according to the data covered by the redundant version itself. The single encoding operation amount and delay are low, and the overall communication delay is lower, especially in scenarios with low decoding success rate.

[0079] Another optional embodiment of the present invention:

[0080] This embodiment provides a communication device, such as Figure 8 As shown, it includes a processor 801, a memory 802 and a communication bus 803;

[0081] The communication bus 803 is used to realize the connection and communication between the processor 801 and the memory 802;

[0082] The processor 801 is used to execute one or more programs stored in the memory 802 to implement the steps of the data encoding method in the above embodiment.

[0083] The present embodiment also provides a computer-readable storage medium, which includes volatile or non-volatile, removable or non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, computer program modules or other data). Computer-readable storage media include, but are not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable read only memory), flash memory or other memory technology, CD-ROM (Compact Disc Read-Only Memory), digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer.

[0084] The computer-readable storage medium in this embodiment can be used to store one or more computer programs, and the one or more computer programs stored therein can be executed by a processor to implement the steps of the data encoding method in the above embodiment.

[0085] It should be understood by those skilled in the art that all or some of the steps, systems, and functional modules / units in the above disclosed methods may be implemented as software (which may be implemented using computer program code executable by a computing device), firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or may be implemented as hardware, or may be implemented as an integrated circuit, such as an application-specific integrated circuit.

[0086] In addition, it is well known to those skilled in the art that communication media generally contain computer readable instructions, data structures, computer program modules or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery media. Therefore, the present invention is not limited to any specific hardware and software combination.

[0087] The data encoding method of this embodiment can be applied in scenarios including but not limited to 5G communication technology or other types of communication technology. It should be understood that the application of the present invention is not limited to the above examples. For ordinary technicians in this field, they can be improved or transformed according to the above description, and all these improvements and transformations should fall within the scope of protection of the claims attached to the present invention.

Claims

1. A data encoding method, It is characterized in that include: Determining a target redundancy version of the data to be transmitted, wherein the coded data of the data to be transmitted is defined with at least two redundancy versions, the coded data is data obtained after the data to be transmitted is completely encoded by a coding matrix, each of the redundancy versions corresponds to a different starting position of the coded data, and the target redundancy version is one of the at least two redundancy versions; In the case where the coded data is not calculated, determining a starting position of target data according to the target redundancy version, the target data being a portion of the coded data corresponding to the target redundancy version; Determine a target sub-matrix from the encoding matrix according to the starting position of the target data and the data length of the target data, wherein the target sub-matrix is ​​a portion of the encoding matrix corresponding to the target data; encoding the data to be transmitted using the target sub-matrix to obtain the target data; The coding matrix includes an LDPC coding matrix; the coded data includes a first subcode block corresponding to a core check matrix and a second subcode block corresponding to an extended check matrix; the redundant version includes a first redundant version, the first redundant version corresponds to a complete first subcode block and a portion of the second subcode block, and determining a target submatrix from the LDPC coding matrix according to a starting position of the target data and a data length of the target data includes: Determining that the target sub-matrix includes the complete core check matrix and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the first redundant version; Among them, the first redundant version is the one that ranks first in order among the redundant versions.

2. The data encoding method according to claim 1, It is characterized in that The target redundancy version includes at least one of the redundancy version currently required to be transmitted and the redundancy version to be transmitted next time.

3. The data encoding method according to claim 1, It is characterized in that The LDPC coding matrix includes a core check matrix and an extended check matrix.

4. The data encoding method according to claim 3, It is characterized in that The starting position corresponding to the first redundancy version is the head of the first subcode block.

5. The data encoding method according to claim 4, It is characterized in that The redundancy version includes a second redundancy version, the second redundancy version corresponds to a portion of the second subcode block, and a range corresponding to the second redundancy version does not overlap with a range corresponding to the first redundancy version; Wherein, in a case where the previous target redundant version is not successfully decoded, determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes: It is determined that the target sub-matrix includes a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the second redundancy version.

6. The data encoding method according to claim 5, It is characterized in that The redundancy version includes a third redundancy version, a starting position corresponding to the third redundancy version is within the second subcode block, and the third redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block; Wherein, in a case where the previous target redundant version is not successfully decoded, determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes: It is determined that the target submatrix includes a region of the core check matrix corresponding to the portion of the first subcode block corresponding to the third redundancy version and a region of the extended check matrix corresponding to the portion of the second subcode block corresponding to the third redundancy version.

7. The data encoding method according to claim 6, It is characterized in that The redundancy version includes a fourth redundancy version, a starting position corresponding to the fourth redundancy version is within the first subcode block, and the fourth redundancy version corresponds to a portion of the first subcode block and a portion of the second subcode block; Wherein, in a case where the previous target redundant version is not successfully decoded, determining a target submatrix from the LDPC coding matrix according to the starting position of the target data and the data length of the target data includes: It is determined that the target sub-matrix includes a region of the core check matrix corresponding to the portion of the first subcode block corresponding to the fourth redundancy version and a region of the extended check matrix corresponding to the portion of the second subcode block corresponding to the fourth redundancy version.

8. The data encoding method according to any one of claims 1 to 7, It is characterized in that The data to be transmitted includes a code block generated according to a transmission block.

9. A communication device, It is characterized in that The communication device includes a processor, a memory and a communication bus; The communication bus is used to realize the connection and communication between the processor and the memory; The processor is used to execute one or more programs stored in the memory to implement the steps of the data encoding method according to any one of claims 1 to 8.

10. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the data encoding method according to any one of claims 1-8.