WO2018171401A1 - 一种信息处理方法、装置及设备 - Google Patents

一种信息处理方法、装置及设备 Download PDF

Info

Publication number
WO2018171401A1
WO2018171401A1 PCT/CN2018/077744 CN2018077744W WO2018171401A1 WO 2018171401 A1 WO2018171401 A1 WO 2018171401A1 CN 2018077744 W CN2018077744 W CN 2018077744W WO 2018171401 A1 WO2018171401 A1 WO 2018171401A1
Authority
WO
WIPO (PCT)
Prior art keywords
code
length
transport block
block
ldpc
Prior art date
Application number
PCT/CN2018/077744
Other languages
English (en)
French (fr)
Inventor
郑晨
刘晓健
魏岳军
曾歆
Original Assignee
华为技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP18771996.8A priority Critical patent/EP3591868B1/en
Publication of WO2018171401A1 publication Critical patent/WO2018171401A1/zh
Priority to US16/580,398 priority patent/US20200021310A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/155—Shortening or extension of codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H04L1/0063—Single parity check
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to an information processing method, apparatus, and device.
  • the Turbo encoder cascades a block partitioning module.
  • the splitting module is configured to divide a transport block (TB) of more than 6144 bits into a plurality of code blocks (CBs) for encoding.
  • CBs code blocks
  • the information data of different code blocks are cascaded to restore the original transport block (or "information sequence").
  • Bit CB-CRC using Turbo code to divide the code block is subject to the length constraint of the Quadratic Polynomial Permutation (QPP) interleaver, and the value of each code block obtained after segmentation is equal to that shown in Figure 2.
  • QPP Quadratic Polynomial Permutation
  • LDPC Low Density Parity Check Code
  • QC-LDPC Quasi-Cyclic Low Density Parity Check
  • the check bit portion has a double diagonal structure, or the check matrix of the raptor-like structure makes the coding very simple and can support the incremental redundancy hybrid retransmission technique.
  • the LDPC code technology has been widely used in major communication standards. When the LDPC code technology is adopted, how to determine the number of code blocks to be divided by the transport block is a problem that those skilled in the art are studying.
  • an embodiment of the present invention provides an information processing method, including: obtaining an encoding code rate of a transport block; and if the first code rate R real is greater than or equal to a second code rate R min , according to the LDPC maximum code block.
  • the length K max determines the number C of code blocks to which the transport block is divided, and the first code rate R real is the maximum of the code rate of the transport block, the code rate of the transport block, and the lowest code rate of the LDPC code.
  • the second code rate Rmin is the maximum value of the lowest code rate corresponding to the maximum code block length of the LDPC code or the lowest code rate corresponding to the maximum code block length of the LDPC code and the limit code rate of the maximum code block length of the LDPC code.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the first code rate R real is smaller than the second code rate R min , the first code rate R real and the maximum code block are obtained according to the first code rate R real
  • the encoded length N CB determines the number C of the code blocks to which the transport block is divided
  • N CB is the maximum coded length N max of the LDPC code
  • N CB is N CB,limit , N CB , limit is the buffer size used by the receiving end to save the soft information of the code block.
  • the maximum code block length of the LDPC code is limited to a code rate of K max /N CB, Limit , N CB, limit is the buffer size used by the receiving end to save the soft information of the code block.
  • the restricted code rate of the transport block is: (TBS+L TB, CRC )/ N IR , TBS is the length of the transport block, L TB, CRC is the length of the cyclic redundancy check CRC of the transport block, and N IR is the buffer size used by the receiver to save the soft information of the transport block.
  • the determining, by the LDPC maximum code block length K max , the code block of the transport block is divided.
  • the quantity includes: determining, according to the LDPC maximum code block length K max , the number of code blocks that are divided by the transport block, where the number C of the divided code blocks is satisfied
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • the determining, according to the first code rate and the maximum coded length N CB of the code block The number of the code blocks to be divided by the transport block includes: determining, according to the first code rate and the maximum coded length N CB of the code block, the number of code blocks that are divided by the transport block, where the transport block is divided by the code block The quantity C is satisfied.
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • a sixth possible implementation manner of the first aspect if a sum of a length of the transport block and a length of a CRC of the transport block is greater than the LDPC maximum code block length, and the following conditions are satisfied: Then the value of C is satisfied.
  • Th is a preset threshold.
  • the preset threshold Th is equal to 0 or the preset threshold Th is less than or equal to The maximum code block length of the LDPC The difference in length is greater than zero.
  • an embodiment of the present invention provides an information processing method, where the method includes: determining Whether the length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, The minimum code rate corresponding to the maximum code block length of the LDPC, where N IR is the buffer size used by the receiving end to store the soft information of the transport block, and G is the number of bits authorized for transmitting the transport block; The length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, and the number of code blocks to which the transport block is divided is determined according to the LDPC maximum code block length K max .
  • the length obtained by encoding the transport block is smaller than the minimum value of N IR and G, and the number of code blocks to which the transport block is divided is determined according to the length of the transport block and the lowest LDPC code rate.
  • the number of code blocks includes: determining the number of code blocks that are divided by the transport block according to the length of the transport block and the lowest code rate of the LDPC, and the number C of the code blocks that are divided by the transport block is satisfied.
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • R min is the lowest code rate of the LDPC
  • N CB is the maximum coded length N max of the LDPC code.
  • the determining, by the LDPC maximum code block length K max , the code block to which the transport block is divided The number includes: determining, according to the LDPC maximum code block length K max , the number of code blocks that are divided by the transport block, where the number C of the divided code blocks is satisfied
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • L CB CRC is the length of the CRC of the code block.
  • an embodiment of the present invention provides an apparatus for information processing, where the apparatus includes a processor and a memory, where the memory is used to store a transport block, and the processor is configured to: obtain an encoding code rate of the transport block;
  • the first code rate R real is greater than or equal to the second code rate R min , and the number C of the code blocks into which the transport block is divided is determined according to the LDPC maximum code block length K max , where the first code rate R real is the code of the transport block.
  • the second code rate Rmin is the lowest code rate corresponding to the maximum code block length of the LDPC code or the maximum code block length of the LDPC code.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the processor is configured to use the first code rate R real and The maximum coded length N CB of the code block determines the number C of code blocks to which the transport block is divided;
  • N CB is the maximum coded length N max of the LDPC code
  • N CB is N CB,limit , N CB , limit is the buffer size used by the receiving end to save the soft information of the code block.
  • the maximum code block length of the LDPC code is limited to a code rate of K max /N CB, Limit , N CB, limit The buffer size used by the receiving end to save the soft information of the code block.
  • the restricted code rate of the transport block is: (TBS+L TB, CRC )/ N IR , TBS is the length of the transport block, L TB, CRC is the length of the cyclic redundancy check CRC of the transport block, and N IR is the buffer size used by the receiver to save the soft information of the transport block.
  • the processor is configured to determine, according to the LDPC maximum code block length K max, that the transport block is divided. The number of code blocks, the number of which is divided by the number of code blocks C is satisfied
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • the processor is configured to perform, after the maximum coding of the first code rate and the code block,
  • the length N CB determines the number of code blocks into which the transport block is divided, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • a sixth possible implementation manner of the third aspect if a sum of a length of the transport block and a length of a CRC of the transport block is greater than the LDPC maximum code block length, and the following conditions are satisfied: Then the value of C is satisfied.
  • Th is a preset threshold.
  • the preset threshold Th is equal to 0 or the preset threshold Th is less than or equal to The maximum code block length of the LDPC The difference in length is greater than zero.
  • an embodiment of the present invention provides an apparatus for information processing, where the apparatus includes a processor and a memory, where the memory is used to store a program, and the processor executes a program in the memory to perform the following operations: acquiring the transmission a coding rate of the block; if the first code rate R real is greater than or equal to the second code rate R min , determining the number C of the code blocks into which the transport block is divided according to the LDPC maximum code block length K max , the first code rate R Real is the maximum of the coded code rate of the transport block, the restricted code rate of the transport block, and the lowest code rate of the LDPC code, and the second code rate Rmin is the lowest code rate corresponding to the maximum code block length of the LDPC code or The maximum value among the lowest code rate corresponding to the maximum code block length of the LDPC code and the limited code rate of the maximum code block length of the LDPC code.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the processor is configured to use the first code rate R real and code
  • the maximum coded length N CB of the block determines the number C of the code blocks to which the transport block is divided;
  • N CB is the maximum coded length N max of the LDPC code
  • N CB is N CB,limit , N CB , limit is the buffer size used by the receiving end to save the soft information of the code block.
  • the limiting code rate of the maximum code block length of the LDPC code is K max /N CB, Limit , N CB, limit The buffer size used by the receiving end to save the soft information of the code block.
  • the restricted code rate of the transport block is: (TBS+L TB, CRC )/ N IR , TBS is the length of the transport block, L TB, CRC is the length of the cyclic redundancy check CRC of the transport block, and N IR is the buffer size used by the receiver to save the soft information of the transport block.
  • the processor is configured to determine, according to the LDPC maximum code block length K max, that the transport block is divided. The number of code blocks, the number of which is divided by the number of code blocks C is satisfied
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • the processor is configured to perform, after the maximum coding of the first code rate and the code block,
  • the length N CB determines the number of code blocks into which the transport block is divided, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • a sixth possible implementation manner of the fourth aspect if a sum of a length of the transport block and a length of a CRC of the transport block is greater than the LDPC maximum code block length, and the following conditions are satisfied: Then the value of C is satisfied.
  • Th is a preset threshold.
  • the preset threshold Th is equal to 0 or the preset threshold Th is less than or equal to The maximum code block length of the LDPC The difference in length is greater than zero.
  • the estimated length of the transport block By performing the above operation, comparing the estimated length of the transport block encoding with the minimum of the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits authorized by the system for transmitting the transport block, If the estimated length of the transport block is relatively large, the number of code blocks that the transport block is divided according to the maximum code block length K max of the LDPC is determined, and if the estimated length of the transport block is relatively small, according to the The length of the transport block and the lowest code rate of the LDPC determine the number of code blocks that are divided by the transport block. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated number of code blocks is more reasonable.
  • the length obtained by encoding the transport block is smaller than the minimum value of N IR and G, and the processor is configured to determine the number of code blocks to which the transport block is divided according to the length of the transport block and the lowest LDPC code rate.
  • the processor is configured to determine the transmission according to a length of the transport block and an LDPC minimum code rate. The number of code blocks that are divided by the block, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • R min is the lowest code rate of the LDPC
  • N CB is the maximum coded length N of the LDPC code.
  • the max and the receiver are used to store the minimum of the cache size of the soft information of the code block.
  • the processor is configured to determine that the transport block is segmented according to an LDPC maximum code block length K max The number of code blocks, the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • L CB CRC is the length of the CRC of the code block.
  • an embodiment of the present invention provides an apparatus for information processing, where the apparatus includes a processor and a memory, where the memory is used to store a program, and the processor calls a program in the memory to perform an operation of: determining Whether the length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, The minimum code rate corresponding to the maximum code block length of the LDPC, where N IR is the buffer size used by the receiving end to store the soft information of the transport block, and G is the number of bits authorized for transmitting the transport block; The length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, and the number of code blocks to which the transport block is divided is determined according to the LDPC maximum code block length K max .
  • the estimated length of the transport block By performing the above operation, comparing the estimated length of the transport block encoding with the minimum of the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits authorized by the system for transmitting the transport block, If the estimated length of the transport block is relatively large, the number of code blocks that the transport block is divided according to the maximum code block length K max of the LDPC is determined, and if the estimated length of the transport block is relatively small, according to the The length of the transport block and the lowest code rate of the LDPC determine the number of code blocks that are divided by the transport block. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated number of code blocks is more reasonable.
  • the length obtained by encoding the transport block is smaller than the minimum value of N IR and G, and the processor is configured to determine the number of code blocks to which the transport block is divided according to the length of the transport block and the lowest LDPC code rate.
  • the processor is configured to determine the transmission according to a length of the transport block and an LDPC minimum code rate. The number of code blocks that are divided by the block, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • R min is the lowest code rate of the LDPC
  • N CB is the maximum coded length N of the LDPC code.
  • the max and the receiver are used to store the minimum of the cache size of the soft information of the code block.
  • the processor is configured to determine that the transport block is segmented according to an LDPC maximum code block length K max The number of code blocks, the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • L CB CRC is the length of the CRC of the code block.
  • an embodiment of the present invention provides an apparatus, including the apparatus of any of the foregoing third or fourth aspect.
  • an embodiment of the present invention provides an apparatus, including the apparatus of any of the foregoing fifth or sixth aspect.
  • an embodiment of the present invention provides a storage medium for storing instructions that, when executed on a computer, perform the method described in the first aspect or any possible implementation of the first aspect.
  • an embodiment of the present invention provides a storage medium for storing an instruction, when the instruction is executed on a computer, performing the method described in the second aspect or any possible implementation manner of the second aspect.
  • determining how to calculate the number of code blocks in which the transport block is divided according to the relative size of the first code rate and the second code rate instead of directly calculating the transmission according to the LDPC maximum code block length in the LDPC code.
  • the number of code blocks divided by the block, the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • FIG. 1 is a schematic diagram of a segmentation scenario of a transport block and a code block in the prior art
  • FIG. 2 is a schematic diagram of a parameter table of a Turbo code interleaver in the prior art
  • FIG. 4 is a schematic flowchart of an information processing method according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a rate matching scenario according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of comparison of information processing effects according to an embodiment of the present invention.
  • FIG. 7 is a schematic flowchart diagram of still another information processing method according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of still another apparatus according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of still another apparatus according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of still another apparatus according to an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of a communication system 30 according to an embodiment of the present invention.
  • the system includes a first device 301 and a second device 302.
  • the first device 301 and the second device 302 can perform Communication, and the data sent by the communication process needs to be encoded, and the information received by the receiving end needs to be decoded to restore the information before the encoding of the transmitting end.
  • the second device 302 can serve as the communication device.
  • the first device 301 can be a user equipment in a cellular network, where the user equipment can be a mobile phone, a tablet computer, a notebook computer, a palmtop computer, a mobile internet device (English: mobile internet device, abbreviation: MID), Wearable devices (such as smart watches (such as iWatch, etc.), smart bracelets, pedometers, etc.), and so on.
  • the user equipment can be a mobile phone, a tablet computer, a notebook computer, a palmtop computer, a mobile internet device (English: mobile internet device, abbreviation: MID), Wearable devices (such as smart watches (such as iWatch, etc.), smart bracelets, pedometers, etc.), and so on.
  • the second device 302 may be a network side device in a cellular network, for example, may be a base station (eNodeB, eNB); when the communication system is a fifth generation mobile communication technology (5th-Generation, 5G) based communication system, The second device 302 may be a base station (gNB) suitable for a new radio (NR); in a communication system based on other technologies, the network device 301 may have other names, which are not exemplified herein.
  • eNodeB eNodeB
  • 5G fifth generation mobile communication technology
  • gNB base station
  • NR new radio
  • the first device needs to calculate the number of code blocks and the size (or "length") of each code block that the transmission block needs to be divided into, in conjunction with the size TBS of the transport block to be transmitted and other correlations, to calculate the number of code blocks and After the length of each code block, the transport block is divided according to the number and length. After the segmentation is completed, each code block is independently coded and rate matched, and then each block is subjected to code block cascading operation to respectively code each code.
  • the blocks are merged into a piece of information, and the merged piece of information may be referred to as target information, and the first device transmits the target information to the second device.
  • the second device receives the target information, and the second device also needs to calculate the size of the code block and the size of each code block (or “length” according to the size of the transport block TBS and other related information. "), and the rate matching length of the transport block (same-end rate matching module), and then segmenting the target information according to the calculated number of code blocks and the length of each code block, and each code after the division
  • the block performs de-rate matching, decoding, and code block cascading operations to recover the data of the TBS.
  • both the first device and the second device need to calculate the number of the transport block that is divided into code blocks, and the calculated rules can be pre-agreed through the same protocol, so that the first device and the second device obtain the same. The results are consistent.
  • the information used in the calculation process may be partially pre-defined in the protocol, or may be partially communicated between the first device and the second device, for example, the first device.
  • the length information of the transport block may be sent to the second device for use in subsequent calculation by the second device.
  • the following embodiments of the present invention focus on the first device as an example.
  • the following possible method flows describe how to calculate the number of code blocks in which the transport block is divided, and the second device calculates the number of code blocks in which the transport block is divided.
  • the calculation method is the same as that of the first device, and therefore is not further described in the embodiment of the present invention.
  • FIG. 4 is a schematic flowchart diagram of an information processing method according to an embodiment of the present invention, where the method includes but is not limited to the following steps:
  • Step S401 The first device acquires a current Modulation and Coding Scheme (MCS).
  • MCS Modulation and Coding Scheme
  • the first device may determine the current modulation and coding scheme MCS according to the current channel condition.
  • the channel condition is good, the high code rate and the high order modulation may be selected, and the channel condition is not good, and the low code rate may be selected. And low-order modulation.
  • Step S402 The first device determines, according to the acquired MCS, an encoding code rate of the transmission transport block.
  • the first device pre-stores a correspondence between multiple MCSs and multiple code rates, and determines a modulation and coding scheme to determine a code rate corresponding to the modulation and coding scheme according to the correspondence, that is, The first device may obtain the coded rate R of the transport block according to the MCS.
  • Step S403 The first device compares the sizes of the first code rate and the second code rate.
  • the receiving end inputs the information into the register, and the register may have a buffer limited condition, for example, the transport block TB buffer is limited.
  • Case and code block CB buffer limited wherein the transport block TB buffer limitation specifically refers to the upper limit value of the storage resource occupied by the bit information after the entire transport block is encoded, that is, the receiving end is used to save the
  • the buffer size of the transport block soft information may also be referred to as the transport block buffer upper limit N IR
  • the code block CB buffer limitation refers to the upper limit value of the storage resources occupied by the bit block encoded bit information in the register, that is, receiving
  • the buffer size used to store the soft information of the code block may also be referred to as the code block buffer upper limit N CB,limit , as shown in FIG.
  • FIG. 5 (for example only), and part a of FIG. 5 illustrates the code block buffer. Unrestricted rate matching, part b of Figure 5 illustrates the rate matching of code block buffer limitation.
  • the cache limitation is mainly defined as the cache resource is limited. When the buffer resource is available, the cache resource is not limited. Cache resources used is typically less.
  • the first code rate and the second code rate may be calculated differently, for example:
  • the first device may calculate the first code rate according to the length of the transport block and the transport block buffer upper limit N IR .
  • the lowest code rate; the upper limit of the buffer of the transport block may be sent by the first device to the second device, or may be pre-defined in the communication protocol between the first device and the second device, and the first device may also be known by other means. .
  • the first device may calculate the second code rate according to the LDPC maximum code block length and the code block buffer upper limit N CB, limit .
  • the calculation formula may be: Wherein, R min is the second code rate, K max is the maximum code block length of the LDPC, N CB, limit is the upper limit of the code block buffer; and the block buffer upper limit N CB, limit can be sent by the first device to the second device. It may also be pre-defined in the communication protocol of the first device and the second device, and the first device may also be known by other means.
  • a plurality of values for measuring the length of the code block are predefined in the LDPC code, wherein each of the values of the code block lengths respectively has a code rate range, if the length of a code block is exactly equal to the length of the code block.
  • the value of the code block can be encoded by referring to the code rate in the code rate range corresponding to the value of the code block length.
  • the LDPC code is predefined in a plurality of metric block length values. There is a maximum value, which may be called the maximum code block length of the LDPC, and the lowest code rate exists in the code rate range corresponding to the maximum code block length of the LDPC.
  • the second code rate is the lowest code rate corresponding to the maximum code block length of the LDPC code or the lowest code rate corresponding to the maximum code block length of the LDPC code and the limited code rate of the maximum code block length of the LDPC code.
  • the second code rate is the maximum value among the lowest code rate corresponding to the maximum code block length of the LDPC code and the limit code rate of the maximum code block length of the LDPC code
  • the second code rate satisfies the following conditions: K max /N CB,limit may be referred to as the limited code rate of the maximum code block length of the LDPC code.
  • Step S404 If the first code rate is greater than or equal to the second code rate, the first device uses the LDPC maximum code block length in the LDPC code as the reference length of the transport block.
  • Step S406 The first device determines the number of code blocks divided by the transport block.
  • the first device may perform step S406 after performing step S404 or performing step S405. It is determined that the number of code blocks divided by the transport block is performed before the specific splitting, and the number of the divided code blocks is determined and then divided according to the quantity information.
  • the first parameter is a parameter calculated according to a transport block size (TBS), and the second parameter is based on the reference a length K CB,max calculated parameter; if less, the number of the transport block is equal to the first parameter divided by the second parameter rounded down; if greater than, the transport block is divided by the number equal to the The first parameter is divided by the second parameter and rounded up.
  • TBS transport block size
  • the number of partitions of the transport block is equal to the first parameter divided by the second parameter.
  • the number of divisions of the transport block is equal to the first parameter divided by the second parameter whole.
  • the first parameter is equal to a length TBS of the transport block and a length L TB of a cyclic redundancy check of the transport block, a sum of CRCs TBS+L TB, CRC
  • the second parameter is equal to the reference length K CB , max and the cyclic redundancy check of the code block CRC length L CB, CRC difference K CB, max - L CB, CRC .
  • the preset threshold Th may be a parameter for comparison according to an actual situation.
  • the preset threshold is less than or equal to the LDPC maximum code block length K max and the reference length K CB,max The difference is greater than zero, that is, 0 ⁇ Th ⁇ K max - K CB, max .
  • part c in FIG. 6 illustrates the relationship between the transport block size TBSize and the partitioned code block size CBSize in the prior art
  • part d in FIG. 6 illustrates the transport block in the embodiment of the present invention.
  • the relationship between the size TBSize and the partitioned code block size CBSize It can be seen that the embodiment of the present invention adopts a larger block length at the critical point, and the length of the divided code block is closer to the block length of the corresponding 1/5 code rate of 4915 as a whole, thereby avoiding the code block length being too small and blocking. Excessive performance loss.
  • CB Group a code block group
  • the length of the transport block before the split (TBS+L TB, CRC ) also needs to add the length of the cyclic redundancy check CRC of each code block group, namely: CG*L CBG, CRC , where CG is the number of code block groups, L CBG, CRC is the cyclic redundancy of the code block group
  • the first device determines how to calculate the number of code blocks in which the transport block is divided according to the relative size of the first code rate and the second code rate, instead of directly according to the LDPC maximum code in the LDPC code.
  • the block length calculates the number of code blocks divided by the transport block. The calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • FIG. 7 is a schematic flowchart diagram of still another information processing method according to an embodiment of the present invention, where the method includes but is not limited to the following steps:
  • Step S701 The first device compares according to The length obtained by encoding the transport block and the minimum of N IR and G.
  • the third parameter being equal to a length TBS of the transport block or a value calculated according to a length TBS of the transport block
  • the third parameter is a value calculated according to a length TBS of the transport block
  • the third parameter is equal to the length TBS of the transport block and the length L TB of the cyclic redundancy check CRC of the transport block
  • the third parameter X3 is divided by The value obtained is equal to The length obtained by encoding the transport block.
  • a plurality of values for measuring the length of the code block may be predefined, wherein each of the values of the measured code block lengths respectively has a code rate range, if a code block has a length equal to the measured code block.
  • the code block can be coded by referring to the code rate in the range of the code rate corresponding to the value of the code block length.
  • the LDPC code defines a plurality of metric block length values. There is a maximum value, which can be said to be the maximum code block length of the LDPC, and the lowest code rate exists in the code rate range corresponding to the maximum code block length K max of the LDPC.
  • the minimum code rate corresponding to the maximum code block length of the LDPC, N IR is the buffer size used by the receiving end to store the soft information of the transport block, and G is the number of bits authorized for transmitting the transport block, and N IR and G may be
  • the communication protocol between the sender and the receiver is defined, so that both the sender and the receiver can learn N IR and G, and may also be configured at the receiver. If the sender needs to know that N IR and G can be sent by the receiver. Give the sender.
  • Step S702 if according to The length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, and the first device determines the number of code blocks to which the transport block is divided according to the LDPC maximum code block length K max .
  • the third parameter may be divided by the fourth parameter and rounded up to obtain a value determined as the number of code blocks CB in which the transport block is divided.
  • the fourth parameter is equal to an LDPC maximum code block length in the LDPC code or a value calculated according to the LDPC maximum code block length, where the fourth parameter is equal to the value calculated according to the LDPC maximum code block length K max
  • Step S703 According to The length obtained by encoding the transport block is smaller than the minimum value of N IR and G, and the first device determines the number of code blocks to which the transport block is divided according to the length of the transport block and the lowest LDPC code rate.
  • the first device calculates the number of code blocks that the transport block is divided according to the value obtained by dividing the third parameter by the lowest code rate of the LDPC.
  • the lowest code rate of the LDPC is the lowest code rate supported by the LDPC code, and can be expressed as R min, K.
  • the third parameter can be said to be divided by the lowest code rate of the LDPC, and the value is the fifth parameter, that is, the first parameter.
  • the five parameters X5 (TBS+L TB, CRC )/R min,K , can calculate the number of code blocks into which the transport block is divided according to the fifth parameter.
  • the value obtained by dividing the smaller of the fifth parameter, the N IR and the G, by the sixth parameter is determined as the number of code blocks in which the transport block is divided
  • the sixth parameter N CB is equal to the minimum value of the buffer size N CB,limit of the soft information used by the receiving end for storing the code block and the maximum encoded length N max of the LDP code.
  • N CB, limit and N max may be defined in the communication protocol between the sender and the receiver, so that both the sender and the receiver can know N CB, limit and N max , and may also be configured at the receiver, if the sender It is necessary to know that N CB, limit and N max can be sent by the receiving end to the transmitting end.
  • the number of code blocks That is to say, the smaller value between G, N IR and the fifth parameter X5 is taken, and then the smaller value is divided by the value of the sixth parameter rounded up as the number of the transport block to be divided.
  • CB Group a code block group
  • the length of the transport block before the split (TBS+L TB, CRC ) also needs to add the length of the cyclic redundancy check CRC of each code block group, namely: CG*L CBG, CRC , where CG is the number of code block groups, L CBG, CRC is the cyclic redundancy of the code block group
  • the fifth parameter X5 (TBS + L TB, CRC + CG * L CBG, CRC ) / R min, K .
  • the first device encodes the estimated length of the transport block with the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits used by the system to transmit the transport block.
  • the minimum value in the comparison is compared. If the estimated length of the transport block after encoding is relatively large, the number of code blocks in which the transport block is divided is determined according to the maximum code block length K max of the LDPC, if the estimated length of the transport block is encoded. Relatively small, the number of code blocks in which the transport block is divided is determined according to the length of the transport block and the lowest code rate of the LDPC. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated The number of code blocks is more reasonable.
  • FIG. 8 is a device 80 according to an embodiment of the present invention.
  • the device 80 includes a processor 801, a memory 802, and a transceiver 803.
  • the processor 801, the memory 802, and the transceiver 803 are connected to each other through a bus.
  • the memory 802 includes, but is not limited to, a random access memory (English: Random Access Memory, RAM for short), a read-only memory (English: Read-Only Memory, ROM for short), and an erasable programmable read-only memory (English: Erasable Programmable Read Only Memory (EPROM), or Portable Disc Read-Only Memory (CD-ROM), which is used to store related instructions or data, such as transport blocks.
  • the transceiver 803 is configured to receive and transmit data.
  • the processor 801 may be one or more central processing units (English: Central Processing Unit, CPU for short). In the case that the processor 801 is a CPU, the CPU may be a single core CPU or a multi-core CPU.
  • CPU Central Processing Unit
  • the processor 801 in the device 80 is configured to perform an information processing operation, or to read program code stored in the memory 802 to perform an information processing operation, and the information processing operation is as follows:
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the processor is configured to determine the first code rate R real and the maximum coded length N CB of the code block. The number of code blocks in which the transport block is divided by C. among them,
  • N CB is the maximum coded length N max of the LDPC code, or if the second code rate R min is the largest LDPC code
  • the maximum value of the minimum code rate corresponding to the code block length and the limit code rate of the maximum code block length of the LDPC code, N CB is N CB, limit , N CB, limit is used by the receiving end to save the code block.
  • the cache size of the soft message is used by the receiving end to save the code block.
  • the limit code rate of the maximum code block length of the LDPC code is K max /N CB,limit , N CB, and the limit is used by the receiving end to save the buffer size of the soft information of the code block.
  • the restricted code rate of the transport block is: (TBS+L TB, CRC )/N IR
  • TBS is the transport block.
  • the length, L TB, CRC is the length of the cyclic redundancy check CRC of the transport block
  • N IR is the buffer size used by the receiver to save the soft information of the transport block.
  • the processor is configured to determine, according to the LDPC maximum code block length K max , the number of code blocks that are divided by the transport block, where the number C of the divided code blocks is satisfied.
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • the processor is configured to determine, according to the first code rate and a maximum coded length N CB of the code block, the number of code blocks that are divided by the transport block, where the transport block is divided. The number of code blocks C is satisfied.
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • the preset threshold Th is equal to 0 or the preset threshold Th is less than or equal to the maximum code block length of the LDPC. The difference in length is greater than zero.
  • each operation may also correspond to the corresponding description of the method embodiment shown in FIG. 4 .
  • the apparatus 80 described in FIG. 8 it is determined how to calculate the number of code blocks in which the transport block is divided according to the relative magnitude of the first code rate and the second code rate, instead of directly according to the LDPC maximum code block length in the LDPC code.
  • the number of code blocks divided by the transport block is calculated.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • FIG. 9 is a device 90 according to an embodiment of the present invention.
  • the device 90 includes a processor 901, a memory 902, and a transceiver 903.
  • the processor 901, the memory 902, and the transceiver 903 are connected to each other through a bus.
  • the memory 902 includes, but is not limited to, a random access memory (English: Random Access Memory, RAM for short), a read-only memory (English: Read-Only Memory, ROM for short), and an erasable programmable read-only memory (English: Erasable Programmable Read Only Memory (EPROM), or Portable Read-Only Memory (CD-ROM), which is used for related instructions and data, such as transport blocks or program codes. .
  • the transceiver 903 is configured to receive and transmit data.
  • the processor 901 in the device 90 is configured to perform an information processing operation, or to read program code stored in the memory 902 to perform an information processing operation, and the information processing operation is specifically as follows:
  • N IR is the buffer size used by the receiving end to store the soft information of the transport block
  • G is the number of bits authorized for transmitting the transport block
  • the length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, and the number of code blocks to which the transport block is divided is determined according to the LDPC maximum code block length K max .
  • the estimated length of the transport block By performing the above operation, comparing the estimated length of the transport block encoding with the minimum of the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits authorized by the system for transmitting the transport block, If the estimated length of the transport block is relatively large, the number of code blocks that the transport block is divided according to the maximum code block length K max of the LDPC is determined, and if the estimated length of the transport block is relatively small, according to the The length of the transport block and the lowest code rate of the LDPC determine the number of code blocks that are divided by the transport block. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated number of code blocks is more reasonable.
  • the processor is configured to determine the number of code blocks to which the transport block is divided according to the length of the transport block and the lowest LDPC code rate.
  • the processor is configured to determine, according to the length of the transport block and the lowest code rate of the LDPC, the number of code blocks that are divided by the transport block, where the number C of the divided code blocks is the value. Satisfy
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • R min is the lowest code rate of the LDPC
  • N CB is the maximum coded length N of the LDPC code.
  • the max and the receiver are used to store the minimum of the cache size of the soft information of the code block.
  • the processor is configured to determine, according to the LDPC maximum code block length K max , the number of code blocks that are divided by the transport block, where the number C of the divided code blocks is satisfied.
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • L CB CRC is the length of the CRC of the code block.
  • each operation may also correspond to the corresponding description of the method embodiment shown in FIG. 7.
  • the estimated length of the transport block is encoded in both the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits used by the system to transmit the transport block. The minimum value is compared. If the estimated length of the transport block is relatively large, the number of code blocks in which the transport block is divided is determined according to the maximum code block length K max of the LDPC, if the estimated length of the transport block is relatively long. Small, the number of code blocks in which the transport block is divided is determined according to the length of the transport block and the lowest code rate of the LDPC. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated code block is calculated. The number is more reasonable.
  • FIG. 10 is a schematic structural diagram of an apparatus 100 according to an embodiment of the present invention.
  • the apparatus 100 may include an obtaining unit 1001 and a first determining unit 1002.
  • the detailed description of each unit is as follows.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the first determining unit 1002 is configured according to the first code rate R real and the maximum coded length N CB of the code block. The number C of code blocks to which the transport block is divided is determined.
  • the limit code rate of the maximum code block length of the LDPC code is K max /N CB,limit , N CB,limit is the buffer size of the soft information used by the receiving end to save the code block.
  • the restricted code rate of the transport block is: (TBS+L TB, CRC )/N IR , TBS is the length of the transport block, L TB, and CRC is a cyclic redundancy of the transport block. The length of the CRC is checked, and N IR is the buffer size used by the receiving end to save the soft information of the transport block.
  • the first determining unit 1002 determines, according to the LDPC maximum code block length K max , the number of code blocks in which the transport block is divided, including: determining that the transport block is segmented according to the LDPC maximum code block length K max The number of code blocks, the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • determining, according to the first code rate and the maximum coded length N CB of the code block, the number of code blocks that are divided by the transport block including: according to the first code rate and the code block.
  • the maximum coded length N CB determines the number of code blocks in which the transport block is divided, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block, L TB, CRC the length of the CRC of the transport block, L CB, CRC is the length of the CRC of the code block.
  • Th is a preset threshold.
  • the preset threshold Th is equal to 0 or the preset threshold Th is less than or equal to the maximum code block length of the LDPC. The difference in length is greater than zero. It should be noted that the implementation of each unit may also correspond to the corresponding description of the method embodiment shown in FIG. 4 .
  • how to calculate the number of code blocks in which the transport block is divided is determined according to the relative magnitude of the first code rate and the second code rate, instead of directly according to the LDPC maximum code block length in the LDPC code.
  • the number of code blocks divided by the transport block is calculated.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • FIG. 11 is a schematic structural diagram of a device 110 according to an embodiment of the present invention.
  • the device 110 may include a fourth determining unit 1101 and a fifth determining unit 1102.
  • the detailed description of each unit is as follows.
  • the fourth determining unit 1101 is configured to determine according to Whether the length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, The minimum code rate corresponding to the maximum code block length of the LDPC, where N IR is the buffer size used by the receiving end to store the soft information of the transport block, and G is the number of bits authorized for transmitting the transport block; The length obtained by encoding the transport block is greater than or equal to the minimum value of N IR and G, and the fifth determining unit 1102 is configured to determine the number of code blocks in which the transport block is divided according to the LDPC maximum code block length K max .
  • the fifth determining unit 1102 determines, according to the length of the transport block and the LDPC lowest code rate, the number of code blocks that are divided by the transport block, including: according to the length of the transport block and the lowest LDPC.
  • the code rate determines the number of code blocks in which the transport block is divided, and the number C of the code blocks that are divided by the transport block satisfies
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • R min is the lowest code rate of the LDPC
  • N CB is the maximum coded length N max of the LDPC code.
  • the fifth determining unit 1102 LDPC code block length K max the maximum number of code blocks to determine the transport block is segmented, comprising a: LDPC code block length K max the maximum transport block is determined according to The number of divided code blocks, the number of which is divided by the number of code blocks C is satisfied
  • the TBS is the length of the transport block
  • L TB CRC is the length of the cyclic redundancy check CRC of the transport block
  • L CB CRC is the length of the CRC of the code block.
  • each unit may also correspond to the corresponding description of the method embodiment shown in FIG. 7 .
  • the length of the estimated transport block encoding is the same as the buffer size of the soft information used by the receiving end to hold the encoded block and the number of bits authorized by the system to transmit the transport block. The minimum value is compared. If the estimated length of the transport block is relatively large, the number of code blocks in which the transport block is divided is determined according to the maximum code block length K max of the LDPC, if the estimated length of the transport block is relatively long. Small, the number of code blocks in which the transport block is divided is determined according to the length of the transport block and the lowest code rate of the LDPC. In this process, the buffer size of the soft information used by the receiver to store the coded block is considered, and the calculated code block is calculated. The number is more reasonable.
  • the block length calculates the number of code blocks divided by the transport block.
  • the calculation process uses the buffer size of the soft information used by the receiving end to store the coded block, and the calculated number of code blocks is more reasonable.
  • the program can be stored in a computer readable storage medium, when the program is executed
  • the flow of the method embodiments as described above may be included.
  • the foregoing storage medium includes various media that can store program codes, such as a ROM or a random access memory RAM, a magnetic disk, or an optical disk.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

本发明实施例公开了一种信息处理方法、装置及设备，该方法包括：若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。采用本发明实施例，能够使计算出的码块数量更合理。

Description

一种信息处理方法、装置及设备 技术领域
本发明涉及通信技术领域，尤其涉及一种信息处理方法、装置及设备。
背景技术
在LTE协议中，Turbo编码器在编码时支持的最长比特序列为6144比特(bit)，为了支持对更长比特序列的编码，Turbo编码器前会级联一个码块分割模块，该码块分割模块用于将超过6144比特的传输块(Transport Block，TB)分割成多个码块(Code Block，CB)分别进行编码。Turbo译码后会将不同码块的信息数据进行级联，恢复出原始的传输块(或称“信息序列”)。图1为一种码块分割的场景示意图，若原始的传输块添加24比特TB-CRC后长度B大于Z＝6144，则需要进行分块，分块后每个码块还可以添加L＝24比特的CB-CRC，采用Turbo码分割码块会受到二次多项式排列(Quadratic Polynomial Permutation，QPP)交织器的长度约束，要求分割后得到的每个码块长度的取值等于图2所示的Turbo码交织器参数表中的一个K值；编码器可以根据确定的K值来推算需要将传输块分割为多少个码块。
低密度奇偶校验码(Low Density Parity Check Code，LDPC)不仅有逼近香农(Shannon)限的良好性能，而且译码复杂度较低,结构灵活，是近年信道编码领域的研究热点，以类循环低密度奇偶校验码(Quasi-Cyclic Low Density Parity Check，QC-LDPC)为例，这种类循环的单位子矩阵结构非常适合实现并行操作的硬件，比如，实现并行度大、进而高吞吐率的译码器。校验位部分具有双对角线结构，或raptor-like结构的校验矩阵使得编码非常简单，并能支持增量冗余混合重传技术。目前LDPC码技术已经被广泛应用在各大通信标准中，当采用LDPC码技术时，如何确定传输块被分割的码块数量是本领域的技术人员正在研究的问题。
发明内容
本发明实施例所要解决的技术问题在于，提供一种信息处理方法、装置及设备，能够使计算出的码块数量适应信道编码的需求。
第一方面，本发明实施例提供一种信息处理方法，该方法包括：获取传输块的编码码率；若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。
通过执行上述步骤，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数 量更合理。
结合第一方面，在第一方面的第一种可能的实现方式中，若该第一码率R real小于该第二码率R min，则根据该第一码率R real和码块的最大编码后长度N CB确定该传输块被分割的码块的数量C；其中，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第二种可能的实现方式中，该LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit为接收端用于保存该码块的软信息的缓存大小。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第三种可能的实现方式中，该传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为接收端用于保存该传输块软信息的缓存大小。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第四种可能的实现方式中，该根据LDPC最大码块长度K max确定传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000001
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第五种可能的实现方式中，该根据该第一码率和码块的最大编码后长度N CB确定该传输块被分割的码块的数量，包括：根据该第一码率和码块的最大编码后长度N CB确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000002
或者，
Figure PCTCN2018077744-appb-000003
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第六种可能的实现方式中，若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000004
则C取值满足
Figure PCTCN2018077744-appb-000005
或者，
若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000006
则C取值满足
Figure PCTCN2018077744-appb-000007
Figure PCTCN2018077744-appb-000008
其中，Th为预设阈值。
结合第一方面，或者第一方面的上述任一可能的实现方式，在第一方面的第七种可能的实现方式中，该预设阈值Th等于0或者，该预设阈值Th为小于或者等于该LDPC最大码块长度与
Figure PCTCN2018077744-appb-000009
的长度之差且大于零。
第二方面，本发明实施例提供一种信息处理方法，该方法包括：确定根据
Figure PCTCN2018077744-appb-000010
对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
Figure PCTCN2018077744-appb-000011
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数；若根据
Figure PCTCN2018077744-appb-000012
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
通过执行上述步骤，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
结合第二方面，在第二方面的第一种可能的实现方式中，若根据
Figure PCTCN2018077744-appb-000013
对传输块进行编码得到的长度小于N IR和G中的最小值，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
结合第二方面，或者第二方面的上述任一可能的实现方式，在第二方面的第二种可能的实现方式中，该根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，包括：根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000014
或者，
Figure PCTCN2018077744-appb-000015
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，R min,K该LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存该码块的软信息的缓存大小中的最小值。
结合第二方面，或者第二方面的上述任一可能的实现方式，在第二方面的第三种可能的实现方式中，该根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000016
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
第三方面，本发明实施例提供一种信息处理的装置，该装置包括处理器和存储器，该 存储器用于存储传输块，该处理器用于执行如下操作：获取该传输块的编码码率；若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。
通过执行上述操作，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
结合第三方面，在第三方面的第一种可能的实现方式中，若该第一码率R real小于该第二码率R min，该处理器用于根据所述第一码率R real和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量C；其中，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第二种可能的实现方式中，该LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit接收端用于保存该码块的软信息的缓存大小。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第三种可能的实现方式中，该传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为接收端用于保存该传输块软信息的缓存大小。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第四种可能的实现方式中，该处理器用于根据LDPC最大码块长度K max确定传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000017
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第五种可能的实现方式中，该处理器用于根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000018
或者，
Figure PCTCN2018077744-appb-000019
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第六种可能 的实现方式中，若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000020
则C取值满足
Figure PCTCN2018077744-appb-000021
或者，
若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000022
则C取值满足
Figure PCTCN2018077744-appb-000023
Figure PCTCN2018077744-appb-000024
其中，Th为预设阈值。
结合第三方面，或者第三方面的上述任一可能的实现方式，在第三方面的第七种可能的实现方式中，该预设阈值Th等于0或者，该预设阈值Th为小于或者等于该LDPC最大码块长度与
Figure PCTCN2018077744-appb-000025
的长度之差且大于零。
第四方面，本发明实施例提供一种信息处理的装置，该装置包括处理器和存储器，该存储器用于存储程序，该处理器执行该存储器中的程序，用于执行如下操作：获取该传输块的编码码率；若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。
通过执行上述操作，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
结合第四方面，在第四方面的第一种可能的实现方式中，若该第一码率R real小于该第二码率R min，该处理器用于根据该第一码率R real和码块的最大编码后长度N CB确定该传输块被分割的码块的数量C；其中，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第二种可能的实现方式中，该LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit接收端用于保存该码块的软信息的缓存大小。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第三种可能的实现方式中，该传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为接收端用于保存该传输块软信息的缓存大小。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第四种可能的实现方式中，该处理器用于根据LDPC最大码块长度K max确定传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000026
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第五种可能的实现方式中，该处理器用于根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000027
或者，
Figure PCTCN2018077744-appb-000028
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第六种可能的实现方式中，若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000029
则C取值满足
Figure PCTCN2018077744-appb-000030
或者，
若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足： 则C取值满足
Figure PCTCN2018077744-appb-000032
Figure PCTCN2018077744-appb-000033
其中，Th为预设阈值。
结合第四方面，或者第四方面的上述任一可能的实现方式，在第四方面的第七种可能的实现方式中，该预设阈值Th等于0或者，该预设阈值Th为小于或者等于该LDPC最大码块长度与
Figure PCTCN2018077744-appb-000034
的长度之差且大于零。
第五方面，本发明实施例提供一种信息处理的装置，该装置包括处理器和存储器，该存储器用于存储传输块，该处理器用于执行如下操作：确定根据
Figure PCTCN2018077744-appb-000035
对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
Figure PCTCN2018077744-appb-000036
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数；若根据
Figure PCTCN2018077744-appb-000037
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
通过执行上述操作，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
结合第五方面，在第五方面的第一种可能的实现方式中，若根据
Figure PCTCN2018077744-appb-000038
对传输块进行编码得到的长度小于N IR和G中的最小值，则该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
结合第五方面，或者第五方面的上述任一可能的实现方式，在第五方面的第二种可能的实现方式中，该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000039
或者，
Figure PCTCN2018077744-appb-000040
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，R min,K为该LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存该码块的软信息的缓存大小中的最小值。
结合第五方面，或者第五方面的上述任一可能的实现方式，在第五方面的第三种可能的实现方式中，该处理器用于根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000041
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
第六方面，本发明实施例提供一种信息处理的装置，该装置包括处理器和存储器，该存储器用于存储程序，该处理器调用该存储器中的程序，用于执行如下操作：确定根据
Figure PCTCN2018077744-appb-000042
对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
Figure PCTCN2018077744-appb-000043
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数；若根据
Figure PCTCN2018077744-appb-000044
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
通过执行上述操作，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
结合第六方面，在第六方面的第一种可能的实现方式中，若根据
Figure PCTCN2018077744-appb-000045
对传输块进行编码得到的长度小于N IR和G中的最小值，则该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
结合第六方面，或者第六方面的上述任一可能的实现方式，在第六方面的第二种可能的实现方式中，该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000046
或者，
Figure PCTCN2018077744-appb-000047
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，R min,K为该LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存该码块的软信息的缓存大小中的最小值。
结合第六方面，或者第六方面的上述任一可能的实现方式，在第六方面的第三种可能的实现方式中，该处理器用于根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000048
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
第七方面，本发明实施例提供一种设备，该设备包括如前述第三方面或第四方面任一种该的装置。
第八方面，本发明实施例提供一种设备，该设备包括如前述第五方面或第六方面任一种该的装置。
第九方面，本发明实施例提供一种存储介质，该存储介质用于存储指令，该指令在计算机上运行时执行第一方面或者第一方面的任意可能实现方式所描述的方法。
第十方面，本发明实施例提供一种存储介质，该存储介质用于存储指令，该指令在计算机上运行时执行第二方面或者第二方面的任意可能实现方式所描述的方法。
通过实施本发明实施例，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
附图说明
为了更清楚地说明本发明实施例或背景技术中的技术方案，下面将对本发明实施例或背景技术中所需要使用的附图进行说明。
图1是现有技术中的一种传输块和码块的分割场景示意图；
图2是现有技术中的一种Turbo码交织器参数表的示意图；
图3是本发明实施例提供的一种通信系统的结构示意图；
图4是本发明实施例提供的一种信息处理方法的流程示意图；
图5是本发明实施例提供的一种速率匹配的场景示意图；
图6是本发明实施例提供的一种信息处理效果的对比示意图；
图7是本发明实施例提供的又一种信息处理方法的流程示意图；
图8是本发明实施例提供的一种装置的结构示意图；
图9是本发明实施例提供的又一种装置的结构示意图；
图10是本发明实施例提供的又一种装置的结构示意图；
图11是本发明实施例提供的又一种装置的结构示意图。
具体实施方式
下面结合本发明实施例中的附图对本发明实施例进行描述。
请参见图3，图3是本发明实施例提供的一种通信系统30的结构示意图，该30系统包括第一设备301和第二设备302，该第一设备301与该第二设备302可以进行通信，且通信过程发送的数据需要进行编码，接收端接收到的信息需要进行解码以还原出发送端编码之前的信息，其中，当该第一设备301作为发送端时，第二设备302可以作为接收端；当第一设备301作为接收端时，第二设备302可以作为发送端，第一设备301和第二设备302均可以在不同的时刻扮演不同的角色，例如，在一个时刻为接收端，在另一个时刻为发送端。可选的，该第一设备301可以为蜂窝网络中的用户设备，该用户设备可以是手机、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(英文：mobile internet device，简称：MID)、可穿戴设备(例如智能手表(如iWatch等)、智能手环、计步器等)，等等。该第二设备302可以为蜂窝网络中的网络侧设备，例如，可以为基站(eNodeB，eNB)；当该通信系统为基于第五代移动通信技术(5th-Generation，5G)的通信系统时，该第二设备302可以为适用于新空口(New Radio，NR)的基站(gNB)；在基于其他技术的通信系统中，该网络设备301可能存在其他名称，此处不再一一举例。
第一设备需要结合待发送的传输块的大小TBS以及其他相关计算出该传输块需要分割成多少个码块和每个码块的大小(或称“长度”)，计算出码块的数量和每个码块的长度后即按照该数量和长度对该传输块分割，分割完成后对每个码块独立地进行编码和速率匹配，然后对各个码块进行码块级联操作以将各个码块合并成一块信息，合并成的一块信息可以称为目标信息，该第一设备将该目标信息发送给第二设备。
第二设备接收该目标信息，该第二设备也同样需结合该传输块的大小TBS以及其他相关信息计算出该传输块需要分割成多少个码块和每个码块的大小(或称“长度”)，以及该传输块的速率匹配后长度(同发端速率匹配模块)，然后根据计算出的码块的数量和每个码块的长度对该目标信息分割，并对分割后的每个码块分别进行解速率匹配、译码以及码块级联操作，恢复出上述TBS的数据。
由以上描述可知，无论是第一设备还是第二设备均需要计算该传输块被分割成码块的数量，计算的规则可以通过相同的协议预先约定好，以便第一设备和第二设备得到的结果一致。另外，计算过程中用到的信息可能有部分是在协议中预先定义好的，也可能有部分是该第一设备与该第二设备之间进行通信来相互告知的，例如，该第一设备可以将传输块的长度信息发送给该第二设备，以供该第二设备后续计算时使用。本发明实施例后续将重点以该第一设备为例，通下面的几种可能的方法流程讲述如何计算传输块被分割的码块的数量，第二设备计算传输块被分割的码块的数量的计算方式与该第一设备相同，因此本发明实施例中不再额外描述。
请参见图4，图4是本发明实施例提供的一种信息处理方法的流程示意图，该方法包括但不限于如下步骤：
步骤S401：第一设备获取当前的调制和编码方案(Modulation and Coding Scheme，MCS)。
具体地，该第一设备可以根据当前信道条件好坏来确定当前的调制编码方案MCS，通 常情况下，信道条件好就可以选择高码率和高阶调制，信道条件不好可选择低码率和低阶调制。
步骤S402：该第一设备根据获取的MCS确定发送传输块的编码码率。
具体地，该第一设备预存了多种MCS与多种码率之间的对应关系，确定了一种调制编码方案就可以根据该对应关系确定该调制编码方案对应的码率，也即是说，该第一设备可以根据MCS获取到该传输块的编码码率R。
步骤S403：该第一设备比较第一码率与第二码率的大小。
具体地，传输块TB经分割、编码后得到的比特信息传输到接收端后该接收端会将该信息输入到寄存器中，寄存器可能存在缓存受限的情况，例如，传输块TB缓存受限的情况和码块CB缓存受限的情况，其中，传输块TB缓存受限具体是指整个传输块编码后的比特信息在寄存器中占用的存储资源存在上限值，即接收端用于保存所述传输块软信息的缓存大小，也可称之为传输块缓存上限N IR，码块CB缓存受限具体是指码块编码后的比特信息在寄存器中占用的存储资源存在上限值，即接收端用于保存所述码块的软信息的缓存大小，也可称之为码块缓存上限N CB,limit，如图5所示(仅为举例)，图5的a部分示意了码块缓存未受限的速率匹配，图5的b部分示意了码块缓存受限的速率匹配，缓存受限主要体现为缓存资源受到了限定，缓存受限时可用的缓存资源比缓存未受限时可用的缓存资源通常要少。
在不同的情况下，该第一码率和第二码率的计算方式可能不同，例如：
当传输块TB缓存受限时，该第一设备可以根据该传输块的长度和传输块缓存上限N IR计算该第一码率，例如，计算公式可以为：R real＝max{R,(TBS+L TB,CRC)/N IR,R min,K}，其中，R real为第一码率，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为传输块缓存上限，(TBS+L TB,CRC)/N IR为根据该传输块缓存上限N IR计算出的码率，可称为限制码率，R min,K为LDPC码的最低码率；该传输块的缓存上限可以由第一设备发送给第二设备，也可以在第一设备与第二设备的通信协议中预先定义好，该第一设备还可能通过其他方式获知。
当码块CB缓存受限时，该第一设备可以根据该LDPC最大码块长度和码块缓存上限N CB,limit计算该第二码率，例如，计算公式可以为：
Figure PCTCN2018077744-appb-000049
其中，R min为第二码率，K max为该LDPC最大码块长度，N CB,limit为该码块缓存上限；码块缓存上限N CB,limit可以由第一设备发送给第二设备，也可以在第一设备与第二设备的通信协议中预先定义好，该第一设备还可能通过其他方式获知。另外，本发明实施例还会涉及LDPC码的最大编码后长度N max(the maximum number of variable nodes(after lifting)of any parity check matrix，N max)，通常情况下系统会授权该最大编码后长度N max以指示码块的软信息不能超过该最大编码后长度N max，当存在码块缓存上限N CB,limit时，该码块编码后的长度其实既不能够超过N CB,limit也不能够超过N max，因此可令N CB＝min{N max，N CB,limit}，也即是说，实际的最大编码后长度N CB由系统授权的N max和N CB,limit中的最小值。在一种可选的方案中，该第一码率满足如下条件：R real＝max{R,(TBS+L TB,CRC)/N IR,R min,K}，其中，(TBS+L TB,CRC)/N IR可称为传输块的限制码率，R min,K为LDPC码的最低码率(即LDPC码支持的最低码率)，TBS为该传输块的长度，L TB,CRC为 该传输块的循环冗余校验CRC的长度。可选的，LDPC码中预定义了很多衡量码块长度的值，其中每个衡量码块长度的值都各自对应有一个码率范围，如果某个码块的长度刚好等于该衡量码块长度的值，则可以参照该衡量码块长度的值对应的码率范围内的码率对该某个码块进行编码，可以理解的是，该LDPC码中预定义了很多衡量码块长度值中存在最大值，可称该最大值为LDPC最大码块长度，LDPC最大码块长度对应的码率范围内存在最低码率。
在一种可选的方案中，该第二码率为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。当第二码率为LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值时，第二码率满足如下条件：
Figure PCTCN2018077744-appb-000050
K max/N CB,limit可称为该LDPC码最大码块长度的限制码率。
步骤S404：若第一码率大于等于第二码率，则第一设备将LDPC码中的LDPC最大码块长度作为传输块被分割的参考长度。
也即是说，若R real≥R min则确定传输块被分割的参考长度K CB,max＝K max。
步骤S405：若该第一码率小于该第二码率，则该第一设备将该第一码率与码块的最大编码后长度N CB的乘积作为该传输块被分割的参考长度。
也即是说，若R real<R min，则确定传输块被分割的参考长度
Figure PCTCN2018077744-appb-000051
步骤S406：该第一设备确定该传输块分割的码块的数量。
具体地，该第一设备执行完步骤S404或者执行完步骤S405之后即可执行步骤S406。确定该传输块分割的码块的数量是在具体分割之前执行的，确定了分割的码块的数量之后再根据该数量信息进行分割。确定的方式可以如下：比较该传输块的长度TBS与该传输块的循环冗余校验CRC的长度L TB,CRC之和TBS+L TB,CRC与上述参考长度K CB,max的相对大小；若TBS+L TB,CRC≤K CB,max，则不需要对该传输块做分割，即码块CB的数量C＝1，且这个码块的长度K＝TBS+L TB,CRC；若TBS+L TB,CRC>K CB,max，则需要做进一步的判断，判断方式如下：
判断第一参数除以第二参数得到的余数是否小于预设阈值Th，该第一参数为根据该传输块的长度(Transport Block Size，TBS)计算得到的参数，该第二参数为根据该参考长度K CB,max计算得到的参数；若小于，则该传输块被分割的数量等于该第一参数除以该第二参数向下取整；若大于，则该传输块被分割的数量等于该第一参数除以该第二参数向上取整。在一种可选的方案中，若第一参数除以第二参数得到的余数等于预设阈值Th，则该传输块被分割的数量等于该第一参数除以该第二参数向下取整；在又一种可选的方案中，若第一参数除以第二参数得到的余数等于预设阈值Th，则该传输块被分割的数量等于该第一参数除以该第二参数向上取整。
可选的，该第一参数等于该传输块的长度TBS与该传输块的循环冗余校验的长度L TB,CRC之和TBS+L TB,CRC，该第二参数等于该参考长度K CB,max与码块的循环冗余校验CRC的长度L CB,CRC之差K CB,max-L CB,CRC。
也即是说，若(TBS+L TB,CRC)mod(K CB,max-L CB,CRC)<Th，则C取值满足
Figure PCTCN2018077744-appb-000052
这个时候，如果以K CB,max为单位对该传输块进行分割，那么会剩余一小部分比特信息，如果因此多出这一小部分信息而多分割一个码块， 会导致分割得到的码块数量较多总体而言，因多出的一小部分比特信息多分出一个块不划算。
若(TBS+L TB,CRC)mod(K CB,max-L CB,CRC)≥Th，则C取值满足
Figure PCTCN2018077744-appb-000053
这个时候，如果以K CB,max为单位对该传输块进行分割，那么会剩余比较多的比特信息，此时会通过向上取整多分割出一个码块，以便该比较多的比特信息能够有效传输。
需要说明的是，该预设阈值Th可以为根据实际情况预先配置的用于对比的参数，可选的，该预设阈值小于等于该LDPC最大码块长度K max与该参考长度K CB,max之差且大于零，即0<Th≤K max-K CB,max。
为了便于理解，下面举一具体样例进行说明，假设TBS＝19600，L TB,CRC＝24，K CB,max＝4915，K max＝6144，L CB,CRC＝24，Th＝100，LDPC码中定义的LDPC最大码块长度K CB,max＝4915时对应的最低码率等于1/5。基于这些数值可以得出(TBS+L TB,CRC>K CB,max，因此可以确定要将该传输块分成多个码块，基于这些数值还可以得出(TBS+L TB,CRC)mod(K CB,max-L CB,CRC)＝60，而Th＝100，因此满足(TBS+L TB,CRC)mod(K CB,max-L CB,CRC)<Th，所以
Figure PCTCN2018077744-appb-000054
Figure PCTCN2018077744-appb-000055
可以理解的是，如果将该传输块分割成4个码块，每个码块的长度等于(19600+24)/4＝4906，添加CB CRC后每个码块长度为4930，该长度4930是略大于K CB,max的，另外可以计算出该4930的码块编码时的码率约等于(4930)/(4915/(1/5))＝0.2006，非常接近1/5码率，因此从码率的角度看其中一个码块不管是分割为4915还是4930后续编码区别不大。但是从码块分割数量来看，本发明实施例分得的码块数量更少，能够提高后续编码性能。如图6所示，图6中的c部分示意了现有技术中传输块大小TBSize与分割得到的码块大小CBSize之间的关系，图6中的d部分示意了本发明实施例中传输块大小TBSize与分割得到的码块大小CBSize之间的关系。可以看出本发明实施例在临界点处采用了更大块长，分割后的码块的长度整体上更接近1/5码率对应的块长4915，避免了码块长度过小、分块过多带来的性能损失。
另外，码块分割时可能会存在一种码块组(CB Group)的分割方法，即若干个码块作为一组添加一个CBG CRC，此时传输块在分割前的长度(TBS+L TB,CRC)还需要添加各码块组的循环冗余校验CRC的长度，即：CG*L CBG,CRC，其中，CG为码块组数目，L CBG,CRC为码块组的循环冗余校验CRC的长度。例如，计算传输块的限制码率时，(TBS+L TB,CRC+CG*L CBG,CRC)/N IR。又例如：
Figure PCTCN2018077744-appb-000056
在图4所描述的方法中，第一设备根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
请参见图7，图7是本发明实施例提供的又一种信息处理方法的流程示意图，该方法包括但不限于如下步骤：
步骤S701：第一设备比较根据
Figure PCTCN2018077744-appb-000057
对传输块进行编码得到的长度与N IR和G中的 最小值的大小。
具体地，可以基于第三参数和
Figure PCTCN2018077744-appb-000058
计算根据
Figure PCTCN2018077744-appb-000059
对传输块进行编码得到的长度，该第三参数等于该传输块的长度TBS或者根据该传输块的长度TBS计算得到的值，当该第三参数为根据该传输块的长度TBS计算得到的值时，可选的，该第三参数等于该传输块的长度TBS与该传输块的循环冗余校验CRC的长度L TB,CRC之和，通过公式可以表述为：第三参数X3＝TBS+L TB,CRC。第三参数X3除以
Figure PCTCN2018077744-appb-000060
得到的值即等于根据
Figure PCTCN2018077744-appb-000061
对传输块进行编码得到的长度。
需要说明的是，LDPC码中可以预定义很多衡量码块长度的值，其中每个衡量码块长度的值都各自对应有一个码率范围，如果某个码块的长度刚好等于该衡量码块长度的值，则可以参照该衡量码块长度的值对应的码率范围内的码率对该某个码块进行编码，可以理解的是，该LDPC码中预定义了很多衡量码块长度值中存在最大值，可称该最大值为LDPC最大码块长度，LDPC最大码块长度K max对应的码率范围内存在最低码率
Figure PCTCN2018077744-appb-000062
需要说明的是，
Figure PCTCN2018077744-appb-000063
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数，N IR和G可能在发送端与接收端的通信协议中定义好，这样发送端和接收端就都可以获知N IR和G，也可能在该接收端进行配置，如果发送端需要获知N IR和G可以由该接收端发送给该发送端。
步骤S702：若根据
Figure PCTCN2018077744-appb-000064
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则第一设备根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
具体地，可以将第三参数除以第四参数向上取整得到值确定为该传输块被分割的码块CB的数量。可选的，该第四参数等于LDPC码中的LDPC最大码块长度或者根据该LDPC最大码块长度计算得到的值，当该第四参数等于根据该LDPC最大码块长度K max计算得到的值时，可选的，该第四参数等于该LDPC最大码块长度K max与该码块的循环冗余校验CRC的长度L CB,CRC之和，通过公式可以表述为：第四参数X4＝K max+L CB,CRC。
可以理解的是，当该传输块的大小比较大时，在传输之前需要进行分割得到大小比该传输块小一些的码块，将该传输块分割为多少个码块需要在正式分割之前就确定好，由以上描述可知，在一种可选的方案中，若
Figure PCTCN2018077744-appb-000065
那么，码块数量
Figure PCTCN2018077744-appb-000066
步骤S703：若根据
Figure PCTCN2018077744-appb-000067
对传输块进行编码得到的长度小于N IR和G中的最小值，则第一设备根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
具体地，则第一设备根据该第三参数除以该LDPC最低码率得到的值计算该传输块被分割的码块的数量。
具体地，LDPC最低码率为LDPC码支持的最低码率，可以表示为R min,K，为了方便后续描述可以称第三参数除以该LDPC最低码率得到的值为第五参数，即第五参数X5＝(TBS+L TB,CRC)/R min,K，可根据该第五参数计算传输块被分割的码块的数量。
在一种可选的方案中，将第五参数、N IR和G三者中的较小值除以第六参数向上取整得到的值确定为该传输块被分割的码块的数量，该第六参数N CB等于接收端用于保存该码块的软信息的缓存大小N CB,limit和LDP码的最大编码后长度N max中的最小值。N CB,limit和N max可能在发送端与接收端的通信协议中定义好，这样发送端和接收端就都可以获知N CB,limit和 N max，也可能在该接收端进行配置，如果发送端需要获知N CB,limit和N max可以由该接收端发送给该发送端。由以上描述可知，若
Figure PCTCN2018077744-appb-000068
那么，码块数量
Figure PCTCN2018077744-appb-000069
也即是说，取G、N IR和第五参数X5三者之间的较小值，然后将该较小值除以第六参数向上取整的数值作为传输块需要被分割的数量。
另外，码块分割时可能会存在一种码块组(CB Group)的分割方法，即若干个码块作为一组添加一个CBG CRC，此时传输块在分割前的长度(TBS+L TB,CRC)还需要添加各码块组的循环冗余校验CRC的长度，即：CG*L CBG,CRC，其中，CG为码块组数目，L CBG,CRC为码块组的循环冗余校验CRC的长度。例如，第五参数X5＝(TBS+L TB,CRC+CG*L CBG,CRC)/R min,K。又例如：
Figure PCTCN2018077744-appb-000070
在图7所描述的方法中，第一设备将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
上述详细阐述了本发明实施例的方法，下面提供了本发明实施例的装置。
请参见图8，图8是本发明实施例提供的一种装置80，该装置80包括处理器801、存储器802和收发器803，该处理器801、存储器802和收发器803通过总线相互连接。
存储器802包括但不限于是随机存储记忆体(英文：Random Access Memory，简称：RAM)、只读存储器(英文：Read-Only Memory，简称：ROM)、可擦除可编程只读存储器(英文：Erasable Programmable Read Only Memory，简称：EPROM)、或便携式只读存储器(英文：Compact Disc Read-Only Memory，简称：CD-ROM)，该存储器802用于存储相关指令或者数据，如传输块。收发器803用于接收和发送数据。
处理器801可以是一个或多个中央处理器(英文：Central Processing Unit，简称：CPU)，在处理器801是一个CPU的情况下，该CPU可以是单核CPU，也可以是多核CPU。
该装置80中的处理器801用于执行信息处理操作，或者用于读取该存储器802中存储的程序代码来执行信息处理操作，信息处理操作具体如下：
获取该传输块的编码码率；若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。
通过执行上述操作，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
在一种可选的方案中，若该第一码率R real小于该第二码率R min，该处理器用于根据该第一码率R real和码块的最大编码后长度N CB确定该传输块被分割的码块的数量C。其中，
若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
在又一种可选的方案中，该LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit接收端用于保存该码块的软信息的缓存大小。
在又一种可选的方案中，在第三方面的第三种可能的实现方式中，该传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为接收端用于保存该传输块软信息的缓存大小。
在又一种可选的方案中，该处理器用于根据LDPC最大码块长度K max确定传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000071
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
在又一种可选的方案中，该处理器用于根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000072
或者，
Figure PCTCN2018077744-appb-000073
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
在又一种可选的方案中，若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000074
则C取值满足
Figure PCTCN2018077744-appb-000075
或者，
若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000076
则C取值满足
Figure PCTCN2018077744-appb-000077
Figure PCTCN2018077744-appb-000078
其中，Th为预设阈值。
在又一种可选的方案中，该预设阈值Th等于0或者，该预设阈值Th为小于或者等于该LDPC最大码块长度与
Figure PCTCN2018077744-appb-000079
的长度之差且大于零。
需要说明的是，各个操作的实现还可以对应参照图4所示的方法实施例的相应描述。
在图8所描述的装置80中，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
请参见图9，图9是本发明实施例提供的一种装置90，该装置90包括处理器901、存储器902和收发器903，该处理器901、存储器902和收发器903通过总线相互连接。
存储器902包括但不限于是随机存储记忆体(英文：Random Access Memory，简称：RAM)、只读存储器(英文：Read-Only Memory，简称：ROM)、可擦除可编程只读存储器(英文：Erasable Programmable Read Only Memory，简称：EPROM)、或便携式只读存储器(英文：Compact Disc Read-Only Memory，简称：CD-ROM)，该存储器902用于相关指令及数据，例如，传输块或者程序代码。收发器903用于接收和发送数据。
处理器901可以是一个或多个中央处理器(英文：Central Processing Unit，简称：CPU)，在处理器901是一个CPU的情况下，该CPU可以是单核CPU，也可以是多核CPU。
该装置90中的处理器901用于执行信息处理操作，或者用于读取该存储器902中存储的程序代码来执行信息处理操作，信息处理操作具体如下：
确定根据
Figure PCTCN2018077744-appb-000080
对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
Figure PCTCN2018077744-appb-000081
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数；若根据
Figure PCTCN2018077744-appb-000082
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
通过执行上述操作，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
在一种可选的方案中，若根据
Figure PCTCN2018077744-appb-000083
对传输块进行编码得到的长度小于N IR和G中的最小值，则该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
在又一种可选的方案中，该处理器用于根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000084
或者，
Figure PCTCN2018077744-appb-000085
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，R min,K为该LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存该码块的软信息的缓存大小中的最小值。
在又一种可选的方案中，该处理器用于根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000086
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
需要说明的是，各个操作的实现还可以对应参照图7所示的方法实施例的相应描述。
在图9所描述的装置90中，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
请参见图10，图10是本发明实施例提供的一种装置100的结构示意图，该装置100可以包括获取单元1001和第一确定单元1002，其中，各个单元的详细描述如下。
获取单元，用于获取传输块的编码码率；若第一码率R real大于或者等于第二码率R min，则第一确定单元1002根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，该第一码率R real为该传输块的编码码率、该传输块的限制码率和LDPC码的最低码率之中的最大值，该第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和该LDPC码最大码块长度的限制码率之中的最大值。
通过执行上述步骤，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
在一种可选的方案中，若该第一码率R real小于该第二码率R min，则第一确定单元1002根据该第一码率R real和码块的最大编码后长度N CB确定该传输块被分割的码块的数量C。
在又一种可选的方案中，该LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit为接收端用于保存该码块的软信息的缓存大小。
在又一种可选的方案中，该传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，N IR为接收端用于保存该传输块软信息的缓存大小。
在又一种可选的方案中，该第一确定单元1002根据LDPC最大码块长度K max确定传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000087
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
在又一种可选的方案中，该根据该第一码率和码块的最大编码后长度N CB确定该传输块被分割的码块的数量，包括：根据该第一码率和码块的最大编码后长度N CB确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000088
或者，
Figure PCTCN2018077744-appb-000089
其中，TBS为该传输块的长度，L TB,CRC该传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
在又一种可选的方案中，若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000090
则C取值满足
Figure PCTCN2018077744-appb-000091
或者，
若该传输块的长度与该传输块的CRC的长度之和大于该LDPC最大码块长度，且以下条件满足：
Figure PCTCN2018077744-appb-000092
则C取值满足
Figure PCTCN2018077744-appb-000093
Figure PCTCN2018077744-appb-000094
其中，Th为预设阈值。
在又一种可选的方案中，该预设阈值Th等于0或者，该预设阈值Th为小于或者等于该LDPC最大码块长度与
Figure PCTCN2018077744-appb-000095
的长度之差且大于零。需要说明的是，各个单元的实现还可以对应参照图4所示的方法实施例的相应描述。
在图10所描述的装置100中，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
请参见图11，图11是本发明实施例提供的一种装置110的结构示意图，该装置110可以包括第四确定单元1101和第五确定单元1102，其中，各个单元的详细描述如下。
第四确定单元1101用于确定根据
Figure PCTCN2018077744-appb-000096
对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
Figure PCTCN2018077744-appb-000097
为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存该传输块的软信息的缓存大小，G为授权的用于传输该传输块的比特数；若根据
Figure PCTCN2018077744-appb-000098
对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则第五确定单元1102用于根据LDPC最大码块长度K max确定该传输块被分割的码块的数量。
通过执行上述步骤，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
在一种可选的方案中，若根据
Figure PCTCN2018077744-appb-000099
对传输块进行编码得到的长度小于N IR和G中的最小值，则第五确定单元1102根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量。
在又一种可选的方案中，该第五确定单元1102根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，包括：根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000100
或者，
Figure PCTCN2018077744-appb-000101
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，R min,K该 LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存该码块的软信息的缓存大小中的最小值。
在又一种可选的方案中，该第五确定单元1102根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，该传输块被分割的码块的数量C取值满足
Figure PCTCN2018077744-appb-000102
其中，TBS为该传输块的长度，L TB,CRC为该传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
需要说明的是，各个单元的实现还可以对应参照图7所示的方法实施例的相应描述。
在图11所描述的装置110中，将预估的传输块编码后长度与接收端用于保存编码块的软信息的缓存大小和系统授权的用于传输该传输块的比特数二者中的最小值进行比较，如果预估的传输块编码后长度相对较大，则根据LDPC最大码块长度K max确定该传输块被分割的码块的数量，如果预估的传输块编码后长度相对较小，则根据该传输块的长度和LDPC最低码率确定该传输块被分割的码块的数量，这个过程中考虑到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
可以理解的是，上述各个实施例中描述的装置(例如，装置80、装置90、装置100和装置110等)可以为一个模块或者元件，因此该装置可以部署在一些设备当中，本发明实施例提供一种部署有该上述装置的设备，该设备可以基于该装置的上述特点确定传输块的数量。
综上所述，通过实施本发明实施例，根据第一码率与第二码率的相对大小来确定如何计算传输块被分割的码块的数量，而不是直接根据LDPC码中的LDPC最大码块长度计算该传输块分割的码块的数量，计算过程用到了接收端用于保存编码块的软信息的缓存大小，计算出的码块数量更合理。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，该流程可以由计算机程序来指令相关的硬件完成，该程序可存储于计算机可读取存储介质中，该程序在执行时，可包括如上述各方法实施例的流程。而前述的存储介质包括：ROM或随机存储记忆体RAM、磁碟或者光盘等各种可存储程序代码的介质。

Claims (25)

  1. 一种信息处理方法，其特征在于，包括：
    获取传输块的编码码率；
    若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，所述第一码率R real为所述传输块的编码码率、所述传输块的限制码率和LDPC码的最低码率之中的最大值，所述第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值。
  2. 根据权利要求1所述的方法，其特征在于，若所述第一码率R real小于所述第二码率R min，则根据所述第一码率R real和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量C；其中，
    若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，
    若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
  3. 根据权利要求1或2所述的方法，其特征在于，所述LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
  4. 根据权利要求1至3任一项所述的方法，其特征在于，所述传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为所述传输块的长度，L TB,CRC为所述传输块的循环冗余校验CRC的长度，N IR为接收端用于保存所述传输块软信息的缓存大小。
  5. 根据权利要求1-4任一项所述的方法，其特征在于，所述根据LDPC最大码块长度K max确定传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100001
    其中，TBS为所述传输块的长度，L TB,CRC所述传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
  6. 根据权利要求2-4任一项所述的方法，其特征在于，所述根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，包括：根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100002
    或者，
    Figure PCTCN2018077744-appb-100003
    其中，TBS为所述传输块的长度，L TB,CRC所述传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
  7. 根据权利要求6所述的方法，其特征在于，若所述传输块的长度与所述传输块的CRC的长度之和大于所述LDPC最大码块长度，且以下条件满足：
    Figure PCTCN2018077744-appb-100004
    则C取值满足
    Figure PCTCN2018077744-appb-100005
    或者，
    若所述传输块的长度与所述传输块的CRC的长度之和大于所述LDPC最大码块长度，且以下条件满足：
    Figure PCTCN2018077744-appb-100006
    则C取值满足
    Figure PCTCN2018077744-appb-100007
    其中，Th为预设阈值。
  8. 根据权利要求7所述的方法，其特征在于，所述预设阈值Th等于0或者，所述预设阈值Th为小于或者等于所述LDPC最大码块长度与
    Figure PCTCN2018077744-appb-100008
    的长度之差且大于零。
  9. 一种信息处理方法，其特征在于，包括：
    确定根据
    Figure PCTCN2018077744-appb-100009
    对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
    Figure PCTCN2018077744-appb-100010
    为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存所述传输块的软信息的缓存大小，G为授权的用于传输所述传输块的比特数；
    若根据
    Figure PCTCN2018077744-appb-100011
    对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定所述传输块被分割的码块的数量。
  10. 根据权利要求9所述的方法，其特征在于，若根据
    Figure PCTCN2018077744-appb-100012
    对传输块进行编码得到的长度小于N IR和G中的最小值，则根据所述传输块的长度和LDPC最低码率确定所述传输块被分割的码块的数量。
  11. 根据权利要求10所述的方法，其特征在于，所述根据所述传输块的长度和LDPC最低码率确定所述传输块被分割的码块的数量，包括：根据所述传输块的长度和LDPC最低码率确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100013
    或者，
    Figure PCTCN2018077744-appb-100014
    其中，TBS为所述传输块的长度，L TB,CRC为所述传输块的循环冗余校验CRC的长度，R min,K所述LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存所述码块的软信息的缓存大小中的最小值。
  12. 根据权利要求9-11任一项所述的方法，其特征在于，所述根据LDPC最大码块长 度K max确定所述传输块被分割的码块的数量，包括：根据LDPC最大码块长度K max确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100015
    其中，TBS为所述传输块的长度，L TB，CRC为所述传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
  13. 一种信息处理的装置，其特征在于，所述装置包括处理器和存储器，所述存储器用于存储传输块，所述处理器用于执行如下操作：
    获取所述传输块的编码码率；
    若第一码率R real大于或者等于第二码率R min，则根据LDPC最大码块长度K max确定传输块被分割的码块的数量C，所述第一码率R real为所述传输块的编码码率、所述传输块的限制码率和LDPC码的最低码率之中的最大值，所述第二码率R min为LDPC码最大码块长度对应的最低码率或者LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值。
  14. 根据权利要求13所述的装置，其特征在于，若所述第一码率R real小于所述第二码率R min，所述处理器用于根据所述第一码率R real和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量C；其中，
    若所述第二码率R min为LDPC码最大码块长度对应的最低码率，N CB为LDPC码的最大编码后长度N max，或者，
    若所述第二码率R min为LDPC码最大码块长度对应的最低码率和所述LDPC码最大码块长度的限制码率之中的最大值，N CB为N CB,limit，N CB,limit为接收端用于保存所述码块的软信息的缓存大小。
  15. 根据权利要求13或14所述的装置，其特征在于，所述LDPC码最大码块长度的限制码率为K max/N CB,limit，N CB,limit接收端用于保存所述码块的软信息的缓存大小。
  16. 根据权利要求13-15任一项所述的装置，其特征在于，所述传输块的限制码率为：(TBS+L TB,CRC)/N IR，TBS为所述传输块的长度，L TB,CRC为所述传输块的循环冗余校验CRC的长度，N IR为接收端用于保存所述传输块软信息的缓存大小。
  17. 根据权利要求13-16任一项所述的装置，其特征在于，所述处理器用于根据LDPC最大码块长度K max确定传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100016
    其中，TBS为所述传输块的长度，L TB,CRC所述传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
  18. 根据权利要求13-15任一项所述的装置，其特征在于，所述处理器用于根据所述第一码率和码块的最大编码后长度N CB确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100017
    或者，
    Figure PCTCN2018077744-appb-100018
    其中，TBS为所述传输块的长度，L TB,CRC所述传输块的CRC的长度，L CB,CRC为码块的CRC的长度。
  19. 根据权利要求18所述的装置，其特征在于，
    若所述传输块的长度与所述传输块的CRC的长度之和大于所述LDPC最大码块长度，且以下条件满足：
    Figure PCTCN2018077744-appb-100019
    则C取值满足
    Figure PCTCN2018077744-appb-100020
    或者，
    若所述传输块的长度与所述传输块的CRC的长度之和大于所述LDPC最大码块长度，且以下条件满足：
    Figure PCTCN2018077744-appb-100021
    则C取值满足
    Figure PCTCN2018077744-appb-100022
    其中，Th为预设阈值。
  20. 根据权利要求19所述的装置，其特征在于，所述预设阈值Th等于0或者，所述预设阈值Th为小于或者等于所述LDPC最大码块长度与
    Figure PCTCN2018077744-appb-100023
    的长度之差且大于零。
  21. 一种信息处理的装置，其特征在于，所述装置包括处理器和存储器，所述存储器用于存储传输块，所述处理器用于执行如下操作：
    确定根据
    Figure PCTCN2018077744-appb-100024
    对传输块进行编码得到的长度是否大于或者等于N IR和G中的最小值，
    Figure PCTCN2018077744-appb-100025
    为LDPC最大码块长度对应的最低码率，N IR为接收端用于保存所述传输块的软信息的缓存大小，G为授权的用于传输所述传输块的比特数；
    若根据
    Figure PCTCN2018077744-appb-100026
    对传输块进行编码得到的长度大于或者等于N IR和G中的最小值，则根据LDPC最大码块长度K max确定所述传输块被分割的码块的数量。
  22. 根据权利要求21所述的装置，其特征在于，若根据
    Figure PCTCN2018077744-appb-100027
    对传输块进行编码得到的长度小于N IR和G中的最小值，则所述处理器用于根据所述传输块的长度和LDPC最低码率确定所述传输块被分割的码块的数量。
  23. 根据权利要求22所述的装置，其特征在于，所述处理器用于根据所述传输块的长度和LDPC最低码率确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100028
    或者，
    Figure PCTCN2018077744-appb-100029
    其中，TBS为所述传输块的长度，L TB,CRC为所述传输块的循环冗余校验CRC的长度，R min,K为所述LDPC最低码率，N CB为LDPC码的最大编码后长度N max和接收端用于保存所述码块的软信息的缓存大小中的最小值。
  24. 根据权利要求22-23任一项所述的装置，其特征在于，所述处理器用于根据LDPC最大码块长度K max确定所述传输块被分割的码块的数量，所述传输块被分割的码块的数量C取值满足
    Figure PCTCN2018077744-appb-100030
    其中，TBS为所述传输块的长度，L TB,CRC为所述传输块的循环冗余校验CRC的长度，L CB,CRC为码块的CRC的长度。
  25. 一种通信设备，其特征在于，所述通信设备包括如权利要求13-24任一项所述的信息处理的装置。
PCT/CN2018/077744 2017-03-24 2018-03-01 一种信息处理方法、装置及设备 WO2018171401A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18771996.8A EP3591868B1 (en) 2017-03-24 2018-03-01 Information processing method, apparatus and device
US16/580,398 US20200021310A1 (en) 2017-03-24 2019-09-24 Information processing method and apparatus, and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710185972.6 2017-03-24
CN201710185972.6A CN108631937B (zh) 2017-03-24 2017-03-24 一种信息处理方法、装置及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/580,398 Continuation US20200021310A1 (en) 2017-03-24 2019-09-24 Information processing method and apparatus, and device

Publications (1)

Publication Number Publication Date
WO2018171401A1 true WO2018171401A1 (zh) 2018-09-27

Family

ID=63584964

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/077744 WO2018171401A1 (zh) 2017-03-24 2018-03-01 一种信息处理方法、装置及设备

Country Status (4)

Country Link
US (1) US20200021310A1 (zh)
EP (1) EP3591868B1 (zh)
CN (1) CN108631937B (zh)
WO (1) WO2018171401A1 (zh)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10819372B2 (en) * 2016-11-04 2020-10-27 Lg Electronics Inc. Method for dividing transport block of LDPC code and apparatus therefor
US20220376820A1 (en) * 2017-01-09 2022-11-24 Telefonaktiebolaget Lm Ericsson (Publ) Cyclic redundancy check selection
CN115720128B (zh) 2017-01-09 2024-09-24 中兴通讯股份有限公司 一种数据处理方法和装置
CN108289010B (zh) * 2017-01-09 2022-04-15 中兴通讯股份有限公司 一种数据处理方法和装置
EP3577768A4 (en) * 2017-02-06 2020-11-25 Telefonaktiebolaget LM Ericsson (Publ) SEGMENTATION OF LDPC CODE BLOCKS
BR112020002607A2 (pt) * 2017-08-11 2020-07-28 Telefonaktiebolaget Lm Ericsson (Publ) transmissor sem fio e método relacionado e receptor sem fio e método relacionado
CN113784356B (zh) * 2021-10-27 2023-08-08 哲库科技(北京)有限公司 一种通信参数的确定方法、装置、设备以及存储介质
US11616597B1 (en) 2022-01-11 2023-03-28 Qualcomm Incorporated Hierarchical cyclic redundancy check techniques

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101621829A (zh) * 2009-07-27 2010-01-06 北京天碁科技有限公司 一种信道质量指示符上报的方法及装置
CN101667884A (zh) * 2008-09-03 2010-03-10 中兴通讯股份有限公司 信道编码方法及装置、信道译码方法及装置
CN102315911A (zh) * 2011-09-29 2012-01-11 中兴通讯股份有限公司 一种低密度奇偶校验码编码方法及装置
US20140068375A1 (en) * 2012-08-28 2014-03-06 Hughes Network Systems, Llc System and method for communicating with low density parity check codes

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8781006B2 (en) * 2010-05-21 2014-07-15 Qualcomm Incorporated Link adaptation in multi-carrier communication systems
US10075266B2 (en) * 2013-10-09 2018-09-11 Qualcomm Incorporated Data transmission scheme with unequal code block sizes
CN105530071B (zh) * 2014-09-29 2018-08-07 普天信息技术有限公司 一种基于码块分割的上行信号编码方法及终端
CN106160937B (zh) * 2015-04-15 2019-01-04 中兴通讯股份有限公司 一种实现码块分割的方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101667884A (zh) * 2008-09-03 2010-03-10 中兴通讯股份有限公司 信道编码方法及装置、信道译码方法及装置
CN101621829A (zh) * 2009-07-27 2010-01-06 北京天碁科技有限公司 一种信道质量指示符上报的方法及装置
CN102315911A (zh) * 2011-09-29 2012-01-11 中兴通讯股份有限公司 一种低密度奇偶校验码编码方法及装置
US20140068375A1 (en) * 2012-08-28 2014-03-06 Hughes Network Systems, Llc System and method for communicating with low density parity check codes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3591868A4 *

Also Published As

Publication number Publication date
EP3591868A4 (en) 2020-06-24
CN108631937B (zh) 2020-06-02
EP3591868B1 (en) 2022-05-04
EP3591868A1 (en) 2020-01-08
CN108631937A (zh) 2018-10-09
US20200021310A1 (en) 2020-01-16

Similar Documents

Publication Publication Date Title
WO2018171401A1 (zh) 一种信息处理方法、装置及设备
JP7026763B2 (ja) レートマッチング方法、符号化装置、および通信装置
US10797826B2 (en) Polar encoding and rate matching method, apparatus, and device
WO2018028351A1 (zh) 用于极化编码的方法、装置和设备
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2018202057A1 (zh) 传输数据的方法、基站和终端设备
WO2019062145A1 (zh) Ploar编码方法和编码装置、译码方法和译码装置
WO2014173133A1 (zh) 极性码的译码方法和译码装置
TWI675566B (zh) 一種確定校驗矩陣的方法及裝置、電腦存儲介質
EP1656737B1 (en) Method and apparatus for varying lengths of low density parity check codewords
CN108347301B (zh) 数据的传输方法和装置
WO2013152605A1 (zh) 极性码的译码方法和译码装置
WO2019015592A1 (zh) 一种Polar码编码方法及装置
WO2019206136A1 (zh) 极化码的速率匹配、解速率匹配方法及设备
US20230208554A1 (en) Encoding and Decoding Method and Apparatus
CN108347300A (zh) 一种调整Polar码的方法、装置及编译码装置
CN109327280B (zh) 分段编码方法及装置
WO2018028469A1 (zh) 一种ldpc编码方法、编码装置及通信设备
CN109004939A (zh) 极化码译码装置和方法
WO2018161946A1 (zh) 数据处理的方法和装置
WO2018171627A1 (zh) 分割传输块的方法、无线通信设备和芯片
CN112703687B (zh) 信道编码方法及装置
WO2024000564A1 (zh) 一种通信方法及通信装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18771996

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018771996

Country of ref document: EP

Effective date: 20190930