Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO2019047980) TRANSPORT BLOCK SIZE DETERMINATION IN MOBILE COMMUNICATIONS
Document

Description

Title of Invention 0001   0002   0003   0004   0005   0006   0007   0008   0009   0010   0011   0012   0013   0014   0015   0016   0017   0018   0019   0020   0021   0022   0023   0024   0025   0026   0027   0028   0029   0030   0031   0032   0033   0034   0035   0036   0037   0038   0039   0040   0041   0042   0043   0044   0045   0046   0047   0048   0049   0050   0051   0052   0053   0054   0055   0056   0057   0058   0059   0060   0061   0062   0063   0064   0065   0066   0067   0068   0069   0070   0071   0072   0073   0074   0075   0076   0077   0078   0079   0080   0081   0082   0083   0084  

Claims

1   2   3   4   5   6   7   8   9   10   11   12   13   14   15   16   17   18   19   20  

Drawings

1   2   3  

Description

Title of Invention : TRANSPORT BLOCK SIZE DETERMINATION IN MOBILE COMMUNICATIONS

[0001]
CROSS REFERENCE TO RELATED PATENT APPLICATION (S)
[0002]
The present disclosure is part of a non-provisional application that claims the priority benefit of U.S. Provisional Patent Application Nos. 62/556,541 and 62/566,814, filed on 11 September 2017 and 02 October 2017, respectively. Contents of above-listed applications are herein incorporated by reference in their entirety.

TECHNICAL FIELD

[0003]
The present disclosure is generally related to mobile communications and, more particularly, to transport block size (TBS) determination with respect to user equipment and network apparatus in mobile communications.

BACKGROUND

[0004]
Unless otherwise indicated herein, approaches described in this section are not prior art to the claims listed below and are not admitted as prior art by inclusion in this section.
[0005]
In Long-Term Evolution (LTE) , the TBS is determined based on the physical resource block (PRB) allocation and the TBS index by using a look-up table. This may be workable when the number of parameters for deriving a TBS is not very large. However, it may be more complex and cumbersome to define a TBS table in New Radio (NR) or a newly developed communication system.
[0006]
In NR, it is more complicated to determine the TBS because of the wide range of supported transmission durations, the wide bandwidth supported in NR, the large number of possible PRBs, the very dynamic available symbol per slot, or the very dynamic reference signal overheads. Accordingly, the TBS design in NR should be more comprehensive and may need to be re-designed. Therefore, it is needed to provide proper TBS determination schemes for NR.
[0007]
SUMMARY
[0008]
The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.
[0009]
An objective of the present disclosure is to propose solutions or schemes that address the aforementioned issues pertaining to TBS determination with respect to user equipment and network apparatus in mobile communications.
[0010]
In one aspect, a method may involve an apparatus determining an intermediate number of information bits. The method may also involve the apparatus quantizing the intermediate number of information bits. The method may further involve the apparatus determining a TBS according to the quantized intermediate number of information bits. The method may further involve the apparatus transmitting, by the processor, the information bits according to the TBS.
[0011]
In one aspect, an apparatus may comprise a transceiver capable of wirelessly communicating with a plurality of nodes of a wireless network. The apparatus may also comprise a processor communicatively coupled to the transceiver. The processor may be capable of determining an intermediate number of information bits. The processor may also be capable of quantizing the intermediate number of information bits. The processor may further be capable of determining a TBS according to the quantized intermediate number of information bits. The processor may further be capable of transmitting, via the transceiver, the information bits according to the TBS.
[0012]
It is noteworthy that, although description provided herein may be in the context of certain radio access technologies, networks and network topologies such as Long-Term Evolution (LTE) , LTE-Advanced, LTE-Advanced Pro, 5th Generation (5G) , New Radio (NR) , Internet-of-Things (IoT) and Narrow Band Internet of Things (NB-IoT) , the proposed concepts, schemes and any variation (s) /derivative (s) thereof may be implemented in, for and by other types of radio access technologies, networks and network topologies. Thus, the scope of the present disclosure is not limited to the examples described herein.
[0013]
BRIEF DESCRIPTION OF DRAWINGS
[0014]
The accompanying drawings are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of the present disclosure. The drawings illustrate implementations of the disclosure and, together with the description, serve to explain the principles of the disclosure. It is appreciable that the drawings are not necessarily in scale as some components may be shown to be out of proportion than the size in actual implementation in order to clearly illustrate the concept of the present disclosure.
[0015]
FIG. 1 is a diagram depicting an example scenario under schemes in accordance with implementations of the present disclosure.
[0016]
FIG. 2 is a block diagram of an example communication apparatus and an example network apparatus in accordance with an implementation of the present disclosure.
[0017]
FIG. 3 is a flowchart of an example process in accordance with an implementation of the present disclosure.

DETAILED DESCRIPTION

[0018]
Detailed embodiments and implementations of the claimed subject matters are disclosed herein. However, it shall be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matters which may be embodied in various forms. The present disclosure may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided so that description of the present disclosure is thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. In the description below, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments and implementations.
[0019]
Overview
[0020]
Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and/or solutions pertaining to TBS determination with respect to user equipment and network apparatus in mobile communications. According to the present disclosure, a number of possible solutions may be implemented separately or jointly. That is, although these possible solutions may be described below separately, two or more of these possible solutions may be implemented in one combination or another.
[0021]
FIG. 1 illustrates an example scenario 100 under schemes in accordance with implementations of the present disclosure. Scenario 100 involves a UE and a network node, which may be a part of a wireless communication network (e.g., a 5G network, an NR network, an IoT network or an NB-IoT network) . In LTE, the TBS is determined based on the PRB allocation and the TBS index by using a look-up table. This may be workable when the number of parameters for deriving a TBS is not very large. However, it may be more complex and cumbersome to define a TBS table in NR or a newly developed communication system. In NR, the TBS determination may need to support large range of PRB allocations, more flexible resource allocations that has to support mini-slots with varying number of allocated symbols, resource sharing with physical downlink control channel (PDCCH) , or ultra-reliable and low latency communications (URLLC) asymmetric hybrid automatic repeat request (HARQ) with varying resource allocation. Accordingly, a new design for TBS determination may be needed in NR.
[0022]
In NR, it is more complicated to determine the TBS because of the wide range of supported transmission durations, the wide bandwidth supported in NR, the large number of possible PRBs, the very dynamic available symbol per slot, or the very dynamic reference signal overheads. Thus, it may be more adequate to use a formula to determine the TBS in NR. Specifically, the UE may be configured to determine the TBS by determining an intermediate number of information bits first. The UE may determine the intermediate number of information bits according to at least one of a scheduled modulation order, a coding rate, a number of resource element, and a signaled number of layers. For example, the intermediate number of information bits may be determined according to the following equation.
[0023]
β = Q m×R×N REG×D REperREG×N L
[0024]
βdenotes the intermediate number of information bits. Q m denotes the scheduled modulation order. Rdenotes the coding rate. N REG denotes the number of resource element group (REG) and may be determined from the signaled resource allocation (RA) . AREG may correspond to one PRB resource allocation over one symbol. D REperREG denotes the density of RE per REG. N L denotes the signaled number of layers.
[0025]
In some implementation, the intermediate number of information bits may also be determined according to the following equation.
[0026]
β = N RE×R×Q m×v
[0027]
β denotes the intermediate number of information bits. N RE denotes the number of resource element. R denotes the coding rate. Q m denotes the scheduled modulation order.
[0028]
After determining the intermediate number of information bits, the UE may be configured to quantize the intermediate number of information bits. The UE may quantize the intermediate number of information bits by a step size. The step size may be configurable and may comprise a minimum value. The UE may be configured to determine the TBS according to the quantized intermediate number of information bits. The UE may be further configured to transmit the information bits according to the TBS. The UE may determine the TBS according to the following equation.
[0029]
[0030]
δ denotes the step size. The step size δ may be adjustable or fixed (e.g., a constant set to8) . N CRC denotes the transport block cycle redundant check (CRC) length.
[0031]
In a case that the step size is dynamic, it may be determined as a power of 2 (e.g., δ= 2 n) . The exponent part n may be determined according to a logarithm function of the non-quantized intermediate number of information bits β and a configurable offset constant c (e.g., c=6) . For example, n may be determined according to the following equation.
[0032]
[0033]
In this example, the step size may comprise a minimum value when n=3 (e.g., 2 3= 8) . Hence, the minimum quantization value may be determined as 1 byte.
[0034]
In some implementation, the step size may be determined according to the CRC length. Specifically, the non-quantized intermediate number of information bits β may be determined according to the CRC length (e.g., β = Q m×R×N REG×D REperREG×N L-N CRC) . The exponent part n of the step size maybe determined according to a logarithm function of thenon-quantized intermediate number of information bits β (e.g., Thus, the step size may be determined according to the CRC length. For example, nmay be determined according tothe following equation. The CRC length may be determined as 24. The offset constant may be determined as 5.
[0035]
[0036]
In some implementation, the UE may be configured to determine the TBS according to at least one of a number of code blocks, a code block size, and a CRC length. For example, the TBS may be determined according to the following equation.
[0037]
TBS = N CB×CBS-N CRC
[0038]
N CB denotes the number of code blocks. CBS denotes the code block size. N CRC denotes the CRC length.
[0039]
The number of code blocks may be determined by the following equations.
[0040]
[0041]
[0042]
K CB, max denotes the maximum code block size (e.g., K CB, max=3824 or K CB, max= 8192) .
[0043]
The code block size may be determined by the following equations.
[0044]
[0045]
[0046]
In a case that CBS -≤K CB, max, andCBS = CBS -. In a case that CBS ->K CB, max, and CBS = CBS +. and CBS -may be introduced to consider the round-floor quantization effect and may remove the unwanted boundaries errors. The code block size may be determined according to a byte alignment when δ=8.
[0047]
In some implementation, the TBS may be determined according to the following equations.
[0048]
[0049]
[0050]
N′ info denotes the quantized intermediate number of information bits. C may correspond to the number of code blocks. 24 may correspond to the CRC length. The other parts may correspond to the code block size.
[0051]
In some implementation, the UE may be configured to compare the intermediate number of information bits with a threshold value. The threshold value may comprise, for example and without limitation, 3824. The UE may be further configured to determine the TBS according to a comparison result. Specifically, the UE may be configured to determine whether the intermediate number of information bits is greater than the threshold value. In a case that the intermediate number of information bits is not greater than the threshold value, the UE may be configured to determine a first step size for quantizing the intermediate number of information bits. In a case that the intermediate number of information bits is greater than the threshold value, the UE may be configured to determine a second step size for quantizing the intermediate number of information bits. The second step size is different from the first step size. For example, in a case that β≤3824, the UE may determine the exponent part of the first step size by In a case thatβ>3824, the UE may determine the exponent part of the second step size by
[0052]
Accordingly, the UE configured with the TBS determination schemes in accordance with implementations of the present disclosure may be able to support the requirements in NR such as large range of PRB allocations, more flexible resource allocations that has to support mini-slots with varying number of allocated symbols, resource sharing with PDCCH, or URLLC asymmetric HARQ with varying resource allocation.
[0053]
Illustrative Implementations
[0054]
FIG. 2illustrates an example communication apparatus 210 and an example network apparatus 220 in accordance with an implementation of the present disclosure. Each of communication apparatus 210 and network apparatus 220 may perform various functions to implement schemes, techniques, processes and methods described herein pertaining to TBS determination with respect to user equipment and network apparatus in wireless communications, including scenario 100 described above as well as process 300 described below.
[0055]
Communication apparatus 210 may be a part of an electronic apparatus, which may be a UE such as a portable or mobile apparatus, a wearable apparatus, a wireless communication apparatus or a computing apparatus. For instance, communication apparatus 210 may be implemented in a smartphone, a smartwatch, a personal digital assistant, a digital camera, or a computing equipment such as a tablet computer, a laptop computer or a notebook computer. Communication apparatus 210 may also be a part of a machine type apparatus, which may be an IoT or NB-IoT apparatus such as an immobile or a stationary apparatus, a home apparatus, a wire communication apparatus or a computing apparatus. For instance, communication apparatus 210 may be implemented in a smartthermostat, a smart fridge, a smart door lock, a wireless speaker or a home control center. Alternatively, communication apparatus 210 may be implemented in the form of one or more integrated-circuit (IC) chips such as, for example and without limitation, one or more single-core processors, one or more multi-core processors, one or more reduced-instruction set computing (RISC) processors, or one or more complex-instruction-set-computing (CISC) processors. Communication apparatus 210 may include at least some of those components shown in FIG. 2 such as a processor 212, for example. communication apparatus 210 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and/or user interface device) , and, thus, such component (s) of communication apparatus 210 are neither shown in FIG. 2 nor described below in the interest of simplicity and brevity.
[0056]
Network apparatus 220 may be a part of an electronic apparatus, which may be a network node such as a base station, a small cell, a router or a gateway. For instance, network apparatus 220 may be implemented in an eNodeB in an LTE, LTE-Advanced or LTE-Advanced Pro network or in a gNB in a 5G, NR, IoT or NB-IoT network. Alternatively, network apparatus 220 may be implemented in the form of one or more IC chips such as, for example and without limitation, one or more single-core processors, one or more multi-core processors, or one or more RISC or CISC processors. Network apparatus 220 may include at least some of those components shown in FIG. 2 such as a processor 222, for example. Network apparatus 220 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and/or user interface device) , and, thus, such component (s) of network apparatus 220 are neither shown in FIG. 2 nor described below in the interest of simplicity and brevity.
[0057]
In one aspect, each of processor 212 and processor 222 may be implemented in the form of one or more single-core processors, one or more multi-core processors, or one or more CISC processors. That is, even though a singular term “a processor” is used herein to refer to processor 212 and processor 222, each of processor 212 and processor 222 may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor 212 and processor 222 may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and/or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor 212 and processor 222 is a special-purpose machine specifically designed, arranged and configured to perform specific tasks including power consumption reduction in a device (e.g., as represented by communication apparatus210) and a network (e.g., as represented by network apparatus 220) in accordance with various implementations of the present disclosure.
[0058]
In some implementations, communication apparatus210 may also include a transceiver 216 coupled to processor 212 and capable of wirelessly transmitting and receiving data. In some implementations, communication apparatus210 may further include a memory 214 coupled to processor 212 and capable of being accessed by processor 212 and storing data therein. In some implementations, network apparatus 220 may also include a transceiver 226 coupled to processor 222 and capable of wirelessly transmitting and receiving data. In some implementations, network apparatus 220 may further include a memory 224 coupled to processor 222 and capable of being accessed by processor 222 and storing data therein. Accordingly, communication apparatus210 and network apparatus 220 may wirelessly communicate with each other via transceiver 216 and transceiver 226, respectively. To aid better understanding, the following description of the operations, functionalities and capabilities of each of communication apparatus210 and network apparatus 220 is provided in the context of a mobile communication environment in which communication apparatus210 is implemented in or as a communication apparatus or a UE and network apparatus 220 is implemented in or as a network node of a communication network.
[0059]
In some implementations, processor 212 may be configured to use a formula to determine the TBS in NR. Processor 212 may be configured to determine the TBS by determining an intermediate number of information bits first. Processor 212 may determine the intermediate number of information bits according to at least one of a scheduled modulation order, a coding rate, a number of resource element, and a signaled number of layers.
[0060]
In some implementations , after determining the intermediate number of information bits, processor 212 may be configured to quantize the intermediate number of information bits. Processor 212 may quantize the intermediate number of information bits by a step size. The step size may be configurable and may comprise a minimum value. Processor 212 may be configured to determine the TBS according to the quantized intermediate number of information bits. Processor 212 may be further configured to transmit, via transceiver 216, the information bits according to the TBS.
[0061]
In some implementations, in a case that the step size is dynamic, processor 212 may determine the step size as a power of 2 (e.g., δ=2 n) . Processor 212 may determine the exponent partnaccording to a logarithm function of the non-quantized intermediate number of information bits and a configurable offset constant. The step size may comprise a minimum value. Processor 212 may determine a minimum quantization value as 1 byte.
[0062]
In some implementations, processor 212 may determine the step size according to the CRC length. Specifically, processor 212 may determine the non-quantized intermediate number of information bits according to the CRC length. Processor 212 may determine the exponent part n of the step size according to a logarithm function of the non-quantized intermediate number of information bits. Thus, processor 212 may determine the step size according to the CRC length. For example, processor 212 may determine the CRC length as 24.
[0063]
In some implementation, processor 212 may be configured to determine the TBS according to at least one of a number of code blocks, a code block size, and a CRC length.
[0064]
In some implementation, processor 212 may be configured to compare the intermediate number of information bits with a threshold value. Processor 212 may determine the threshold value as, for example and without limitation, 3824. Processor 212 may be further configured to determine the TBS according to a comparison result. Specifically, processor 212 may be configured to determine whether the intermediate number of information bits is greater than the threshold value. In a case that the intermediate number of information bits is not greater than the threshold value, processor 212 may be configured to determine a first step size for quantizing the intermediate number of information bits. In a case that the intermediate number of information bits is greater than the threshold value, processor 212 may be configured to determine a second step size for quantizing the intermediate number of information bits. The second step size is different from the first step size.
[0065]
Illustrative Processes
[0066]
FIG. 3illustrates an example process 300 in accordance with an implementation of the present disclosure. Process 300 may be an example implementation of scenario100, whether partially or completely, with respect to TBS determination in accordance with the present disclosure. Process 300 may represent an aspect of implementation of features of communication apparatus 210. Process 300 may include one or more operations, actions, or functions as illustrated by one or more of blocks 310, 320, 330 and 340. Although illustrated as discrete blocks, various blocks of process 300 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks of process 300 may executed in the order shown in FIG. 3 or, alternatively, in a different order. Process 300 may be implemented by communication apparatus 210 or any suitable UE or machine type devices. Solely for illustrative purposes and without limitation, process 300 is described below in the context of communication apparatus 210. Process 300 may begin at block 310.
[0067]
At 310, process 300 may involve processor 212 of apparatus 210determining an intermediate number of information bits. Process 300 may proceed from 310 to 320.
[0068]
At 320, process 300 may involve processor 212 quantizing the intermediate number of information bits. Process 300 may proceed from 320 to 330.
[0069]
At 330, process 300 may involve processor 212 determining a TBS according to the quantized intermediate number of information bits. . Process 300 may proceed from 330 to 340.
[0070]
At 340, process 300 may involve processor 212transmitting the information bits according to the TBS.
[0071]
In some implementations, process 300 may involve processor 212 quantizing the intermediate number of information bits by a step size. The step size may be configurable and may comprise a minimum value.
[0072]
In some implementations, process 300 may involve processor 212determining the step size by a power of 2. The exponent of 2 may be determined according to a logarithm function of the intermediate number of information bits.
[0073]
In some implementations, process 300 may involve processor 212determining the exponent according to at least one a cyclic redundancy check (CRC) length and a configurable offset constant.
[0074]
In some implementations, process 300 may involve processor 212determining the TBS according to at least one of a number of code blocks, a code block size, and a CRC length.
[0075]
In some implementations, process 300 may involve processor 212determining the code block size according to a byte alignment.
[0076]
In some implementations, process 300 may involve processor 212determining the intermediate number of information bits according to at least one of a number of resource element, a coding rate, a scheduled modulation order, and a signaled number of layers.
[0077]
In some implementations, process 300 may involve processor 212comparing the intermediate number of information bits with a threshold value. Process 300 may further involve processor 212determining the TBS according to a comparison result.
[0078]
In some implementations, process 300 may involve processor 212determining whether the intermediate number of information bits is greater than a threshold value. Process 300 may further involve processor 212determining a first step size for quantizing the intermediate number of information bits when the intermediate number of information bits is not greater than the threshold value.
[0079]
In some implementations, process 300 may involve processor 212determining whether the intermediate number of information bits is greater than a threshold value. Process 300 may further involve processor 212determininga second step size for quantizing the intermediate number of information bits when the intermediate number of information bits is greater than the threshold value.
[0080]
Additional Notes
[0081]
The herein-described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as "associated with" each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being "operably connected" , or "operably coupled" , to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being "operably couplable" , to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and/or physically interacting components and/or wirelessly interactable and/or wirelessly interacting components and/or logically interacting and/or logically interactable components.
[0082]
Further, with respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity.
[0083]
Moreover, it will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims, e.g., bodies of the appended claims, are generally intended as “open” terms, e.g., the term “including” should be interpreted as “including but not limited to, ” the term “having” should be interpreted as “having at least, ” the term “includes” should be interpreted as “includes but is not limited to, ” etc. It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim recitation to implementations containing only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an, " e.g., “a” and/or “an” should be interpreted to mean “at least one” or “one or more; ” the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number, e.g., the bare recitation of "two recitations, " without other modifiers, means at least two recitations, or two or more recitations. Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc. In those instances where a convention analogous to “at least one of A, B, or C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc. It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B. ”
[0084]
From the foregoing, it will be appreciated that various implementations of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the present disclosure. Accordingly, the various implementations disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the following claims.

Claims

[Claim 1]
A method, comprising: determining, by a processor of an apparatus, an intermediate number of information bits; quantizing, by the processor, the intermediate number of information bits; determining, by the processor, a transport block size (TBS) according to the quantized intermediate number of information bits; and transmitting , by the processor, the information bits according to the TBS.
[Claim 2]
The method of Claim 1, wherein the quantizing comprises quantizing the intermediate number of information bits by a step size, and wherein the step size is configurable and comprises a minimum value.
[Claim 3]
The method of Claim 2, further comprising: determining, by the processor, the step size by a power of 2, wherein an exponent of 2 is determined according to a logarithm function of the intermediate number of information bits.
[Claim 4]
The method of Claim 3, further comprising: determining, by the processor, the exponent according to at least one a cyclic redundancy check (CRC) length and a configurable offset constant.
[Claim 5]
The method of Claim 1, further comprising: determining, by the processor, the TBS according to at least one of a number of code blocks, a code block size, and a cyclic redundancy check (CRC) length.
[Claim 6]
The method of Claim 1, further comprising: determining, by the processor, the code block size according to a byte alignment.
[Claim 7]
The method of Claim 1, further comprising: determining, by the processor, the intermediate number of information bits according to at least one of a number of resource element, a coding rate, a scheduled modulation order, and a signaled number of layers.
[Claim 8]
The method of Claim 1, further comprising: comparing, by the processor, the intermediate number of information bits with a threshold value; and determining, by the processor, the TBS according to a comparison result.
[Claim 9]
The method of Claim 1, further comprising: determining, by the processor, whether the intermediate number of information bits is greater than a threshold value; and determining, by the processor, a first step size for quantizing the intermediate number of information bits when the intermediate number of information bits is not greater than the threshold value.
[Claim 10]
The method of Claim 1, further comprising: determining, by the processor, whether the intermediate number of information bits is greater than a threshold value; and determining, by the processor, a second step size for quantizing the intermediate number of information bits when the intermediate number of information bits is greater than the threshold value.
[Claim 11]
An apparatus, comprising: a transceiver capable of wirelessly communicating with a plurality of nodes of a wireless network; and a processor communicatively coupled to the transceiver, the processor capable of: determining an intermediate number of information bits; quantizing the intermediate number of information bits; determining a transport block size (TBS) according to the quantized intermediate number of information bits; and transmitting, via the transceiver, the information bits according to the TBS.
[Claim 12]
The apparatus of Claim 11, wherein, in the quantizing the intermediate number of information bits, the processor is further capable of quantizing the intermediate number of information bits by a step size, and wherein the step size is configurable and comprises a minimum value.
[Claim 13]
The apparatus of Claim 12, wherein the processor is further capable of: determining the step size by a power of 2, wherein an exponent of 2 is determined according to a logarithm function of the intermediate number of information bits.
[Claim 14]
The apparatus of Claim 12, wherein the processor is further capable of: determining the exponent according to at least one a cyclic redundancy check (CRC) length and a configurable offset constant.
[Claim 15]
The apparatus of Claim 11, wherein the processor is further capable of: determining the TBS according to at least one of a number of code blocks, a code block size, and a cyclic redundancy check (CRC) length.
[Claim 16]
The apparatus of Claim 11, wherein the processor is further capable of: determining the code block size according to a byte alignment.
[Claim 17]
The apparatus of Claim 11, wherein the processor is further capable of: determining the intermediate number of information bits according to at least one of a number of resource element, a coding rate, a scheduled modulation order, and a signaled number of layers.
[Claim 18]
The apparatus of Claim 11, wherein the processor is further capable of: comparing the intermediate number of information bits with a threshold value; and determining the TBS according to a comparison result.
[Claim 19]
The apparatus of Claim 11, wherein the processor is further capable of: determining whether the intermediate number of information bits is greater than a threshold value; and determining a first step size for quantizing the intermediate number of information bits when the intermediate number of information bits is not greater than the threshold value.
[Claim 20]
The apparatus of Claim 11, wherein the processor is further capable of: determining whether the intermediate number of information bits is greater than a threshold value; and determining a second step size for quantizing the intermediate number of information bits when the intermediate number of information bits is greater than the threshold value.

Drawings

[ Fig. 1]  
[ Fig. 2]  
[ Fig. 3]