WO2019024696A1 - 确定传输块大小的方法、装置及设备 - Google Patents

确定传输块大小的方法、装置及设备 Download PDF

Info

Publication number
WO2019024696A1
WO2019024696A1 PCT/CN2018/096451 CN2018096451W WO2019024696A1 WO 2019024696 A1 WO2019024696 A1 WO 2019024696A1 CN 2018096451 W CN2018096451 W CN 2018096451W WO 2019024696 A1 WO2019024696 A1 WO 2019024696A1
Authority
WO
WIPO (PCT)
Prior art keywords
transport block
block size
initial transport
value
quantized
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2018/096451
Other languages
English (en)
French (fr)
Inventor
邢艳萍
王加庆
高雪娟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Telecommunications Technology CATT
Original Assignee
China Academy of Telecommunications Technology CATT
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 China Academy of Telecommunications Technology CATT filed Critical China Academy of Telecommunications Technology CATT
Priority to KR1020207005928A priority Critical patent/KR102326830B1/ko
Priority to JP2020506256A priority patent/JP7009611B2/ja
Priority to EP18840627.6A priority patent/EP3664544B1/en
Priority to US16/633,547 priority patent/US11212703B2/en
Publication of WO2019024696A1 publication Critical patent/WO2019024696A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • H04L1/0003—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate by switching between different modulation schemes
    • 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/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1221—Wireless traffic scheduling based on age of data to be sent
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format

Definitions

  • the present disclosure relates to the field of communications technologies, and in particular, to a method, apparatus, and device for determining a transport block size.
  • the transport block size carried by the data channel can be obtained by looking up the table.
  • the data channel resource allocation of LTE is in units of PRB (Physical Resource Block) pair.
  • PRB Physical Resource Block
  • TBS Transport Block Size
  • the available data in each PRB pair is assumed.
  • the number of RE (Resource Element) channels transmitted by the channel is fixed.
  • the resource allocation of data channels in NR is more flexible. For example, one scheduling may allocate one time slot, one or more symbols, or resources of multiple time slots, and the like. Since the resource scheduling in the NR is more flexible than LTE, the TBS determination method of LTE cannot be directly used.
  • a related method for dynamically calculating a TBS based on scheduling information is proposed in the related art.
  • the method can flexibly calculate the TBS according to the resource allocation
  • the obtained TBS may be any byte, which obviously does not adapt to the feature of verifying and optimizing only the code block of a certain length in the NR, so that the performance of the transport block cannot be guaranteed.
  • the present disclosure provides a method, apparatus, and apparatus for determining a transport block size to ensure performance of a transport block in an NR system.
  • an embodiment of the present disclosure provides a method for determining a transport block size, including:
  • a final transport block size is determined based on the quantized initial transport block size.
  • the determining an initial transport block size includes:
  • An initial transport block size is determined based on the scheduling information.
  • the determining an initial transport block size includes:
  • the initial transport block size is determined according to the scheduling information and the number of layers of the codeword mapping.
  • the quantizing the initial transport block size according to the comparison result, and obtaining the quantized initial transport block size including:
  • the quantized initial transport block size is:
  • Km takes the value K, and the elements in the set K are positive integers.
  • the quantizing the initial transport block size according to the comparison result, and obtaining the quantized initial transport block size further includes:
  • the quantized initial transport block size is:
  • B represents the quantized initial transport block size
  • K' n is taken over the set K'
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • the minimum value of the set K' is greater than among them, B_temp represents the initial transport block size, L CB represents the code block cyclic redundancy check code CRC length, and Y represents the threshold value.
  • the set K' is a subset of the set K.
  • the selection criteria for Km are:
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values.
  • K 'n selection criteria is:
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K′ n is determined to be the minimum value or the maximum value of two or more values.
  • the determining, according to the quantized initial transport block size, the final transport block size including:
  • the final transport block size is the difference between the initial transport block size and the CRC length of the transport block.
  • the determining, according to the quantized initial transport block size, the final transport block size including:
  • the final transport block size is a product of the difference between the initial transport block size and the CRC length of the transport block and the number of layers of the codeword mapping.
  • the threshold value is equal to a maximum length value of the code block.
  • the method further includes:
  • a target element that is not a multiple of 8 in the set K and/or the set K' is quantized such that the target element is a multiple of 8.
  • the method further includes:
  • the quantized initial transport block size is quantized to a multiple of 8.
  • the method further includes:
  • the final transport block size is quantized to a multiple of 8.
  • an embodiment of the present disclosure provides an apparatus for determining a transport block size, including: a processor, a transceiver, and a program stored on the memory and executable on the processor, where In the program, the processor is used to:
  • a final transport block size is determined based on the quantized initial transport block size.
  • the processor when determining the initial transport block size, is configured to:
  • An initial transport block size is determined based on the scheduling information.
  • the processor when determining the initial transport block size, is further configured to:
  • the initial transport block size is determined according to the scheduling information and the number of layers of the codeword mapping.
  • the processor when the initial transport block size is quantized according to the comparison result to obtain a quantized initial transport block size, the processor is configured to:
  • the quantized initial transport block size is:
  • Km takes the value K, and the elements in the set K are positive integers.
  • the processor is further configured to:
  • the quantized initial transport block size is:
  • B represents the quantized initial transport block size
  • K' n is taken over the set K'
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • the minimum value of the set K' is greater than among them, B_temp represents the initial transport block size, L CB represents the code block cyclic redundancy check code CRC length, and Y represents the threshold value.
  • the set K' is a subset of the set K.
  • the selection criteria for Km are:
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values.
  • K 'n selection criteria is:
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K' n is determined to be the minimum value or the maximum value of two or more values.
  • the processor is further configured to determine that the final transport block size is a difference between the initial transport block size and a CRC length of the transport block.
  • the processor is further configured to determine that the final transport block size is a product of a difference between the initial transport block size and a CRC length of the transport block and a number of layers of the codeword mapping.
  • the threshold value is equal to a maximum length value of the code block.
  • the processor is further configured to:
  • a target element that is not a multiple of 8 in the set K and/or the set K' is quantized such that the target element is a multiple of 8.
  • the processor is further configured to:
  • the quantized initial transport block size is quantized to a multiple of 8.
  • the processor is further configured to:
  • the final transport block size is quantized to a multiple of 8.
  • an embodiment of the present disclosure provides a computer readable storage medium for storing a program, the program being executed by a processor to implement the steps in the method of any of the first aspects.
  • FIG. 1 is a flow chart of a method of determining a transport block size, in accordance with some embodiments of the present disclosure
  • FIG. 2 is a flowchart of a method of determining a transport block size according to further embodiments of the present disclosure
  • FIG. 3 is a flowchart of a method of determining a transport block size according to further embodiments of the present disclosure
  • FIG. 4 is a schematic diagram of an apparatus for determining a transport block size according to some embodiments of the present disclosure
  • FIG. 5 is a schematic diagram of a first determining module according to some embodiments of the present disclosure.
  • FIG. 6 is a schematic diagram of a first determining module according to further embodiments of the present disclosure.
  • FIG. 7 is a schematic diagram of a quantization processing module of some embodiments of the present disclosure.
  • FIG. 8 is a structural diagram of an apparatus for determining a transport block size according to some embodiments of the present disclosure.
  • FIG. 9 is a structural diagram of an apparatus for determining a transport block size according to further embodiments of the present disclosure.
  • FIG. 10 is a structural diagram of an apparatus for determining a transport block size according to still another embodiment of the present disclosure.
  • FIG. 11 is a schematic diagram of an electronic device of some embodiments of the present disclosure.
  • a method of determining a transport block size includes steps 101 to 104.
  • Step 101 Determine an initial transport block size.
  • the manner of determining the initial TBS may include, but is not limited to, the following two types:
  • Manner 1 Receive scheduling information on the network side, and determine an initial transmission block size according to the scheduling information.
  • Manner 2 Receive scheduling information of the network side, determine a layer number of the codeword mapping according to the scheduling information, and determine an initial transport block size according to the scheduling information and the number of layers of the codeword mapping.
  • Step 102 Compare the initial transport block size and a threshold value to obtain a comparison result.
  • the threshold value is equal to a maximum length value of the code block.
  • the value of the threshold value can also be adjusted accordingly.
  • Step 103 Quantize the initial transport block size according to the comparison result to obtain a quantized initial transport block size.
  • B represents the quantized initial transport block size
  • K 'n to set the value K'
  • B_temp represents the initial transport block size
  • L CB represents a code block CRC (Cyclic Redundancy Check, cyclic redundancy check code) length
  • Y represents a threshold value.
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • B_temp represents the initial transport block size
  • L CB represents the code block CRC length
  • Y represents the threshold value.
  • the set K' is a subset of the set K.
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values. For example, if there are 3 candidate Km values satisfying criterion 3 in some cases, then the maximum or minimum value may be selected among the 3 candidate Km values as the value of the final Km.
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K' n is determined to be the minimum value or the maximum value of two or more values. For example, in some cases to meet the criteria of the candidate 3 K 'n has a value of 3, then K may be in the 3 candidate' n selected value as a final maximum or minimum K 'n values.
  • Step 104 Determine a final transport block size according to the quantized initial transport block size.
  • the final transport block size is a layer of the difference between the initial transport block size and the CRC length of the transport block and the codeword mapping layer. The product of the number. Otherwise, the final transport block size is the difference between the initial transport block size and the CRC length of the transport block.
  • the length of each code block is equal after the TBS is segmented by the code block, so that in the NR system, a plurality of code blocks into which one TBS is divided have the same performance.
  • the code block segmentation and the number of zeros in the encoding and interleaving process can be minimized, thereby reducing the codec complexity and maximizing the codec performance of the code block.
  • the performance of the TB Transport Block
  • the target element of the set K and/or the set K′ that is not a multiple of 8 is quantized such that the target element is a multiple of 8. .
  • the quantized initial transport block size may also be quantized to a multiple of 8.
  • the final transport block size may also be quantized to a multiple of eight.
  • a method for determining a transport block size includes steps 201 to 203.
  • Step 201 The terminal side determines an initial transport block size TBS, which is recorded as B_temp.
  • the terminal side determines B_temp according to the scheduling information sent by the network side, and B_temp includes the CRC length of the transport block, and records the CRC length as L TB .
  • the number of layers of the codeword mapping is not considered when determining the initial TBS.
  • the initial transport block size can be determined as follows.
  • Manner 1 The terminal side calculates the initial transport block size B_temp according to the scheduling information sent by the network side.
  • the terminal side calculates the initial transport block size according to the following formula:
  • the N RE is the number of resource elements (Resource Element, RE) occupied by the allocated data channel; Q m is a modulation order; and R is a target code rate.
  • the N RE can be calculated according to the time-frequency resource allocated by the network side, and the modulation order and the target code rate are obtained by scheduling information sent by the network side.
  • the terminal directly obtains B_temp according to the scheduling information lookup table, or obtains B_temp by further converting according to the scheduling information.
  • Step 202 The terminal determines the quantized transport block size B.
  • the quantized transport block size B is determined here in the following manner.
  • B denotes the quantized initial transport block size
  • B_temp denotes the initial transport block size
  • Km takes the value K
  • the elements in the set K are positive integers
  • K' n takes the value K'
  • L CB represents The code block cyclic redundancy check code has a CRC length
  • Y represents a threshold value.
  • Y is the maximum length of the code block.
  • Km is a value in set K.
  • Km is a minimum value greater than or equal to B_temp in the set K, or a maximum value of the set K that is less than or equal to B_temp, or a value closest to B_temp in the set K.
  • the meaning of "closest” means that the absolute value of the difference between Km and the initial transport block size is the smallest. Further, it can be agreed that when two values in the set satisfy one of the above conditions, a larger or smaller value is selected.
  • K' n is a value in the set K'.
  • K ' is the set of n-K' satisfying the minimum B_temp ⁇ C ⁇ (Ki'-L CB), or to meet the maximum B_temp ⁇ C ⁇ (Ki'-L CB), or satisfies C ⁇ (Ki '-L CB ) is the closest value to B_temp.
  • Ki' is an element in the set K'.
  • "closest" means refers, K 'value of the set of n-K' in C ⁇ (Ki'-L CB) and the difference between the initial transport block size of the smallest absolute value. Further, it can be agreed that when two values in the set satisfy one of the above conditions, a larger or smaller value is selected.
  • the set K' is greater than the minimum value A subset of the collection K.
  • Step 203 The terminal side determines the final transport block size, which is recorded as B_final.
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • Set K is a predefined set in the protocol.
  • the possible values in the set K are as shown in Table 1 below.
  • K ' is the set of n-K' satisfying a value C ⁇ (Ki'-L CB) of the closest B_temp.
  • B_temp 6636 quantized transport block size
  • the final transport block size B_final is determined based on the quantized transport block size B.
  • the set K is a set of pre-configurations.
  • the network side configures a set K for the terminal, and the set K is a subset of the set K in the example 1.
  • the manner of determining the transport block size is the same as the other processing of the case (1).
  • the set K is a set calculated based on the calculation parameters.
  • the element in the set K is Kb*Z, where Z is a set of LDPC lifting sizes, and the values are as shown in Table 2 below.
  • the set K is ⁇ 44, 66, 88, 110, 132, 154, 176, 198, 220, 242, 264, 308, 352, ..., 8448 ⁇
  • the value is not quantized for a value that is not an integer byte length (an integer multiple of 8).
  • the quantization is 64 or 72.
  • the quantization rule can be the smallest integer byte greater than the value, or the largest integer byte less than the value, or the integer byte closest to the value.
  • byte quantization is performed on non-integer bytes in the set, and byte quantization is performed on the quantized TBS or byte quantization is performed on the final TBS.
  • the final transport block size B_final is determined based on the quantized transport block size B.
  • a method for determining a transport block size includes steps 301 to 303.
  • Step 301 The terminal side determines an initial transport block size TBS, denoted as B_temp.
  • the terminal side determines B_temp according to the scheduling information sent by the network side, and B_temp includes the CRC length of the transport block, which is denoted as L TB .
  • the number of layers of codeword mapping is considered in determining the initial TBS.
  • Manner 1 The terminal side calculates the initial transport block size B_temp according to the scheduling information sent by the network side.
  • the terminal side calculates the initial transport block size according to the following formula:
  • the N RE is the number of resource elements (Resource Element, RE) occupied by the allocated data channel; Q m is a modulation order; and R is a target code rate.
  • the N RE can be calculated according to the time-frequency resource allocated by the network side, and the modulation order and the target code rate are obtained by scheduling information sent by the network side.
  • v is the number of layers of the codeword mapping, and is obtained by scheduling information sent by the network side.
  • the terminal directly obtains B_temp according to the scheduling information lookup table, or obtains B_temp by further converting according to the scheduling information.
  • Step 302 The terminal side determines an initial transport block size TBS, denoted as B_temp.
  • This process can be referred to the description of the foregoing step 202.
  • Step 303 The terminal side determines the final transport block size, which is recorded as B_final.
  • the method of determining the transport block size of the embodiment of the present disclosure is applicable to a 5G NR.
  • the TBS can be obtained by a unified formula and the TBS is guaranteed to be equal in length after the code block is segmented, and the code block length is equal to the value in a preset set.
  • the code block segmentation and the number of zeros in the encoding and interleaving process can be minimized, thereby reducing the codec complexity and maximizing the codec performance of the code block.
  • the performance of the TB can be guaranteed by selecting the code block length that is sufficiently verified and optimized in the NR as the element value in the set.
  • an apparatus for determining a transport block size includes:
  • a first determining module 401 configured to determine an initial transport block size
  • a comparison module 402 configured to compare the initial transport block size and a threshold value to obtain a comparison result
  • a quantization processing module 403 configured to use the comparison result
  • the initial transport block size is quantized to obtain a quantized initial transport block size.
  • the second determining module 404 is configured to determine a final transport block size according to the quantized initial transport block size.
  • the first determining module 401 includes:
  • the first receiving submodule 4011 is configured to receive scheduling information
  • the first determining submodule 4012 is configured to determine an initial transport block size according to the scheduling information.
  • the first determining module 401 includes:
  • a second receiving sub-module 4013 configured to receive scheduling information
  • a second determining sub-module 4014 configured to determine a layer number of the codeword mapping
  • a third determining sub-module 4015 configured to perform, according to the layer of the scheduling information and the codeword mapping Number, determines the initial transport block size.
  • the quantization processing module 403 includes:
  • the first quantization submodule 4031 is configured to: if the comparison result is that the initial transport block size is less than or equal to the threshold, the quantized initial transport block size is:
  • Km takes the value K, and the elements in the set K are positive integers;
  • the second quantization submodule 4032 is configured to: if the comparison result is that the initial transport block size is greater than the threshold, the quantized initial transport block size is:
  • B represents the quantized initial transport block size
  • K' n is taken over the set K'
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K' is a subset of the set K.
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values.
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K' n is determined to be the minimum value or the maximum value of two or more values.
  • the second determining module 404 is specifically configured to determine that the final transport block size is a difference between the initial transport block size and the CRC length of the transport block.
  • the second determining module 404 is specifically configured to determine that the final transport block size is a product of a difference between the initial transport block size and a CRC length of a transport block and a number of layers of a codeword mapping.
  • the threshold value is equal to a maximum length value of the code block.
  • the apparatus further includes: a first quantization module 405, configured to quantize the target element of the set K and/or the set K′ that is not a multiple of 8 such that the target element is 8 Multiples.
  • a first quantization module 405 configured to quantize the target element of the set K and/or the set K′ that is not a multiple of 8 such that the target element is 8 Multiples.
  • the apparatus further includes: a second quantization module 406, configured to quantize the quantized initial transport block size to a multiple of 8.
  • the apparatus further includes: a third quantization module 407, configured to quantize the final transport block size to a multiple of 8.
  • the TBS can be obtained by a unified formula and the TBS is guaranteed to be equal in length after the code block is segmented, and the code block length is equal to the value in a preset set.
  • the code block segmentation and the number of zeros in the encoding and interleaving process can be minimized, thereby reducing the codec complexity and maximizing the codec performance of the code block.
  • the performance of the TB can be guaranteed by selecting the code block length that is sufficiently verified and optimized in the NR as the element value in the set.
  • the electronic device of the embodiment of the present disclosure includes:
  • the processor 1100 is configured to read a program in the memory 1120 and perform the following process:
  • Determining an initial transport block size comparing the initial transport block size and a threshold value to obtain a comparison result; and performing quantization on the initial transport block size according to the comparison result to obtain a quantized initial transport block size;
  • the quantized initial transport block size determines the final transport block size
  • the transceiver 1110 is configured to receive and transmit data under the control of the processor 1100.
  • the bus architecture can include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 1100 and various circuits of memory represented by memory 1120.
  • the bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein.
  • the bus interface provides an interface.
  • the transceiver 1110 can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium.
  • the processor 1100 is responsible for managing the bus architecture and general processing, and the memory 1120 can store data used by the processor 1100 in performing operations.
  • the processor 1100 is responsible for managing the bus architecture and general processing, and the memory 1120 can store data used by the processor 1100 in performing operations.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • An initial transport block size is determined based on the scheduling information.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the initial transport block size is determined according to the scheduling information and the number of layers of the codeword mapping.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the quantized initial transport block size is:
  • Km takes the value K, and the elements in the set K are positive integers;
  • the quantized initial transport block size is:
  • B represents the quantized initial transport block size
  • K' n is taken over the set K'
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K' is a subset of the set K.
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values.
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K' n is determined to be the minimum value or the maximum value of two or more values.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the final transport block size is the difference between the initial transport block size and the CRC length of the transport block.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the final transport block size is a product of the difference between the initial transport block size and the CRC length of the transport block and the number of layers of the codeword mapping.
  • the threshold value is equal to a maximum length value of the code block.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • a target element that is not a multiple of 8 in the set K and/or the set K' is quantized such that the target element is a multiple of 8.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the quantized initial transport block size is quantized to a multiple of 8.
  • the processor 1100 is further configured to read the computer program, and perform the following steps:
  • the final transport block size is quantized to a multiple of 8.
  • a computer readable storage medium of an embodiment of the present disclosure is configured to store a computer program executable by a processor to implement the following steps:
  • the determining the initial transport block size includes:
  • An initial transport block size is determined based on the scheduling information.
  • determining that the initial transport block is small comprises:
  • the initial transport block size is determined according to the scheduling information and the number of layers of the codeword mapping.
  • the quantizing the initial transport block size according to the comparison result, and obtaining the quantized initial transport block size including:
  • the quantized initial transport block size is:
  • Km takes the value K, and the elements in the set K are positive integers;
  • the quantized initial transport block size is:
  • B represents the quantized initial transport block size
  • K' n is taken over the set K'
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K is a predefined or pre-configured set, or the set K is a set calculated according to a calculation parameter.
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • the set K' is a subset of the set K.
  • Km is the minimum value in the set K that is greater than or equal to the initial transport block size
  • Criterion 2 Km is a value in the set K that is less than or equal to the maximum value of the initial transport block size
  • Criterion 3 The value of Km is the smallest value of the absolute value of the difference between the size of the initial transport block and the size of the initial transport block in the set K.
  • the final value of Km is determined to be the minimum value or the maximum value of two or more values.
  • K' n is the minimum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki' - L CB ); or
  • K' n is the maximum value in the set K' that satisfies B_temp ⁇ C ⁇ (Ki'-L CB ); or
  • K' n is a value that satisfies the smallest absolute value of the difference between C ⁇ (Ki '-L CB ) and B_temp in the set K′;
  • B_temp represents the initial transport block size
  • L CB represents the code block cyclic redundancy check code CRC length
  • Y represents the threshold value
  • Ki' is an element in the set K'.
  • the final value of K' n is determined to be the minimum value or the maximum value of two or more values.
  • the determining, according to the quantized initial transport block size, the final transport block size including:
  • the final transport block size is the difference between the initial transport block size and the CRC length of the transport block.
  • the determining, according to the quantized initial transport block size, the final transport block size including:
  • the final transport block size is a product of the difference between the initial transport block size and the CRC length of the transport block and the number of layers of the codeword mapping.
  • the threshold value is equal to a maximum length value of the code block.
  • the method further includes:
  • a target element that is not a multiple of 8 in the set K and/or the set K' is quantized such that the target element is a multiple of 8.
  • the method further includes:
  • the quantized initial transport block size is quantized to a multiple of 8.
  • the method further includes: after determining the final transport block size according to the quantized initial transport block size, the method further includes:
  • the final transport block size is quantized to a multiple of 8.
  • the disclosed method and apparatus may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • each functional unit in various embodiments of the present disclosure may be integrated into one processing unit, or each unit may be physically included separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
  • the above-described integrated unit implemented in the form of a software functional unit can be stored in a computer readable storage medium.
  • the above software functional unit is stored in a storage medium and includes a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform part of the steps of the transceiving method of the various embodiments of the present disclosure.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, and the program code can be stored. Medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Quality & Reliability (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本公开提供一种确定传输块大小的方法、装置及设备。本公开的确定传输块大小的方法，包括：确定初始传输块大小；将所述初始传输块大小和门限值进行比较，获得比较结果；根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；根据所述量化后的初始传输块大小确定最终的传输块大小。

Description

确定传输块大小的方法、装置及设备
相关申请的交叉引用
本申请主张在2017年8月4日在中国提交的中国专利申请No.201710659738.2的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其涉及一种确定传输块大小的方法、装置及设备。
背景技术
在LTE(Long Term Evolution，长期演进)中，数据信道承载的传输块大小可通过查表的方式获得。LTE的数据信道资源分配以PRB(Physical Resource Block，物理资源块)pair(对)为单位，在TBS(Transport Block Size，传输块大小)表格设计时，假设了每个PRB pair中的可用于数据信道传输的RE(Resource Element，资源单元)数是固定的。
然而，NR(New Radio，新空口)中数据信道的资源分配更加灵活。例如，一次调度可以分配一个时隙、一个或者多个符号、或者多个时隙的资源等。由于在NR中的资源调度相对LTE更加灵活，因此无法直接沿用LTE的TBS确定方法。
相关技术中提出了一种根据调度信息动态计算TBS的方法。该方法虽然可以灵活得根据资源分配计算TBS，但获得的TBS可能为任意字节，这显然不适应NR中只对特定长度的码块进行验证和优化的特性，从而无法保证传输块的性能。
发明内容
有鉴于此，本公开提供一种确定传输块大小的方法、装置及设备，以在NR系统中保证传输块的性能。
第一方面，本公开实施例提供一种确定传输块大小的方法，包括：
确定初始传输块大小；
将所述初始传输块大小和门限值进行比较，获得比较结果；
根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；
根据所述量化后的初始传输块大小确定最终的传输块大小。
可选地，所述确定初始传输块大小，包括：
接收调度信息；
根据所述调度信息确定初始传输块大小。
可选地，所述确定初始传输块大小，包括：
接收调度信息；
确定码字映射的层数；
根据所述调度信息和码字映射的层数，确定初始传输块大小。
可选地，所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小，包括：
若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
B＝Km；
其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数。
可选地，所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小，还包括：
若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
B＝C×(K' n-L CB)；
其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000001
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
可选地，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
可选地，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000002
其中，
Figure PCTCN2018096451-appb-000003
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
可选地，所述集合K'为所述集合K的子集。
可选地，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
其中，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
可选地，K' n的选取准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000004
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
可选地，当满足准则1、或准则2或准则3的K′ n的个数为2个以上时，K′ n的最终取值确定为2个以上的值中的最小值或者最大值。
可选地，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
可选地，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
可选地，所述门限值等于码块的最大长度值。
可选地，所述方法还包括：
对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
可选地，在所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小后，所述方法还包括：
将所述量化后的初始传输块大小量化为8的倍数。
可选地，在所述根据所述量化后的初始传输块大小确定最终的传输块大小后，所述方法还包括：
将所述最终的传输块大小量化为8的倍数。
第二方面，本公开实施例提供一种确定传输块大小的装置，包括：处理器、收发机及存储在所述存储器上并可在所述处理器上运行的程序，其中，在执行所述程序时，所述处理器用于：
确定初始传输块大小；
将所述初始传输块大小和门限值进行比较，获得比较结果；
根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；
根据所述量化后的初始传输块大小确定最终的传输块大小。
可选地，在确定初始传输块大小时，所述处理器用于：
接收调度信息；
根据所述调度信息确定初始传输块大小。
可选地，在确定初始传输块大小时，所述处理器进一步用于：
接收调度信息；
确定码字映射的层数；
根据所述调度信息和码字映射的层数，确定初始传输块大小。
可选地，在根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小时，所述处理器用于：
若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
B＝Km；
其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数。
可选地，在根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小时，所述处理器进一步用于：
若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
B＝C×(K' n-L CB)；
其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000005
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
可选地，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
可选地，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000006
其中，
Figure PCTCN2018096451-appb-000007
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
可选地，所述集合K'为所述集合K的子集。
可选地，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
可选地，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
可选地，K' n的选择准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000008
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
可选地，当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
可选地，处理器进一步具体用于，确定所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
可选地，处理器进一步具体用于，确定所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
可选地，所述门限值等于码块的最大长度值。
可选地，所述处理器进一步用于：
对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
可选地，所述处理器进一步用于：
将所述量化后的初始传输块大小量化为8的倍数。
可选地，所述处理器进一步用于：
将所述最终的传输块大小量化为8的倍数。
第三方面，本公开实施例提供一种计算机可读存储介质，用于存储程序，所述程序被处理器执行时实现如第一方面任一项所述的方法中的步骤。
附图说明
图1为本公开的一些实施例的确定传输块大小的方法的流程图；
图2为本公开的另一些实施例的确定传输块大小的方法的流程图；
图3为本公开的另一些实施例的确定传输块大小的方法的流程图；
图4为本公开的一些实施例的确定传输块大小的装置的示意图；
图5为本公开的一些实施例的第一确定模块的示意图；
图6为本公开的另一些实施例的第一确定模块的示意图；
图7为本公开的一些实施例的量化处理模块的示意图；
图8为本公开的一些实施例的确定传输块大小的装置的结构图；
图9为本公开的另一些实施例的确定传输块大小的装置的结构图；
图10为本公开的另一些实施例的确定传输块大小的装置的结构图；
图11为本公开的一些实施例的电子设备的示意图。
具体实施方式
下面将结合附图和实施例，对本公开的具体实施方式作进一步详细描述。以下实施例用于说明本公开，但不用来限制本公开的范围。
如图1所示，本公开实施例的确定传输块大小的方法包括步骤101至104。
步骤101、确定初始传输块大小。
在本公开实施例中，确定初始TBS的方式可包括但不局限于以下两种：
方式一、接收网络侧的调度信息，根据所述调度信息确定初始传输块大小。
方式二、接收网络侧的调度信息，根据所述调度信息确定码字映射的层数，根据所述调度信息和码字映射的层数，确定初始传输块大小。
步骤102、将所述初始传输块大小和门限值进行比较，获得比较结果。
在本公开实施例中，所述门限值等于码块的最大长度值。当然，根据实际需要，门限值的取值还可做相应的调整。
步骤103、根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小。
在此步骤中，具体的：
若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：B＝Km；其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：B＝C×(K' n-L CB)；其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000009
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示 码块CRC(Cyclic Redundancy Check，循环冗余校验码)长度，Y表示所述门限值。
在此，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
其中，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000010
其中，
Figure PCTCN2018096451-appb-000011
B_temp表示所述初始传输块大小，L CB表示码块CRC长度，Y表示所述门限值。其中，所述集合K'为所述集合K的子集。
在实际应用中，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。例如，在某种情况下满足准则3的候选Km值有3个，那么可在3个候选Km值中选取最大值或者最小值作为最终的Km的取值。
在实际应用中，K' n的选取准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000012
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。例如，在某种情况下满足准则3的候选K' n值有3个，那么可在3个候选K' n值中选取最大值或者最小值作为最终的K' n的取值。
步骤104、根据所述量化后的初始传输块大小确定最终的传输块大小。
若码字映射到单层传输或者初始TBS计算考虑了码字映射的层数，所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。否则，所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
利用本公开实施例的方案计算获得TBS，可保证TBS在码块分段后，每个码块的长度相等，从而在NR系统中保证了一个TBS分割成的多个码块具有相同的性能。进一步，通过合理的集合K/K'中元素值的设计，可以最小化码块分割以及编码、交织过程的补零个数，从而降低编解码复杂度，同时最大程度优化码块的编解码性能。并且，通过选择NR中充分验证和优化的码块长度作为集合中的元素值可以保证TB(Transport Block，传输块)的性能。
此外，为了获得整数字节长度的TBS，在本公开实施例中，对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。或者，还可将所述量化后的初始传输块大小量化为8的倍数。或者，还可将所述最终的传输块大小量化为8的倍数。
以下实施例中，以终端侧的处理过程为例，详细描述一下本公开实施例的实现过程。
如图2所示，本公开实施例的确定传输块大小的方法，包括步骤201至203。
步骤201、终端侧确定初始传输块大小TBS，记为B_temp。
具体地，终端侧根据网络侧发送的调度信息确定B_temp，B_temp包含了传输块的CRC长度，将CRC长度记为L TB。在此实施例中，设定在确定初始TBS时不考虑码字映射的层数。
在此步骤中，可通过如下方式确定初始传输块大小。
方式一：终端侧根据网络侧发送的调度信息计算初始传输块大小B_temp。
具体地，终端侧按照下述公式计算初始传输块大小：
B_temp＝N RE×Q m×R
其中，N RE为分配的数据信道占用的资源单元(Resource Element，RE)个数；Q m为调制阶数；R为目标码率。N RE可根据网络侧分配的时频资源计算得到，调制阶数和目标码率通过网络侧发送的调度信息获得。
方式二：终端侧根据调度信息查表获得初始传输块大小B_temp。
具体地，终端根据调度信息查表直接获得B_temp，或者根据调度信息查表再经过进一步的换算获得B_temp。
步骤202、终端确定量化后的传输块大小B。
具体地，在此按照下述方式确定量化后的传输块大小B。
将所述初始传输块大小和门限值进行比较，获得比较结果，然后根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小。
具体的，
若B_temp≤Y，则B＝Km；C＝1；
若B_temp＞Y，则B＝C×(K' n-L CB)，
Figure PCTCN2018096451-appb-000013
其中，B表示量化后的初始传输块大小，B_temp表示所述初始传输块大小，Km取值于集合K，集合K中的元素为正整数；K' n取值于集合K'，L CB表示码块循环冗余校验码CRC长度，Y表示门限值。其中，较优地，Y为码块最大长度。
在此实施例中，Km为集合K中一个取值。具体地，Km为集合K中大于或等于B_temp的最小值，或者为集合K中小于或等于B_temp的最大值，或者为集合K中最接近B_temp的一个取值。其中，“最接近”的含义指的是，Km与所述初始传输块大小的差值的绝对值最小。进一步可以约定，当集合中的两个取值同时满足以上的某个条件时，选择较大或者较小的一个取值。
在此实施例中，K' n为集合K'中的一个取值。
具体地，K' n为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值，或者满足B_temp≥C×(Ki'-L CB)的最大值，或者满足C×(Ki'-L CB)最接近B_temp的一个取值。Ki'为集合K'中的元素。其中，“最接近”的含义指的是，K' n取值为集合K'中C×(Ki'-L CB)与所述初始传输块大小的差值的绝对值最小。进一步可以约定，当集合中的两个取值同时满足以上的某个条件时，选择较大或者较小的一个取值。
其中，集合K'中的最小值大于
Figure PCTCN2018096451-appb-000014
较优地，集合K'为满足最小值大于
Figure PCTCN2018096451-appb-000015
的集合K的子集。
步骤203、终端侧确定最终的传输块大小，记为B_final。
由于在此实施例中，在确定初始TBS时不考虑码字映射的层数，因此，B_final＝(B-L TB)×v，其中，v为码字映射的层数。
以下，结合集合K的不同的获得方式，对上述实施例的实现过程做详细说明。
在本公开实施例中，集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
(一)集合K为协议中预定义的一个集合。
具体地，例如集合K中可能的取值如下表1所示，
即{40,48,...,512,528,544,...,1024,1056,1088,...,2048,2112,2176,...,6144,6272,6400,...,8448}。
表1
Figure PCTCN2018096451-appb-000016
假设码块最大长度Y＝8448，则：
K∈{40,48,...,512,528,544,...,1024,1056,1088,...,2048,2112,2176,...,6144,6272,6400,...,8448}。
假设初始传输块大小B_temp＝6636，B_temp≤Y＝8448，则C＝1，B＝Km。进一步，假设协议规定Km为集合K中小于或等于B_temp的最大值，则B_temp＝6636量化后的传输块大小B＝6272。
同理，假设协议规定Km为集合K中大于或等于B_temp的最小值，则B_temp＝6636量化后的传输块大小B＝6400。
再假设协议规定Km为集合K中最接近B_temp的一个取值，且当集合中的两个取值同时满足时，选择较大的一个取值，则B_temp＝6636量化后的传输块大小B＝6400。
假设初始传输块大小B_temp＝15264，码块的CRC长度L CB为24比特，B_temp＞Y＝8448，则B＝C×(K' n-L CB)，其中
Figure PCTCN2018096451-appb-000017
进一步，假设协议规定K' n为集合K'中满足C×(Ki'-L CB)最接近B_temp的一 个取值。集合K'为集合K的子集，满足集合K'中的最小值大于
Figure PCTCN2018096451-appb-000018
即集合K'∈{4224,4288,...,6144,6272,6400,...,8448}，则K' n＝7680。则B_temp＝6636量化后的传输块大小B＝C×(K' n-L CB)＝2×(7680-24)＝15312。
假设码块最大长度Y＝2560，其它假设沿用上述Y＝8448的假设，则K∈{40,48,...,512,528,544,...,1024,1056,1088,...,2048,2112,2176,...,2560}。
仍然假设初始TBS B_temp＝6336，则B＝C×(K' n-L CB)。
其中，
Figure PCTCN2018096451-appb-000019
集合K'为集合K的子集，且其中的最小值大于
Figure PCTCN2018096451-appb-000020
K'∈{1728,1760,...,2560}，K' n＝2112，量化后的传输块大小B＝C×(K' n-L CB)＝3×(2112-24)＝6264。
最后，根据量化后的传输块大小B确定最终的传输块大小B_final。
假设B＝6264，L TB＝24，v＝2，则B_final＝(B-L TB)×v＝12480。
(二)集合K为预配置的一个集合。
具体地，例如网络侧为终端配置集合K，集合K为例1中的集合K的一个子集。在这种情况下，确定传输块大小的方式和情况(一)的其他处理过程相同。
(三)集合K为根据计算参数计算得到的一个集合。
具体地，例如集合K中的元素为Kb*Z，其中，Z为LDPC lifting大小的集合，取值如下表2所示。
表2
Figure PCTCN2018096451-appb-000021
Kb根据BG(Base Gragh)1或者BG2，以及码长进一步确定。以BG1为例，Kb＝22。
则集合K为{44，66，88，110，132，154，176，198，220，242，264，308，352，…,8448}
进一步，对于不是整数字节长度(8的整数倍)的值进行量化。例如，对于66，量化为64或者72。量化规则可以是大于该数值的最小整数字节，或者小于该数值的最大整数字节，或者最接近该数值的整数字节。或者，对集合中是非整数字节不进行字节量化，而对量化后的TBS进行字节量化或者对最终的TBS进行字节量化。
仍然采用与情况一中Y＝8448相同的假设。若B_temp＝15264，则B＝C×(K' n-L CB)，其中C＝2，K'∈{4224,4576,...,8448}，则K' n＝7744。则量化后的传输块大小B＝15440。
最后，根据量化后的传输块大小B确定最终的传输块大小B_final。
如图3所示，本公开实施例的确定传输块大小的方法，包括步骤301至303。
步骤301、终端侧确定初始传输块大小TBS，记为B_temp。
具体地，终端侧根据网络侧发送的调度信息确定B_temp，B_temp包含了传输块的CRC长度，记为L TB。在确定初始TBS时考虑码字映射的层数。
以下给出几种具体的获得初始TBS的方式。
方式一：终端侧根据网络侧发送的调度信息计算初始传输块大小B_temp。
具体地，终端侧按照下述公式计算初始传输块大小：
B_temp＝N RE×Q m×R×v
其中，N RE为分配的数据信道占用的资源单元(Resource Element，RE)个数；Q m为调制阶数；R为目标码率。N RE可根据网络侧分配的时频资源计算得到，调制阶数和目标码率通过网络侧发送的调度信息获得。v为码字映射的层数，通过网络侧发送的调度信息获得。
方式二：终端侧根据调度信息查表获得初始传输块大小B_temp。
具体地，终端根据调度信息查表直接获得B_temp，或者根据调度信息查表再经过进一步的换算获得B_temp。
步骤302、终端侧确定初始传输块大小TBS，记为B_temp。
此过程可参照前述步骤202的描述。
步骤303、终端侧确定最终的传输块大小，记为B_final。
由于在此实施例中，在确定初始TBS时考虑了码字映射的层数，因此，B_final＝B-L TB。
假设B＝6264，L TB＝24，则B_final＝B-L TB＝6240。
本公开实施例的确定传输块大小的方法，适用于5G NR中。通过以上描述可以看出，采用本公开可以以一个统一的公式计算获得TBS且保证TBS在码块分段后，每个码块的长度相等，并且码块长度等于一个预设集合中的值。通过合理的K/K’集合中元素值的设计，可以最小化码块分割以及编码、交织过程的补零个数，从而降低编解码复杂度，同时最大程度优化码块的编解码性能。并且，通过选择NR中充分验证和优化的码块长度作为集合中的元素值可以保证TB的性能。
如图4所示，本公开实施例的确定传输块大小的装置，包括：
第一确定模块401，用于确定初始传输块大小；比较模块402，用于将所述初始传输块大小和门限值进行比较，获得比较结果；量化处理模块403，用于根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；第二确定模块404，用于根据所述量化后的初始传输块大小确定最终的传输块大小。
如图5所示，所述第一确定模块401包括：
第一接收子模块4011，用于接收调度信息；第一确定子模块4012，用于根据所述调度信息确定初始传输块大小。
如图6所示，所述第一确定模块401包括：
第二接收子模块4013，用于接收调度信息；第二确定子模块4014，用于确定码字映射的层数；第三确定子模块4015，用于根据所述调度信息和码字映射的层数，确定初始传输块大小。
如图7所示，所述量化处理模块403包括：
第一量化子模块4031，用于若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
B＝Km；
其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
第二量化子模块4032，用于若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
B＝C×(K' n-L CB)；
其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000022
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
其中，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000023
其中，
Figure PCTCN2018096451-appb-000024
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K'为所述集合K的子集。
其中，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
其中，K' n的选取准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000025
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
其中，所述第二确定模块404具体用于，确定所述最终的传输块大小为， 所述初始传输块大小和传输块的CRC长度之差。
其中，所述第二确定模块404具体用于，确定所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
其中，所述门限值等于码块的最大长度值。
如图8所示，所述装置还包括：第一量化模块405，用于对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
如图9所示，所述装置还包括：第二量化模块406，用于将所述量化后的初始传输块大小量化为8的倍数。
如图10所示，所述装置还包括：第三量化模块407，用于将所述最终的传输块大小量化为8的倍数。
通过以上描述可以看出，采用本公开可以以一个统一的公式计算获得TBS且保证TBS在码块分段后，每个码块的长度相等，并且码块长度等于一个预设集合中的值。通过合理的K/K’集合中元素值的设计，可以最小化码块分割以及编码、交织过程的补零个数，从而降低编解码复杂度，同时最大程度优化码块的编解码性能。并且，通过选择NR中充分验证和优化的码块长度作为集合中的元素值可以保证TB的性能。
如图11所示，本公开实施例的电子设备包括：
处理器1100，用于读取存储器1120中的程序，执行下列过程：
确定初始传输块大小；将所述初始传输块大小和门限值进行比较，获得比较结果；根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；根据所述量化后的初始传输块大小确定最终的传输块大小；
收发机1110，用于在处理器1100的控制下接收和发送数据。
其中，在图11中，总线架构可以包括任意数量的互联的总线和桥，具体由处理器1100代表的一个或多个处理器和存储器1120代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。收发机1110可以是多个元件， 即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元。处理器1100负责管理总线架构和通常的处理，存储器1120可以存储处理器1100在执行操作时所使用的数据。
处理器1100负责管理总线架构和通常的处理，存储器1120可以存储处理器1100在执行操作时所使用的数据。
处理器1100还用于读取所述计算机程序，执行如下步骤:
接收调度信息；
根据所述调度信息确定初始传输块大小。
处理器1100还用于读取所述计算机程序，执行如下步骤:
接收调度信息；
确定码字映射的层数；
根据所述调度信息和码字映射的层数，确定初始传输块大小。
处理器1100还用于读取所述计算机程序，执行如下步骤:
若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
B＝Km；
其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
B＝C×(K' n-L CB)；
其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000026
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
其中，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000027
其中，
Figure PCTCN2018096451-appb-000028
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K'为所述集合K的子集。
其中，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
其中，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
其中，K' n的选取准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000029
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
其中，当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
处理器1100还用于读取所述计算机程序，执行如下步骤:
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
处理器1100还用于读取所述计算机程序，执行如下步骤:
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
其中，所述门限值等于码块的最大长度值。
处理器1100还用于读取所述计算机程序，执行如下步骤:
对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
处理器1100还用于读取所述计算机程序，执行如下步骤:
将所述量化后的初始传输块大小量化为8的倍数。
处理器1100还用于读取所述计算机程序，执行如下步骤:
将所述最终的传输块大小量化为8的倍数。
此外，本公开实施例的计算机可读存储介质，用于存储计算机程序，所述计算机程序可被处理器执行实现以下步骤：
其中，所述确定初始传输块大小，包括：
接收调度信息；
根据所述调度信息确定初始传输块大小。
其中，所述确定初始传输块小，包括：
接收调度信息；
确定码字映射的层数；
根据所述调度信息和码字映射的层数，确定初始传输块大小。
其中，所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小，包括：
若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
B＝Km；
其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
B＝C×(K' n-L CB)；
其中，B表示量化后的初始传输块大小，
Figure PCTCN2018096451-appb-000030
K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
其中，所述集合K'的最小值大于
Figure PCTCN2018096451-appb-000031
其中，
Figure PCTCN2018096451-appb-000032
B_temp 表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
其中，所述集合K'为所述集合K的子集。
其中，Km的选取准则为：
准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
其中，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
其中，K' n的选取准则为：
准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
其中，
Figure PCTCN2018096451-appb-000033
B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
其中，当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
其中，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
其中，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
其中，所述门限值等于码块的最大长度值。
其中，所述方法还包括：
对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
其中，在所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小后，所述方法还包括：
将所述量化后的初始传输块大小量化为8的倍数。
其中，在所述根据所述量化后的初始传输块大小确定最终的传输块大小后，所述方法还包括：
将所述最终的传输块大小量化为8的倍数。
在本申请所提供的几个实施例中，应该理解到，所揭露方法和装置，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理包括，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能单元的形式实现。
上述以软件功能单元的形式实现的集成的单元，可以存储在一个计算机可读取存储介质中。上述软件功能单元存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开各个实施例所述收发方法的部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，简称ROM)、随机存取存储器(Random Access Memory，简称RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述是本公开的可选实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本公开所述原理的前提下，还可以作出若干改进和 润饰，这些改进和润饰也应视为本公开的保护范围。

Claims (37)

  1. 一种确定传输块大小的方法，包括：
    确定初始传输块大小；
    将所述初始传输块大小和门限值进行比较，获得比较结果；
    根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；
    根据所述量化后的初始传输块大小确定最终的传输块大小。
  2. 根据权利要求1所述的方法，其中，所述确定初始传输块大小，包括：
    接收调度信息；
    根据所述调度信息确定所述初始传输块大小。
  3. 根据权利要求1所述的方法，其中，所述确定初始传输块大小，包括：
    接收调度信息；
    确定码字映射的层数；
    根据所述调度信息和码字映射的层数，确定所述初始传输块大小。
  4. 根据权利要求1所述的方法，其中，所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小，包括：
    若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
    B＝Km；
    其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
  5. 根据权利要求1所述的方法，其中，所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小，还包括：
    若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
    B＝C×(K' n-L CB)；
    其中，B表示量化后的初始传输块大小，
    Figure PCTCN2018096451-appb-100001
    K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y 表示所述门限值。
  6. 根据权利要求4或5所述的方法，其中，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
  7. 根据权利要求4或5所述的方法，其中，所述集合K'的最小值大于
    Figure PCTCN2018096451-appb-100002
    其中，
    Figure PCTCN2018096451-appb-100003
    B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
  8. 根据权利要求7所述的方法，其中，所述集合K'为所述集合K的子集。
  9. 根据权利要求4或5所述的方法，其中，Km的选取准则为：
    准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；或者
    准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
    准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
  10. 根据权利要求9所述的方法，其中，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
  11. 根据权利要求4或5所述的方法，其中，K' n的选取准则为：
    准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
    准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
    准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
    其中，
    Figure PCTCN2018096451-appb-100004
    B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
  12. 根据权利要求11所述的方法，其中，当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
  13. 根据权利要求2所述的方法，其中，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
    所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
  14. 根据权利要求3所述的方法，其中，所述根据所述量化后的初始传输块大小确定最终的传输块大小，包括：
    所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
  15. 根据权利要求1所述的方法，其中，所述门限值等于码块的最大长度值。
  16. 根据权利要求4或5所述的方法，还包括：
    对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
  17. 根据权利要求1所述的方法，其中，在所述根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小后，所述方法还包括：
    将所述量化后的初始传输块大小量化为8的倍数。
  18. 根据权利要求1所述的方法，其中，在所述根据所述量化后的初始传输块大小确定最终的传输块大小后，所述方法还包括：
    将所述最终的传输块大小量化为8的倍数。
  19. 一种确定传输块大小的装置，包括：处理器、收发机及存储在所述存储器上并可在所述处理器上运行的程序，其中，在执行所述程序时，所述处理器用于：
    确定初始传输块大小；
    将所述初始传输块大小和门限值进行比较，获得比较结果；
    根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小；
    根据所述量化后的初始传输块大小确定最终的传输块大小。
  20. 根据权利要求19所述的装置，其中，在确定初始传输块大小时，所述处理器用于：
    接收调度信息；
    根据所述调度信息确定初始传输块大小。
  21. 根据权利要求19所述的装置，其中，在确定初始传输块大小时，所述处理器进一步用于：
    接收调度信息；
    确定码字映射的层数；
    根据所述调度信息和码字映射的层数，确定初始传输块大小。
  22. 根据权利要求19所述的装置，其中，在根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小时，所述处理器用于：
    若比较结果为所述初始传输块大小小于或等于所述门限值，则量化后的初始传输块大小为：
    B＝Km；
    其中，B表示量化后的初始传输块大小，Km取值于集合K，集合K中的元素为正整数；
  23. 根据权利要求19所述的装置，其中，在根据所述比较结果对所述初始传输块大小进行量化，获得量化后的初始传输块大小时，所述处理器进一步用于：
    若比较结果为所述初始传输块大小大于所述门限值，则量化后的初始传输块大小为：
    B＝C×(K' n-L CB)；
    其中，B表示量化后的初始传输块大小，
    Figure PCTCN2018096451-appb-100005
    K' n取值于集合K'，B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
  24. 根据权利要求22或23所述的装置，其中，所述集合K为预定义或者预配置的集合，或者所述集合K为根据计算参数计算得到的集合。
  25. 根据权利要求21所述的装置，其中，所述集合K'的最小值大于
    Figure PCTCN2018096451-appb-100006
    其中，
    Figure PCTCN2018096451-appb-100007
    B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值。
  26. 根据权利要求22所述的装置，其中，所述集合K'为所述集合K的子集。
  27. 根据权利要求22或23所述的装置，其中，Km的选取准则为：
    准则1：Km取值为集合K中大于或等于所述初始传输块大小的最小值；
    准则2：Km取值为集合K中小于或等于所述初始传输块大小的最大值；或者
    准则3：Km取值为集合K中与所述初始传输块大小的差值的绝对值最小的值。
  28. 根据权利要求25所述的装置，其中，当满足准则1、或准则2或准则3的Km的个数为2个以上时，Km的最终取值确定为2个以上的值中的最小值或者最大值。
  29. 根据权利要求22或23所述的装置，其中，K' n的选取准则为：
    准则1：K' n取值为集合K'中满足B_temp≤C×(Ki'-L CB)的最小值；或者
    准则2：K' n取值为集合K'中满足B_temp≥C×(Ki'-L CB)的最大值；或者
    准则3：K' n取值为集合K'中满足C×(Ki'-L CB)与B_temp的差值的绝对值最小的值；
    其中，
    Figure PCTCN2018096451-appb-100008
    B_temp表示所述初始传输块大小，L CB表示码块循环冗余校验码CRC长度，Y表示所述门限值，Ki'为集合K'中的元素。
  30. 根据权利要求27所述的装置，其中，当满足准则1、或准则2或准则3的K' n的个数为2个以上时，K' n的最终取值确定为2个以上的值中的最小值或者最大值。
  31. 根据权利要求19所述的装置，其中，所述处理器进一步用于：确定所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差。
  32. 根据权利要求20所述的装置，其中，所述处理器进一步用于：确定所述最终的传输块大小为，所述初始传输块大小和传输块的CRC长度之差与码字映射的层数的积。
  33. 根据权利要求19所述的装置，其中，所述门限值等于码块的最大长度值。
  34. 根据权利要求22或23所述的装置，所述处理器进一步用于：
    对所述集合K和/所述集合K'中不是8的倍数的目标元素进行量化，使得所述目标元素为8的倍数。
  35. 根据权利要求19所述的装置，所述处理器进一步用于：
    将所述量化后的初始传输块大小量化为8的倍数。
  36. 根据权利要求19所述的装置，所述处理器进一步用于：
    将所述最终的传输块大小量化为8的倍数。
  37. 一种计算机可读存储介质，用于存储程序，其中，所述程序被处理器执行时实现如权利要求1至18中任一项所述的方法中的步骤。
PCT/CN2018/096451 2017-08-04 2018-07-20 确定传输块大小的方法、装置及设备 Ceased WO2019024696A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
KR1020207005928A KR102326830B1 (ko) 2017-08-04 2018-07-20 전송 블록 크기를 확정하는 방법, 장치 및 기기
JP2020506256A JP7009611B2 (ja) 2017-08-04 2018-07-20 伝送ブロックサイズ特定方法、装置および機器
EP18840627.6A EP3664544B1 (en) 2017-08-04 2018-07-20 Method, apparatus and device for determining size of transmission block
US16/633,547 US11212703B2 (en) 2017-08-04 2018-07-20 Method, apparatus and equipment for determining transport block size

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710659738.2 2017-08-04
CN201710659738.2A CN109392100B (zh) 2017-08-04 2017-08-04 一种确定传输块大小的方法、装置及设备

Publications (1)

Publication Number Publication Date
WO2019024696A1 true WO2019024696A1 (zh) 2019-02-07

Family

ID=65233526

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/096451 Ceased WO2019024696A1 (zh) 2017-08-04 2018-07-20 确定传输块大小的方法、装置及设备

Country Status (7)

Country Link
US (1) US11212703B2 (zh)
EP (1) EP3664544B1 (zh)
JP (1) JP7009611B2 (zh)
KR (1) KR102326830B1 (zh)
CN (1) CN109392100B (zh)
TW (1) TWI794260B (zh)
WO (1) WO2019024696A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3923494A4 (en) * 2019-03-05 2022-03-16 Huawei Technologies Co., Ltd. Transport block size determining method and communication apparatus
CN111669251B (zh) * 2019-03-05 2022-07-22 华为技术有限公司 传输块大小的确定方法及通信装置
WO2020220314A1 (zh) * 2019-04-30 2020-11-05 富士通株式会社 资源确定方法、资源调度方法以及装置
EP4014409A1 (en) * 2019-08-16 2022-06-22 Telefonaktiebolaget LM Ericsson (publ) Tbs determination for multi-trp pdsch transmission schemes
US11672007B2 (en) * 2020-03-06 2023-06-06 Qualcomm Incorporated Feedback reporting in a two-step random-access procedure
EP4133861A4 (en) * 2020-04-08 2024-01-03 Apple Inc. TRANSPORT BLOCK SIZING FOR A PHYSICAL SHARED CHANNEL
CN115250168B (zh) * 2021-04-28 2024-07-12 维沃移动通信有限公司 传输块大小计算方法、装置及通信设备

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101378534A (zh) * 2007-08-29 2009-03-04 中兴通讯股份有限公司 高速上行分组接入的媒体接入控制层调度方法及系统
CN101431791A (zh) * 2007-12-27 2009-05-13 华为技术有限公司 Hspa功率分配方法、系统和装置
CN101860977A (zh) * 2009-04-10 2010-10-13 大唐移动通信设备有限公司 使基站获取ue上下文信息的方法和系统
CN102118793A (zh) * 2011-03-01 2011-07-06 大唐移动通信设备有限公司 一种匹配tbs的方法和装置
CN102469566A (zh) * 2010-11-12 2012-05-23 中兴通讯股份有限公司 无线资源分配方法及装置
WO2016018125A1 (ko) * 2014-07-31 2016-02-04 엘지전자 주식회사 비면허대역을 지원하는 무선접속시스템에서 전송 기회 구간을 설정하는 방법 및 장치

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009096658A1 (en) * 2008-01-31 2009-08-06 Lg Electronics Inc. Method for determining transport block size and signal transmission method using the same
KR101526990B1 (ko) 2008-01-31 2015-06-11 엘지전자 주식회사 전송 블록 크기 결정 방법 및 이를 이용한 신호 전송 방법
US8867673B2 (en) * 2010-07-23 2014-10-21 Qualcomm Incorporated Selective quantization of decision metrics in wireless communication
EP2661820A1 (en) * 2011-01-07 2013-11-13 Interdigital Patent Holdings, Inc. Selection of transmission parameters for transmit diversity terminals
US9160485B2 (en) * 2012-12-03 2015-10-13 Lg Electronics Inc. Method and apparatus for encoding transport block
KR101765375B1 (ko) * 2014-03-21 2017-08-08 주식회사 케이티 전송 블록 크기 결정 방법 및 장치
CN110519017B (zh) 2014-03-21 2022-05-31 株式会社Kt 确定传输块大小的方法和其设备
US10425938B2 (en) 2015-11-06 2019-09-24 Kt Corporation Method of determining modulation order and transport block size in downlink data channel, and apparatus thereof
US10707988B2 (en) * 2017-09-11 2020-07-07 Mediatek Singapore Pte. Ltd Transport block size determination in mobile communications

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101378534A (zh) * 2007-08-29 2009-03-04 中兴通讯股份有限公司 高速上行分组接入的媒体接入控制层调度方法及系统
CN101431791A (zh) * 2007-12-27 2009-05-13 华为技术有限公司 Hspa功率分配方法、系统和装置
CN101860977A (zh) * 2009-04-10 2010-10-13 大唐移动通信设备有限公司 使基站获取ue上下文信息的方法和系统
CN102469566A (zh) * 2010-11-12 2012-05-23 中兴通讯股份有限公司 无线资源分配方法及装置
CN102118793A (zh) * 2011-03-01 2011-07-06 大唐移动通信设备有限公司 一种匹配tbs的方法和装置
WO2016018125A1 (ko) * 2014-07-31 2016-02-04 엘지전자 주식회사 비면허대역을 지원하는 무선접속시스템에서 전송 기회 구간을 설정하는 방법 및 장치

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
TWI794260B (zh) 2023-03-01
CN109392100A (zh) 2019-02-26
EP3664544A4 (en) 2020-07-22
KR20200030606A (ko) 2020-03-20
EP3664544A1 (en) 2020-06-10
JP2020532167A (ja) 2020-11-05
US11212703B2 (en) 2021-12-28
TW201911785A (zh) 2019-03-16
CN109392100B (zh) 2021-09-10
US20200213902A1 (en) 2020-07-02
KR102326830B1 (ko) 2021-11-16
JP7009611B2 (ja) 2022-01-25
EP3664544B1 (en) 2022-03-02

Similar Documents

Publication Publication Date Title
WO2019024696A1 (zh) 确定传输块大小的方法、装置及设备
CN109716662B (zh) 使用极化码编码数据的方法和装置
JP6925450B2 (ja) データ送信方法、基地局、及び端末デバイス
CN110166168B (zh) 确定传输块大小的方法、装置以及系统
WO2018028351A1 (zh) 用于极化编码的方法、装置和设备
JP7434405B2 (ja) コードブロック分割方法、端末、基地局およびコンピュータ読み取り可能な記憶媒体
CN108809486B (zh) Polar码编译码方法及装置
CN108631937A (zh) 一种信息处理方法、装置及设备
CN110351843B (zh) 资源分配指示方法、资源分配获取方法、基站及用户终端
CN110063079B (zh) 传输块大小确定方法及装置
JP7507876B2 (ja) リソース決定方法及び機器
WO2019052343A1 (zh) 一种数据传输方法及装置
WO2020020131A1 (zh) 信息传输方法、终端及基站
WO2018137667A1 (zh) 传输数据的方法和装置以及传输信息的方法和装置
CN113784356B (zh) 一种通信参数的确定方法、装置、设备以及存储介质
CN108365938B (zh) 一种资源调度方法、用户设备及接入网设备
CN111315022A (zh) 上行控制信道资源确定方法、终端和网络侧设备
CN108631941B (zh) 通信方法和装置
CN110351003B (zh) 确定传输块大小的方法和通信装置
WO2018201903A1 (zh) 数据传输方法、终端和基站
WO2016145616A1 (zh) 一种信息传输方法、设备及系统
CN108322284A (zh) 编码块发送方法、数据接收方法、接入网设备及终端设备
WO2018171627A1 (zh) 分割传输块的方法、无线通信设备和芯片
WO2018028515A1 (zh) 一种资源分配方法和装置
WO2017185907A1 (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: 18840627

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020506256

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20207005928

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2018840627

Country of ref document: EP

Effective date: 20200304