Transport block size determination

Abstract

The present application relates to methods, systems and devices related to digital wireless communication, and more specifically, to techniques related to determining a transport block size. In one exemplary aspect, a method for wireless communication is disclosed. The method includes receiving, by a terminal, a first message identifying a first coding rate and a second coding rate. The method also includes performing, by the terminal, a first operation related to a first coding operation and using the first coding rate. The method also includes performing, by the terminal, a second operation related to a second coding operation and using the second coding rate. The method also includes transmitting or receiving, by the terminal, a second message using information related to the first operation and / or the second operation.

Description

Technical Field

[0001] This patent document relates generally to wireless communications. Background Art

[0002] Mobile communication technologies are driving the world towards an increasingly connected and networked society. The rapid growth of mobile communications and technological advances have led to greater demands for capacity and connectivity. Other aspects such as energy consumption, equipment cost, spectrum efficiency and latency are also important to meet the needs of various communication scenarios. Various technologies are being discussed, including new ways to provide higher quality of service. Summary of the invention

[0003] This document discloses methods, systems, and devices related to digital wireless communications, and more particularly, to techniques related to determining transport block size.

[0004] In one exemplary aspect, a method for wireless communication is disclosed. The method includes receiving, by a terminal, a first message identifying a first coding rate and a second coding rate. The method also includes performing, by the terminal, a first operation related to the first coding operation and using the first coding rate. The method also includes performing, by the terminal, a second operation related to the second coding operation and using the second coding rate. The method also includes transmitting or receiving, by the terminal, a second message using information related to the first operation and / or the second operation.

[0005] In another exemplary aspect, a wireless communication device including a processor is disclosed. The processor is configured to implement the methods described herein.

[0006] In yet another exemplary aspect, the various techniques described herein may be embodied as processor-executable code and stored on a computer-readable program medium.

[0007] The details of one or more embodiments are set forth in the attached appendix, drawings, and the description below. Other features will be apparent from the description and drawings, and from the clauses. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Figures 1A to 1H An example for precoding between transport block CRC attachment and code block CRC attachment is shown.

[0009] Figure 2 An example block diagram on a radio link model showing the operation of combined channel coding and special coding.

[0010] Figure 3 is an example flow process of the TBS determination steps for a system using a specific encoding and LDPC encoding.

[0011] Figure 4 is an example flow chart for TBS determination steps.

[0012] Figure 5 is a block diagram illustrating an example of a CRC attachment operation.

[0013] Figure 6 is an example flow chart for determining the effective code rate for a particular encoding and LDPC encoding module.

[0014] Figure 7 is a block diagram of example LDPC code block information allocation for operation based on a radio link combination of specific encoding and LDPC encoding.

[0015] FIG. 8A to FIG. 8B is a block diagram of example LDPC code block information allocation for operation based on a radio link combination of specific encoding and LDPC encoding.

[0016] Fig. 9 is a block diagram of example LDPC code block information allocation for operation based on a radio link combination of specific encoding and LDPC encoding.

[0017] Fig.10 is a block diagram of example LDPC code block information allocation for operation based on a radio link combination of specific encoding and LDPC encoding.

[0018] Fig.11 is a block diagram of an example LDPC code block information allocation based on a radio link for combined specific coding and LDPC coding operations.

[0019] Fig.12 is a block diagram of an example LDPC code block information allocation based on a radio link for combined specific coding and LDPC coding operations.

[0020] Fig.13 is a block diagram 1300 of a method for determining a transport block size.

[0021] Fig.14 An example of a wireless communication system in which the technology according to one or more embodiments of the present technology can be applied is shown.

[0022] Fig.15 A block diagram representation of a portion of a hardware platform. DETAILED DESCRIPTION

[0023] The development of a new generation of wireless communications - 5G New Radio (NR) communications - is part of the continuous mobile broadband evolution process to meet the requirements of growing network demand. NR will provide greater throughput to allow more users to be connected at the same time. Other aspects, such as energy consumption, equipment cost, spectrum efficiency and latency, are also important to meet the needs of various communication scenarios.

[0024] In the 3rd Generation Partnership Project (3GPP) standards, higher-order quadrature amplitude modulation (QAM) constellation modulation has been used to improve spectrum efficiency since 3G systems. However, due to the nonlinearity of the transmission medium, the marginal gains obtained in higher-order QAM constellations are gradually disappearing. Therefore, other enhanced channel coding and modulation schemes may be approved to improve efficiency for higher-order QAM.

[0025] For example, Probabilistic amplitude shaping (PAS), as a low-complexity probabilistic shaping (PS) scheme, can use DVB-S2 low-density parity check (LDPC) codes to achieve a frame error rate (FER) of about 0.01 at 1.1 dB with additive white Gaussian noise (AWGN) capacity in steps of 0.1 bit / dim (bit rate) from 1 bit / dim to 5 bit / dim without iteration between demodulation and decoding. In some settings, PAS combined with LDPC codes can have a coding gain of more than 2 dB over AWGN channels compared to the current fifth-generation (5G) modulation and coding scheme (MCS).

[0026] However, if the enhanced channel coding and modulation scheme is used for the current communication system, the effective code rate for the entire coding link may not be similar to the target code rate determined by the current MCS table and may be related to the code rate of the introduced enhanced coding module. Therefore, the code rate used for channel coding may be related to channel quality indicator (CQI) reporting, MCS indication, code block segmentation, LDPC base graph (BG) selection and transport block size (TBS) determination. Considering the potential impact on the code rate value of the entire coding link, some schemes for CQI reporting, MCS indication, TBS determination and BG selection are disclosed in the present disclosure.

[0027] In 3GPP 5G, devices such as user equipment (UE) or base stations (BS) can divide data bits into transport blocks (TB) for channel coding and modulation. The number of information bits of a transport block may be referred to as TBS. Channel coding and modulation schemes may be used to encode information bits into a modulation sequence. The modulation sequence may include a constellation point sequence output from a modulation mapper. The modulation mapper may include a high-order modulation including a marker for a constellation having a number of constellation points greater than 2. The constellation may include a set of complex values ​​and each complex value is a constellation point. As non-limiting examples, there may be various types of constellations, such as quadrature amplitude modulation (QAM), quadrature phase shift keying (QPSK), phase shift keying (PSK), amplitude shift keying (ASK), and amplitude phase shift keying (MAPSK).

[0028] Labeling can include a mapping between a set of bit sequences and a set of complex values. The bits associated with a complex value can be referred to as the label of the complex value. The number of bits in the complex value label can be referred to as the length of the label. If all labels in the label have the same length, the length can also be referred to as the length of the label. The labeling of a constellation is a mapping between a set of bit sequences and the set of constellation points. Table 1 can provide specific examples for labeling, for example, 00 is the label for the value 1+j in label 1, and 0 is the label for the value 5 in label 4. As a non-limiting example, for a given constellation, there can be various types of labeling of the constellation, such as Gray labeling and natural labeling. Table 1 can provide two specific examples of labeling of the QPSK constellation {1+j, 1-j, -1+j, -1-j}, namely labeling 1 and labeling 3, where Is an imaginary unit.

[0029]

[0030] Table 1: Examples for markers ( is an imaginary unit)

[0031] There may be amplitude sets and phase sets associated with a given modulation mapper. An amplitude set may include a set of non-negative real values. An element in an amplitude set may be referred to as an amplitude. The definition of a tag may also be applied to an amplitude set. This may not be limited to one type of tag for a given amplitude set. Table 1 may provide two specific examples of tags for an amplitude set {1, 3, 5, 7}, namely, tag 2 and tag 4. Table 2 may provide an amplitude set and corresponding tags for 16QAM, 64QAM, and 256QAM of 3GPP 5G. An amplitude sequence may include a sequence of each element selected from the amplitude set. The energy of an amplitude sequence is defined as the sum of the weights of each amplitude in the amplitude sequence. The weight of an amplitude α may include a function value f(α), where f(·) is a monotonically increasing real-valued function that maps a non-negative real value to a non-negative real value. Specific examples of f(α) are f(α)=α, f(α)=α 2 , and f(α)=2α+1. The power of a constellation point may include the square of the complex modulus of the constellation point. The power of a modulation sequence may include the sum of the powers of each constellation point in the modulation sequence. A phase set may include a set of real values. An element in a phase set is referred to as a phase. The definition of a label may also be applied to a phase set. The label of a given phase set is not limited to one type. Table 1 may provide a specific example of a label for a phase set {-1, 1}, which is used in 16QAM, 64QAM, and 256QAM of 3GPP 5G. A phase sequence may include a sequence for each element selected from a phase set. For the QAM constellation in 3GPP 5G, two pairs of amplitude and phase are mapped to constellation points, one pair for the real part and the other pair for the imaginary part. Tables 3(a), (b), and (c) may provide examples of the relationship between amplitude, phase, amplitude set, phase set, constellation, and their labels.

[0032]

[0033] Table 2: Amplitude sets and markings for QAM constellations

[0034] In theory, it is not efficient for a channel coding and modulation scheme to output constellation points with equal probability. An efficient scheme should output different constellation points with different probabilities. Specifically, in the output of the channel coding and modulation, constellation points with less power may appear more frequently than constellation points with greater power. In the present disclosure, the channel coding and modulation scheme may encode the TB into a modulation sequence with desired probabilities for the constellation points.

[0035]

[0036] Table 3(a): Example of the relationship between amplitude, phase, amplitude set, phase set, constellation and their labels for 16QAM ( is an imaginary unit, and the constellations are plotted below the table)

[0037]

[0038] Table 3(b): Example of the relationship between amplitude, phase, amplitude set, phase set, constellation and their labels for 16APSK ( is an imaginary unit, and the constellations are plotted below the table)

[0039]

[0040] Table 3(c): Example of the relationship between amplitude, phase, amplitude set, phase set, constellation and their labels for 16APSK ( is an imaginary unit, and the constellations are plotted below the table)

[0041] In the following, the size of a set or the size of a set may be the number of elements in a set. The symbol |_z_| for a real value may represent the largest integer not greater than z. The symbol |-z-| for a real value may represent the smallest integer not less than z. The symbol round(z) for a real value may represent the integer closest to z. The symbol exp(·) may be a natural exponential function. The symbol "mod" may be a modular operation. The symbol π may be the ratio of a circle to a circle.

[0042] In the present disclosure, channel coding and modulation for a transport block may include the following steps, in no particular order: channel coding, specific coding, transport block CRC attachment, code block segmentation, code block CRC attachment. The channel coding may be one of the following: low density parity check code, polar code, turbo code, convolutional code. The specific coding may include a process including at least one of the following: bit to symbol coding and symbol to bit conversion.

[0043] TBS confirmed introduction

[0044] In 5G NR, for a PDSCH / PUSCH allocated by a PDCCH having a scheduling downlink control information (DCI) format and whose CRC is scrambled by multiple RNTIs, the UE may first select a PDSCH / PUSCH based on the MCS index (I MCS ) determines the target code rate (R) and modulation order (Q m ), and the number of layers (v) and the number of allocated PRBs (physical resource blocks, PRBs) (n PRB ) to determine the TBS. Multiple MCS tables used for PDSCH and PUSCH are shown in Tables A1 to A3 and Tables B1 to B2 in the Appendix. Each MCS entry may include an MCS index, a target code rate (R), a modulation order (Q m) and the corresponding spectral efficiency (SE). The TBS determination step may include determining the number of REs in the time slot (N RE ) and / or based on N info =N RE ·R·Q m ·υ determines the intermediate number of information bits (N info ). When N info When ≤3824, TBS can divide the middle number of information bits into 2 n Quantify to obtain N' info Where n is an integer, not less than 3 and equal to N info The value of N′ can be found using the TBS table. info The closest TBS.

[0045] When N info >3824, TBS can divide the intermediate number of information bits into 2 n Quantify to obtain N' info , where n is an integer which may not be less than 6 and is info The value of , and the target code rate (R) can be used to determine the modification factor and calculate the number of code blocks (C) based on the modification factor, and (N' info +24) should be evenly divided by the value of (8*C).

[0046] To obtain the number of code blocks, the UE may first select an LDPC base graph according to the rules shown in Table 4, and then determine the maximum code block size of the selected base graph. For BG1, the maximum code block size may be Kcb=8448, and for BG2, the maximum code block size may be Kcb=3840. For TB, the total number of bits after the cyclic redundancy check (CRC) is attached may be TBS+L TB_CRC , where L TB_CRC =24 bits. If TBS+L TB_CRC is not greater than Kcb, the number of code blocks can be 1 and no additional CRC sequence can be attached to a single code block; otherwise, C=ceil((TBS+L TB_CRC ) / (Kcb-L CB_CRC )) to determine the total number of code blocks, and the total number of bits of each code block is K'=(TBS+L TB_CRC ) / C+L CB_CRC .

[0047] R ≤292 292<K≤3824 >3824 >2 / 3 BG2 BG1 BG1 1 / 4<R≤2 / 3 BG2 BG2 BG1 ≤1 / 4 BG2 BG2 BG2

[0048] Table 4: Base graph selection for NR-LDPC

[0049] Introduction to CQI Report

[0050] Based on the observation interval in time and frequency, the UE may derive, for each CQI value reported in an uplink timeslot, the highest CQI index for which a single PDSCH transport block having a combination of modulation scheme, target code rate and transport block size corresponding to the CQI index and occupying a set of downlink physical resource blocks called channel state information (CSI) reference resources may be received with a transport block error probability not exceeding a target transport block error rate corresponding to a CQI table configured by higher layer parameters. If a combination of modulation scheme and transport block size for transmission on a PDSCH in a CSI reference resource may be signaled based on TBS determination, then this combination may correspond to a CQI index, the modulation scheme indicated by the CQI index, and the effective channel code rate corresponding to this combination of transport block size and modulation scheme applied to the reference resource is closest to the code rate indicated by the CQI index. If more than one combination of transport block size and modulation scheme results in an effective channel code rate close to the code rate indicated by the CQI index, then only the combination with the smallest such transport block size may be relevant.

[0051] Introduction to specific coding operations in the radio link model

[0052]

[0053] Table 5A: Example of labeling for amplitude, where (a) amplitude set Φ = {1, 2, 6}

[0054]

[0055] Table 5B: Example of marking for amplitude, where (b) amplitude set Φ = {1, 3, 5, 7}

[0056]

[0057] Table 5C: Example of labeling for amplitude, where (c) amplitude set Φ = {1, 3, 5, 7, 9, 11, 13, 15}

[0058] In a specific example of this embodiment, the bit-to-symbol encoding (i.e., the specific encoding) may encode a first bit sequence u into a first amplitude sequence A using an amplitude set Φ. The length of the first bit sequence u is denoted as Kd. The length of the first amplitude sequence A is denoted as Na. The number of elements in the amplitude set Φ is denoted as Ma. The mark length of the amplitude set Φ, denoted as Qa, may be an integer such that an integer power of 2 is greater than or equal to the size of the amplitude set Φ, i.e., 2 Qa ≥Ma.

[0059] Furthermore, in this specific example of the present embodiment, the symbol-to-bit conversion may be performed based on the labeling of the amplitude set Φ (which converts each amplitude A i The first amplitude sequence A = [A0, A1, A2, ..., A Na-1 ] is converted to a second bit sequence v = [v0, v1, v2, ..., v Nv-1 One of the specific implementations of symbol-to-bit conversion is: the bit (v i·Qa , v i·Qa+1 , ..., v i·Qa+Qa-1 ) is the amplitude A for i=0, 1, 2, ..., Na-1 i Mark.

[0060] In addition, in a specific example of this embodiment, Table 3 may provide one of the specific implementations for marking the amplitude set Φ for 16QAM, 64QAM, and 256QAM in 3GPP 5G.

[0061] In addition, in a specific example of this embodiment, one of the specific implementations of the labeling of the amplitude set Φ can be: the label of the minimum amplitude in the amplitude set Φ is more than the label of the maximum amplitude in the amplitude set Φ. Or, equivalently, the labeling of the constellation of the modulation mapper has the following property: the label of the constellation point with the minimum power in the constellation of the modulation mapper is more than the label of the constellation point with the maximum power. Tables 5A to 5C can provide specific examples of labels for amplitudes of three amplitude sets {1, 2, 6}, {1, 3, 5, 7}, {1, 3, 5, 7, 9, 11, 13, 15}, where Qa = 2 and 3.

[0062] Furthermore, in a specific example of this embodiment, the bit-to-symbol encoding is one of: source-coded correlation encoding, energy threshold encoding, minimum energy encoding, variable length encoding, and non-linear encoding.

[0063] Furthermore, in a specific example of this embodiment, source-coded correlation coding encodes the first bit sequence u into the first amplitude sequence A according to a probability correlation parameter.

[0064] One specific implementation of the probability-related parameter may be a probability mass function (PMF) of the amplitude set Φ. One specific implementation of the probability mass function can be to calculate the amplitude The number of occurrences in the first amplitude sequence A Where, for i = 0, the sum on the right is zero. Take Φ = {1, 3, 5} and its probability mass function Pr{1} = 0.4, Pr{3} = 0.3, Pr{5} = 0.3 and Na = 5 as an example:

[0065]

[0066] For using amplitude sets One specific implementation of the probability mass function can be to calculate the amplitude The number of occurrences in the first amplitude sequence A Wherein, for i=0, the sum on the right is zero. Taking Φ={1, 3, 5} and probability mass function Pr{1}=0.4, Pr{3}=0.3, Pr{5}=0.3 and Na=5 as an example, Num(1)=round(5·Pr{1})=round(5·0.4)=2, Num(3)=round(5·Pr{1}+5·Pr{3})-round(5·Pr{1})=round(3.5)-2=2, Num(5)=round(5·Pr{1}+5·Pr{3}+5·Pr{5})-round(5·Pr{1}+5·Pr{3})=5-round(3.5)=1.

[0067] With the amplitude The number of occurrences in the first amplitude sequence A, the first amplitude sequence A can have a number of 1, 3 and 5, namely Num(1), Num(3) and Num(5). Using the round(·) operation, Table 6 can provide one of the specific examples for Φ={1, 3, 5}, where the probability mass function Pr{1}=0.4, Pr{3}=0.3, Pr{5}=0.3, Kd=4 and Na=5.

[0068]

[0069] Table 6: Correlation coding of source coding with a single PMF as parameter using the round(·) operation for Kd=4 and Na=5.

[0070] One of the specific implementations for the probability-related parameters may be a Qa probability mass function for the set {0, 1}, where Qa is the length of the label of the amplitude set Φ. The Qa PMF is represented as PMF0, PMF1, ..., PMFQa-1. One of the specific implementations for using the Qa PMF may include: dividing the first bit sequence u into Qa parts u0, u1, ..., uQa-1, treating the set {0, 1} as an amplitude set and encoding ui into a bit sequence yi of Na bits using PMFi, as in the example in (i), taking the i-th bit from each bit sequence y0, y1, ..., and yQa-1 to form a label (y0, i, y1, i, ..., yQa-1, i) and mapping it to the amplitude Ai of the first amplitude sequence A, where i = 0, 1, 2, ..., Na-1. Using the round(·) operation, Table 7 can use mark 3 in Table 5B to provide one of the specific examples for Φ={1,3,5,7}, where other parameters may include Qa=2,Kd=4,Na=5,PMF0 is Pr{0}=0.35,Pr{1}=0.65; PMF1 is Pr{0}=0.2,Pr{1}=0.8,and the first bit sequence u=[u0,u1,u2,u3] is divided into Qa=2 parts, namely u0=[u0,u1,u2] with a length of 3 bits and u1=[u3] with a length of 1 bit.

[0071] For u0, Num(0)=round(5×0.35)=2, Num(1)=round(5×0.35+5×0.65)-2=3, and for u1, Num(0)=round(5×0.20)=1, Num(1)=round(5×0.20+5×0.80)-1=4.

[0072]

[0073] Table 7: Source coding The dependent coding has two PMFs for the set {0, 1} as parameters, for y0, Pr{0} = 0.35, Pr{1} = 0.65 and for y1, Pr{0} = 0.2, Pr{1} = 0.8. Kd = 4, Na = 5. For y0, Num(0) = 2, Num(1) = 3; for y1, Num(0) = 1, Num(1) = 4. The notation of the amplitude set Φ = {1, 3, 5, 7} is {11, 10, 01, 00}.

[0074] One of the specific implementations of the probability-related parameter may be a non-negative integer set having a one-to-one mapping with the amplitude set, and the sum of the elements in the non-negative integer set is equal to the length of the first amplitude sequence A. One of the specific implementations is: the non-negative integer set has an element that is each amplitude that appears in the first amplitude sequence A. The encoding can be the same as (i).

[0075] One of the specific implementations for the probability-related parameter may be a set of R positive integers with R>1. One of the specific implementations may be: the set of R positive integers is the number of 0s and 1s in each yi of (ii), where R is equal to the mark length of the amplitude set Qa, and the encoding is the same as (ii). One of the specific implementations may be: each of the sets of R positive integers is a set in (iii). The encoding may be as follows.

[0076] In some embodiments, a one-to-one mapping is constructed between the prefix-free code of the R codewords and the R sets of positive integers. One of the specific implementations is that R=3 and the prefix-free code can be {0, 10, 11} and for the amplitude set {1, 3} with a one-to-one mapping 0->{3, 2}; 10->{4, 1}; 11->{1, 4}, the R sets of positive integers are {3, 2}, {4, 1} and {1, 4}.

[0077] A set of positive integers corresponding to the prefix bits of the first bit sequence u is selected and encoded as (iii). For example, u = [0, 0, 1, 1], prefix bit 0 is a codeword without a prefix code, and the corresponding set of positive integers {2, 3} is used as the parameters encoded in (iii). Another example is u = [1, 0, 1, 1], prefix bit 10 is a codeword without a prefix code, and the corresponding set of positive integers {2, 3} is used as the parameters encoded in (iii). Table 8 gives the details for the encoding.

[0078]

[0079] Table 8: Source coding correlation coding with multiple sets of positive integers as parameters for the amplitude set Φ = {1, 3}, for Kd = 4 and Na = 5

[0080] In addition, in the specific example of this embodiment, the energy threshold encoding can be based on the predefined value E m >0 encodes the first bit sequence u into the first amplitude sequence A, so that the energy threshold encoding 2 Kd The sequence energy of any of the possible outputs is less than or equal to E m One of the specific implementations can be discussed as follows.

[0081] As an example, the sequence energy may be defined as the sum of the squares of the amplitudes in the first amplitude sequence.

[0082] For all Ma of length Na of the amplitude set Φ Na In the amplitude sequence, Ti(a0, a1, ..., a i ) is expressed as the number of amplitude sequences, where the first i amplitudes are a0, a1, …a iand the sequence energy is less than or equal to E m with a predefined value E max = 28, amplitude set Φ = {1, 3, 5}, and Na = 4 as an example. Then, T3(1, 3, 3, 3) = 1 because [1, 3, 3, 3] itself has an energy less than or equal to 28; T2(1, 3, 5) = 0 because 1 2 + 3 2 + 5 2 = 35 > 28; T2(1, 3, 3) = 2 because both [1, 3, 3, 1] and [1, 3, 3, 3] have energies not greater than 28.

[0083] Taking Kd = 4 as an example. The encoding from the first bit sequence u = [u0, u1, u2, u3] to the first amplitude sequence A = [A0, A1, A2, A3] is in Algorithm 1.

[0084] Algorithm 1 may include one specific implementation of energy threshold encoding by converting u into an integer and setting I0 = I. For i = 0, 1, 2, 3, find Ai in the amplitude set Φ = {1, 3, 5} such that and if i < Na - 1, then calculate The output [A0, A1, A2, A3] can be the first amplitude sequence A.

[0085] In addition, in a specific example of this embodiment, the minimum energy encoding can encode the first bit sequence u into the first amplitude sequence A such that the 2 Kd possible outputs of the minimum energy encoding are the 2 Na amplitude sequences among all Ma amplitude sequences with each amplitude selected from the amplitude set that have the lowest sequence energy. Kd Table 9 can provide one specific implementation of the minimum energy encoding, that is, converting the first bit sequence u into an integer such that the I-th minimum energy sequence is the first amplitude sequence A for the amplitude set Φ = {1, 3}, Kd = 3, and Na = 4.

[0086]

[0087] Table 9: One specific implementation of the minimum energy encoding for the amplitude set Φ = {1, 3}, for Kd = 3 and Na = 4

[0088] In addition, in a specific example of the present embodiment, the variable length coding is one of the following: variable to variable length coding and fixed to variable length coding, wherein the variable to variable length coding uses a one-to-one mapping between a first prefix-free code and a second prefix-free code to encode a first bit sequence into a first amplitude sequence; the fixed to variable length coding uses a one-to-one mapping between a first fixed length bit sequence set and a second prefix-free code to encode a first bit sequence into a first amplitude sequence. The prefix-free code has the following two properties: (i) codewords have different lengths; (ii) any codeword is not a prefix of any other codeword, so that if [a0, a1, ..., an-1] is a codeword of length n, then there is no other codeword of the form [a0, a1, ..., an-1, b0, b1, ..., bm-1], where m>0. The first prefix-free code uses bits as elements in the codeword. The second prefix-free code uses amplitudes as elements in the codeword. One of the specific examples of the first prefix-free code is {0, 10, 110, 111}, where the elements in the codeword are bits. One of the specific examples of the second prefix-free code is {1111, 1113, 33, 53}, where the elements in the codeword are selected from the amplitude set Φ = {1, 3, 5}.

[0089] One specific example of variable to variable length encoding is a one-to-one mapping between prefix-free codes {0, 10, 110, 111} and prefix-free codes {1111, 1113, 33, 53} as follows: 0->1111, 10->1113, 110->33, 111->53.

[0090] Table 10 may give one of the specific examples of variable to variable length coding for the amplitude set Φ={1,3}. One of the specific examples of fixed to variable length is a one-to-one mapping between the first fixed length bit sequence set {11,10,01} and the prefix-free code {1111,1113,33}, as follows: 11->1111, 10->1113, 01->33.

[0091] One specific example of fixed to variable length is a one-to-one mapping between prefix-free codes {11, 10, 01, 00} and prefix-free codes {1111, 1113, 33, 53}, as follows: 11->1111, 10->1113, 01->33, 00->53.

[0092]

[0093] Table 10: One of the specific examples of variable to variable length coding of amplitude set Φ = {1, 3}

[0094] In addition, in a specific example of the present embodiment, the non-linear encoding encodes the first bit sequence into a first amplitude sequence, such that there are at least three different bit sequences [u0, 0, u0, ..., u0, Kd-1], [u1, 0, u1, 1, ..., u1, Kd-1] and [u2, 0, u2, 1, ..., u2, Kd-1] and their corresponding outputs of the non-linear encoding [A0, 0, A0, 1, ..., A0, Na-1], [A1, 0, A1, 1, ..., A1, Na-1] and [A2, 0, A2, 1, ..., A2, Na-1] satisfy all of the following properties: u2, i = u1, i, + u0, i mod2 for i = 0, 1, 2, ..., Kd-1, where mod 2 is a modulo-2 operation, there is at least one integer i such that A2, i 1 A1,i+A0,i mod 2, where mod 2 is a modulo-2 operation, and there exists at least one integer i such that A2,i 1 A1,i+A0,i, where the addition is real addition.

[0095] In addition, in a specific example of this embodiment, the precoding is a non-linear coding, so that there are at least three different first bit sequences [u0, 0, u0, 1, ..., u0, Kd-1], [u1, 0, u1, 1, ..., u1, Kd-1] and [u2, 0, u2, 1, ..., u2, Kd-1] and their corresponding second bit sequences are [v0, 0, v0, 1, ..., v0, Nv-1], [v1, 0, v1, 1, ..., v1, Nv-1] and [v2, 0, v2, 1, ..., v2, Nv-1], which respectively satisfy all of the following properties: u2, i = u1, i, + u0, for i = 0, 1, 2, ..., Kd-1, i mod 2, where mod 2 is a modulo-2 operation, and there is at least one integer i such that v2, i 1 v1, i+v0, i mod 2, where mod 2 is the modulo-2 operation.

[0096] Furthermore, in a specific example of this embodiment, the first bit sequence u may be divided into Cp subsequences, wherein each subsequence is precoded individually.

[0097] The labeling of the amplitude set can have an impact on the error correction performance of the channel coding and modulation. If the input to the channel coding has more bits 1, the output of the channel coding will have more bits 1 and have better error correction performance. Therefore, the amplitudes that appear more frequently in the precoded output should have labels with more bits "1", i.e. labels with the following property: the label of the smallest amplitude in the amplitude set Φ has more bits "1" than the label of the largest amplitude in the amplitude set Φ.

[0098] Introduction to possible locations of precoding operation in the radio link

[0099] The precoding operation can be placed before the TB CRC attachment, such as Figure 1A and Figure 1B As shown, or between TB CRC attachment and CBCRC attachment, as Figure 1C , Figure 1D , Figure 1E and Figure 1F as shown, or after the CB CRC is attached, as Figure 1G and Figure 1H shown.

[0100] Figures 1A to 1H An example for precoding between transport block CRC attachment and code block CRC attachment is shown.

[0101] For the case where precoding is between transport block CRC attachment and code block CRC attachment, Figure 1C and Figure 1D Two specific examples may be provided, namely at least a portion of the output of the transport block CRC attachment is an input to precoding, and both the output of the precoding and the output of the transport block CRC attachment (except at least a portion of the output of the transport block CRC attachment) are inputs to code block segmentation, and the output of the code block segmentation is an input to the code block CRC attachment. The output of the code block CRC attachment is an input to channel coding.

[0102] Figure 1E and Figure 1F Two specific examples can be provided, namely, the output of transport block CRC attachment is the input of code block segmentation, and at least a part of the output of code block segmentation is the input of precoding, and both the output of precoding and the output of code block segmentation (except at least a part of the output of code block segmentation) are the input of code block CRC attachment.

[0103] The output of the code block CRC attachment can be the input of the channel coding. One of the benefits of precoding between the transport block CRC attachment and the code block CRC attachment is that if an error is detected by the CRC attached to the code block, no precoding decoding is required, which reduces reception complexity. Another benefit of precoding between the transport block CRC attachment and the code block CRC attachment is that for a given number of resource elements, the TBS is larger than the TBS of the precoding after both the transport block CRC attachment and the code block CRC attachment.

[0104] Introduction to the relationship between the code rates of different modules in the radio link

[0105] According to the above-mentioned example of operations for a radio link model in combination with specific coding (i.e., precoding) and channel coding, the radio link model may include one or more of the following modules: 1) a bit splitting module; 2) a specific coding module; 3) a channel coding module; 4) a modulation module. The total number of data bits may be regarded as Ki. The bit splitting module may divide its input bits into two parts: Ks and Kc. Ks may be regarded as at least a part of the number of input bits of a specific coding module. Kc may be regarded as at least a part of the number of input bits of a channel coding module. The number of output bits of the specific coding module is represented as Ns. Ns and Kc are represented as at least a part of the number of input bits of the channel coding module. The number of redundant parity bits output by the channel coding module may be regarded as Np. The modulation module may be configured to receive the output bits of the channel coding module by converting each Q m Binary bits are mapped to complex numbers to convert input bits into modulation symbols. The number of output modulation symbols is represented as Nx. The symbols including Ki, Ks, Kc, Ns and Np can represent not only the number of bits but also the bit sequence, and the symbol Nx represents not only the number of symbols but also the modulated symbol sequence.

[0106] In the following, Q m =2*m can indicate that each modulated symbol is mapped by 2*m bits, which are part of the output of the system coding module. m =2 indicates the quadrature phase shift keying (QPSK) modulation scheme. m =4 indicates 16QAM. m =6 indicates 64QAM. m =8 means 256QAM.

[0107] Without considering the CRC bit attachment, the relationship between the code rates for different operations can be derived from the radio link model shown in Figure 1. Among them, precoding represents a specific coding operation. If the output bits of the precoding operation are completely mapped to the amplitude of the modulation symbol, then the output bits except the bit Ns can be completely mapped to the symbol bits of the modulation symbol. Therefore, the number of modulated symbols Nx, the number of output redundant parity bits of the channel coding Np, the number of input channel coding bits Ns and Kc, and the modulation order Q m The relationship between can be derived as follows:

[0108] Figure 2 An example block diagram 200 on a radio link model of the operation of combined channel coding and special coding is shown.

[0109] In 3GPP 5G, for TBS determination, the intermediate information bits can be obtained by multiplying the target code rate R and the associated resource parameters. The target code rate R can also be used to determine the TBS, target SE, basemap selection, and LDPC coding for CQI reporting. Figure 2 For a radio link in the L1 signaling, if the L1 signaling only indicates the code rate of the channel coding Rc and the code rate of the precoding operation Rs, then for TBS determination, the code rate used to determine the number of intermediate information bits can be derived as an effective code rate (R eff ).

[0110] For example, if the target code rate of the precoding operation is indicated as Rs and the target code rate of the channel coding operation is indicated as Rc, wherein the indicated Rs represents the value of Ks / Ns, and the indicated Rc represents the value of (Ns+Kc) / (Ns+Kc+Np), the code rate R used to determine the number of intermediate information bits is eff It can be derived as follows:

[0111]

[0112] Then, the relationship between Ks and Kc can be derived as follows:

[0113]

[0114] Therefore, the spectrum efficiency (SE) can be derived from the effective bit rate as follows: SE eff =R eff ×Q m =2(m-1)×(Rs-1)+2m×Rc.

[0115] The ratio of the number of the two parts of the split bits (Kc and Ks respectively) may not be less than 0 for the bit splitting module.

[0116] If the code rate Rs and code rate R eff The same method exists to derive the code rate Rc by using the MCS index indicated by L1 signaling. And deriving the code rate R for TBS determination eff The method can be the same.

[0117] System Overview

[0118] In the following, layer 1 (L1) signaling may refer to physical layer signaling or PDCCH carrying DCI. A higher layer parameter may refer to radio resource control (RRC) signaling or medium access control (MAC) signaling or MAC entity. A higher layer parameter refers to RRC signaling or RRC information element (IE).

[0119] Hereinafter, CBS may be the number of bits of a code block used for channel coding. For example, for NR LDPC, the maximum code block size for LDPC base 1 is 8448, while for LDPC base Figure 2 The maximum code block size is 3840.

[0120] Parameters related to a specific coding operation or precoding module may include at least one of the following: 1) code rate (Rs); 2) input bits (Ks); 3) coded bits (Ns). Parameters related to a channel coding module may include at least one of the following: 1) code rate (Rc); 2) input bits (Kc); 3) base graph or matrix selected for channel coding; 4) number of code blocks.

[0121] The target code rate Rt can be directly used to determine the N bit rate for the TBS indicated by L1 signaling. info The bit rate.

[0122] Effective bit rate (R eff ) can represent the code rate derived from the code rates Rs and Rc or represent the number of information bits (including TBS) divided by the number of physical channel bits on PDSCH or PUSCH.

[0123] In some embodiments, the number of information bits includes a transport block size and a number of transport block cyclic redundancy check (TB-CRC) bits.

[0124] In some embodiments, the effective code rate of a particular coding module Rs_eff or LDPC coding module Rc_eff may be defined as the number of input bits including CRC bits divided by the number of output bits available for transmission in physical channel resources on PDSCH or PUSCH.

[0125] In some embodiments, the effective bit rate (R eff ) can be similar to the target bit rate (Rt).

[0126] In some embodiments, the target code rate (Rt) can be determined by the UE through the MCS index (I MCS ) is determined. The MCS index is indicated by DCI.

[0127] This embodiment may include a combination of code rate and modulation order selection for CQI reporting, BG selection, TBS determination and MCS indication, and a specific TBS determination step for a radio link incorporating specific coding and channel coding operations.

[0128] Parameters related to CQI reporting may include resources for channel measurement, a CQI table configured by higher layer parameters, and a CQI index used to determine a combination of a modulation scheme and a transport block size.

[0129] Parameters related to BG selection may include the number of input bits for LDPC coding, code rate, and candidate base graphs.

[0130] Parameters relevant to TBS determination may include the modulation order Q m , the total number of configured resource elements (RE), the effective code rate R eff Or target bit rate Rt and number of layers.

[0131] In some embodiments, for a radio link combining operation of specific coding and channel coding, Rs, Rc and Rt or R eff Any two of these three parameters can be used to determine the remaining one.

[0132] Example 1: CQI Report

[0133] In some embodiments, the UE derives the CQI value reported in the uplink timeslot based on a combination of the modulation order, target code rate and transport block size corresponding to the CQI index.

[0134] In some embodiments, the target code rate is a code rate determined for the TBS corresponding to the CQI index.

[0135] In some embodiments, the target code rate is the code rate used for a specific encoding operation corresponding to the CQI index.

[0136] In some embodiments, the target code rate is a code rate used for a channel coding operation corresponding to a CQI index.

[0137] In some embodiments, the target code rate is an effective code rate derived from the code rates of the specific coding and channel coding operations corresponding to the CQI index.

[0138] In some embodiments, the TBS determination step for CQI reporting conforms to the procedures described in Embodiments 3 and 4.

[0139] Example 2: BG selection for LDPC coding

[0140] The BG selection or matrix generation for channel coding may be related to the code rate Rc and the number of input bits. When a specific coding operation is performed before the channel coding operation, as shown in FIG1 , the code rate Rc may be related to or determined by at least one of the following parameters: an MCS index indicated by L1 signaling; a code rate Rs for a specific coding operation; the number of output bits for a specific coding operation; a modulation order; a transport block size.

[0141] exist Figure 1C to Figure 1F In , the BG selection can also be related to the number of CRC bits used for the TB.

[0142] exist Figure 1G to Figure 1H In the embodiment, the BG selection may also be related to the code block size and the number of CRC bits used for the CB. The code block may be used for channel coding and / or a specific coding operation.

[0143] When an LDPC encoding operation is performed before or after a specific encoding operation, the BG selection may be related to at least one of the following parameters: transport block size; rate Rs used for the specific encoding operation; modulation order.

[0144] The number of input bits is related to at least one of the following parameters: transport block size; rate Rs used for a particular coding operation; modulation order; and code rate Rc used for LDPC coding.

[0145] The first method may involve two BGs for the radio link model. In some embodiments, when there are two BGs used for LDPC coding, if the number of input bits (Kc) for LDPC coding is not greater than T1, or if Kc is not greater than T2 and the code rate Rc is not greater than R1, or the code rate Rc is not greater than R2, the LDPC basis Figure 2 is used; otherwise, LDPC base graph 1 is used.

[0146] In some embodiments, the value of R1 is not less than 2 / 3, the value of R2 is not less than 1 / 4, the value of T1 is not less than 292, and the value of T2 is not less than 3824.

[0147] In some embodiments, when there are two BGs used for LDPC coding, if the number of input bits (Ks) for a particular coding is not greater than T1, or if Ks is not greater than T2 and the code rate Rs is not greater than R1, or the code rate Rs is not greater than R2, the LDPC basis Figure 2 is used; otherwise, LDPC base graph 1 is used.

[0148] In some embodiments, the value of R1 is no greater than 2 / 3, the value of R2 is no greater than 1 / 4, the value of T1 is no greater than 292, and the value of T2 is no greater than 3824.

[0149] In some embodiments, when there are two BGs used for LDPC coding, if the number of input bits (Ks) for a particular coding is not greater than T1, or if Ks is not greater than T2 and the code rate Rc is not greater than R1, or the code rate Rc is not greater than R2, the LDPC basis Figure 2 is used; otherwise, LDPC base graph 1 is used.

[0150] In some embodiments, the value of R1 is not less than 2 / 3, the value of R2 is not less than 1 / 4, the value of T1 is not greater than 292, and the value of T2 is not greater than 3824.

[0151] The thresholds T1 and T2 can be related to the intermediate information bits and / or the target code rate Rt or the effective code rate Rt. eff , and / or code rate Rc, and / or code rate Rs, and / or modulation order.

[0152] The thresholds R1 and R2 may be related to the code rate Rc, and / or the code rate Rs, and / or the target code rate Rt or the effective code rate R eff The value of T1 can be smaller than the value of T2, and the value of R1 can be larger than the value of R2.

[0153] For example, according to Figure 2 The BG selection procedure for the radio link model in is as follows: Assume that Rs = 1 / 3, Rc = 2 / 3, and 64QAM (Q m =6=2*m) is determined by the MCS index indicated by the DCI, and TBS=4736 is determined by the TBS determination step in the present disclosure. Then the following parameters can be obtained: the target code rate is Rt=(Rs-1)*(m-1) / m+Rc=2 / 9, the number of input bits for a specific encoding operation is Ks=4760, and the number of output bits for a specific encoding operation is Ns=Ks / Rs=14280.

[0154] For LDPC coding, the following parameters can be obtained: the number of input bits for LDPC coding is Kc=Ns=14280, and the code rate for LDPC coding is Rc=2 / 3. Therefore, LDPC base graph 1 can be used according to Rc≤2 / 3 and Kc>3824.

[0155] The second approach may involve two BG selections for LDPC coding.

[0156] In some embodiments, for the TBS determination step, the UE determines the target code rate and the modulation order Q based on the MCS index indicated by the DCI. m Afterwards, the UE may first determine the number of unquantized intermediate information bits N info .

[0157] In some embodiments, the UE info The comparison between the TBS and the predefined threshold is performed based on different steps to determine the TBS.

[0158] In some embodiments, the predefined threshold is related to the ratio of the value of T2 and the number of two parts of split bits (eg, Kc / Ks).

[0159] In some embodiments, the predefined threshold is defined as T2*(1+δ)*Rs / (Rs+δ), ie (Ks+Kc). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0160] In some embodiments, the value of δ may be determined by the code rate Rt, and / or the code rate Rs, and / or the code rate Rc and / or the modulation order.

[0161] In some embodiments, the UE calculates the maximum CBS including the CRC bits and the modified N info To determine the number of code blocks, the maximum CBS including the CRC bits corresponds to the selected BG.

[0162] In some embodiments, the modified N info not greater than T1, or if the modified N info If the code rate Rc is not greater than R1, or the code rate Rc is not greater than R2, then the LDPC basis Figure 2 is used; otherwise, LDPC base graph 1 is used.

[0163] In some embodiments, the modified N info It is composed of 2 n Modified N info Where n is an integer and can be represented by N info Sure.

[0164] Thresholds T1 and T2 are modified by a scaling factor based on T2, δ and Rs. The scaling factor is related to at least one of the following parameters: 1) code rate Rs; 2) target code rate Rt; 3) modulation order; 4) ratio δ of two parts of information bits split by the bit splitting module.

[0165] The thresholds R1 and R2 may be related to the code rate Rc, and / or the code rate Rs, and / or the target code rate Rt or the effective code rate R eff The value of T1 can be smaller than the value of T2, and the value of R1 can be larger than the value of R2.

[0166] In some embodiments, the value of R1 is 2 / 3 and the value of R2 is 1 / 4.

[0167] A third approach may involve a BG for LDPC coding.

[0168] In some embodiments, if a TB can be encoded by a combination of channel coding and a specific coding operation, only one BG is used for channel coding.

[0169] In some embodiments, the channel coding is LDPC coding.

[0170] In some embodiments, BG is LDPC base graph 1.

[0171] In some embodiments, there is a code block segmentation operation before a specific encoding operation and BG is an LDPC basis Figure 2 .

[0172] In some embodiments, the maximum CBS for a particular encoding operation is less than the maximum CBS of the LDPC code corresponding to the selected BG.

[0173] In some embodiments, the maximum CBS for a particular encoding operation is related to the code rate Rs for the particular encoding operation.

[0174] Embodiment 3: Determining TBS for a radio link using specific coding and channel coding

[0175] In some embodiments, the TBS determined by the TBS determination step should satisfy constraints on input bits for a specific encoding operation and channel coding operation.

[0176] In some embodiments, the TBS may be fully divided by a bit splitting module.

[0177] In some embodiments, the value of the product of TBS and the ratio δ of the bit splitting module should be an integer.

[0178] In some embodiments, the constraints on the input bits of a specific coding operation include at least one of the following: 1) the effective code rate of the specific coding module should not be greater than a threshold 1; 2) the total number of input bits of the specific coding module can be divided evenly by the divisor 1; 3) the number of information bits of each code block of the specific coding module can be divided evenly by the divisor 2; 4) the ratio between the information bit sizes of the two parts divided by the bit splitting module should not be greater than 1.

[0179] Threshold 1 is less than 2 / 3, and divisor 1 is equal to 8 and / or the modulation order and / or the number of code blocks of a specific coding module or the least common multiple of 8 and the modulation order.

[0180] In some embodiments, the constraints on the input bits of the LDPC code include at least one of the following: 1) the effective code rate of the LDPC code should not be greater than 0.95; 2) the number of input bits of the LDPC code can be evenly divided by the product of 8 and the number of code blocks; 3) the number of information bits of each code block of a specific coding module can be evenly divided by 8; 4) the ratio between the information bit sizes of the two parts divided by the bit splitting module should not be less than 1; 5) the code rate Rc of the LDPC code should not be less than (Q m -2) / Q m .

[0181] In some embodiments, for the TBS determination step according to the radio link model of combined channel coding and specific coding operation, if two base maps can be used for the channel coding operation, the UE will select the base map according to the method in the above embodiments.

[0182] For data transmission with a specific coding operation and channel coding operation, the first method of the TBS determination step may include at least one of the following steps:

[0183] Step 1), the UE determines the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE ).

[0184] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH or PUSCH in a time slot.

[0185] In some embodiments, the allocated PRBs do not include the number of PRBs used for rate matching indicated by DCI format 1-1 or DCI format 1-2.

[0186] Step 2), the UE may determine a temporary value Temp_v related to the TBS based on multiple parameters.

[0187] In some embodiments, the plurality of parameters includes the total number of REs (N RE ), modulation order (Q m ), code rate (R) and number of layers.

[0188] In some embodiments, the code rate (R) corresponds to the target code rate Rt or to the effective code rate (R eff). The target code rate Rt can be determined by the MCS index indicated by the DCI. eff ) can be determined by the code rate (Rs) of a specific coding operation and / or the code rate (Rc) of a channel coding operation, and / or the modulation order, and / or the number of CRC bits.

[0189] In some embodiments, the UE calculates the total number of REs (N RE ), modulation order (Q m ), the code rate (Rc) used for channel coding, the number of layers and the scaling factor β determine the temporary value Temp_v.

[0190] In some embodiments, the scaling factor β is the modulation order (Q m ), and / or a function of the code rate (Rs) used for a particular encoding operation, and / or the number of CRC bits.

[0191] Step 3), the temporary value Temp_v can be modified by the modification value α to generate a modified value Temp_m. Where α is 2 n In some embodiments, n is an integer and is not less than 3. In some embodiments, the value of n is related to the temporary value Temp_v.

[0192] In some embodiments, when the temporary value Temp_v is not greater than the threshold, the modification value α1 may be equal to 2 n An integer of . Wherein, n is not less than 3.

[0193] In some embodiments, when the temporary value Temp_v is greater than a threshold, Temp_v is modified based on the CRC bits for the TB and a modification value α2 to generate a modified value Temp_m, where the modification value α2 may be equal to 2. n An integer of , where n is not less than 6.

[0194] In some embodiments, the threshold is equal to 3824.

[0195] In some embodiments, the threshold is defined as T2*(1+δ)*Rs / (Rs+δ). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0196] Step 4), if the bit splitting operation is configured or available for the UE, the UE may determine the number of two temporary parts of split bits including a specific code (Ks_v) and a channel code (Kc_v) based on a ratio δ. Where δ represents the ratio of the number of two parts of split bits. In some embodiments, δ is a real number not less than 0.

[0197] In some embodiments, the value of δ may be determined by the code rate Rt, and / or the code rate Rs, and / or the code rate Rc and / or the modulation order.

[0198] Step 5), Kc_v may be modified to generate a modified number of information bits Kc_m for the channel coding module. In some embodiments, the modified number of information bits Kc_m for channel coding is the final portion of the input bits for channel coding.

[0199] Step 6), Ks_v may be modified by a rounding function or a constraint condition for code block segmentation of a specific coding module to generate a modified number of information bits Ks_m for the specific coding module.

[0200] In some embodiments, the modification procedures of steps 2) to 4) in the NR TBS determination step are reused to modify Kc_v so as to replace N with Kc_v in step 5). info And Kc_m is generated by replacing the modified value α with the modified value β based on the constraints for the specific encoding module.

[0201] In some embodiments, if the channel coding may be LDPC coding, the modification steps of steps 2) to 4) in the NR TBS determination step are reused to replace N by Kc_v in step 5). info To modify Kc_v to generate Kc_m.

[0202] In some embodiments, the modification procedures of steps 2) to 4) in the NR TBS determination step are reused to modify Ks_v so as to replace N with Ks_v in step 6). info And Ks_m is generated by replacing the modified value α with the modified value β based on the constraints for the specific encoding module.

[0203] In some embodiments, the modification value α may represent the modification value 2 n Or a modified value corresponding to the maximum CBS of the selected BG.

[0204] Step 7), the final TBS can be determined by adding the modified Kc_m and Ks_m. The number of information bits for a specific coding module is Ks_m, and the number of information bits for an LDPC coding module is Kc_m.

[0205] The description of the TBS determination steps for the above-mentioned method 1 for a radio link using a specific encoding and LDPC encoding is shown as Figure 2 .

[0206] Figure 3 is an example flow 300 of TBS determination steps for a system using a particular encoding and LDPC encoding.

[0207] For data transmission with a specific encoding operation and an LDPC encoding operation, the second method for the TBS determination step may include at least one of the following steps:

[0208] Step 1), the UE may determine the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE ).

[0209] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated dedicated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH and PUSCH in a time slot.

[0210] Step 2), the UE may determine a temporary value Temp_v related to the TBS based on multiple parameters.

[0211] In some embodiments, the plurality of parameters includes the total number of REs (N RE ), modulation order (Q m ), code rate (R) and number of layers (v).

[0212] In some embodiments, the code rate (R) corresponds to the target code rate Rt or to the effective code rate (R eff In some embodiments, the target code rate Rt may be determined by the MCS index indicated by the DCI. eff ) can be determined by the code rate (Rs) of a specific coding operation and / or the code rate (Rc) of an LDPC coding operation, and / or the modulation order, and / or the number of CRC bits.

[0213] Step 3), the temporary value Temp_v can be modified by the modification value α to generate a modified value Temp_m. Where α is 2 n In some embodiments, n is an integer and is not less than 3. In some embodiments, the value of n is related to the temporary value Temp_v.

[0214] In some embodiments, when the temporary value Temp_v is not greater than the threshold, the modification value α1 may be equal to 2 n Wherein, n is an integer and is not less than 3.

[0215] In some embodiments, when the temporary value Temp_v is greater than a threshold, Temp_v is modified based on the CRC bits for the TB and the modification value α2 to generate a modified value Temp_m. The modification value α2 may be equal to 2. nIn some embodiments, n is not less than 6.

[0216] In some embodiments, the threshold is equal to 3824.

[0217] In some embodiments, the threshold is defined as T2*(1+δ)*Rs / (Rs+δ). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0218] Step 4), if the bit splitting operation is configured or available to the UE, the UE may determine the number of two temporary parts of information bits including Ks_v and Kc_v based on the modified value Temp_m of the TBS, the ratio of Kc to Ks, and a rounding function, wherein the rounding function is used to modify the number of temporary split information bits Ks_v and Kc_v to an integer.

[0219] In some embodiments, the rounding function may include a modification function to generate a modified number of information bits Kc_m and Ks_m that satisfies constraints for the corresponding encoding operation.

[0220] In some embodiments, the ratio is the number of information bits in the two parts divided by the bit splitting module, the code rate Rc of the LDPC code, and / or the code rate Rs of a specific coding operation, and / or the modulation order, and / or the target code rate Rt or the effective code rate R eff function.

[0221] In some embodiments, the rounding function represents round down, or round up, or round down.

[0222] In some embodiments, the sum of Kc_m and Ks_m should equal the value of Temp_m.

[0223] Step 5), the final TBS can be determined by adding the modified Kc_m and Ks_m.

[0224] The description of the TBS determination steps for the above-mentioned method 2 for a radio link with specific coding and LDPC coding is shown as Figure 3 .

[0225] Figure 4 is an example flow chart 400 for the TBS determination step.

[0226] For data transmission with a specific encoding operation and an LDPC encoding operation, the third method for the TBS determination step may include at least one of the following steps:

[0227] Step 1), the UE may determine the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE).

[0228] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated dedicated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH and PUSCH in a time slot.

[0229] Step 2), the UE may determine a temporary value Temp_v related to the TBS based on multiple parameters.

[0230] In some embodiments, the plurality of parameters includes the total number of REs (N RE ), modulation order (Q m ), code rate (R) and number of layers (v).

[0231] In some embodiments, the code rate (R) corresponds to the target code rate Rt or to the effective code rate (R eff In some embodiments, the target code rate Rt may be determined by the MCS index indicated by the DCI. eff ) can be determined by the code rate (Rs) of a specific coding operation and / or the code rate (Rc) of an LDPC coding operation, and / or the modulation order, and / or the number of CRC bits.

[0232] In some embodiments, the temporary value Temp_v is calculated by the total number of REs (N RE ), modulation order (Q m ), the product of the code rate (R) and the number of layers (v).

[0233] Step 3), the temporary value Temp_v can be modified by the modification value α to generate a modified value Temp_m. Where α is 2 n In some embodiments, n is an integer and is not less than 3. In some embodiments, the value of n is related to the temporary value Temp_v.

[0234] In some embodiments, when the temporary value Temp_v is not greater than the threshold, the modification value α1 may be equal to 2 n Wherein, n is an integer and is not less than 3.

[0235] In some embodiments, when the temporary value Temp_v is greater than a threshold, Temp_v is modified based on the CRC bits for the TB and the modification value α2 to generate a modified value Temp_m. The modification value α2 may be equal to 2. n In some embodiments, n is not less than 6.

[0236] In some embodiments, the threshold is equal to 3824.

[0237] In some embodiments, the threshold is defined as T2*(1+δ)*Rs / (Rs+δ). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0238] Step 4), the modified value Temp_m is determined as the final TBS.

[0239] For data transmission with a specific encoding operation and an LDPC encoding operation, a fourth method for the TBS determination step may include at least one of the following steps:

[0240] Step 1), the UE may determine the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE ).

[0241] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated dedicated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH and PUSCH in a time slot.

[0242] Step 2), the UE may determine a temporary value Temp_v related to the TBS based on multiple parameters.

[0243] In some embodiments, the plurality of parameters includes the total number of REs (N RE ), modulation order (Q m ), code rate (R) and number of layers (v).

[0244] In some embodiments, the code rate (R) corresponds to the target code rate Rt or to the effective code rate (R eff In some embodiments, the target code rate Rt may be determined by the MCS index indicated by the DCI. eff ) can be determined by the code rate (Rs) of a specific coding operation and / or the code rate (Rc) of an LDPC coding operation, and / or the modulation order, and / or the number of CRC bits.

[0245] In some embodiments, the temporary value Temp_v is calculated by the total number of REs (N RE ), modulation order (Q m ), the product of the code rate (R) and the number of layers (v).

[0246] Step 3), the temporary value Temp_v can be modified by the modification value α to generate a modified value Temp_m. Where α is 2 nIn some embodiments, n is an integer and is not less than 3. In some embodiments, the value of n is related to the temporary value Temp_v.

[0247] In some embodiments, when the temporary value Temp_v is not greater than the threshold, the modification value α1 may be equal to 2 n Wherein, n is an integer and is not less than 3.

[0248] In some embodiments, when the temporary value Temp_v is greater than a threshold, Temp_v is modified based on the CRC bits for the TB and the modification value α2 to generate a modified value Temp_m. The modification value α2 may be equal to 2. n In some embodiments, n is not less than 6.

[0249] In some embodiments, the threshold is equal to 3824.

[0250] In some embodiments, the threshold is defined as T2*(1+δ)*Rs / (Rs+δ). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0251] Step 4), if Temp_v is not greater than the threshold, the final TBS is determined as the TBS in the TBS table that is not less than and closest to the modified value Temp_m, or not greater than and closest to the modified value Temp_m, or closest to the modified value Temp_m.

[0252] Step 5), if Temp_v is greater than the threshold, the modified value Temp_m is determined as the final TBS.

[0253] For data transmission with a specific coding operation and an LDPC coding operation, a fifth method for the TBS determination step may include at least one of the following steps:

[0254] Step 1), the UE may determine the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE ).

[0255] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated dedicated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH and PUSCH in a time slot.

[0256] Step 2), the UE may determine a first temporary value Temp_v1 and a second temporary value Temp_v2.

[0257] In some embodiments, the first temporary value Temp_v1 is related to at least one of the following: the code rate (Rs) of a particular coding operation; the total number of REs (N RE ); modulation order (Q m ) and number of layers (v).

[0258] In some embodiments, the second temporary value Temp_v2 is related to at least one of the following: the code rate (Rc) of the channel coding operation; the total number of REs (N RE ); modulation order (Q m ) and number of layers (v).

[0259] In some embodiments, the temporary value Temp_v1 is calculated by the total number of REs (N RE ), modulation order (Q m ), the product of the bit rate (Rs) and the number of layers (v) for a specific coding operation.

[0260] In some embodiments, the temporary value Temp_v2 is calculated by the total number of REs (N RE ), modulation order (Q m ), the product of the code rate (Rc) of the channel coding operation and the number of layers (v).

[0261] Step 3), the temporary values ​​Temp_v1 and Temp_v2 may be modified by a modification method to generate modified values ​​Temp_m1 and Temp_m2, respectively. The modification method at least includes: a quantization method to satisfy constraints for a specific coding operation and a channel coding operation, respectively; and a rounding operation including at least one of a round-up operation, a round-down operation, and a round-to-zero operation.

[0262] In some embodiments, the temporary value Temp_v2 is modified based on step 3) and step 4) in the TBS determination step in the NR Rel-16 standard.

[0263] Step 4), the modified value Temp_m2 is modified by the modified value Temp_m1 and the code rate (Rs) of the specific encoding based on the predefined function to generate a modified value Temp_m3.

[0264] In some embodiments, the predefined function includes at least one of: a rounding operation; an addition or subtraction; a multiplication operation; a division operation; and a quantization operation.

[0265] Step 5), determine the final TBS by adding Temp_m1 and Temp_m3.

[0266] For data transmission with a specific coding operation and an LDPC coding operation, a sixth method for the TBS determination step may include at least one of the following steps:

[0267] Step 1), the UE may determine the total number of resource elements (N) based on multiple parameters indicated by the DCI or configured by higher layer parameters. RE ).

[0268] In some embodiments, the multiple parameters may include the allocated physical resource blocks (PRBs), the number of subcarriers in the PRBs, the allocated dedicated demodulation reference signal (DMRS) symbols, and / or the overhead of the control resource set (CORESET) or other RS ​​in the physical channel, and the number of symbols allocated for PDSCH and PUSCH in a time slot.

[0269] Step 2), the UE may determine a temporary value Temp_v related to the TBS based on multiple parameters.

[0270] In some embodiments, the plurality of parameters includes the total number of REs (N RE ), modulation order (Q m ), code rate (R) and number of layers (v).

[0271] In some embodiments, the code rate (R) corresponds to the target code rate Rt or to the effective code rate (R eff In some embodiments, the target code rate Rt may be determined by the MCS index indicated by the DCI. eff ) can be determined by the code rate (Rs) of a specific coding operation and / or the code rate (Rc) of an LDPC coding operation, and / or the modulation order, and / or the number of CRC bits.

[0272] In some embodiments, the temporary value Temp_v is calculated by the total number of REs (N RE ), modulation order (Q m ), the product of the code rate (R) and the number of layers (v).

[0273] Step 3), the temporary value Temp_v can be modified by the modification value α to generate a modified value Temp_m. Where α is 2 n In some embodiments, n is an integer and is not less than 3. In some embodiments, the value of n is related to the temporary value Temp_v.

[0274] In some embodiments, when the temporary value Temp_v is not greater than the threshold, the modification value α1 may be equal to 2 n Wherein, n is an integer and is not less than 3.

[0275] In some embodiments, when the temporary value Temp_v is greater than a threshold, Temp_v is modified based on the CRC bits for the TB and the modification value α2 to generate a modified value Temp_m. The modification value α2 may be equal to 2. n In some embodiments, n is not less than 6.

[0276] In some embodiments, the threshold is equal to 3824.

[0277] In some embodiments, the threshold is defined as T2*(1+δ)*Rs / (Rs+δ). Where δ represents the ratio of the number of two parts of the split bits. In some embodiments, δ is a real number not less than 0.

[0278] Step 4), the modified value Temp_m1 is determined by at least one of: a predefined function, the modified value Temp_m; a code rate (Rs) of a specific code; a code rate (Rc) of a channel code; and a ratio of a bit splitting module.

[0279] Step 5), the modified value Temp_m2 is determined by at least one of: a predefined function, the modified value Temp_m; the modified value Temp_m1; the code rate of the specific coding (Rs); the code rate of the channel coding (Rc); and the ratio of the bit splitting module.

[0280] In some embodiments, the ratio may be determined by at least one of a code rate of the specific coding (Rs) and a code rate of the channel coding (Rc).

[0281] In some embodiments, the predefined function includes at least one of: a rounding operation; an addition or subtraction; a multiplication operation; a division operation; and a quantization operation.

[0282] Step 6), determine the final TBS by adding Temp_m1 and Temp_m2.

[0283] Each step for the TBS determination step in the above-mentioned methods 1 to 2 can be used as an independent embodiment.

[0284] In some embodiments, the CRC bits for the TB can be appended after a specific encoding operation. For example, Figure 1A and Figure 1B The radio link model in shows certain coding operations (eg, precoding operations) preceding the TB CRC attachment.

[0285] In some embodiments, CRC bits for TB can be appended before a specific encoding operation. For example, Figure 1C to Figure 1FThe radio link model in shows certain coding operations (eg, precoding operations) that follow the TB CRC attachment.

[0286] In some embodiments, the CRC bits for TB and the CRC bits for CB may be appended before a specific encoding operation. For example, Figure 1G and Figure 1H The radio link model in shows certain coding operations (eg, precoding operations) following TB CRC attachment and CB CRC attachment.

[0287] In some embodiments, the CRC bits for the TB may be attached before at least one of the following operations: 1) bit splitting; 2) CB splitting corresponding to a specific coding operation; 3) CB splitting corresponding to LDPC coding; 4) a specific coding operation; 5) LDPC coding.

[0288] In some embodiments, the CRC bits for the CB may be attached after at least one of the following operations: 1) TB CRC attachment; 2) bit splitting; 3) CB segmentation corresponding to a specific coding operation; 4) LDPC BG selection; 5) CB segmentation corresponding to LDPC coding; 6) a specific coding operation.

[0289] Based on the radio link model in FIG1 , a method for determining TBS by considering a CRC attach operation is shown as follows:

[0290] For example, the CRC attachment operation is shown as a sequence: TB_CRC attachment --> bit splitting --> specific coding splitting and BG selection --> CB splitting.

[0291] For example, TB CRC Figure 4 The specific encoding operation in was previously attached.

[0292] Figure 5 5 is a block diagram illustrating an example CRC attachment operation. In some embodiments, if the UE detects a DCI scheduling data transmission, the UE may 1) determine the code rate Rc, code rate Rs and modulation order Q according to the configuration m ; 2) According to the configured Rc, Rs and Q m Calculate R eff ; 3) Calculate Ks, Kc: calculate TBS_temp, quantize and obtain Ks and Kc. In some embodiments, (Ks+Kc) includes TB_CRC bits. The UE may also 4) calculate Ns+Kc: calculate the temporary number of input bits for the channel coding operation (denoted as CC_temp), calculate the number of code blocks for the channel coding module, and / or 5) calculate the effective code rate of Rc (denoted as eff_Rc) and the effective code rate of Rs (denoted as eff_Rs).

[0293] A first example for TBS determination may assume that n PRB =25 and the number of REs per PRB is 144, Rs=1 / 3, Rc=2 / 3, 64QAM (Q m =6=2*m), and the number of layers is 1, so the total number of REs is N RE =25*144.

[0294] Rs can represent the value of Ks / Ns, so R eff =(Rs-1)*(m-1) / m+Rc=2 / 9. Assume that the number of CRC bits for a code block is equal to 0 (L CB_CRC =0), then TBS_temp=N RE *R eff *Q m *v=4800.

[0295] TBS_temp can be quantized as follows: if TBS_temp>3824, n=floor(log2(TBS_temp-24))-5=7, TBS_modify=2 n *round((TBS_temp-24) / 2 n )=4736,TBS=4736.

[0296] Using example equation 1: Kc+Ks=4736+TB_CRC=4760 and Kc / Ks=(Rc*m / (m-1)-1) / Rs=0, we obtain Kc=0, Ks=4760.

[0297] Then, CC_temp = N RE *Rc*Q m *v=14400. CC_temp can be quantized as follows: if Rc>1 / 4 and CC_temp>8424, then C=ceil(CC_temp / 8424)=2, CC_modify=(2*8)*ceil(CC_temp / (2*8))=14400.

[0298] Using example equation 2: Ns+Kc=14400. Example equation 3: Ns=Ks / Rs. The results may include TBS=4736, Ks=4760, L TB_CRC =24, C=2, L CB_CRC =0, Kc=0, Ns=14400, eff_Rs=Ks / Ns=0.3306 <Rs,eff_Rc=1 / (1+1 / (m-1))=2 / 3=Rc。

[0299] Reff =(TBS+L TB_CRC ) / (Ns+Ns / (m-1))=0.2204, and Nx=Ns / (2*(m-1))

[0300] =3600.

[0301] Based on the same parameters assumed, it is assumed that the number of CRC bits for a code block is equal to 24 (L CB_CRC =24), then CC_temp=N RE *Rc*Q m *v=14400. CC_temp can be quantized as follows: If Rc>1 / 4 and CC_temp>8424, then C=ceil(CC_temp / 8424)=2, CC_modify=(2*8)*ceil((CC_temp) / (2*8))=14400. Equation 2: Ns+Kc=14400. Equation 3: Ns=Ks / Rs. Then, TBS_temp=N RE *R eff *Q m *v=4800. The TBS_temp can be quantized as follows: if TBS_temp>3824, n=floor(log2(TBS_temp-24-C*24))-5=7, TBS_modify=2 n *round((TBS_temp-24-C*24) / 2 n )=4736,TBS=4736.

[0302] Using Equation 1: Kc + Ks = 4736 + L TB_CRC +C*L CB_CRC =4808, Kc / Ks=(Rc*m / (m-1)-1) / Rs=0 to obtain Kc=0, Ks=4808.

[0303] Results: TBS = 4736, Ks = 4808, L TB_CRC =24, C=2, L CB_CRC =24, Kc=0, Ns=14400, eff_Rs=Ks / Ns=0.3339>Rs, eff_Rc=1 / (1+1 / (m-1))=2 / 3=Rc. R eff =(TBS+L TB_CRC ) / (Ns+Ns / (m-1))=0.2204, and Nx=Ns / (2*(m-1))=3600.

[0304] Assume that the number of CRC bits for a code block is equal to 24 (L CB_CRC =24), then 3) CC_temp = N RE *Rc*Q m *v=14400. Quantize CC_temp as follows: if Rc>1 / 4 and CC_temp>8424, C=ceil(CC_temp / 8424)=2, CC_modify=(2*8)*ceil((CC_temp) / (2*8))=14400.

[0305] Equation 2: Ns+Kc=14400, and Equation 3: Ns=Ks / Rs.

[0306] 2) TBS_temp = N RE *R eff *Q m *v=4800. Quantize TBS_temp as follows: if TBS_temp>3824, n=floor(log2(TBS_temp-24))-5=7, TBS_modify=2 n *round((TBS_temp-24) / 2 n )=4736,TBS=4736.

[0307] Using Equation 1: Kc+Ks=4736+TB_CRC=4760, Kc / Ks=(Rc*m / (m-1)-1) / Rs=0 to obtain Kc=0, Ks=4760. This equation may not be used to obtain Kc and Ks because Rs may be changed to a valid Rs for a specific coding module.

[0308] Result: TBS=4736, Ks=4760, TB_CRC=24, C=2, CB_CRC=24, Kc=0, Ns=14400, eff_Rs=Ks / Ns=0.3306<Rs,eff_Rc=(Ns+Kc+C*LCB_CRC) / (Ns+Ns / (m-1))=0.6689> Rc.

[0309] R eff =(TBS+L TB_CRC ) / (Ns+Ns / (m-1))=0.2204, and Nx=Ns / (2*(m-1))

[0310] =3600.

[0311] Examples 1-2 were used for TBS determination.

[0312] Assume that n PRB=25 and the number of REs per PRB is 144, Rs=1 / 3, Rc=3 / 5, 16QAM (Q m =4=2*m), and the number of layers is 1, so the total number of REs is N RE =25*144.

[0313] 1) Rs can represent the value of Ks / Ns, so R eff =(Rs-1)*(m-1) / m+Rc=4 / 15. Assume that the number of CRC bits for a code block is equal to 0 (L CB_CRC =0), then 2) TBS_temp = N RE *R eff *Q m *v=3840. Quantize TBS_temp as follows: if TBS_temp>3824, n=floor(log2(TBS_temp-24))-5=6, TBS_modify=2 n *round((TBS_temp-24) / 2 n )=3840,TBS=3840.

[0314] Equation 1: Kc+Ks=3840+24=3864.

[0315] Kc / Ks=(Rc*m / (m-1)-1) / Rs=3 / 5. ==>Kc=1439, Ks=2415.

[0316] 3) CC_temp = N RE *Rc*Q m *v=8640. Quantize CC_temp as follows: If Rc>1 / 4 and CC_temp>8424, C=2, CC_modify=8640, Equation 2: Ns+Kc=8640.

[0317] Equation 3: Ns=Ks / Rs.

[0318] Provisional results: Ks = 2415, Kc = 1439, Ns = 7201, eff_Rs = Ks / Ns = 0.3354>Rs, eff_Rc = (Ns+Kc) / (Ns+Ns / (m-1)) = 0.5999 <Rc。R eff =(TBS+TB_CRC) / (Ns+Ns / (m-1))=0.2683, and Nx=Ns / (2*(m-1))=3600.5.

[0319] In some embodiments, the constraints for a particular encoding operation should include that Ns can be (Q m -2) Divide equally.

[0320] Examples 1 - 3 are used for TBS determination by considering the constraint conditions for Rs.

[0321] Assume n PRB = 25 and the number of REs per PRB is 144, Rs = 1 / 3, Rc = 3 / 5, 16QAM (Q m = 4 = 2 * m), and the number of layers is 1. Therefore, the total number of REs is N RE = 25 * 144.

[0322] Rs can be expressed as the value of Ks / Ns. Therefore, R eff = (Rs - 1) * (m - 1) / m + Rc = 4 / 15. Assume the number of CRC bits for the code block is equal to 0 (L CB_CRC = 0), then TBS_temp = N RE * R eff * Q m * v = 3840. Quantize TBS_temp as follows: If TBS_temp > 3824, n = floor(log2(TBS_temp - 24)) - 5 = 6, TBS_modify = 2 n * round((TBS_temp - 24) / 2 n ) = 3840, TBS = 3840.

[0323] Equation 1: Kc + Ks = 3840 + 24 = 3864. Kc / Ks = (Rc * m / (m - 1) - 1) / Rs = 3 / 5. ==> Kc = 1439, Ks = 2415.

[0324] CC_temp = N RE * Rc * Q m * v = 8640. Quantize CC_temp as follows: If Rc > 1 / 4 and CC_temp > 8424, C = 2, CC_modify = 8640, Equation 2: Ns + Kc = 8640. Equation 3: Ns = Ks / Rs.

[0325] Use the equations: Kc + Ks = 3864 and δ = Kc / Ks = 3 / 5 to generate Ks_temp = 2415; then, use the equations: Ns = ceil{(Ks_temp / Rs) / (2 * (m - 1))} * (2 * (m - 1)) = 7246 and Ns + Kc = 8640 to generate Kc = 1394 and Ks = 2470.

[0326] The effective code rate can be obtained as follows: eff_Rs = Ks / Ns = 0.3409; eff_Rc = (Ns + Kc) / (Ns + Ns / (m - 1)) = 0.5962 < Rc; and Reff =(TBS+TB_CRC) / (Ns+Ns / (m-1))=0.2660. The number mapped to the resource can be calculated as Nx=Ns / (2*(m-1))=3623>N RE .

[0327] From Examples 1-3, the number of modulated symbols is greater than the total number of REs allocated by the DCI.

[0328] In some embodiments, the constraint may include Ns / (Q m -2) should not be greater than the total number of allocated REs.

[0329] In some embodiments, the value of Nx is given by Ns / (Q m -2) OK.

[0330] In some embodiments, the value of Ns should be given by the function (Ns / (Q m -2))*(Q m -2) and (Q m -2)*N RE The function represents round down, round up, round up, and keep the original value.

[0331] Examples 1-4 are used for TBS determination by considering constraints on Ns.

[0332] Assume that n PRB =25 and the number of REs per PRB is 144, Rs=1 / 3, Rc=3 / 5, 16QAM (Q m =4=2*m), and the number of layers is 1, so the total number of REs is N RE =25*144.

[0333] 1) Rs can represent the value of Ks / Ns, so R eff =(Rs-1)*(m-1) / m+Rc=4 / 15. Assuming that the number of CRC bits for a code block is equal to 0 (CB_CRC=0), then 2) TBS_temp=N RE *R eff *Q m *v=3840. Quantize TBS_temp as follows: if TBS_temp>3824, n=floor(log2(TBS_temp-24))-5=6, TBS_modify=2 n *round((TBS_temp-24) / 2 n )=3840,TBS=3840.

[0334] Equation 1: Kc+Ks=3840+24=3864. Kc / Ks=(Rc*m / (m-1)-1) / Rs=3 / 5. ==>Kc=1439, Ks=2415.

[0335] 3) CC_temp = N RE *Rc*Q m *v=8640. Quantize CC_temp as follows: If Rc>1 / 4 and CC_temp>8424, C=2, CC_modify=8640, Equation 2: Ns+Kc=8640. Equation 3: Ns=Ks / Rs.

[0336] Use the equation: Kc+Ks=3864 and δ=Kc / Ks=3 / 5 to generate Ks_temp=241. Then, use the equation: Ns=min{floor{(Ks_temp / Rs) / (2*(m-1))}*(2*(m-1)), 2*(m-1)N RE}=7200 and Ns+Kc=8640 to generate Kc=1440 and Ks=2424.

[0337] The effective code rate can be obtained as: eff_Rs=Ks / Ns=0.3367; eff_Rc=(Ns+Kc) / (Ns+Ns / (m-1))=0.6=Rc; and R eff =(TBS+L TB_CRC ) / (Ns+Ns / (m-1))=0.2667.

[0338] The number of symbols mapped into the resource can be calculated as Nx=Ns / (2*(m-1))=3600=N RE .

[0339] Example 4: Limitations on TBS determination

[0340] Figure 6 The flowchart in can illustrate the determination procedure of the effective code rate for a specific encoding module and LDPC encoding module.

[0341] Figure 6 is an example flow chart 600 for determining an effective code rate for a particular coding and LDPC coding module. If the UE meets the restriction condition, the UE may ignore the scheduled data transmission, and / or the UE assumes that the scheduled data transmission was not successfully received.

[0342] The restriction conditions may include at least one of the following: 1) The effective bit rate R of TBS eff1) Not greater than the code rate Rs of the specific coding module determined by the DCI indication; 2) The effective code rate Rs_eff of the specific coding module is greater than the code rate Rs of the specific coding module determined by the DCI indication; 3) The effective code rate Rc_eff of the channel coding module is greater than 0.95; 4) When the high-level parameters related to the specific coding operation are not configured to the UE, the number of input bits of the specific coding module is equal to 0; 5) When the high-level parameters related to the specific coding operation are configured to the UE, the number of input bits of the specific coding module is greater than the threshold.

[0343] The effective code rate of a particular coding module or channel coding module may be defined as the number of input bits including CRC bits divided by the number of output bits that may be mapped into physical channel resources on the PDSCH or PUSCH.

[0344] In some embodiments, the UE does not expect the effective coding rate Rs_eff of a specific coding module to be greater than the coding rate Rs of the specific coding module determined by the DCI indication.

[0345] In some embodiments, the UE does not expect the effective code rate Rc_eff of the channel coding module to be greater than 0.95.

[0346] In some embodiments, when higher layer parameters related to a specific coding operation are configured to the UE, the information bits used for the specific coding operation are greater than 8 and less than the value of TBS.

[0347] In some embodiments, if a specific coding operation is available for the UE, the TBS should be no greater than a threshold, wherein the threshold is no less than 3824.

[0348] Embodiment 5: MCS indication of code rate

[0349] In some embodiments, the information bits of each code block used for channel coding include one or more bits of Kc that are not less than 2*Zc. In some embodiments, if the portion of information bits of Kc in each code block size is less than 2*Zc, padding bits should be attached after the portion of information bits of Kc.

[0350] In the MCS table, for a radio link combining a specific coding operation and a channel coding operation, the effective code rate for TBS is SE eff =R eff ×Qm=2(m-1)×(Rd-1)+2m×Rc, and the spectral efficiency corresponds to the MCS index.

[0351] In some embodiments, the MCS index indicated by the DCI can be used to determine the code rate Rs, the channel coding code rate Rc, the modulation order Q m , and spectral efficiency. It is used to determine Ninf o's effective bit rate R eff It can be composed of Rs, Rc and Q m Sure.

[0352] In some embodiments, the MCS index indicated by the DCI can be used to determine the code rate Rs, target code rate Rt, modulation order Q m , and spectrum efficiency. The effective code rate Rc_eff of LDPC coding can be obtained by Rs, Rt and Q m Sure.

[0353] In some embodiments, the MCS index indicated by the DCI can be used to determine the code rate Rc, target code rate Rt, modulation order Q of the LDPC code. m , and spectral efficiency. The effective code rate of a particular coding operation Rs_eff can be obtained by Rc, Rt and Q m Sure.

[0354] In some embodiments, the MCS index indicated by the DCI may be used to determine the ratio of the two parts of the information bits split by the bit splitting module.

[0355] In some embodiments, each MCS entry corresponds to an MCS index, a target code rate Rc for channel coding, a target code rate Rs for specific coding, a modulation order (Q m ) and spectral efficiency (SE).

[0356] In some embodiments, the Rc corresponding to the MCS entry in the MCS table should satisfy the condition

[0357]

[0358] Embodiment 6: Code block information bit allocation for channel coding

[0359] In some embodiments, the total output bits of a particular encoding operation should be sent in a physical channel.

[0360] In some embodiments, the output bits of a particular encoding operation should not be punctured.

[0361] In some embodiments, the channel coding represents LDPC coding.

[0362] In some embodiments, the output bits of a particular encoding operation should not be set at the first 2*Zc bit positions of the LDPC code block, where Zc is the lifting size for the LDPC code.

[0363] In some embodiments, the number of input bits for LDPC encoding (excluding the output bits of a specific encoding operation) should be no less than the value of 2*Zc*C. Where Zc is the size of the lifting value for LDPC encoding. Where C is the number of code blocks for LDPC encoding.

[0364] In some embodiments, the number of input bits for LDPC coding (in addition to the output bits of a particular coding operation) can be divided by a value of 2*Zc, where Zc is the size of the boost value for LDPC coding.

[0365] Here, the number of input bits (excluding output bits of a specific encoding operation) used for LDPC encoding is denoted as Kc.

[0366] Method 1: Allocate total bits of Kc to TB in each LDPC code block In this method, the first 2*Zc bits in each LDPC code block are punctured, so the first 2*Zc bits are set as part of the bits of Kc.

[0367] Examples 1 to 2 show the allocation of LDPC code block information for the case where only one LDPC code block is used for TB. Examples 3 to 4 show the allocation of LDPC code block information for the case where LDPC code blocks are segmented for TB. Example 1 Figure 6 As shown, if Kc<2*Zc, then 2*Zc-Kc padding bits should be added after the information bits of Kc, where the padding bits are all zeros, or all ones, or a predefined bit sequence.

[0368] Figure 7 is a block diagram 700 of example LDPC code block information allocation for a radio link based on operation of a combination of specific encoding and LDPC encoding.

[0369] Example 2, if Kc ≥ 2*Zc, then Solution 1: Place the bits of Kc at the valid bit positions of each LDPC code block, such as Fig. 8A Solution 2: Place (2*Zc) bits of Kc at the valid bit position of each LDPC code block, and place the reminder bit of Kc at the other bit position of each code block, such as Figure 8B The lower bit position is shown.

[0370] 8 is a block diagram 800 of example LDPC code block information allocation for a radio link based on combined specific coding and LDPC coding operation. Scheme 3: Place (2*Zc) bits of Kc at the valid bit position of each LDPC code block, and place the reminder bit of Kc at the highest bit position of each modulated symbol of each code block after the information bits of the code block transposed by the LDPC interleaver, as shown in FIG8. The reminder bit of Kc can then represent the sign ('+' or '-') bit position of the modulated symbol. If the number of Kc bits is not enough to occupy the highest bit position of each modulated symbol of each code block, padding bits should be added after the bits of Kc.

[0371] Fig. 9 is a block diagram 900 of example LDPC code block information allocation for a radio link based on operation of a combination of specific encoding and LDPC encoding.

[0372] Example 3: If Kc<2*Zc*C, Scheme 1, by equally dividing the total number of Kc bits into the code blocks of TB, put the Kc bits into the valid bit position or header of each code block. Fig. 9 As shown, the padding bits are placed in the first bit position in the range of func(Kc / C)+1 to 2*Zc of each code block. In some embodiments, func(Kc / C) means that if Kc / C is not an integer, then for the first mod(Kc, C) code block, func(Kc / C) is equal to the value of floor(Kc / C); and for the remaining (C-mod(Kc, C)) code blocks, func(Kc / C) is equal to the value of ceil(Kc / C). Wherein floor(●) means rounding down "●". Ceil(●) means rounding up "●".

[0373] Fig.10 1000 is a block diagram of example LDPC code block information allocation for a radio link based on combined specific coding and LDPC coding operation. Scheme 2, Kc bits are placed in the (2*Zc) valid bit positions or headers of each code block from the first code block to the nth code block until all Kc bits are located. For code blocks whose first (2*Zc) bits are not completely filled with Kc bits, the padding bits can be located at the remaining bit positions.

[0374] For example, if Kc>(C-1)*2*Zc, the Kc bit will be located first at the first (2*Zc) bits of CB1 to CBC-1. For CBC, the padding bits will be located after the (Kc-(C-1)*2*Zc+1)th bit to the (2*Zc)th bit position, such as Fig.10 shown.

[0375] Fig.11is a block diagram 1100 of an example LDPC code block information allocation for a radio link based on combined specific coding and LDPC coding operation. Scheme 3, if Kc≥2*Zc*C, the code block information allocation scheme of Example 2 can be reused for each code block of a TB.

[0376] Method 2: Constraints on the value of Kc for TB. The value of Kc bits for TB should satisfy (Kc mod CBS) ≥ 2*Zc. First, Kc bits can be placed in all bit positions from the first code block to the Cth code block until all Kc bits are located. Then Ns bits are placed in the reminder bit position of the reminder code block. For example, there are n1 code blocks that fully carry Kc bits, n2 code blocks that fully carry Ns bits, and one code block CBn1+1 that carries both part of Kc bits and part of Ns bits, as Fig.11 shown.

[0377] In some embodiments, for code blocks fully filled with Kc bits (e.g., CB1 to CBn1), the code blocks should be punctured with an additional (C-n1)*2*Zc bits. In some embodiments, for code blocks filled with Ns bits (e.g., CBn1+2 to CBC), the code blocks should not be punctured with the first 2*Zc bits.

[0378] Fig.12 1200 is a block diagram of an example LDPC code block information allocation for a radio link based on a combination of specific coding and LDPC coding. In some embodiments, the padding bits in methods 1 and 2 above may be attached to the first bit position of the LDPC code block, and the number of information bits Kc may be located at the bit position after the padding bits.

[0379] Fig.13 1300 is a block diagram of a method for determining a transport block size. The method can include receiving, by a terminal, a first message identifying a first coding rate and a second coding rate (block 1302). The method can also include performing, by the terminal, a first operation related to the first coding operation and using the first coding rate (block 1304). The method can also include performing, by the terminal, a second operation related to the second coding operation and using the second coding rate (block 1306). The method can also include transmitting or receiving, by the terminal, a second message using information related to the first operation and / or the second operation (block 1308).

[0380] In some embodiments, the first encoding operation comprises a low density parity check (LDPC) encoding operation.

[0381] In some embodiments, the first encoding operation includes any of a polar encoding operation, a turbo encoding operation, or a convolutional encoding operation.

[0382] In some embodiments, the second encoding operation includes any one of a bit-to-symbol encoding operation and a symbol-to-bit conversion operation.

[0383] In some embodiments, the second encoding operation includes a distribution matching operation and a signal shaping operation.

[0384] In some embodiments, either of the first operation and the second operation is a transport block size (TBS) determination operation.

[0385] In some embodiments, either of the first operation and the second operation is a modulation and coding scheme (MCS) indication operation.

[0386] In some embodiments, code block segmentation and base graph selection operations for a first encoding operation are related to a second operation.

[0387] In some embodiments, the method further includes the terminal deriving a code rate, a modulation order, a number of layers, a total number of resource elements (N RE ) to determine the temporary TBS value, and where N RE Determined by using the number of allocated PRBs.

[0388] In some embodiments, the code rate is determined by the first coding rate and / or the second coding rate.

[0389] In some embodiments, N RE The number of REs that are not available for data transmission is not included.

[0390] In some embodiments, the method also includes determining, by the terminal, that the temporary TBS value includes a first part temporary TBS value and a second part temporary TBS value, and modifying, by the terminal, the temporary TBS value of each part by a modification method to generate a modified first part TBS value and a modified second part TBS value, and determining, by the terminal, a final TBS value based at least on the modified first part TBS value and the modified second part TBS value, and wherein the first part temporary TBS value is determined by at least a first coding rate, and wherein the second part temporary TBS value is determined by at least a second coding rate.

[0391] In some embodiments, the method also includes the terminal modifying the temporary TBS value through a modification method to generate a TBS correction value; the terminal modifying the TBS correction value based on at least one of a first coding rate, a second coding rate, a ratio and a predefined function to generate a first part TBS correction value and a second part TBS correction value; and the terminal determining the final TBS value by combining the first part TBS correction value and the second part TBS correction value.

[0392] In some embodiments, the ratio is determined by the first coding rate, the second coding rate and / or the modulation order.

[0393] In some embodiments, the modification method includes at least a rounding operation, a threshold value related to a threshold value to generate a TBS correction value, and wherein the threshold value is related to the first coding rate and the second coding rate.

[0394] In some embodiments, the predefined function includes any one of a rounding operation, a rounding down operation, a rounding up operation, a multiplication operation using a modification factor, a division operation using a modification factor, and a subtraction operation using the number of CRC bits, wherein the modification factor is related to the number of code blocks of any one of the first encoding operation and the second encoding operation.

[0395] In some embodiments, the method also includes receiving, by the terminal, a third message including a plurality of base map parameters related to base map selection for a first encoding operation; and selecting, by the terminal, a base map based on the plurality of base map parameters, wherein the plurality of base map parameters include at least a second encoding rate related to a second encoding operation.

[0396] In some embodiments, the second base map is selected in response to determining that a second base map condition is satisfied, the second base map condition comprising any of: determining whether the number of information bits is not greater than a first threshold, determining whether the number of information bits is not greater than a second threshold and whether the code rate used for the first encoding operation is not greater than a third threshold, and determining whether the code rate used for the first encoding operation is not greater than a fourth threshold.

[0397] In some embodiments, a first LDPC base graph is selected in response to determining that a first base graph condition is satisfied, the first base graph condition comprising any of the following: determining whether the number of information bits is not greater than a second threshold and whether the first code rate used for the first encoding operation is greater than a fourth threshold, and determining whether the number of information bits is not greater than the second threshold and whether the number of information bits is greater than the first threshold, and whether the code rate used for the first encoding operation is greater than a third threshold.

[0398] In some embodiments, the number of information bits includes input bits or a final TBS value of a second coding operation, and the first threshold and / or the second threshold is related to the second coding rate of the second coding operation, the modulation order, the first coding rate of the first coding operation and / or the number of CRC bits attached to a transport block (TB) or a code block (CB), and the third threshold and / or the fourth threshold is related to the coding rate of the second coding operation and the first coding rate of the first coding operation.

[0399] In some embodiments, the number of information bits is not less than twice the size of the boost value for the channel operation, wherein the information bits are part of the TB in addition to the input bits for the second encoding operation.

[0400] In some embodiments, the information bits of the code block are located at an upper or head bit position of the code block of the first encoding operation, wherein the information bits of the code block are: used for a portion of the TB for the first encoding operation in addition to the bits output by the second encoding operation.

[0401] In some embodiments, if the number of information bits of the code block of the first encoding operation is less than twice the boost value size for the first encoding operation, a set of padding bits is added to the first bit position of twice the boost value size of the code block in addition to the bit positions of the set of information bits, and wherein the set of information bits is: a portion of the input bits of the code block of the first encoding operation in addition to the bits output from the second encoding operation.

[0402] In some embodiments, the first coding rate and the second coding rate can be determined by an available MCS table and an MCS index indicated by downlink control signaling.

[0403] In some embodiments, the first coding rate corresponds to an MCS index in an MCS table, the MCS index is satisfied that the first coding rate is not less than a threshold, and wherein the threshold is related to a value of a modulation order corresponding to the MCS index.

[0404] Example Wireless System

[0405] Fig.14 An example of a wireless communication system in which the technology according to one or more embodiments of the present technology can be applied is shown. The wireless communication system 1400 can include one or more base stations (BS) 1405a, 1405b, one or more wireless devices or terminals 1410a, 1410b, 1410c, 1410d, and a core network 1425. The base stations 1405a, 1405b can provide wireless services to the wireless devices 1410a, 1410b, 1410c, and 1410d within one or more wireless sectors. In some embodiments, the base stations 1405a, 1405b include directional antennas to generate two or more directional beams to provide wireless coverage in different sectors. The base station can implement the functions of scheduling cells or candidate cells, as described in this document.

[0406] The core network 1425 can communicate with one or more base stations 1405a, 1405b. The core network 1425 provides connections with other wireless communication systems and wired communication systems. The core network may include one or more service subscription databases to store information related to subscribed wireless devices 1410a, 1410b, 1410c and 1410d. The first base station 1405a can provide wireless services based on a first radio access technology, and the second base station 1405b can provide wireless services based on a second radio access technology. Base stations 1405a and 1405b can collaborate in the same place or can be installed on site separately according to deployment scenarios. Wireless devices 1410a, 1410b, 1410c and 1410d can support multiple different radio access technologies.

[0407] In some implementations, a wireless communication system may include multiple networks using different wireless technologies. A dual-mode or multi-mode wireless device includes two or more wireless technologies that can be used to connect to different wireless networks.

[0408] Fig.15 1505 is a block diagram representation of a portion of a hardware platform. A hardware platform 1505, such as a network node or base station or terminal or wireless device (or UE), may include a processor electronic device 1510, such as a microprocessor that implements one or more technologies presented in this application. The hardware platform 1505 may include a transceiver electronic device 1515 to send and / or receive wired or wireless signals through one or more communication interfaces such as an antenna 1520 or a telephone line interface. The hardware platform 1505 may implement other communication interfaces with defined protocols for transmitting and receiving data. The hardware platform 1505 may include one or more memories (not explicitly shown) that are configured to store information such as data and / or instructions. In some embodiments, the processor electronic device 1510 may include at least a portion of the transceiver electronic device 1515. In some embodiments, at least some of the disclosed technologies, modules, or functions are implemented using the hardware platform 1505.

[0409] in conclusion

[0410] The disclosed and other embodiments, modules and described functional operations of this document can be implemented in digital electronic circuits, or in computer software, firmware or hardware (including the structures disclosed in this document and their structural equivalents) or one or more combinations thereof. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium, for execution by a data processing device or control of the operation of the data processing device. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a combination of substances that affect machine-readable propagation signals, or a combination of one or more of them. The term "data processing device" includes all devices, equipment and machines for processing data, such as programmable processors, computers or multiple processors or computers. The device can also include, in addition to hardware, code that creates an execution environment for the computer program in question, such as code that constitutes processor firmware, protocol stacks, database management systems, operating systems or one or more combinations thereof. A propagation signal is an artificially generated signal, such as a machine-generated electrical, optical or electromagnetic signal, which is generated to encode information for transmission to a suitable receiver device.

[0411] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a standalone program or module, component, subroutine, or other unit suitable for a computing environment. A computer program does not necessarily correspond to a file in a file system. A program may be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordination files (e.g., files storing one or more modules, subroutines, or code portions). A computer program may be deployed to be executed on one or more computers, which are located at one site or distributed at multiple sites and interconnected by a communication network.

[0412] The processes and logic flows described in this document may be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows may also be performed by special-purpose logic circuits, and the apparatus may also be implemented as special-purpose logic circuits, such as FPGAs (field programmable gate arrays) or ASICs (application specific integrated circuits).

[0413] For example, processors suitable for executing computer programs include both general-purpose and special-purpose microprocessors, and any one or more processors of any kind of digital computer. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The basic elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include one or more mass storage devices (e.g., magnetic disks, magneto-optical disks, or optical disks) for storing data, or be operably coupled to receive data from one or more mass storage devices for storing data or to transfer data to it or both. However, a computer does not have to have such a device. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory; magneto-optical disks; and CD ROM and DVD-ROM disks. The processor and memory can be supplemented by or incorporated into a dedicated logic circuit.

[0414] Although this patent document contains many details, these should not be interpreted as limitations on the scope of any invention or the scope of what may be claimed, but rather as descriptions of specific features of a specific embodiment that may be a specific invention. Certain features described in the context of a single embodiment in this patent document may also be implemented in combination in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately or in any suitable sub-combination in multiple embodiments. In addition, although features may be described above as working in certain combinations and even initially claimed to be so protected, in some cases, one or more features from the claimed combination may be removed from the combination, and the claimed combination may be directed to a sub-combination or a variant of the sub-combination.

[0415] Similarly, while operations are described in a particular order in the drawings, this should not be understood as requiring that the operations be performed in the particular order shown or in sequential order, or that all of the illustrated operations be performed to achieve the desired results. Furthermore, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.

[0416] Only a few implementations and examples are described, and other implementations, enhancements, and variations can be made based on what is described and illustrated in this patent document.

Claims

1. A method for wireless communication, comprising: Receiving, by a terminal, a first message identifying a first coding rate and a second coding rate; The terminal performs a first operation related to channel coding and using the first coding rate, wherein performing the first operation includes at least determining a first part of the temporary transport block size TBS value by the first coding rate; performing, by the terminal, a second operation related to a specific coding operation and using the second coding rate, wherein performing the second operation includes determining a second portion of temporary TBS values ​​at least by the second coding rate; The terminal modifies the temporary TBS value of each part to generate a modified first part TBS value and a modified second part TBS value; and determining, by the terminal, a final TBS value based at least on the modified first partial TBS value and the modified second partial TBS value; and Communication of a second message is performed by the terminal, the second message including a number of information bits according to the final TBS value.

2. The method according to claim 1, wherein: The communication operation performed includes transmitting the second message using the information related to the first operation and the second operation.

3. The method according to claim 1, wherein: The communication operation performed includes receiving the second message using the information related to the first operation and the second operation.

4. The method according to claim 1, wherein: The channel coding includes a low-density parity check (LDPC) coding operation.

5. The method according to claim 1, wherein: Either one of the first operation and the second operation is a TBS determination operation.

6. The method according to claim 1, wherein: Either of the first operation and the second operation is a modulation and coding scheme (MCS) indication operation.

7. The method according to claim 1 or 5, further comprising: The terminal derives the code rate, modulation order, number of layers and total number of resource elements N by RE The temporary TBS value is determined by multiplying the N RE Determined by using the number of allocated PRBs.

8. The method according to claim 7, further comprising: The terminal modifies the temporary TBS value to generate a TBS correction value; modifying, by the terminal, the TBS correction value based on at least one of the first coding rate, the second coding rate, a ratio, and a predefined function to generate a first partial TBS correction value and a second partial TBS correction value; as well as A final TBS value is determined by the terminal by combining the first partial TBS correction value and the second partial TBS correction value.

9. The method according to claim 8, wherein: The ratio is determined by the first coding rate, the second coding rate and / or the modulation order.

10. The method according to claim 1 or 8, wherein: The modification includes at least a rounding operation, a quantization value related to a threshold to generate a TBS correction value, and wherein the threshold is related to the first coding rate and the second coding rate.

11. The method according to claim 8, wherein: The predefined function includes any one of a rounding operation, a rounding-down operation, a rounding-up operation, a multiplication operation using a modification factor, a division operation using a modification factor, and a subtraction operation using the number of cyclic redundancy check CRC bits, wherein the modification factor is related to the number of code blocks used for any one of the channel coding and the specific coding operation.

12. The method according to any one of claims 1, 2 and 5, wherein: The number of information bits is not less than twice the size of a lifting value for a low-density parity check (LDPC) encoding operation, and wherein the information bits are part of a TBS other than input bits for the particular encoding operation.

13. The method according to claim 12, wherein: The information bits of a code block are located at an upper or head bit position of the code block of the channel coding; wherein the information bits of the code block are: used as part of the TBS for the channel coding in addition to the bits output by the specific coding operation.

14. The method according to claim 12, wherein: If the number of information bits of the channel-coded code block is less than twice the boost value size for the LDPC encoding operation, a set of padding bits is added to the first bit position of twice the boost value size of the code block other than the bit positions of the information bit set, and wherein the information bit set is a portion of the input bits of the channel-coded code block other than the bits output from the particular encoding operation.

15. A device for wireless communication, comprising a processor and a memory, wherein the processor is configured to read instructions from the memory to execute the method according to any one of claims 1 to 14.

16. A non-transitory computer readable medium having stored thereon codes which, when executed by a processor, cause the processor to implement the method of any one of claims 1 to 14.

Images