CN115642985A - Data encoding method, communication device and computer readable storage medium - Google Patents
Data encoding method, communication device and computer readable storage medium Download PDFInfo
- Publication number
- CN115642985A CN115642985A CN202211095862.8A CN202211095862A CN115642985A CN 115642985 A CN115642985 A CN 115642985A CN 202211095862 A CN202211095862 A CN 202211095862A CN 115642985 A CN115642985 A CN 115642985A
- Authority
- CN
- China
- Prior art keywords
- data
- sub
- target
- redundancy version
- matrix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000006854 communication Effects 0.000 title claims abstract description 30
- 238000004891 communication Methods 0.000 title claims abstract description 29
- 239000011159 matrix material Substances 0.000 claims abstract description 145
- 230000005540 biological transmission Effects 0.000 abstract description 8
- 238000005516 engineering process Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 238000004590 computer program Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention relates to a data encoding method, a communication device and a computer readable storage medium, wherein the data encoding method comprises the steps of determining a target redundancy version of data to be transmitted; under the condition that the coded data is not calculated, determining the initial position of the target data according to the target redundancy version; determining a target sub-matrix from the coding matrix according to the initial position of the target data and the data length of the target data; the method has the advantages that the target submatrix is adopted to encode the data to be transmitted to obtain the target data, single data transmission only involves the operation of partial matrixes, the single operation amount is less, the operation speed is higher, and particularly when the first redundancy version is sent, the time delay is lower.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a data encoding method, a communication apparatus, and a computer-readable storage medium.
Background
With the development of communication technology, the current main stream communication mode has reached 5G (fifth generation mobile communication technology). In some communication technologies, an IR-HARQ (Incremental Redundancy-Hybrid Automatic Repeat reQuest) technology is used to transmit data, and the decoding success rate is increased by retransmitting a Redundancy version. However, although the current communication means has excellent performance, there are still disadvantages in terms of delay and resource consumption.
Therefore, how to reduce the coding delay and the computation amount is an urgent problem to be solved.
Disclosure of Invention
In view of the above-mentioned shortcomings of the related art, the present application aims to provide a data encoding method, a communication device and a computer readable storage medium, which aim to solve the problems of time delay and large resource consumption of the encoding process.
A method of data encoding comprising:
determining a target redundancy version of data to be transmitted, wherein at least two redundancy versions are defined in encoded data of the data to be transmitted, the encoded data is data obtained by completely encoding the data to be transmitted through an encoding matrix, each redundancy version corresponds to different initial positions of the encoded data, and the target redundancy version is one of the at least two redundancy versions;
under the condition that the coded data are not calculated, determining the initial position of target data according to the target redundancy version, wherein the target data are the parts, corresponding to the target redundancy version, in the coded data;
determining a target sub-matrix from the coding matrix according to the initial position of the target data and the data length of the target data, wherein the target sub-matrix is a part of the coding matrix corresponding to the target data;
and coding the data to be transmitted by adopting the target sub-matrix to obtain the target data.
Optionally, the target redundancy version includes at least one of the redundancy version currently required to be transmitted and the redundancy version required to be transmitted next time.
Optionally, the encoding matrix comprises an LDPC encoding matrix comprising a core check matrix and an extended check matrix;
the encoded data includes a first sub-code block corresponding to the core check matrix and a second sub-code block corresponding to the extended check matrix.
Optionally, the redundancy version includes a first redundancy version, and a start position corresponding to the first redundancy version is a header of the first sub code block;
the first redundancy version corresponds to the complete first sub-code block and a part of the second sub-code block, and 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 includes:
determining that the target sub-matrix comprises the complete core check matrix and the region of the extended check matrix corresponding to the part of the second sub-code block corresponding to the first redundancy version.
Optionally, the redundancy versions include a second redundancy version, the second redundancy version corresponds to a portion of the second sub-code block, and a range corresponding to the second redundancy version does not overlap with a range corresponding to the first redundancy version;
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 comprises:
determining that the target sub-matrix comprises a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the second redundancy version.
Optionally, the redundancy versions include a third redundancy version, the third redundancy version corresponding to a starting position within the second sub-code block, the third redundancy version corresponding to a portion of the first sub-code block and a portion of the second sub-code block;
the 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 includes:
determining that the target sub-matrix comprises 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.
Optionally, the redundancy versions include a fourth redundancy version, the fourth redundancy version corresponding to a starting position within the first sub-code block, the fourth redundancy version corresponding to a portion of the first sub-code block and a portion of the second sub-code block;
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 comprises:
determining that the target sub-matrix comprises a region of the core check matrix corresponding to the portion of the first sub-code block corresponding to the fourth redundancy version and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the fourth redundancy version.
Optionally, the data to be transmitted includes code blocks generated from a transport block.
Based on the same inventive concept, the application also provides a communication device, which comprises a processor, a memory and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute one or more programs stored in the memory to implement the steps of the data encoding method described above.
Based on the same inventive concept, the present application also provides a computer-readable storage medium storing one or more programs, which are executable by one or more processors to implement the steps of the above-described data encoding method.
Advantageous effects
According to the data encoding method, the communication device and the computer readable storage medium, in the process of encoding data, only one part of the encoding matrix is used for encoding operation according to the target redundancy version, single operation only relates to operation of a partial matrix, the single operation amount is less, the operation speed is higher, and particularly when the first redundancy version is sent, the time delay is lower; in some implementations, for example, in a scenario where the first decoding success rate is high, the overall computation amount and delay can be significantly reduced.
Drawings
Fig. 1 is a schematic basic flow chart of a data encoding method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an LDPC encoding matrix provided by an embodiment of the present invention;
FIG. 3 is a schematic diagram of encoded data and redundancy versions provided by an embodiment of the present invention;
fig. 4 is a schematic diagram of a coding range corresponding to a redundancy version RV0 according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a coding range corresponding to a redundancy version RV2 according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a coding range corresponding to a redundancy version RV3 according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a coding range corresponding to a redundancy version RV1 according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a communication device according to yet another alternative embodiment of the present invention.
Detailed Description
To facilitate an understanding of the present application, the present application will now be described more fully with reference to the accompanying drawings. Preferred embodiments of the present application are given in the accompanying drawings. This application may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein in the description of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application.
Example (b):
the present embodiment provides a data encoding method, as shown in fig. 1, including:
s101, determining a target redundancy version of data to be transmitted;
s102, determining the initial position of target data according to the target redundancy version;
s103, determining a target sub-matrix from the LDPC coding matrix according to the initial position of the target data and the data length of the target data;
s104, encoding data to be transmitted by adopting a target sub-matrix to obtain target data;
in this embodiment, the encoded data to be transmitted is defined with at least two redundancy versions, where the redundancy versions correspond to different initial positions of the encoded data, and it should be noted that the encoded data is obtained by completely encoding the data to be transmitted by using an encoding matrix. For example, in this embodiment, an IR-HARQ technique or the like is correspondingly used when transmitting data, and in the process of information transmission, the transmitting end first sends data of one redundancy version, and if the receiving end fails to decode successfully, the transmitting end may send data of another redundancy version.
The data to be transmitted in the present embodiment includes code blocks generated from transport blocks. For example, the code block may be obtained by cutting a transport block, in some examples, a transport block larger than a predetermined length is cut into a code block of a predetermined length, in other examples, the transport block may be regarded as a code block if the length of the transport block is smaller than the predetermined length. In practical applications, each code block may further be added with a Cyclic Redundancy Check (CRC) code.
In the data coding method, the target redundancy version needing to be coded is determined, the initial position of the target data is determined, and the coded data are not calculated in the process. That is to say, this embodiment does not perform complete encoding on data to be transmitted, and since each transmission only involves one of the redundancy versions, the encoded data is not completely transmitted at one time. Of course, the target data can be obtained only after the data to be encoded is encoded, and although the data to be encoded is not encoded in advance in the embodiment, the target redundancy version can reflect the start position of the target data. In addition, according to the actual transmission requirement, the data length of each transmission can be determined before encoding.
It will be appreciated that although the complete encoded data is not determined, knowing the starting position of the target data and its data length is sufficient to determine the range of positions of the target data within the entire encoded data. In the encoding process of this embodiment, the determined encoding matrix can be used to encode complete encoded data depending on the encoding matrix, and based on the calculation rule of the matrix, when partial content of the matrix is used, partial data corresponding to the partial matrix can also be calculated.
The target sub-matrix is a part of the encoding matrix, and specifically, the target sub-matrix is a part of the encoding matrix corresponding to the target data, and the data to be encoded and the target sub-matrix are operated, and the obtained result is the target data.
It can be seen that, in the data encoding method of this embodiment, in the process of encoding data, only a part of the encoding matrix is used for encoding operation according to the target redundancy version. Compared with the method of calculating complete coded data first and then intercepting and sending the part corresponding to the redundancy version in the related technology, the method of the embodiment only relates to the operation of a partial matrix in a single operation, the single operation amount is less, the operation speed is higher, and especially when the first redundancy version is sent, the transmission delay is low; in some implementations, for example, in a scenario where the first decoding success rate is high, the overall computation amount and delay can be significantly reduced.
The target redundancy version in this embodiment may be a redundancy version that needs to be currently transmitted, that is, this embodiment may perform partial encoding on the part of data of the redundancy version that needs to be currently transmitted. The target redundancy version can also be a redundancy version which needs to be transmitted next time, and the required data is obtained by encoding only, and the data which does not need to be transmitted does not need to be operated.
In some embodiments, the encoding matrix includes, but is not limited to, an LDPC encoding matrix and other encoding matrices capable of encoding to obtain redundant check information, as shown in fig. 2, the LDPC encoding matrix includes a core check matrix a and an extended check matrix B; the encoded data includes a first sub-code block corresponding to the core check matrix a and a second sub-code block corresponding to the extended check matrix B. The core check matrix A completes basic LDPC coding, and the extension check matrix B is used for generating 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, the extended check matrix B is designed according to the required code rate requirement, and the data coding method of this embodiment can be practically applied to the communication process with any code rate. Illustratively, 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; the specific design manner of the extended check matrix B is not limited in this embodiment, and other matrices or combinations of matrices may also be used as the extended check matrix B. For ease of understanding, referring to fig. 3, in the IR-HARQ protocol, the encoded data is defined as a circular structure, and in the related art, the encoded data may be put into a circular buffer for use after being obtained, for example, the encoded data of fig. 3 is shown in a clockwise direction in a circular loop, and the tail of the second sub-code block 20 is connected to the head of the first sub-code block 10. In this embodiment, the encoded data in the example is not actually obtained, but the same rule is still applied to the redundancy version and the corresponding actual data.
Illustratively, the redundancy versions of the data to be transmitted include at least two, each redundancy version corresponds to a different starting position, and at least one of the redundancy versions has an independent decoding capability. The redundancy version data with independent decoding capability at least comprises a complete first sub-code block and a part of a second sub-code block, and decoding can be attempted through information contained in the data. In practical applications, the sequential first-order redundancy versions have independent decoding capability.
In some embodiments, the redundancy versions include a first redundancy version, the start position of the first redundancy version corresponds to the head of the first sub-code block, the first redundancy version corresponds to the complete first sub-code block and a part of the second sub-code block, and determining a target sub-matrix from the LDPC coding matrix according to the start position of the target data and the data length of the target data includes:
determining that the target sub-matrix comprises the complete core check matrix and the region of the extended check matrix corresponding to the part of the second sub-code block corresponding to the first redundancy version.
In some embodiments, the redundancy versions include a second redundancy version, the second redundancy version corresponds to a portion of the second sub-code block, and a range to which the second redundancy version corresponds does not overlap with a range to which the first redundancy version corresponds;
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 comprises:
it is determined that the target sub-matrix comprises a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the second redundancy version.
In some embodiments, the redundancy versions include a third redundancy version corresponding to a starting position within the second sub-code block, the third redundancy version corresponding to a portion of the first sub-code block and a portion of the second sub-code block;
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 comprises:
and determining that the target sub-matrix comprises the area of the core check matrix corresponding to the part of the first sub-code block corresponding to the third redundancy version and the area of the extended check matrix corresponding to the part of the second sub-code block corresponding to the third redundancy version.
In some embodiments, the redundancy versions include a fourth redundancy version having a starting position within the first sub-code block and corresponding to a portion of the first sub-code block and a portion of the second sub-code block.
For better understanding, the data encoding method of the present embodiment is described below with reference to an example of a specific communication procedure.
In this example, four redundancy versions RV0, RV1, RV2, and RV3 are defined as the encoded data of the data to be transmitted, the starting position of each redundancy version is shown in fig. 3, the starting position of the redundancy version RV0 is at the head of the first sub-code block 10, the starting position of the redundancy version RV1 is at a certain position in the first sub-code block 10, the starting positions of the redundancy version RV2 and the redundancy version RV3 are at certain positions in the second sub-code block 20, and the starting positions of the redundancy versions RV0, RV1, RV2, and RV3 are distributed in the clockwise direction of the drawing and are different from each other. On the premise of meeting the specification requirement, the data length corresponding to each redundancy version is determined according to the actual situation, and this example is not limited.
Wherein (the data of) the redundancy version RV0 covers the complete first sub-code block 10 and part of the second sub-code block 20, and thus the redundancy version RV0 has self-decoding capability; when the first transmission is carried out, the redundancy version RV0 is transmitted firstly. As shown in fig. 4, in this embodiment, a matrix within the range of X1 in the LDPC coding matrix is determined as a target sub-matrix according to the start position and the length of the redundancy version RV0. And coding the code block needing to be transmitted at this time by adopting the target sub-matrix, wherein the target sub-matrix can be independently cut out, or the coding is finished when the code block reaches the boundary of the target sub-matrix. The obtained target data is the part of the encoded data corresponding to the redundancy version RV0, and after the target data is obtained, the target data can be sent to a receiving end, and the receiving end tries to decode after receiving the target data.
If the information that the receiving end has not successfully decoded is received, the next redundancy version needs to be transmitted at this time, and in this embodiment, the transmission order of the redundancy versions is RV0, RV2, RV3, and RV1 in sequence, so that the redundancy version RV2 needs to be transmitted at this time. In some implementation processes, the receiving end may also directly request the transmitting end for data to be transmitted again without feeding back whether the decoding is successful, and at this time, the next redundancy version also needs to be encoded and transmitted.
The redundancy version RV2 is encoded, in this example, the redundancy version RV2 and the redundancy version RV0 do not overlap with each other, and in some examples, the redundancy version RV2 may complement the redundancy version RV0 to form complete encoded data. As shown in fig. 5, a matrix within the range of X2 in the LDPC coding matrix is determined as a target sub-matrix according to the starting position and the length of the redundancy version RV2, and a part of the extended check matrix is included within the range of X2 in the LDPC coding matrix.
If information that the receiving end has not successfully decoded is received, the redundancy version RV3 is encoded in sequence, and the redundancy version RV3 includes a rear portion of the second sub-code block 20 and a front portion of the first sub-code block 10. As shown in fig. 6, a matrix within the range of X3 in the LDPC coding matrix is determined as a target sub-matrix according to the starting position and the length of the redundancy version RV3, and a part of the core check matrix and a part of the extended check matrix are included in the range of X3 in the LDPC coding matrix.
Similarly, if the information that the receiving end has not successfully decoded is still received, the redundancy version RV4 is encoded in sequence, and the redundancy version RV4 includes a rear portion of the first sub-code block 10 and a front portion of the second sub-code block 20. As shown in fig. 7, a matrix within the range of X4 in the LDPC coding matrix is determined as a target sub-matrix according to the starting position and the length of the redundancy version RV4, and a part of the core check matrix and a part of the extended check matrix are included in the range of X4 in the LDPC coding matrix. It can be understood that, due to the difference between the starting positions of redundancy version RV4 and redundancy 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 equal to the range of X3 in the LDPC coding matrix.
In practical applications, the division of the redundancy version of the encoded data may also take other forms, and the embodiment is not limited to this. The redundant versions divided by other forms can also adopt the data coding method of the embodiment, so that the effects of lower time delay of single coding and lower computation amount are achieved.
In the above example, after receiving the message to be encoded, the data to be encoded is encoded to obtain the target data.
As yet another example, the target data may be obtained in advance before the message to be encoded is received, i.e., the target redundancy version may not be the redundancy version that is currently being transmitted immediately.
Illustratively, the redundancy version definition of this example is the same as the previous example. When transmitting for the first time, the redundancy version RV0 is still transmitted first. When the redundancy version RV0 is sent, the data encoding method in this embodiment is still used, and only the portion of the matrix corresponding to the redundancy version RV0 is used to encode the data to be encoded, the obtained target data is the portion of the data corresponding to the redundancy version RV0 in the encoded data, after the target data is obtained, the target data may be sent to a receiving end, and the receiving end tries to decode after receiving the target data.
In this example, after the coding of the redundancy version RV0 is completed, the redundancy version RV2 that needs to be sent next time is coded immediately, that is, the redundancy version RV2 is used as a target redundancy version, and a matrix within the range of X2 in the LDPC coding matrix is determined as a target sub-matrix according to the start position and the length of the redundancy version RV2. The target data obtained by encoding according to the redundancy version RV2 can be stored in a cache in advance, and when information that the receiving end does not successfully decode is received, the target data obtained by encoding according to the redundancy version RV2 can be immediately sent to the receiving end. After the target data obtained by encoding the redundancy version RV2 is sent, the target data of the redundancy version RV3 that needs to be sent next time may be encoded in advance by using the foregoing method. If the receiving end decodes successfully according to the target data, the target data stored in the cache can be cleared.
The embodiment encodes the redundancy version which is possibly required to be transmitted in advance, only a part of encoding matrixes are needed to be adopted according to data covered by the redundancy version in the encoding process, the single encoding computation and the time delay are low, and the overall communication time delay is lower particularly in a scene with a low decoding success rate.
Yet another alternative embodiment of the invention:
the present embodiment provides a communication apparatus, as shown in fig. 8, which includes a processor 801, a memory 802 and a communication bus 803;
the communication bus 803 is used for realizing connection communication between the processor 801 and the memory 802;
the processor 801 is configured to execute one or more programs stored in the memory 802 to implement the steps of the data encoding method according to the above-described embodiment.
The present embodiments also provide a computer-readable storage medium including volatile or non-volatile, removable or non-removable media implemented in any method or technology for storage of 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 disk Read-Only Memory), digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
The computer-readable storage medium in the present embodiment may be used for storing one or more computer programs, and the stored one or more computer programs may be executed by a processor to implement the steps of the data encoding method as in the above embodiments.
It will be apparent to those skilled in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software (which may be implemented as computer program code executable by a computing device), firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit.
In addition, communication media typically embodies computer readable instructions, data structures, computer program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to one of ordinary skill in the art. Thus, the present invention is not limited to any specific combination of hardware and software.
The data encoding method of the present embodiment can be applied to a scenario including, but not limited to, a 5G communication technology or other types of communication technologies. It will be understood that the invention is not limited to the examples described above, but that modifications and variations will occur to those skilled in the art in light of the above teachings, and that all such modifications and variations are considered to be within the scope of the invention as defined by the appended claims.
Claims (10)
1. A method of encoding data, comprising:
determining a target redundancy version of data to be transmitted, wherein at least two redundancy versions are defined in encoded data of the data to be transmitted, the encoded data is data obtained by completely encoding the data to be transmitted through an encoding matrix, each redundancy version corresponds to different initial positions of the encoded data, and the target redundancy version is one of the at least two redundancy versions;
under the condition that the coded data are not calculated, determining the initial position of target data according to the target redundancy version, wherein the target data are the parts, corresponding to the target redundancy version, in the coded data;
determining a target sub-matrix from the coding matrix according to the initial position of the target data and the data length of the target data, wherein the target sub-matrix is a part of the coding matrix corresponding to the target data;
and coding the data to be transmitted by adopting the target sub-matrix to obtain the target data.
2. The data encoding method of claim 1, wherein the target redundancy version comprises at least one of the redundancy version currently required to be transmitted and the redundancy version required to be transmitted next.
3. The data encoding method of claim 1, wherein the encoding matrix comprises an LDPC encoding matrix comprising a core check matrix and an extended check matrix;
the encoded data includes a first sub-code block corresponding to the core check matrix and a second sub-code block corresponding to the extended check matrix.
4. The data encoding method of claim 3, wherein the redundancy versions comprise a first redundancy version corresponding to a starting position that is a header of the first sub-code block;
the first redundancy version corresponds to the complete first sub-code block and a part of the second sub-code block, and 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 includes:
determining that the target sub-matrix comprises the complete core check matrix and the region of the extended check matrix corresponding to the part of the second sub-code block corresponding to the first redundancy version.
5. The data encoding method of claim 4, wherein the redundancy versions include a second redundancy version that corresponds to a portion of the second sub-code block and does not overlap with a range that corresponds to the first redundancy version;
the 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 includes:
determining that the target sub-matrix comprises 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 of claim 5, wherein the redundancy versions include a third redundancy version, the third redundancy version corresponding to a starting position within the second sub-code block, the third redundancy version corresponding to a portion of the first sub-code block and a portion of the second sub-code block;
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 comprises:
determining that the target sub-matrix comprises 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.
7. The data encoding method of claim 6, wherein the redundancy versions comprise a fourth redundancy version corresponding to a starting position within the first sub-code block, the fourth redundancy version corresponding to a portion of the first sub-code block and a portion of the second sub-code block;
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 comprises:
determining that the target sub-matrix includes a region of the core check matrix corresponding to the portion of the first sub-code block corresponding to the fourth redundancy version and a region of the extended check matrix corresponding to the portion of the second sub-code block corresponding to the fourth redundancy version.
8. The data encoding method of any one of claims 1-7, wherein the data to be transmitted comprises code blocks generated from a transport block.
9. A communication device, comprising a processor, a memory, and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute one or more programs stored in the memory to implement the steps of the data encoding method of any one of claims 1-8.
10. A computer readable storage medium, storing one or more programs, the one or more programs being executable by one or more processors to perform the steps of the data encoding method as claimed in any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211095862.8A CN115642985A (en) | 2022-09-06 | 2022-09-06 | Data encoding method, communication device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211095862.8A CN115642985A (en) | 2022-09-06 | 2022-09-06 | Data encoding method, communication device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115642985A true CN115642985A (en) | 2023-01-24 |
Family
ID=84941204
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211095862.8A Pending CN115642985A (en) | 2022-09-06 | 2022-09-06 | Data encoding method, communication device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115642985A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024182937A1 (en) * | 2023-03-03 | 2024-09-12 | 华为技术有限公司 | Encoding method and device, and decoding method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101325474A (en) * | 2007-06-12 | 2008-12-17 | 中兴通讯股份有限公司 | Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code |
| WO2018103638A1 (en) * | 2016-12-07 | 2018-06-14 | 华为技术有限公司 | Data transmission method, sending device, receiving device and communication system |
| US20200212937A1 (en) * | 2017-09-11 | 2020-07-02 | Zte Corporation | Methods and apparatus for processing ldpc coded data |
| CN114203250A (en) * | 2021-12-14 | 2022-03-18 | 北京得瑞领新科技有限公司 | Data storage method and data reading method of solid-state memory and solid-state memory |
-
2022
- 2022-09-06 CN CN202211095862.8A patent/CN115642985A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101325474A (en) * | 2007-06-12 | 2008-12-17 | 中兴通讯股份有限公司 | Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code |
| WO2018103638A1 (en) * | 2016-12-07 | 2018-06-14 | 华为技术有限公司 | Data transmission method, sending device, receiving device and communication system |
| US20200212937A1 (en) * | 2017-09-11 | 2020-07-02 | Zte Corporation | Methods and apparatus for processing ldpc coded data |
| CN114203250A (en) * | 2021-12-14 | 2022-03-18 | 北京得瑞领新科技有限公司 | Data storage method and data reading method of solid-state memory and solid-state memory |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024182937A1 (en) * | 2023-03-03 | 2024-09-12 | 华为技术有限公司 | Encoding method and device, and decoding method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102461049B (en) | For the harq buffer management of wireless system and the method for Feedback Design | |
| JP3699730B2 (en) | Method and apparatus for communicating blocks of digital information between transmitting and receiving stations | |
| US6697987B2 (en) | Method of packet data transfer with hybrid ARQ | |
| JP4495236B2 (en) | Turbo coding with gradual data transmission and processing | |
| CN101867443B (en) | Rate matching method and device | |
| JP7252344B2 (en) | Data transmission method and communication device | |
| US11342945B2 (en) | Method and apparatus for processing rate matching of polar codes | |
| CN115642985A (en) | Data encoding method, communication device and computer readable storage medium | |
| JP7408152B2 (en) | Self-adaptive system code FEC encoding and decoding method, apparatus, system and medium based on media content | |
| US12015486B2 (en) | Data retransmission decoding method, apparatus and system, and communication device | |
| CN107733551B (en) | Data transmission method, device and system | |
| CN103414543B (en) | A kind of method adjusting HARQ buffer memory and terminal | |
| US10992426B2 (en) | Data processing method, device and node | |
| CN115085872B (en) | Data processing method and device, storage medium and electronic equipment | |
| CN108631928B (en) | Data transmission method, sending equipment and receiving equipment | |
| US20180351700A1 (en) | Convolutional code data sending method and apparatus | |
| CN103647621A (en) | Method and device for processing data coding | |
| WO2018171332A1 (en) | Data transmission method and apparatus | |
| CN113949491A (en) | HARQ-ACK information transmission method and device | |
| US20180034588A1 (en) | Apparatus and method for data transmission using coded-combining or hybrid-coding | |
| WO2008043315A1 (en) | A method and system for applying the error correction code technology to the data transmission | |
| CN114337917B (en) | Data transmission method based on forward error correction and short message sending method | |
| CN111181695B (en) | Method, device and system for requesting hybrid automatic repeat request of polar code | |
| CN116405164B (en) | Decoding method, device and equipment | |
| CN116633499B (en) | Data storage method, data storage device and processor of receiving end |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |